Reinhardt cardinals in inner models
1 Introduction
A cardinal is Reinhardt if it is the critical point of an elementary embedding from the universe of sets to itself. Kunen [1] famously refuted the existence of Reinhardt cardinals using the Axiom of Choice (AC). It is a longstanding open problem whether Reinhardt cardinals are consistent if AC is dropped.
Noah Schweber [2] introduced the notion of a uniformly supercompact cardinal, a cardinal that is the critical point of an elementary embedding such that for all ordinals . He posed the question of whether such a cardinal must be Reinhardt, and he also asked about the consistency strength of uniformly supercompact cardinals. Both questions remain open, but this note makes some progress on the matter.
Say a cardinal is weakly Reinhardt if it is the critical point of an elementary embedding such that for all ordinals . This condition is equivalent to requiring that for all ordinals . It seems to be weaker than demanding that for all ordinals .
Theorem 2.2.
If there is a proper class of weakly Reinhardt cardinals, then there is an inner model with a proper class of Reinhardt cardinals.
As a corollary, we obtain a consistency strength lower bound for a large cardinal that looks a bit more like Schweber’s: for lack of a better term, say is ultrafilter Reinhardt if it is the critical point of an elementary embedding such that for all ordinals , and . Here denotes the set of ultrafilters on .
Proposition 2.3.
If is ultrafilter Reinhardt, then is weakly Reinhardt.
1.1 Preliminaries
Our background theory is von Neumman-Bernays-Gödel (NBG) set theory without AC. Even though we work without AC, for us a cardinal is an ordinal number that is not in bijection with any smaller ordinal. Of course, if AC fails, there are sets whose cardinality cannot be identified with a cardinal in this sense. Still, for any set , one can define the Hartogs number of , denoted by , as the least cardinal such that there is no injection from to .
2 The inner model
If is a cardinal and is a set, denotes the set of -complete ultrafilters on . In the context of choiceless large cardinal axioms, sufficiently complete ultrafilters on ordinals can often be treated as “idealized ordinals.” The following lemma is a simple example of this phenomenon, although the pattern runs quite a bit deeper than this.
Lemma 2.1.
If there is a weakly Reinhardt cardinal, then for all sufficiently large cardinals , for any ordinal , can be wellordered.
Proof.
Assume not. Let witness that is weakly Reinhardt. By transfinite recursion, define a sequence of ordinals for , taking suprema at limit ordinals and, at successor stages, setting equal to the least ordinal such that cannot be wellordered. Let . Then . For each , let be the ultrafilter on derived from using , so .
Note that the function is simply definable from , and so . For any , is constant on a set in because is -complete and has cardinality less than . Indeed, , the Hartogs number of as computed in , since is a wellorderable subset of in . Moreover, since , and by the definition of the ordinals and the elementarity of .
Suppose , and we will show that for -almost all , . Let be the unique ultrafilter on such that for -almost all . If , then for all , , and hence for -almost all , . It follows that . This proves , and so . Therefore is a surjection from the ordinal to , which contradicts that cannot be wellordered. ∎
Let us now define the inner model in which weakly Reinhardt cardinals become Reinhardt. Suppose is a cardinal. Let denote the class of -complete ultrafilters on ordinals. For any class , we denote the class of all subsets of by . Finally, let
Granting that sufficiently complete ultrafilters on ordinals are idealized ordinals, the models are the corresponding idealizations of the inner model .
Theorem 2.2.
If there is a proper class of weakly Reinhardt cardinals, then for all sufficiently large cardinals , contains a proper class of Reinhardt cardinals.
Proof.
Let be a cardinal large enough that for all ordinals , can be wellordered. Let . We claim that if is weakly Reinhardt, then is Reinhardt in . To see this, let witness that is weakly Reinhardt. We will show that and for all . Hence is an amenable class of and in , is an elementary embedding from the universe to itself. Letting denote the collection of classes amenable to , it follows that is a model of NBG with a proper class of Reinhardt cardinals.
We first show that , or in other words, that is correctly computed by . (Here we use that since .) The closure properties of guarantee that all ultrafilters on ordinals are in , and the elementarity of implies that for all , is wellorderable in . Finally, since is closed under wellordered sequences, is contained in . This implies that is correctly computed by .
Finally, we show that for any , . For this, it suffices to show that for any ordinal , is in . Since is wellorderable in , it suffices to show that belongs to where . Then letting be a bijection in ,
and since by the previous paragraph. But because it is encoded by the extender where is the ultrafilter on derived from using : indeed, if , then . Since is a wellordered sequence of -complete ultrafilters, . ∎
We now show that ultrafilter Reinhardt cardinals are weakly Reinhardt, so the same consistency strength lower bound applies to them.
Proposition 2.3.
If is ultrafilter Reinhardt, then is weakly Reinhardt.
Proof.
Suppose is elementary and for all ordinals , and . We claim that for all ordinals , . Consider the extender given by letting be the ultrafilter derived from using . Then , and hence , since for , . ∎
Finally, observe that the inner models considered here yield models with Reinhardt cardinals that are a bit tamer than one might expect:
Proposition 2.4.
If there is a proper class of Reinhardt cardinals, then there is an inner model with a proper class of Reinhardt cardinals in which every set is constructible from a wellordered sequence of ultrafilters on ordinals.∎
Corollary 2.5.
If the existence of a proper class of Reinhardt cardinals is consistent, then it is consistent with .
Proof.
For any cardinal , a -sequence of subsets of can be coded by a single subset of ; namely, . So if every set is constructible from a wellordered sequence of ultrafilters on ordinals, then . ∎
More advanced techniques yield the following theorem, whose proof is omitted:
Theorem 2.6.
If there is a Reinhardt cardinal, then for a closed unbounded class of cardinals , there is a Reinhardt cardinal in .∎
Here is the smallest inner model such that . We also note that the proofs here easily generalize to show that if there is a proper class of Berkeley cardinals, then for sufficiently large , there is a proper class of Berkeley cardinals in .
3 Questions
Let us list some variants of Schweber’s original questions that seem natural given the results of this note.
Question 3.1.
Are Reinhardt cardinals and weakly Reinhardt cardinals equiconsistent?
Question 3.2.
Is the existence of a Reinhardt cardinal compatible with ?
In the context of NBG, a cardinal is Ord-supercompact if for all ordinals , there is an elementary embedding such that and .
Question 3.3.
Is NBG plus the existence of a proper class of Ord-supercompact cardinals equiconsistent with ZFC plus a proper class of supercompact cardinals?
References
- [1] Kenneth Kunen. Elementary embeddings and infinitary combinatorics. J. Symbolic Logic, 36:407–413, 1971.
- [2] Noah Schweber. Supercompact and Reinhardt cardinals without choice. MathOverflow.