Varsovian models II
Abstract
Assume sufficient large cardinals. Let be the minimal iterable proper class model satisfying “there are such that the are Woodin cardinals and the are strong cardinals”. Let . We identify an inner model of , which is a proper class model satisfying “there are 2 Woodin cardinals”, and is iterable both in and in , and closed under its own iteration strategy. The construction also yields significant information about the extent to which knows its own iteration strategy. We characterize the universe of as the mantle and the least ground of , and as for being -generic with sufficiently large. These results correspond to facts already known for , and the proofs are an elaboration of those, but there are substantial new issues and new methods with which to handle them. 2222020 Mathematics Subject Classifications: 03E45, 03E55, 03E40. 333Keywords: Inner model theory, mouse, iteration strategy, self-iterability, strategy mouse, HOD, mantle, ground, Varsovian model.
1 Introduction
The first generation of canonical inner models for large cardinals are those of the form (or ) where is a sequence of (partial) measures or extenders with various nice properties. The second generation are those of the form (or ), with as before, but is a (partial) iteration strategy for . We refer to the former as mice or extender models, and the latter as strategy mice or strategic extender models. Strategy mice arise naturally as HODs of determinacy models, and this phenomenon has been extensively studied. (The universe of) a strategy mouse was also found in [8] to be the mantle of and a certain HOD associated to the mouse (the “minimal” proper class mouse with a strong cardinal above a Woodin cardinal). While mice with Woodin cardinals (and which model ZFC, for example) can only compute restricted fragments of their own iteration strategies, strategy mice can be fully self-iterable.
One can contemplate the relationship between the two hierarchies; a key issue is the consistency strength of large cardinals when exhibited in the respective models: how do large cardinal hypotheses in (fully iterable) mice compare in consistency strength to those in (fully iterable) strategy mice, particularly for strategy mice which are closed under their own strategy? Continuing the line of investigation of [8], the present paper derives444Disclaimer: The “proofs” (and some definitions) presented here are not quite complete, because their full exposition depends on an integration, omitted here, of the method of -translation (see [1]) with the techniques we develop. The integration itself is a straightforward matter of combining the two things. But because -translation itself is already quite detailed, its inclusion would have added significantly to the length of the paper. It will be covered instead in [13]. the existence of a fully iterable proper class strategy mouse , closed under its strategy, and containing two Woodin cardinals, from the existence and full iterability of the mouse . This is the least active mouse such that letting where is the active extender of , then “There are ordinals such that each is a Woodin cardinal and each is a strong cardinal”. Letting be the proper class model left behind after iterating out of the universe, the strategy mouse will be an inner model of . (We also obtain Silver indiscernibles for .) The analysis also shows that computes substantial fragments of its own iteration strategy, thereby contributing to the investigation of self-iterability in mice as in [12], but here beyond the tame level.
Now recall that if is a model of ZFC, then is a ground of iff is also a model of ZFC and there is some poset and some which is -generic with . (Note this implies that is transitive in the sense of and contains all of the ordinals of ; by the Woodin/Laver ground definability result [2], [6], is also definable from parameters over .) The intersection of all grounds of is called the mantle of . Recall is called a bedrock iff has no non-trivial grounds, or equivalently, . See [2] and [25] for more general background on these topics not specific to inner model theory.
The reason that mice modelling ZFC + Woodin cardinals do not compute their own iteration strategies is connected with the fact that they have proper (set-)grounds. The standard examples of such grounds arise from Woodin’s genericity iterations. This phenomenon has led to inner model theoretic geology, which has proven to be an exciting and fruitful area of set theory. Its program is to analyze the collection of grounds and the mantle of given canonical inner models. See [3] and [8], which address exactly this kind of problem, and are precursors to the current work. See also [16], parts of which were motivated by the current work. The theme uncovered in these works is roughly that the mantle of a (sufficiently canonical) mouse tends to itself be a mouse or a strategy mouse, and hence can be analyzed in high detail.
The paper [3] proves that if is a tame proper class mouse with a Woodin cardinal but no strong cardinal, and some further technical assumptions hold, then the mantle of is itself a mouse, but is not a ground of ; see [3, §3.4] and specifically [3, Theorem 3.33]. As an example, the mantle of (the minimal proper class mouse with one Woodin cardinal) is the model left behind after iterating the unique measure on the least measurable of out of the universe, and note this model has no measurable cardinals. The situation is entirely different if has a strong cardinal.
Let denote the minimal active mouse such that letting where is the active extender of , then “there is a strong cardinal above a Woodin cardinal”, and suppose this mouse is fully iterable (for all set-sized trees). Let be the proper class mouse left by iterating out of the universe. It is shown in [8] that there are only set many grounds of and that the mantle of is itself a ground of and hence a bedrock. There is therefore some analogy here between and in the presence of an extendible cardinal; see [26, Theorem 1.3]. The mantle of , however, also has an interesting structural analysis, as it is the universe of the strategy mouse mentioned earlier. It is, moreover, a canonical “least” inner model which has a Woodin cardinal and knows how to fully iterate itself; see [8, Lemma 2.20].
In personal communication with the second author [27], W. Hugh Woodin expressed suspicion that the mantle of any proper class mouse with a strong cardinal above a Woodin cardinal might perhaps contain non-trivial strategy information at its least Woodin cardinal and not at any larger Woodin.
A reasonable candidate for testing this suspicion and for extending the analysis of [8] is the big brother of , namely , introduced above, and studied in this paper. We will show that the strategy mouse , also introduced above, has universe the mantle of , and so in fact, this mantle contains two Woodins together with non-trivial (and is closed under) strategy information for both of them. There is therefore a stronger analogy between hod mice (see [7]) and mantles of extender models than was previously expected. This universe is also a ground of , and hence is a bedrock. We will also show that has universe the eventual generic HOD of ; that is, its universe is whenever is a sufficiently large ordinal and is -generic.
In some more detail, we will first isolate the first Varsovian model of and show that is a ground of , contains exactly two Woodin cardinals and a strong above them, and knows how to iterate itself fully for trees based on its least Woodin. This model is at first constructed in the form of “”, very much like in the construction of [8], which also mirrors Woodin’s analysis of . We then show that this model admits a stratification as a fine structural strategy premouse. The indexing used for the stratification is new, and this indexing is important in the overall analysis we give. It is moreover determined in a very strong sense by the hierarchy of – the extender sequence of is in fact given by simply restricting the extenders on the sequence of above a certain point, some of which correspond to strategy. We then go on to isolate the second Varsovian model of , which will be constructed inside (so ), using an elaboration of the construction of in . We then analyze the model and compute an iteration strategy for it, and establish the remaining facts mentioned above: the universe of is the mantle and eventual generic HOD of , contains exactly two Woodin cardinals and knows fully how to iterate itself. We also show that the universe of is the -mantle of , where is the least strong of . The overall picture and process is expected to generalize to iterations (working in the appropriate starting mouse) and beyond.
The reader who is familiar with [7], for example, will encounter a lot of parallels between our analysis and the theory of hod mice; a key difference, though, is that our treatment is purely combinatorial and “inner model theoretic”, using no descriptive set theory. Familiarity with [8] certainly helps, since the current paper is in large part an extension of that one, and some arguments covered in [8] are omitted here. But the reader who is reasonably familiar with inner model theory in general should be able to refer to [8] as needed.
The paper is organized as follows. There are some preliminaries and notation listed at the end of this section. In §2, we present the general method of assigning the (first) Varsovian model to an extender model , and prove key facts about it, under certain hypotheses. In §3, we describe some key properties of and its iteration strategy, which will be essential throughout. In §4, the first Varsovian model of , and its iteration strategy , are defined and analyzed. This analysis is centered around the stratification of as a strategy premouse. We also give natural characterizations of the universe of . In §5, we identify , also stratifying it as a strategy premouse. We show that has two Woodin cardinals, is fully iterable, and is closed under its iteration strategy. We expect that the hypothesis used to construct such a model is in some sense optimal. We finally show in §5.8 that the universe of is the mantle of and is for sufficiently large collapse generics .
The work presented here was started by the first two authors, extending their [8]. In the early stages, significant progress was made, but without a full development of the level-by-level fine structural correspondence presented in this paper between the models , and ; such a correspondence was considered to some extent, but then put aside in favour of other methods. During this time, the first author developed an approach to computing the mantle of which does not use the level-by-level correspondence, but this has not been published. Later, the second author returned to the level-by-level correspondence, and developed some of the main ideas in its connection. Following this, in September 2017, the second and third authors then began discussing this approach. Over the next few months, building on what had already been established, they (mostly) completed the analysis via this approach, leading to the current presentation (some details being added over time somewhat later). Some of the evolution of ideas was documented by the second author’s talks at the 4th Münster conference on inner model theory, July 17–Aug 01, 2017, and at the 1st Girona conference on inner model theory, July 16–27, 2018, and in the handwritten notes [10].
The early development, worked out by the first two authors, directly yielded parts of the present paper, as well as precursors to some other parts. Some version of probably the most central concept in the paper, the strategy mouse hierarchy used in Definition 4.10 (which is also a precursor of Definition 5.17), is due to the first two authors, as is §4.7; the setup for the first direct limit system in §§4.1,4.3,4.4 is much as in [8] and is basically due to them, although the approach used in §4.2 for computing short tree strategy, and some other uses of normalization, are due to the 3rd author. The 2nd author is responsible for the majority of §2, including Definition 2.3, for the computation of in Theorem 4.5 via extending Lemma 4.5 (and the idea to consider ), and the modified P-construction (Definition 5.4). The 2nd and 3rd authors jointly established Lemma 5.1.1, the construction of the second direct limit system in §5.2, and the strategy mouse hierarchy used in Definition 5.17 (adapting 4.10). The (self-)iterability of and is also mostly due to the 2nd and 3rd authors, integrating some of the earlier work of the first two. The 3rd author is responsible for Lemma 4.5, that , Lemmas 2, 4.9, 4.12.4, 4.12.5, 5.6.4, 5.6.5, Definitions 4.28, 5.32, §§4.10, 4.11, 5.1.2, 5.1.3, 5.8, and the original version of §4.8.
1.1 Notation and Background
General: Given structures , denotes the universe of , and means .
Premice: All premice in the paper are Jensen-indexed (-indexed). Given premouse with universe , internal extender sequence and active extender , we write , , , and . Write for its passivization, for the initial segment of with (inclusive of active extender) and . Write . Given premice , we write iff for some , and iff but . Given also such that is -sound and is -sound, we write iff and if then , and write iff but . For , we say is a cutpoint of iff for all , if then , and a strong cutpoint iff for all , if then . For , denotes the -generator extender algebra at , with axioms induced by extenders with inaccessible in and . And .
Hulls: In general, denotes the structure whose universe is the collection of elements of , definable over from parameters in , with definitions of “kind ”, and whose predicates are just the restrictions of those of . Here “kind ” depends on context, but the main example is that if is a premouse, then the universe of is the collection of all such that for some formula and , is the unique such that . When it makes sense, denotes the transitive collapse of (including the collapses of predicates).
Ultrapowers: Let be an extender over . Write for the ultrapower map, and for the degree- ultrapower and associated map. Write for the critical point of , , and for the measure space of ; in particular, if is short then .
Iteration trees: A fine structural iteration tree consists of tree order , tree-predecessor function , model-dropping node-set , model-or-degree-dropping node-set , models and degrees (for ), extenders and model pre-images where (for ), and here where , and if and , iteration maps , and if is also a successor ordinal, . (Note we are only indicating notation above; the definition of iteration tree has more demands.)
Let be an -sound premouse, where , and a fine structural iteration tree. Recall that is -maximal on iff (i) , (ii) for , (iii) is the least such that , and (iv) is the lex-largest such that and . We say is normal if it is -maximal for some . For an -cardinal, we say is based on iff for all , if does not drop in model then . We say is above iff for all , and strictly above iff for all .
P-construction: Given a premouse and , , or just if is understood, denotes the P-construction as computed in over base set . In [12, §1], this model would be denoted . If is a limit length iteration tree, abbreviates , and if is the trivial tree (that is, uses no extenders) then denotes . (The latter notation is just convenient when we set up indices for the direct limit systems, as then the trivial tree on indexes the base of the system computed in .)
Remark 1.0.
For our overall purposes Jensen indexing for premice is natural. However, genericity iterations are essential, which are somewhat cumbersome with Jensen indexing and Jensen iteration rules (as for -maximality above). The process for this is described in [20, Theorem 5.8]. We f also use genericity inflation, sketched in §4.2, and minimal genericity inflation, see [15, §5.2***].)
2 Ground generation
In this section we shall present an abstract version of the construction of a Varsovian model derived from a given inner model (satisfying the requirements below), and prove that is a ground of . It will take some time to lay out the required hypotheses ((ug1)–(ug24)); we will also collect some facts along the way.
Fix such that
-
(ug1)
is a proper class transitive model of ZFC,
-
(ug2)
is a directed partial order,
-
(ug3)
is an indexed system of transitive proper class inner models of which is an -class; that is, each is a transitive proper class inner model of , and is an -class. 555In practice, and all , , will be (pure or strategic) premice, hence inner models constructed from a distinguished (class sized) predicate, in which case our definability hypothesis is supposed to mean that the collection of predicates constructing the , , is definable over .
Suppose that in there is a system such that:
-
(ug4)
is elementary whenever ,
-
(ug5)
the maps are commuting; that is, for .
Let
be the directed system (the ext stands for external). Define the direct limit (model and maps)
(1) |
Suppose
-
(ug6)
is wellfounded; we take it transitive.
Note that the system is not assumed to be an -class, hence neither . But suppose that is “covered” by an -class, in the sense that there is an -class (we use the same symbol , since there will be no possibility of confusion) such that:
-
(ug7)
and is a directed partial order on ,
-
(ug8)
if then iff and
-
(ug9)
if and then ,
-
(ug10)
if , and , then .
Further, there is a system
(2) |
such that:
-
(ug11)
is an -class,
-
(ug12)
for all , is an elementary substructure of ,666Here if is a (possibly strategy) premouse, then this is precisely defined, and is passive (strategy) premouse; in general should be stratified in an -indexed increasing chain of -elementary substructures and should be the proper level of that hierarchy indexed at .
-
(ug13)
for all with , the map is elementary,
-
(ug14)
for all and , we have , and the map
is the inclusion map (hence -elementary),
-
(ug15)
the maps commute, in that ,
Note if and , then , so by (ug13), (ug14), (ug15),
is -elementary and has the same graph as has , and in particular, the graph is independent of . And note that whenever and and , because here and
but and are just inclusion maps.
Definition 2.1.
Given and , say is -stable iff for all with . Say is -stable iff is -stable for each . Call true iff is -stable and for all with , we have .
Lemma 2.1.
For each , there is such that is -stable.
The proof is standard, using the wellfoundedness of . Assume further:
-
(ug16)
for all , there is with and true.
-
(ug17)
for all and , there exists such that , is true and .
Define the direct limit .
Lemma 2.1.
is -definable.
Proof.
Our assumptions immediately give that is -definable. Consider the equality. We proceed as in the proof of [8, Lemma 2.4] or the first few claims in [19]; the last few properties listed above been abstracted from those proofs. We will define a map and show that is the identity.
Let and . By (ug10) and (ug16), we may fix such that and is true. Define
By commutativity and truth (trueness), this does not depend on the choice of , so is well-defined. Note that is -elementary and cofinal, hence fully elementary, by [4, Theorem II.1, p. 54; Remark II.2, p. 55]. If and , then by (ug17) there is with true and . Hence . So is surjective, so . ∎
Given , write , and given , write . Call a set a cone iff for some , and a cone iff for some .
Lemma 2.1.
We have:
-
1.
There is a cone such that for all with .
-
2.
There is a cone such that for all with , and
Proof.
Let and (using (ug16)) let be such that and is true (hence is -stable). Then and work. ∎
Note that part 2 of the previous lemma is understood by . Using this, we can define the associated -map . For write
(3) |
where is any element of any cone witnessing part 2 of the lemma. Note this is well-defined, and is a class of .
Lemma 2.1.
Let , and be cones witnessing Lemma 2. Then:
-
1.
for all ,
-
2.
and for all ,
-
3.
.
Proof.
There is another important characterization of , given some further properties. Assume:
-
(ug18)
There is a unique -minimal . Moreover, and for each .
So for all , and . The next hypotheses guarantee a homogeneity property of the system, in that each may equally serve as a base. Let , , etc, for .777Note that we write , not ; of the course the latter does not make sense. We know , but is of course computed in as the direct limit of . At this stage it is not relevant whether there is some external system of elementary embeddings associated with analogous to . Let and . Suppose:
-
(ug19)
For all , is dense in and dense in , and ,
-
(ug20)
For all and all with , we have and and .
-
(ug21)
For all there is with true and .
Using these properties, it is now straightforward to deduce:
Lemma 2.1.
For each , we have:
-
1.
is dense in and dense in , and .
-
2.
The direct limit of is just , and the associated -map is just , so and .
Definition 2.2.
For and , say is embedding-good iff , and for all .
Note that embedding-good is an -class.
Lemma 2.2.
-
1.
If is as in (ug21) then is true and for all .
-
2.
For each there is such that for each , we have true and , and for each there is such that is true and and is embedding-good.
Proof.
Let be the class of all embedding-good tuples. Define and . Working in , define by
Lemma 2.2.
is elementary and for . Moreover, for all .
Proof.
We now define the associated Varsovian model as
(4) |
So by Lemmas 2 and 2, is a class of , for all , and . Let , so is defined over just as over . So letting ,
Lemma 2.2.
extends uniquely to an elementary
such that (and ). Moreover, is -definable from .
Proof.
Since every element of is definable over from , and some ordinal, it suffices to see that for all formulas and ordinals , we have
But iff
for each . Taking such that is -stable, and then applying , note that the latter holds iff satisfies the corresponding formula regarding ; that is, iff
It therefore makes sense to define, for any ,
(5) |
and for ,
(6) |
that is, and denote the same function, as do and .
We next formulate a few more assumptions which ensure that certain sets are generic over . Let and . Let and , etc. Assume:
-
(ug22)
“ is regular and is a -cc complete Boolean algebra”, and
-
(ug23)
“ is regular and is -cc”.
Now work in . Let be the infinitary propositional language, with propositional symbols for each ordinal , generated by closing under under negation and under conjunctions and disjunctions of length (so if where , then and are also in ). (Note is a proper class of .)
Working in any outer universe of , given a set of ordinals, the satisfaction relation for is defined recursively as usual; that is, iff ; iff ; iff for all ; and iff for some .
Fix some -name for a set of ordinals, for some , and let for , and .
Definition 2.3.
Work in . Let be the poset whose conditions are formulas such that there is such that
and with ordering iff for every , we have
Although is proper class, it is easy to see that this is equivalent to a set forcing. Note here that since , is well-defined and
and the forcing assertions above make sense, as is a -name and . Note that by modding out by the equivalence relation
we get a forcing-equivalent poset defined as follows:
Definition 2.4.
Work in . Let be the forcing whose conditions are those Boolean values in of the form
where , excluding the -condition of , and with ordering induced by .
Note that the forcing depends on the name ; if we want to make this explicit, we will write .
Lemma 2.4.
“ has the -c.c.”
Lemma 2.4.
Let be a set of ordinals and and suppose that for all there is such that is -generic and .888In our applications, where will be a (pure or strategic) premouse, will typically be a canonical code for , and the name will provide a canonical translation of the pair into , where is the generic filter. Then the filter
or equivalently, if using Definition 2.4 to define , the filter
is -generic, and (so note ).
Proof.
Easily, is a filter. We verify genericity, and then clearly . Let be a maximal antichain of . We must see meets , or equivalently, that for some . Supposing otherwise, where
and by Lemma 2, , so .
For each , we have , so , and by hypothesis there is a -generic with , so
(7) |
Considering the definition of , note that we may take such that , so that (7) implies
so . But the elementarity of easily gives that for every , so is not a maximal antichain. Contradiction! ∎
Finally, suppose:
-
(ug24)
For every ordinal with , there is a set coding , and there is such that is -stable, and there is a -name such that the hypotheses of Lemma 2 hold for .
So under these assumptions for a given , the conclusion of Lemma 2 holds with respect to . Assumption (ug24) basically says that the form a system of grounds for in a “uniform” manner.
Definition 2.5.
Theorem 2.5.
Under the uniform grounds assumptions, is a ground of , via a forcing such that “ has cardinality ” and “ is -cc”. Therefore is a regular cardinal in .
However, is not a ground of .
Proof.
We have that every set (of ordinals) in is generic over for some . Since there are only set-many such forcings, is in fact a ground of for some such . Moreover, this forcing is -cc in , by [11, Theorem 2.2], we can find a forcing as desired.
The “therefore” clause now follows (recall is a regular cardinal of ).
Now is a ground of (since is a ground of ). Suppose is a ground of . Then is also a ground of . But defines , which is then a non-trivial elementary embedding between two grounds of , contradicting [5, Theorem 8]. ∎
When we produce instances of uniform grounds later, we will actually know more: we will have and Woodin in (hence also in , so Woodin in , which will be an assumption), and , so , so some will be a as above, but in fact of cardinality in and hence also in .
3 The model
In this section introduce the mouse we will be analyzing, and establish some of its basic properties, as well as some of those of its iteration strategy.
Definition 3.1.
Let be the statement, in the passive premouse language, asserting “There are ordinals with Woodin and strong for , as witnessed by ”. Let be the least active mouse such that where .999By [18], Woodinness and strength is automatically witnessed by , as a consequence of iterability, but we will also consider premice which need not be iterable. Then denotes the proper class model left behind by iterating out of the universe. Note , and is -sound. We assume throughout that exists and is -iterable.101010We could probably just work with -iterability. By [20, Theorems 9.1, 9.3], because is -sound and projects to , -iterability for implies -iterability, and similarly, -iterability for implies -iterability. We usually write .
Certain aspects of normalization, used to define from , will be used in the paper. The main features we need are the properties of mentioned in Fact 3 below, which can be black-boxed. Some of the details of the normalization process will also come up to some extent later on, but the reader unfamiliar with those details should still be able to follow most of the arguments in the paper.
Remark 3.1.
knows enough of that is definable over the universe of (without parameters). Therefore by [22, Theorem 1.1], is definable over the universe of without parameters. Thus, when we talk about definability over , it does not matter whether we are given as a predicate or not. However, if is -generic, then can differ from , for example.
Definition 3.2.
If is a stack on via , then denotes the tail stacks strategy for induced by , i.e. . Also denotes the normal part of . Actually by what follows below, we can and usually do write and .
Recall that is the strategy for stacks induced by .
Fact 3.2.
We have:
-
(1)
is the unique -strategy for , so satisfies both strong hull condensation and minimal hull condensation, and therefore by [15]:
-
–
every iterate of via is also an iterate via ,
-
–
if is -generic then extend canonically to , with the same properties there; with an abuse of notation, we continue to write for these extensions, or may write or to emphasize the distinction.
-
–
-
(2)
is fully positional, in that whenever are two stacks via with the same last model , then , irrespective of drops. However, positionality will only be relevant in the non-dropping case.
-
(3)
is commuting, i.e., if and are non-dropping stacks via with a common last model, then ; see [15, ***Theorem 10.4].
-
(4)
For all via , with last model , has minimal hull condensation and ; see [15, ***Theorem 10.2].111111In order to define , one also needs that is -standard, where , but this follows from the fact that is -standard, by [15, ***Remark 2.2]. Thus, every iterate of via is also an iterate via , in a unique manner,
-
(5)
If are via , of successor length, with non-dropping final branches, and , , and then and agree with one another in their action on trees based on . See [15, ***Theorem 10.5].121212The precise version of this fact might be simplified by the fact that is below superstrong.
Remark 3.2.
Definition 3.3.
We say that a stack on is correct if it is via . We say that is a -iterate of iff there is a correct stack on with last model . By the properties above, we may in fact take via (hence normal), and note that this is uniquely determined by (and ); we write . A -iterate is a dropping iterate iff drops, and otherwise is non-dropping.
Let be a non-dropping -iterate. Then a -iterate is similarly an iterate of via (equivalently, via ).131313We don’t need to iterate dropping iterates of further. If is a non-dropping -iterate, let be the iteration map (via ). Given , we say that is -sound iff, letting , we have ; equivalently, for all .
Definition 3.4.
Let denote the class of critical points of the linear iteration of which produces . For as above, let .
Definition 3.5 (-like).
A premouse is -like iff is proper class and satisfies a certain finite sub-theory of the theory of , including “I have no active proper segment such that ”. We will not spell out exactly, but the reader should add statements to it as needed to make certain arguments work. For an -like model , write
(8) |
If , then we may suppress the superscript , so , etc.
Fact 3.5.
Let be a non-dropping -iterate of and . Let . Then and is the unique club class of indiscernibles such that , or alternatively such that .
The following two lemmas are instances of branch condensation (see [7]) and are simple variants of [8, Lemma 2.1]; we fill in a couple of key points which were omitted from that proof, however.
Lemma 3.5 (Branch condensation A).
Let be a successor length tree on , via , based on , with non-dropping. Let be on , via , based on , with of limit length and successor with non-dropping. Let be -generic. Let where is a non-dropping -cofinal branch and
is elementary with . Then .
Proof.
Because extends to , with corresponding properties there (cf. Fact 3(1)), we may assume . Let . Let and .
Suppose first . Then there is a Q-structure for , and because is a cardinal of , has no Woodin cardinals, so is a strong cutpoint of . Because we have , is iterable.
If is non-dropping and then we can compare versus for a contradiction. So in any case, exists. Since has no Woodins, is also a strong cutpoint of , so we can compare and get , so .
Now suppose . Then we can argue as in the proof of [8, Lemma 2.1]; however, we fill in a seemingly key point: We extend to
with as in [8]. Now (this was not mentioned in [8]); for is iterable and is -sound, and likewise for , but both are models of “I am ”, so comparison gives . And because and fix all sufficiently large indiscernibles, we can indeed conclude that , where
where is the class of -indiscernibles. So by the Zipper Lemma, we get . ∎
There is also a version at . We won’t directly use this, but will use a variant, which will use a similar proof:
Lemma 3.5 (Branch condensation B).
Let be successor length on , via , based on , with non-dropping. Let be on , via , based on , with of limit length and above , successor length with non-dropping. Let be -generic. Let where is a non-dropping -cofinal branch and
is elementary with . Then .
Proof.
Again we may assume . Let be least with either or . Let . So and is -sound and where and . Let , and . If then let be the Q-structure for ; this exists because is the least Woodin of above , and is above . Otherwise let . This time, can have extenders overlapping , but only with . Let be likewise.
Define phalanxes . We claim are iterable.141414The notation indicates that we start iterating the phalanx with extenders of index , and extenders with critical point apply to . Given this, we can compare , and because is -sound and are -sound, we get , so if then and , and we reach a contradiction like before.
Define phalanxes and . It suffices to see are iterable, because then we can reduce trees on to trees on , using , and likewise to .
But is iterable because . For , we have defined as before (note that the same definition still works in case ). So is iterable. But with . So we can lift trees on to trees on using the maps . So is iterable. ∎
4 The first Varsovian model
We begin by identifying a natural direct limit system, giving uniform grounds for , in the sense Definition 2.5 in §2, hence yielding a Varsovian model, which we denote (we will later define a second Varsovian model ). The direct limit system will be defined analogously to that of [8, §2]. The main difference is in the increased large cardinal level. A smaller difference, one of approach, is that we use normalization, which means that we can focus on normal trees, instead of stacks.
4.1 The models for the system
Definition 4.1.
Let be a limit length normal tree on , based on , via .151515Recall is the -strategy (that is, for -maximal, hence normal, trees) for . Let . We say that is short iff either drops or ; otherwise is maximal. Let be the restriction of to short trees.
If is a non-dropping -iterate of and is limit length normal on and based on , we define short/maximal for analogously, and is the restriction of to short trees.
Definition 4.2.
Let consist of all iteration trees on , such that either is trivial, or
-
(a)
is based on , via (hence is -maximal),
-
(b)
is maximal,
and for some strong cutpoint of , writing and ,
-
3.
,
-
4.
is definable from parameters over ,
-
5.
is -generic for ,
-
6.
is proper class;161616Recall the notation from §1.1. 171717Recall is Woodin in , as witnessed by , and is the universe of . hence is a ground of via , and in fact . We write here also .
Lemma 4.2.
Let , and . Then , and .
We have by definition, but because of the requirement that be via (hence via ), it is not immediate that . But we show in the next section that it is, and that is rich, with the following properties: The restriction of to is known to , and whenever for some , the restriction of to is known to (and moreover, these are preserved by ). Pseudo-genericity iterations can be formed using these strategies to produce trees in . Any two such models can be pseudo-compared with these strategies. Moreover, every maximal tree via is “absorbed” by some .
4.2 The short tree strategy for
We now show that is closed under and is a class of , and that the same also holds with replacing , for any -generic (where need not be in ); in fact when the class can be taken lightface.
Let be via of limit length, and . Suppose we want to compute . Since has strong hull condensation, it suffices to find a tree via and -cofinal branch and a tree embedding , for then .
Suppose also and is based on . Working in we want to (i) determine whether is short, and (ii) if short, compute . If it happens that incorporates, in an appropriate manner, a genericity iteration for making generic, then we will be able to use P-constructions (combined with -translation, discussed below) to achieve both of these goals. In the general case, we use the method of (genericity) inflation to reduce to a tree which does incorporate such a genericity iteration (see [20, §5.2], which adapts methods for tame mice from [12, §1]). We give here a sketch of the relevant methods from [20], restricted to our context; but the reader should consult [20] for details.
Suppose also that is -generic for some , and . If let ; otherwise let be -total with and (so ). Let be a strong cutpoint of with . Following [20], let be the genericity inflation (explained further below) of for making generic for the -generator extender algebra, incorporating an initial linear iteration which moves the least measurable of beyond , and incorporating linear iterations past -translations of Q-structures.181818The technique of inserting linear iterations past Q-structures comes from [17], where there are details of such a construction given. The -translation is due to Steel, Neeman, Closson; see [1], together with an amendment in [13]. The -translations of Q-structures are segments of which compute the Q-structures which guide branch choices for .
Here is a sketch of the relevant material from [20]. We define by induction on . Suppose we have defined, but have not yet succeeded in finding . We will have an ordinal defined, and possibly have an ordinal and a lifting map
defined. (At we have and and .) We set , unless there is an extender with such that either (i) induces an extender algebra axiom which is not satisfied by , and satisfies some further conditions as explained in [20]191919It suffices that is inaccessible in , but one must also consider other extenders, including partial ones, because of the nature of genericity iteration with Jensen indexing. or (ii) is a measure to be used for one of the linear iterations mentioned above.202020The linear iterations need to be set up appropriately, to ensure that the process does not last too long; similar details are dealt with in the comparison arguments in [17]. We say is either copied from (when and are defined) or is inflationary (otherwise). The stages for which is not defined correspond to a drop in model in , below the image of the relevant extender from , and arise because of the nature of genericity iteration with Jensen indexing. Let . If is copied then is defined, and is the restriction of a map given by the Shift Lemma applied to and another map (whose domain is ; we have not specified here). If is inflationary then is defined just in case is defined and is total over , and in this case and .
Now consider a limit stage . The first thing to do is either compute (if ), or declare maximal (if ). Let . If is a Q-structure for itself then is trivial, and arguing as in [17] shows that in this case, (the argument is mostly standard, but some variant details arise, which are discussed there). So suppose otherwise. Then and is definable from parameters over . This is because , , the process for determining is locally definable, and the -translations of Q-structures used to compute the branches of are all proper segments of , because of the linear iterations past these -translations. Moreover, is generic for the -generator extender algebra of .
From now on, let us assume that for simplicity; since is a strong cutpoint of , the general case only involves shifting to . Let . Let , considering as a tree on . (Maybe is not short.) Then could have extenders overlapping . But the -translation of is a premouse extending and having no overlaps of , and in fact, either (i) and is short and , or (ii) and is maximal and . So can see which of case (i) and (ii) we are in, and in case (i), compute (as is the unique segment of whose inverse -translation is well-defined and terminates with a Q-structure for , which is then ). Moreover, the branch is determined by the -translation of a Q-structure, as promised earlier.
Suppose . So we have computed in . By [20], this determines either (i) some (and possibly a as before), in which case we continue the process; or (ii) a -cofinal branch and a tree embedding
with mapped cofinally into , and is encoded into , in such a manner that can compute from .
Now suppose that the process reaches of length . So is maximal and . Let and . So . Again by [20], there is a tree embedding
which maps cofinally in , and since are based on , then is maximal. Also in this case, considering as trees on , instead of on , we get that (the P-construction of above , which is the analogue of the inverse -translation of in this case), so if (and still ) then .
This completes the sketch. For further details the reader should refer to [20], augmented by [1], [13] and [22].
Definition 4.3.
For a non-dropping -iterate of , (the short tree strategy for ) denotes the restriction of to short trees. Also, denotes the (-maximal) strategy for induced by (including maximal trees) and denotes its restriction to short trees.
Note that by Fact 3(5), the notations and are unambiguous; that is, if are both non-dropping -iterates of with , then agrees with in terms of their action on trees based on . Of course is equivalent to , except that the two strategies have different base models. This is useful notationally below, where we can refer directly to but maybe not to .
We summarize the main results of this section in the following two lemmas:
Lemma 4.3.
Let be -generic. Then:
-
1.
is closed under .
-
2.
are classes of , definable over (as a coarse structure) from the parameter where , uniformly in .
-
3.
If then these are in fact lightface classes of the universe of .
-
4.
Therefore is lightface -definable, as is (recall if is the trivial tree on ),
-
5.
For each non-dropping -iterate of with , is closed under , and is definable over from , uniformly in . Therefore the function
with domain the class of all such , is lightface -definable.
-
6.
The corresponding facts hold after replacing by and by and by , for any non-dropping -iterate of . Moreover,
and with from part 5, has the corresponding domain in , and for each .
Proof.
By the previous discussion, is closed under . Moreover,
are definable over from the predicate . But the universe of is definable over from by Woodin-Laver [6], [28]. By [22], is definable over from , but the latter is -iterable in (via ), and is therefore definable without parameters there (which is relevant to the case that ). Part 5 is a straightforward adaptation; in fact, note that trees via normalize to trees via . Part 6 is also straightforward, using the uniformity of the process.212121However, working inside , if on is maximal and we minimally inflate to produce , and build the proper class model by P-construction, and , then it need not be that . But in this case, and will still compare to a common model above . Related issues will be discussed further in §4.11. ∎
Lemma 4.3.
Let be -generic for and be a limit length normal tree on which is based on and via . If let , and otherwise let be -total with and
and . Let . Let be a strong cutpoint of with . Then there is such that:
-
(1)
is a limit length tree on (but is equivalent to one on ), based on , via (hence -maximal); let and ,
-
(2)
,
-
(3)
is -generic for ,
-
(4)
If is maximal then is maximal, and .
-
(5)
Suppose is short. Then is short and , and there is which computes the Q-structure via inverse -translation above .
-
(6)
There is a tree embedding , and can be computed locally from (hence if are short then ).
-
(7)
If (so ) and is maximal then .
Definition 4.4.
We may also express the situation of the preceding lemma by saying that is absorbed by , or is absorbed by .
4.3 The first direct limit system
4.3.1 The external direct limit system
We now define a system of uniform grounds for . In the notation of §2, we use index set
For , the associated model is . Of course and are essentially equivalent. By Lemma 4.2, is lightface -definable. Write .
We now define the partial order on , and maps . Let and and . Set
We also define the order on by iff . The associated embedding is just the iteration map . We remark that if then the tree witnessing that is of the form , with via and , but .222222 cannot have an elementary embedding , because are both grounds of and by [5]. Therefore . is determined by (in fact, just by , because all the relevant Q-structures are segments of ), so . We write for , and . While is not amenable to (if non-identity), we do have:
Lemma 4.4.
is a directed partial order, is lightface -definable, and the associated embeddings commute: if then .
Proof Sketch.
For the definability, note that iff the pseudo-comparison of , using to iterate ,232323Or just reading Q-structures from segments of to compute branches. yields a limit length tree on with (so does not move in the pseudo-comparison).
The fact that is a partial order, and the commutativity, follows from the properties of in Fact 3.
For directedness, given , witnessed by trees , form a simultaneous pseudo-comparison and -genericity iteration of in , using , producing trees respectively, and with ; note that if we normalize the stack , or the stack , we get the same normal tree ; here . ∎
Now define . By the lemma, is a direct limit system with properties (ug1), (ug2), (ug3), (ug4), (ug5). Note that (ug18) holds, with . Define the direct limit model and maps
(9) |
Notice that even though is a definable collection of classes in , this system is not “in” , as the maps (when non-identity) are not amenable to . As usual, is wellfounded, giving (ug6).
Definition 4.5.
For , let be the canonical class -name for ; that is, is the name for the class “premouse” such that is given by the extender algebra generic, and is given by extending via the usual extension to small generic extensions (equivalently, agrees with on the ordinals). (Of course, for some generics, this might not actually yield a premouse, but with the generic for adding , we have .) Note that .
Lemma 4.5.
(ug19) holds: for each , is dense in and dense in , and .
Proof.
Let . The fact that is by Lemma 4.2 part 6. So let and . We must find some with . Let be some -name such that . Let be a strong cutpoint of such that and . Let be the Boolean value of the statement “ is an -like premouse and ”. Then working in , we can form a tree on by Boolean-valued comparison of and all interpretations of below , with -genericity and Boolean-valued -genericity iteration folded in, and using the short tree strategies to iterate. (The Boolean-valued genericity iteration means that we use extenders under the usual circumstances as for genericity iteration, and given that there is some condition forcing that induces an axiom false for .) For each limit , if is not a Q-structure for itself then and is definable from parameters over , because (i) the segments of are determined level-by-level by above , and (ii) for all limits , the Q-structures guiding branch choice at stage do not overlap , and (iii) the Q-structures of all trees at stage are identical, and hence ; this means that we can use P-construction to compute Q-structures, and obtain an iterate in . (For (ii), suppose is least such that a Q-structure overlaps . Then there are fatal drops passed before stage . This has to originally arise from a disagreement between the extender sequences of some projecting structures, as opposed to extenders used for genericity iteration purposes (as the latter are only used when they are sufficiently total; cf. the process in [20]). But then we can find some mutual generics witnessing this disagreement, and because the short tree strategies extend to generic extensions (because is forced -like), and given the fatal drop, these strategies suffice to complete the comparison between the conflicting projecting structures in the generic extension, which leads to the usual contradiction. Because does not overlap , note that no extenders in of length will be used for genericity iteration purposes.) ∎
4.3.2 The internal direct limit system
Definition 4.6.
Work in . Given and , say is weakly -iterable iff for all with , letting , there is such that forces the existence of a -cofinal branch such that
(10) |
(in particular, is in the wellfounded part of ). We say that is -iterable iff every with is weakly -iterable.
Given an -iterable , define
(Note that the hulls here are uncollapsed. Recall that is passive by definition.) Given also a -iterable with and , define
as the common restriction of iteration maps for witnessing the weak -iterability requirement (10). 242424Notice that does not depend on , because and have the same graph. In [8], the notation for the analogous map, , does not mention . (Those restrictions agree pairwise by the Zipper Lemma.) Say that is strongly -iterable iff is -iterable and whenever and (hence ), then
Let , and similarly let . The order on is now determined by (ug8): for , we have iff and . Define the order on in the same manner. Clearly
Define the system .
Given and , recall that is -stable iff for every with .
Remark 4.6.
Even though it is superfluous, we note that -iterability actually implies strong -iterability. This follows from calculations in [15]. For let , and . Say that a -cofinal branch is -good iff is -wellfounded and ; likewise for the other trees. Then the -good branches correspond exactly to pairs such that is -good and is -good; and moreover, the corresponding iteration maps then commute (see [15, ***Theorem 10.8]). Let be -good and witness weak -iterability. Let be the -maximal tree on given by . So , where is the branch extender. By a condensation argument due to J. Steel, , and since , clearly , so , and similarly . Likewise for being -good and witnessing weak -iterability, and -maximal tree on . Let be the corresponding branch, and the -maximal tree on . Then we get , and , and commutativity in general. But note that these embeddings agree with the covering direct limit maps (consider the natural factor map ), and therefore we get strong -iterability.
The following is proved by the usual arguments (recall that since is wellfounded, for all , there is such that is -stable):
Lemma 4.6.
The following properties follow directly from the definitions; note that strong -iterability is used for (ug15):
For the following, recall from Definition 3.4:
Lemma 4.6.
For each , is -stable for every . Therefore property (ug17) holds, as witnessed by some .
Proof.
We now have enough properties from §2 to define (working in ) the direct limit
(11) |
and the -map, and Lemmas 2 and 2 hold, so in particular, is the identity and . Property (ug20) is straightforward (the main point is that if and then , because agree above ). For property (ug21), given , note that any such that is -stable works.
So far we have verified (ug1)–(ug21). For the remaining properties we use and (the -generator extender algebra of at ). This immediately secures (ug22). Recall we defined in Definition 4.5, and .
Lemma 4.6.
We have:
-
1.
For each -stable and each , letting and be the -generic filter for given by , then . Moreover, .
-
2.
Property (ug24) holds.
-
3.
is the least measurable cardinal of .
-
4.
.
Proof.
Part 1 is already clear, and part 2 is an easy consequence. Part 3 is also clear. Part 4 is by the proof of [8, Lemma 2.7(b)].252525Actually, an easy cardinality calculation shows that , and we will show directly later that is Woodin in and is a ground of via a forcing which has the -cc in , and hence is regular in , so , without using the proof of [8, Lemma 2.7(b)]. ∎
Lemma 4.6.
Let be -total with and let . We have:
-
1.
, and so .
-
2.
is a -sound -iterate of .
-
3.
.
-
4.
is the -iteration map.
Proof.
Lemma 4.6.
The following are true.
-
(a)
The restriction of to trees in and based on , is lightface definable over .
- (b)
Proof.
The short tree strategy for is computed just like for , and the definability is like in 4.2. The computation of branches at maximal stages is just like [8, Lemma 2.9(a),(b)], supplemented by Lemmas 3 and 4.3.2, and for the definability, use the definability of from in (see 4.2). Here is a sketch for . Let be -total, with and a maximal tree on . Let . By Lemma 4.3.2, is a -sound iterate of and is the correct iteration map. Now let . Then “ is a maximal -iterate of ”, and therefore “ is a maximal -iterate of ”, considering statements satisfied by regarding such iterates. But is correct about this. Let be the tree on leading to . Working in a generic extension of , find a -cofinal branch and -cofinal branch such that , and then verify that , using Lemma 3.282828There is an alternate proof which uses properties of normalization and is more direct. Let be the tree leading from to (with final branch ). We have by Lemma 4.3.2. But (of limit length) is the normalization of the stack (the trees in the first given proof). Letting be the correct branches through , determines (together with ) the pair uniquely via normalization. ∎
Remark 4.6.
The strategy also has minimal hull condensation, so we get the canonical stacks strategy induced by , which agrees with the tail strategy , by Fact 3. It is easily definable from , and for stacks based on , we only need the normal strategy for trees based there. So can also compute the restriction of to stacks based on , which are in .
4.4 The first Varsovian model as
In §2 we defined the elementary maps and . We now want to show that is an iterate of and is a correct iteration map. We also want to generalize this to other iterates of , but in general one must be a little careful.
Definition 4.7.
Given an -like premouse , let and be defined over just as how , are defined over . If is a correct iterate of , also define (the external direct limit) relative to , as for : given a maximal tree (considered as a tree on ), let and , and let be the direct limit of these models under the iteration maps (by Lemma 4.2, and in particular its part 6, these trees are indeed according to ).292929These models can in general be distinct from the models computed by via P-construction, which is why the care mentioned above is needed. If in fact (the model indexed by in the covering system ) for each such , then define as in §2.
Lemma 4.7.
Let be a -sound, non-dropping correct iterate of . Then for each , and , and is a -sound, non-dropping correct iterate of both and .
Proof.
The proof is just like for , using the -soundness of (and resulting -soundness of ) as a substitute for the fact that , to see that the models of really are iterates of . ∎
We will see later, however, that if is a -iterate of which is -sound but non--sound, then , so we need a little more care in this case.
By the lemma, is an iterate of . Now recall that is the union of all for embedding-good tuples , and that , and if then
(12) |
where is any pair with and . As usual we have:
Lemma 4.7.
is the iteration map according to .
Similarly, let be as in Lemma 4.4 (so a -sound correct iterate, and likewise ). Let . Then is the iteration map according to .
Write . As in [8], since the tree from to is based on , is determined by (as is the ultrapower map by the extender derived from ), which is in turn determined by the pair . Since , it follows that
Moreover, is definable over this universe from the predicate (given , we can recover and the maximal tree leading from to , but in , there is a unique -cofinal branch with ; but ).
Definition 4.8.
The first Varsovian model of (cf. (4)) is the structure
(13) |
that is, has universe and predicates and .
(By the preceding comments, it would suffice to just have the predicate , but we include for convenience.) Later we will introduce a second presentation of , constructed from a different predicate (but giving the same universe). However, the two predicates will be inter-definable over that universe.
Before we introduce that presentation, we first develop some properties of using the presentation above. We may at times blur the distinction between the universe and the structure , but for definability issues over , we can by default use as a predicate.
4.5
Up until this point, the paper has covered material which is mostly a direct adaptation from that of [8]. But in this section we begin to see some new features. In [8] it is shown that the Varsovian model has universe that of , where is -generic, for the strong cardinal of . In this section we will establish an analogue of this fact.
Let be -generic. Note that if is the universe of , then it would follow as in [8] that is closed under maximal branches according to (those branches are in by 4.3.2, and have length of uncountable cofinality in , and hence are unique there). Thus, such a fact is at least useful in verifying that the first Varsovian model can iterate its own least Woodin cardinal, which one would like to prove.
Also, in order to proceed to the next step of the mantle analysis, one might want to consider iteration trees on , based on (we will show that is Woodin in ). But because is built from the somewhat cumbersome combination of and , the nature of its large cardinals above (and so far also below there, though that is resolved by standard methods) is somewhat unclear, as is its fine structure.
Now if we are to expect to be closed under , a possible goal is to find a presentation of it as a strategy mouse, built from extenders and strategy for , with a fine structural hierarchy; with this target in mind, we write for the desired model of this form (whatever its eventual presentation might be). The first two authors considered various candidates for such a presentation, with one possibility being a construction by level-by-level correspondence between and , via a modified kind of P-construction. This P-construction would result from restricting the extenders of to segments of , starting above some point not too far above . (An early candidate was , but the second and third authors later reduced this to an optimal starting point, which we use.) Of course standard P-constructions build a ground of the outer model, and this feature was expected, via a Bukowsky-style forcing as in [8]. Here we use the forcing from §2, which was eventually isolated by the second author. But note that a new feature in this P-construction would be that some extenders (those extenders with ) overlap the forcing . This would cause a problem with a standard P-construction (where the base forcing is produced by genericity iteration). But such extenders yield strategy information, via the process in the proof of 4.3.2 (whereas those with would be as usual). So it appears that one might construct with such a P-construction, with extenders having corresponding to strategy information, to be added fine structurally to the relevant segment of . This could then lead to a model closed under for trees based on , as is desired. The model should also inherit iterability for itself, from the iterability of , in a manner similar to standard P-constructions.
A first basic question is whether the model constructed as above will end up . We now make the key observation which shows that it does. A useful first step is to restrict one’s attention to the action of the extenders on the ordinals; this will be enough for the P-construction. For the purpose of the next lemma, let us write
(14) |
where, since we are using Jensen indexing, the -extender in (14) is an elementary embedding where , so .
In the following lemma, recall that for definability over , we by default have the predicate available for free:
Lemma 4.8.
is lightface definable over .
Proof.
Let with . We claim that iff
which suffices. This equivalence holds as for every , we have , since and results from a P-construction of above some point below . ∎
One can now proceed directly with the P-construction, using and to define it. But we postpone this, and first establish some other characterizations of the universe of .
The proof of the preceding lemma can be extended to show that has universe , for a certain collection of premice in , and as above. Thus, we use here in place of the use of in [8]. We describe how this works next. What follows is slightly related to some methods from [17]; also cf. 4.8.
Definition 4.9.
Let be a premouse, and let be a strong cutpoint of . If is -generic over , then every extender from with (and hence ) lifts canonically to an extender over . Let us write . Then gets reorganized as a premouse over with extender sequence ; so .
Let , be proper class premice and . Write
iff is a strong cutpoint in both and and there are with being -generic over and and . So “” expresses the fact that above , and are intertranslatable: for every , , and vice versa. Write
iff there is some with . Both and are equivalence relations.
Let be a proper class premouse, let be inaccessible in , and let be -generic over . We denote by the collection of all such that and “”.
Remark 4.9.
Note that if then
-
(i)
There are and generics witnessing that .
-
(ii)
is -definable inside from the set parameter and the class parameter , uniformly in .
-
(iii)
There is which is -generic over , with . For any such , we have .
-
(iv)
is definable over from , uniformly in .
-
(v)
is definable over from , for all , uniformly in .
Fix now which is -generic. We write .
The following is now immediate.
Lemma 4.9.
If , then there is which is -generic over such that , and for any such , we have .
Theorem 4.9.
We have:
-
(i)
(including its predicates) is definable over from the parameter , and
-
(ii)
has universe .
Remark 4.9.
This leaves the question: is the universe of ?
Proof.
We first verify (i). Write . Say that is -like iff is -like. Fix an -like . We claim that and are defined over in the same manner as over , which suffices. For the systems and have cofinally many points in common, which easily suffices. To see this fact, use a Boolean-valued comparison argument as in the last part of the proof of [8, Claim 2.11] (comparison with simultaneous genericity iteration, against for various -like ). Because “-like” includes short-tree iterability, etc, we can indeed form this iteration successfully.
Part (ii): By (i), . We now prove the converse. Let be a set of ordinals, a formula, such that for every ,
So for every and with , and every , we have
(since , by Remark 4.5).
Given an -like , write for the natural -name for (for the -generic filter; cf. the remarks on the uniform definability of above).
4.6 Uniform grounds
Recall that is the least Woodin of . The following lemma completes the proof that the first direct limit system for provides uniform grounds (§2):
Lemma 4.9.
We have:
-
(a)
.
-
(b)
is (the least) Woodin in .
-
(c)
Property (ug23) of uniform grounds holds for ; that is, “ is regular and is -cc”. Moreover, “ is a complete Boolean algebra”.
Proof.
So by Theorem 2, is a ground for , and in fact as in its proof, there is some -stable such that is -generic, where , and . We will actually refine this result in Lemma 4.9.
We can immediately deduce the following corollary, which however will be extended in Lemma 4.9:
Corollary 4.9.
For all maximal trees via , based on , we have , and is the unique -cofinal branch in .
4.7 The structure
Let be the least total measure on the -sequence with critical point . Fix a natural tree with and which makes generic, after iterating the least measurable out to . As lives on , we may and shall construe as a tree on rather than on . If , then
and . Also,
(15) |
Let us write
(16) |
By Corollary 4.6, . Hence
(17) |
is an amenable structure and is an element of .
Lemma 4.9 (Soundness of ).
.
Proof.
Let
As , , so that and . Let be defined over as was defined over . The tree is on which lives on , but we may and shall construe as a tree on , and as such is according to .
Let . By branch condensation Lemma 3, is the pullback of via . We will have that and there is a canonical elementary embedding
defined by
where and . We will have that and and agree on this common part of their domains.
If is a total extender from the -sequence, then by the elementarity of , satisfies all the axioms of the extender algebra of given by , as satisfies all the axioms of the extender algebra of given by . We may conclude that is generic over . If is the associated generic over and that over , then , and hence we may lift to an elementary embedding
defined by .
But notice that , so that by the -soundness of and by the choice of as a measure, must be the identity, and therefore so is . ∎
Corollary 4.9.
-
(a)
has size inside .
-
(b)
.
This corollary should be compared with Lemma 4.9, to come.
4.8 The -mantle of
We now give another characterization of the universe of , though no results outside of this subsection actually depend on it.
The following definitions are essentially taken from [26], though the notation and terminology is different. If is an inner model and is a cardinal of , then is a ground of iff is an inner model of and there is some poset which has size in and some which is -generic over such that . is called a ground of iff there is some such that is a ground of . The mantle of is the intersection of all grounds of . We write for the -mantle of .
The main result of this subsection is that has universe ; see 4.8. The following fact and its proof are similar to parts of [22, ***Lemmas 3.11 and 4.1] and [17, ***Lemmas 5.4 and 5.12]; in particular, we make use of the condensation stacks from [22].
Let be a cardinal strong cutpoint of , and . Let be -generic over . Let denote the set of all such that:
-
–
is a premouse of ordinal height ,
-
–
has a largest cardinal , and is a strong cutpoint of ,
-
–
“ is fully iterable above ”
-
–
there is a proper class premouse with and “”.
Note that because of the restriction on above , we don’t actually need to quantify over proper classes here, and clearly is definable over from the class . We now refine this fact:
Lemma 4.9.
Let be -generic over . Then (i) is definable over from no parameters, uniformly in . Further, (ii) for all as in the definition of , is definable over from the parameter , uniformly in .
Proof.
Note that and is the universe of . Now working in , let be the set of all premice of height such that for some ,
-
–
has a largest cardinal, , which is a strong cutpoint of ,
-
–
is fully iterable above ,
-
–
is -generic over and has universe ,
-
–
the condensation stack above (relativized as a premouse over ) is well-defined, hence is proper class with universe .303030Recall we are working in , so “” refers to here. Because we relativize over , plays the role that plays in the unrelativized condensation stack for a premouse .
For , we write for the largest cardinal of , and with as above, we consider as an -premouse. Now , and in fact , as witnessed by . For by [22], the condensation stack above , as computed in , is just (arranged as a premouse over ).
We will show that , which gives part (i). The first direction is basically as in [17, Lemma 5.4 part 1]:
Claim 1.
.
Proof.
Let , as witnessed by . Everything is clear enough except for the fact that, in , the condensation stack is well-defined. But has universe that of , and there is such that is iterable above (in ), and we can take here such that projects to . By this iterability, , when considered as an -premouse, therefore is just the condensation stack above . But is also iterable in (above ; that is, as an -premouse). So satisfies all standard condensation facts (as an -premouse). So we can argue as in the proof of [17, Lemma 5.4 part 1] to see that , when considered as an -premouse, is also the condensation stack above , as computed in , as desired. ∎
Claim 2.
Let , witnessed by . Then there is such that and and have the same universe, with largest cardinal , and the two structures and are inter-definable from parameters and project .
Proof.
We basically follow the proof of [22, Lemma 3.11]. Let be arranged as a premouse over , and be the condensation stack over as computed in .
So both have universe , and in particular, and . We first find such that and have the same universe and are inter-definable from parameters (and some more). Define as follows. Let and . Now given , let be the least such that and and . Define symmetrically.
Let and . Note that have the same universe , which has largest cardinal , and therefore and (that is, and are both passive, as is a strong cutpoint of ). Note that is definable from the parameter over ; in fact, is the Jensen stack above there; cf. [22]. It follows that is . Likewise for and . Using this, note that also is , and so .
Now as in [22], we can find and such that and the hulls and have the same elements, and letting be the transitive collapses and and the uncollapse maps (so have the same universe and the same graphs), and such that and and and are -sound with , so and . Note that the definition of reflects down to a definition of , where . Likewise vice versa. Therefore have the same universe and are inter-definable from parameters. So letting , we are done. ∎
Claim 3.
.
Proof.
Let be as in Claim 2. Then note that is a strong cutpoint of and of and of the condensation stack above (as an -premouse, as computed in ). So the iterability of and above (in ) implies that for each . Thus, the extender sequences of and are intertranslatable (modulo a generic) above . So by a proof almost identical to [17, ***Lemma 5.4 part 1], and (as an -premouse) have the same extender sequence above . Now let be the result of the P-construction of above . Because , this works fine structurally, giving a proper class premouse extending . But since and agree above , it follows that . So . ∎
This proves part (i). For (ii), working in , given , we first define the condensation stack above , and then the P-construction of above , which gives the desired . ∎
Lemma 4.9.
is dense in the -grounds of , so .
Proof.
Let be a regular cardinal strong cutpoint of , and let be a -ground of , via a generic filter (so ). Let be -generic and be -generic, with . Let be the model produced by the P-construction of over . By Lemma 4.8, and is definable from parameters over . And is a ground of ; in fact , as is definable over from the parameter , via the Jensen stack.313131It follows by the standard forcing argument that is the actually the universe of .
Now working in , we can compute some by forming a Boolean-valued comparison/genericity iteration above , to compute , and then using P-construction to compute the rest of . ∎
Theorem 4.9.
has universe .
Proof.
We already know by Lemma 4.8.
Let us verify .323232The original argument used for the proof that , found by the 3rd author, was slightly different; that argument is sketched for the analogous result Corollary 5.8. The 2nd author then adapted that one to yield the one presented here. In either form, the argument is related to Usuba’s ZFC proof of the fact that if is extendible then . Related arguments have since been used by the second author in [9] and the third author in [21], [16]. Let be the order total measure on . Let
be the ultrapower map. For , is the order total measure on in . Let be the ultrapower map. Note . Let and be the ultrapower map.
Arguing much as in the proof of Lemma 4.5, is definable over : for all and , we have
(For the second equivalence, just take such that are -stable.)
Now let be a set of ordinals. By the preceding paragraph,
(18) |
By elementarity, . It is straightforward to verify that is the direct limit of a system of uniform grounds of in much the same way as is the direct limit of the system of uniform grounds of ; here the models are exactly those of the form for some . So by Theorem 2,
is a -ground of . So , but note , so , but then using line (18) we get , since
4.9 The first Varsovian model as the strategy mouse
We will now give another presentation of , as a strategy mouse in a fine structural hierarchy , as sketched at the beginning of §4.5. To motivate this, first notice the following.
A routine first observation is:
Lemma 4.9.
Let be an active (Jensen indexed) premouse. Then is -definable over , uniformly in .
We remark that it is important here that we have the universe and (internal) extender sequence of available.
Let for the poset of Definition 2.3, for adding generic subset of .
Lemma 4.9.
is -generic over and .
Proof.
Since we have verified the properties for uniform grounds, that is -generic over follows from §2. We aim to show that by performing a “-construction.”
Definition 4.10.
We now define a class structure , structured analogously to a premouse, built from a sequence of extenders. However, some of the extenders will be (properly) long, and will not cohere the sequence. We write and with the usual meaning. For those segments active with long extenders, some of the premouse axioms will fail (in particular, coherence).333333The segments where or [ and ] do not satisfy the usual premouse axioms with respect to their active extender. Write .
The map (see (5) and the preceding discussion) is an iteration map. We define (recursively on ):
(19) |
(We will verify in Lemma 4.9 that this definition makes sense; in particular, that when .) Let us also write
(20) | |||||
(21) |
We define the structure
Like with , when we discuss definability or write an equation with , or some similar structure, then we refer to the structure itself, not just its universe . In particular, definability over has the class predicate available by default, just like for premice. (But when no confusion can arise, such as with expressions like “” or “”, we really mean “” or “”, etc.)
Write , so is the least (properly) long extender of , which is just the extender induced by .
Definition 4.11 (Fine structure of ).
The fine structural concepts (, , , -solidity, etc, for ) are defined for segments , and also for , just as for standard premice with Jensen indexing below superstrong: (without any constant symbols in the fine structural language), which determines everything else via the usual recursion.
We will show that all segments of are well-defined, sound, and establish a fine structural correspondence between segments of and segments of , above a certain starting point. The first non-trivial instance of these facts is given by 4.9 together with the next lemma; it uses techniques reminiscent of those in [22]. It results in a tighter bound on than that given by Corollary 4.7.
Lemma 4.11.
Let (so has active). Then:
-
(a)
is -definable over .
-
(b)
is isomorphic to a structure which is definable without parameters over .
-
(c)
is sound, with and .
-
(d)
, where is the least such that is admissible. Therefore is passive for every .
Proof.
Part (b): Let be like , but consisting of pairs such that there is with and and . (Let the associated ordering, models and embeddings be the corresponding ones of .) Let be the direct limit of , and the associated -map. Let
be the natural map determined by how sits within . Noting that is definable over , it suffices to see that is the identity.
Fix with . For , let be the transitive collapse of
and let be the uncollapse map, and where .
We claim that , and therefore . For this, note , so . But is a small (of size ) forcing extension of , which implies , so , as required.
So write for the common value of . One can now use the argument of the proof of Lemma 2 (which showed that the natural map is the identity), but replacing the use of there with . It follows that .
Part (c): Since , it suffices that .343434Let be the structure defined in §4.7. We already know , but it seems that the branch through the genericity tree involved there might not be computable from . So the soundness of is not an obvious corollary. Let ; we want to see that . Fix a non-empty and such that . Let be as above. As before, is -stable, and note that (because , if then ). But then, as desired, we have
The levels of correspond tightly to the levels of , as follows.
Lemma 4.11.
Let be the -generic determined by . (so ). For every we have:
-
1.
and are in ,
-
2.
and are sound,
-
3.
Suppose .353535 Also, and are “generically equivalent in the codes”, and letting be the unique surjective order-preserving map, then are likewise equivalent with for all , but we will not need this. Then
-
(a)
and is -generic,
-
(b)
,363636The notation is explained in 4.9.
-
(c)
,
-
(d)
if and then satisfies the usual premouse axioms with respect to its active predicate (with Jensen indexing; in particular, is an extender over ), and
-
(e)
if and then is a long -extender over and
is a lightface proper class of , uniformly in .
-
(a)
Remark 4.11.
Here the notation is the usual one in this context, meaning that (i) the two structures have the same universe, (ii) for each (or ), (which is already true by definition), and conversely, if then is the canonical small forcing extension of to and if then is determined by and as usual for a premouse, and (iii) the structures and (or and ) have corresponding fine structure in the manner usual for P-constructions as in [12], with matching projecta and parameters, etc.
Proof.
The lemma holds for directly by definition, for by 4.9. For it is a straightforward consequence: we have since , and therefore cannot project . Note that , just because is the least segment with an active extender of its kind. Using 4.9, therefore . If then we therefore get , and hence is sound. If instead then note that has universe that of , and the forcing relation is (lightface, as ). But , and since all of the facts witnessing this get forced, it follows that , so is sound.
For we discuss parts 1 and 33(d),3(e); for the rest one mostly uses standard calculations as for P-constructions. Suppose we have established that , and , so . We already know that (by Lemma 4.5). We must verify that (and uniformly so), and hence , and that has the right properties.
Suppose . Then is an extender over satisfying the usual requirements for premice, by the usual proof (using induction and that is a small forcing extension of ). It follows that can be computed from the pair , as usual. But is in by induction.
Now suppose that . Then is a (long) -extender over , but this time does not cohere . In order to compute the full from , one also needs the target model
By 4.9, this is computed by the local covering system of (as defined in that proof, but over , not ). But since and the forcing where is the largest cardinal of , and , there is a canonical definition of over (uniform in all such ). That is, although we don’t have the full directly available, the agreement between and ensures that the short tree strategy for is computed almost like when we do have : Given a strong cutpoint of with , let be -generic. Then can be arranged as a premouse over , and note that we can also take such that there is an -generic such that (with equivalent intercomputable with ). Therefore we can use to compute short tree strategy for in the same manner we use (working above ), and by homogeneity, this computation restricted to trees in is independent of the choice of . The computation of maximal trees (above ) is similarly absolute, and note that the P-constructions determined by these trees also agree between and . The system computed in is also easily dense in that of . Therefore computes , as desired.373737Note that the foregoing proof did not use Lemmas 4.3.2 or 4.3.2, which we are yet to actually prove; it does not matter here whether is a correct iterate of . But in any case, we could have proved those lemmas at the point they appeared in the text. ∎
Proof.
Let us show . Write . By 4.9 part 3, , and since , therefore is -generic over both and . But then as in the proof of Lemma 4.9, has universe (as does ).
Now let be a set of ordinals. We show that . Let be an -name in such that . Let be such that . It is easy to see that then
So the two models have the same universe. ∎
The preceding fact will be refined later in Lemma 4.10.
Remark 4.11.
We may also reorganize as a strategy premouse, by representing the information contained in the long extenders in differently. These extenders are easily seen to be intertranslatable with fragments of for trees based on . Namely, let us define a sequence as follows. Except for those where is long, we set . If is long, then , where is the normal tree on leading from to . Then easily, Lemma 4.9 holds also after replacing with , and are level-by-level intertranslatable. So .383838However, it is not clear whether can be arranged as a strategy mouse in one of the more traditional hierarchies, like those used for HOD mice, or the least (tree) branch hierarchy.
Lemma 4.11.
We have:
-
(a)
The restriction of to trees in and based on , is lightface definable over (so by Lemma 4.10 below, it is also lightface definable over ).
-
(b)
Let be in some set generic extension of and be set-generic over . Let be the restriction of to trees in and based on . Then is definable over the universe of from the predicate .393939Regarding trees , cf. Footnote 27.
Proof.
This is much like the proof of Lemma 4.3.2 (whose complete proof will rely on Lemma 4.11, still to come), although now we don’t have itself available. The computation of short tree strategy is as in the proof of Lemma 4.9 part 33(e). The computation of branches at maximal stages is like in the proof of Lemma 4.3.2. ∎
To summarize, we have isolated several representations of the universe of , indicating that is a natural object:
4.10 Varsovian strategy premice
In this section we will introduce an axiomatization for premice in the hierarchy of . But first, we refine Lemma 4.9 as follows:
Lemma 4.11.
-
1.
.
-
2.
is a lightface class of ,
-
3.
is a lightface class of .
Proof.
Part 1: Let . We have and is the ultrapower map, so . By Lemma 2, extends elementarily to
so considering how is defined over , and over ,
is also elementary. Since , it follows that is also derived from . Let and be the ultrapower map and the factor map, so . Since and is the ultrapower map, we have (and ). So in fact and .404040Here is a slightly alternate argument. We have and is the ultrapower map. Let and be the ultrapower map. Then as before, in fact and . Moreover, by considering some fixed indiscernibles, is the correct extender of the iteration map . Now and have the same universe, and is defined over via the procedure mentioned for part 2 of the lemma. So is defined over in the same manner. But agrees with , so this definition actually yields .
Definition 4.12.
For an -like , , , and denote the lightface -classes defined over just as the corresponding classes are defined over .
Also given an -like and with , we define by recursion on by setting , where . Noting that this definition is level-by-level, we similarly define whenever is -small and is an inaccessible limit of cutpoints and Woodins of and , level-by-level (starting by defining as is defined (in the codes) over ). We will often suppress the from the notation, writing just .
We now want to axiomatize structures in the hierarchy of to some extent:
Definition 4.13.
A base Vsp is an amenable transitive structure such that in some forcing extension there is such that:
-
1.
are premice which model and are -small; that is, they have no active segments which satisfy “There are with Woodin and strong”.
-
2.
has a least Woodin cardinal and a largest cardinal , and is inaccessible in and a limit of cutpoints of ; likewise for ,
-
3.
, is the least measurable of , and ,
-
4.
(defined over like is defined over ) is well-defined, and has least measurable and least Woodin ,
-
5.
is obtained by iterating , via a normal tree of length ,
-
6.
is a cofinal -elementary (hence fully elementary, by ) embedding
and there is a -cofinal branch such that , and (so is intercomputable with , and note that by amenability of , is amenable to , and hence so is ),
-
7.
and and is Woodin in , as witnessed by ,
-
8.
is -generic, where is defined over as above was defined over .
Remark 4.13.
Let and be the core map. Then
(22) |
For we have and by hypothesis. So is clear, and is because for each , is in the hull on the right, by calculations like with the Zipper Lemma.
Now because is Woodin in , and in particular regular, we have that is sound with , and in particular .
Note also that is (lightface) , and we use the natural definition above to define , so . Moreover, like for , is a sub-algebra of the extender algebra of at and “ is a -cc complete Boolean algebra”.
The definition is actually specified by an (infinite) first-order theory satisfied by , modulo the wellfoundedness of . (The theory needs to be infinite because of the assertion of Woodinness in in condition 7.) To see this, observe that the (generic) existence of is first-order: Working in , we can say that there is some condition of forcing over that the generic object is a premouse such that the conditions above hold (and by the preceding discussion, all relevant antichains are in ); a small subtlety here is that we need to refer to and the hull in (22) in order to talk about and assert that it is isomorphic to ; note that we can just talk about the relevant theories to assert this. (We don’t demand that be wellfounded, but only what was asserted above, which gives that it is wellfounded through .)
Unsound base Vsps naturally arise from iterating sound ones.
Definition 4.14.
A Varsovian strategy premouse (Vsp) is a structure
for some sequence of extenders, where either is a premouse, or:
-
1.
and is an amenable acceptable J-structure,
-
2.
has a least Woodin cardinal , and an initial segment which is a base Vsp,
-
3.
, so is the least Woodin of ,
-
4.
if and then either:
-
(a)
satisfies the premouse axioms (for Jensen indexing) with respect to , and , or
-
(b)
We have:
-
i.
,
-
ii.
has largest cardinal , which is inaccessible in and a limit of cutpoints of (where cutpoint is with regard to all kinds of extenders),
-
iii.
is well-defined, and satisfies the axioms of a premouse (but is possibly illfounded) with a Woodin cardinal , and is -wellfounded with ,
-
iv.
is a proper class of and has least measurable ,
-
v.
is a cofinal -elementary embedding ,
-
vi.
is pseudo-normal iterate of , via tree , and there is a -cofinal branch such that (hence is amenable to and inter-definable with over ),
-
i.
-
(a)
-
5.
each proper segment of is a sound Vsp (defining Vsp recursively), where the fine structural language for base Vsps and segments as in 4b is just that with symbols for ,
-
6.
some forces that the generic object is a premouse of height with , and there is an extension of to a premouse such that (and note then that is level-by-level definable over , via inverse P-construction).
We write above (if is not a premouse).
Definition 4.15.
A Vsp is -like iff it is proper class and in some set-generic extension, for some -like premouse . (Note this is first-order over .)
When talking about the extenders , for a Vsp , we say that is short if satisfies the usual premouse axioms with respect to , and long otherwise; likewise for the corresponding segments. So is the least long segment.
We write . Let be -like. We define analogously (first-order over as in the proof of Lemma 4.10 part 3). In fact, let us define more generally, including the case that is illfounded, but satisfies the first order properties of a -like structure. Also if is a premouse, let . We write for (the premouse) . (So .) We write for the strategy for (for trees based on ) defined over just as the corresponding restriction of is defined over , via the proof of Lemma 4.9.
4.11 The action of -iteration on
We now aim to extend Lemma 4.9, analyzing the nature of for iterates of , and the partial iterability of in .
Lemma 4.15.
Let be any non-dropping -iterate of . Let . Let
Then is a -sound non-dropping -iterate of , , and letting be the uncollapse map, then .414141But if is not -sound then is not a -iterate of .
Proof.
We have for some tree via , where does not drop; this is because the Q-structures used to guide the short tree strategy computing are correct. But and is an iterable, -sound, -like premouse, and with above minimal, comparison gives . Finally note that is a club class of generating indiscernibles for , so . ∎
Definition 4.16.
Let be a non-dropping -iterate of . Define as the direct limit of the iterates , for (the notation as in Lemma 4.11). (Cf. Definition 4.7.) For let be the uncollapse map and
Suppose further that is -sound. Let and . We say that is -stable iff whenever , we have and
The definition of stability above is more complicated than the version for , because it can be that but is not actually an iterate of (although is an iterate of ).
Lemma 4.16.
Let be a non-dropping -iterate of . Then:
-
1.
is a -sound non-dropping -iterate of .
-
2.
.
-
3.
If then and is a -iterate of .
Proof.
Lemma 4.16.
Let be a -sound non-dropping -iterate of . Then:
-
1.
For each , we have .
-
2.
For each there is such that is -stable.
Proof.
Part 1: We in fact that (which immediately gives ). This is just by extender algebra genericity and definability of over .
Part 2: Since is -sound, we can fix and and a term such that . Then taking with , we get . Now since is wellfounded, it suffices to see that
whenever and . So let with . Then whenever , because satisfies the same about (because whenever , is actually an iterate of , and these iterates are -sound, etc). But note that
(because any generic branch witnessing the definition of must move the relevant theory of indiscernibles and elements correctly, since these agree appropriately between and ). This gives the desired conclusion. ∎
The following lemma is proved like a similar fact in [16], integrated with part of the argument for [8, Lemma 2.9]:
Lemma 4.16.
Let be a -sound non-dropping -iterate of and a -sound non-dropping -iterate of . Let be the -core of . Then:
-
1.
and ,
-
2.
and ,
-
3.
is a -sound -iterate of .
-
4.
If then
-
(a)
is a -iterate of , and
-
(b)
is just the -iteration map .
-
(a)
-
5.
If then is not a -iterate of .
Proof.
Part 1: We have , and is -sound. Suppose is least such that , fix a tuple and a term and such that , and note we may assume that by shifting this part up, but since and is a lightface -class, this gives a contradiction.
Part 3: Note that Lemma 4.11 applies. Like in §2, we will define an elementary and show that . We can cover by with indices of the form with . For given any , by Lemma 4.11, we can fix such that is -stable (see Definition 4.16) and , and with large enough that there is such that , which suffices. Because of this covering, we can define in the natural way; i.e. for each such and , set ; note we have . It is now easy to see that and .
Part 2: By part 1 and since , we get . And by part 3 and its proof, . Since is also a lightface -class, are model theoretic indiscernibles for . Therefore .
Part 4: 4a is an easy consequence of the fact that and are - and -sound respectively. For 4b, we argue partly like in [8, Lemma 2.9(a)], but somewhat differently.424242 Moreover, the proof of [8, Lemma 2.9(a)] has a bug: with notation as there, it talks about iteration maps and , with the implication that is in fact an iterate of , but this is not true, as is not -sound, whereas is -sound. So, note that by the preceding parts, is indeed an iterate of , and , so it just remains to see that
So let . Let be such that . Fix with some such that . Note that is a -iterate of and
(23) |
Now
where and . But then with the map defined as earlier, but for instead of ,
using that , , , and line (23).
Part 5: If then is not -sound, but then any non-dropping iterate of is non -sound, so . ∎
4.12 Iterability of
In this subsection we will define a normal iteration strategy for in . We will first define and analyze the action of for trees based on .
4.12.1 Tree translation from to
The iteration strategy for will be tightly connected to that for , as we describe now. But first the basic notion under consideration:
Definition 4.17.
Let be a -like Vsp. A -maximal iteration tree on of length is a system
with the usual properties, except that when is a long extender (which is allowed), then is the least such that does not drop and .
We say that is short-normal iff uses no long extenders.
Iteration strategies and iterability for are now defined in the obvious manner.
Definition 4.18.
A short-normal tree on a -like Vsp is a -maximal tree that uses no long extenders. Note that a short-normal tree is of the form , where is based on , and either
-
(i)
[ has limit length or drops] and , or
-
(ii)
has successor length, does not drop and is above .
Say that are the lower, upper components respectively.
Definition 4.19.
Let be -like. An iteration tree on is -translatable iff:
-
1.
is -maximal, and
-
2.
for all such that .
Remark 4.19.
Under -maximality, condition 2 holds iff for and for all limits such that and and . This follows easily from the fact that for (using Jensen indexing).
Definition 4.20.
Let be -like. Let on be -translatable. The -translation of is the -maximal tree on such that:
-
1.
and have the same tree, drop and degree structure,
-
2.
for all .
Remark 4.20.
Let be -like. Let be a tree on and let be such that does not drop, , and . Note that
where is the least -admissible. Note here that is the set-sized model such that and above , is the level-by-level translation of . Note that because , is a -cc forcing extension of .
Lemma 4.20.
Let on be -translatable, where is -like. Then:
-
1.
The -translation of exists and is unique.
-
2.
and and for all .
-
3.
for all such that does not drop.
-
4.
for all .
-
5.
for all .
Proof.
This is partly via the usual translation of iteration trees between models and P-constructions thereof. However, there is a new feature here, when and is such that does not drop and letting , then , so consider this situation.
Then is long with space , and and does not drop, and . Let be such that and and
We need some with and such that and for -measure one many . We may assume .
If , the existence of is just because is the restriction of , and this restriction is cofinal in . In general we will reduce to this case.
Now is a -cc forcing extension of , so for some , where has cardinality in . Let be the ordertype of , so , let be the collapse, and let . So and , so we get a corresponding pair , with . Letting , then and works. ∎
4.12.2 Trees based on
We now transfer trees on , based on , to trees on .
Definition 4.21.
Write for the normal strategy for for trees based on , induced by . We use analogous notation more generally. Let denote the putative normal strategy for trees on based on , induced by . This makes sense by Lemma 4.6.
Remark 4.21.
Let be a putative tree on , based on , via . Let . Suppose does not drop. Then , and if is wellfounded then it is -like. If instead drops, note that it drops below the image of and is a premouse (note that it is wellfounded in this case), so .
Definition 4.22.
Let be a Vsp. Then denotes the partial putative strategy for determined by the long extenders of . That is, iff , is on , “ is via ”, and either
-
–
“ is short and ”, or
-
–
“ is maximal” and there is a long such that and is computed via factoring through as in Footnote 28, where is the cofinal branch through the tree from to determined by .
The following lemma, which is the main point of this subsubsection, is the analogue of [8, Lemma 2.17] and [19, Claim 12].
Lemma 4.22.
yields wellfounded models. Moreover, let be on , via , and let be the corresponding tree on (so via ). Let
be the natural copy map (where ). Then:
-
–
drops iff drops.
-
–
If drops then .
-
–
If does not drop then and where is the -iteration map, and in fact, where .
-
–
; therefore, .
Proof.
We include the proof, mostly following that of [19]. Let be as above, of length . The interesting case is the non-dropping one, so consider this.
Let and . Let , and be the iteration maps. We have
likewise for (maybe , but ). We have
The analogue of the following claim was used in the proof of [19, Claim 12], where it was implicitly asserted but the proof not explicitly given. We give the proof here. It is just a slight generalization of the proofs of [19, Claims 8–10] (or see [8, Lemma 2.15]), the main conclusion of which is that if is the iteration map, then
Claim.
We have:
-
(i)
and
-
(ii)
.
Proof.
Let and , let and the uncollapse maps, and . By the claim, .
Also, where is the iteration map. Letting
it easily follows that and agree with the iteration maps and respectively. Therefore .
Let be the -extender derived from , or equivalently from , also equivalently the -branch extender of . So (recalling is the corresponding tree on )
and . We also have and . Let be the natural factor map, i.e.
whenever and . Then is surjective, because if then there is and such that , and since , therefore . So in fact and , so , so , and letting be the natural copy map, then .
It just remains to see that (still with ). First consider the case that for some correct normal above- tree on and , we have and is -total, and where . Here by Lemma 4.11, is indeed a -sound iterate of , and is just the iteration map. Moreover, by Lemma 4.12.1, is the corresponding iterate of . But now the calculations that work for (the proof of Lemma 4.9, using Lemma 4.11) also work for .
Now consider the general case. We will reduce this to the special case above via Lemma 3. Let be -total with , and the least Woodin of such that . Form a genericity iteration at , above , making etc generic. Let be the eventual image of . Then is as in the previous case; let and let . Recall is an iterate of , and note is the corresponding iterate of ; let be the iteration map. Let be such that is active with a long extender , , and . Note that is continuous at and (as ). Let and be the ultrapower maps. Let be the length tree from to and the length tree from to ; note that by first order considerations, these exist, and determines a -cofinal branch such that and , and likewise for . We know that is via , by the previous case. Note also that is via , because the Q-structure for each (for limit ) does not overlap , and is embedded into the Q-structure for . But
and and . So by Lemma 3, , as desired. ∎
Definition 4.23.
Given a non-dropping -iterate of , let be induced by just as is induced by (this makes sense by Lemma 4.12.2).
4.12.3 Condensation properties for full normalization
The strategy (together with ) will have the properties required for extending to a strategy for stacks with full normalization. We now lay out the properties of needed for this. Recall the notions -standard, -relevantly condensing and -sub-condensing from [15, ***Definition 2.1]. We adapt these in an obvious manner to Vsps.
Definition 4.24.
Let and let be an -sound Vsp. We say that is -relevantly condensing iff either is a premouse which is -relevantly condensing, or is a sound base Vsp, or and satisfies the requirements of -relevantly condensing from [15, Definition 2.1] for such that is an -sound Vsp, and (so ). Likewise for -sub-condensing.
For , a Vsp is -standard iff is -sound and either is an -standard premouse, or is a base Vsp and is -standard, or and is -relevantly condensing for each , and every is -relevantly-condensing and -sub-condensing for each .
A Vsp is -standard iff -standard for each .
Lemma 4.24.
is -standard. (Thus, we take -like to include -standard.)
Proof.
Let and be a Vsp and be an embedding as in the definition of -relevantly- or -sub-condensing. We want to know that . But note that there is a premouse such that and and extends to , which also satisfies the conditions of -relevantly- or -sub-condensing, respectively. So , so . ∎
Remark 4.24.
Let be -like. Then as for premice, if is a -maximal tree on then is -standard (see [15, ***Remark 2.2]).
4.12.4 Short-normal trees on
Recall that short-normal trees on -like Vsps were defined in Definition 4.18.
Definition 4.25.
Let be a (possibly dropping, putative) iterate of , via a short-normal tree with lower and upper components . We say that is good iff is via and if does not drop then is wellfounded and for every long , for some -iterate of , and is the corresponding iteration map. Say that a (partial) iteration strategy is good iff all putative iterates via are good.
Note we have already shown that is good. We now want to extend to a good short-normal -maximal strategy for . So we start by setting . As an easy next step, we deal with trees based on .
Definition 4.26.
Write for the putative strategy for , for short-normal -maximal trees based on , as follows:
-
1.
, and
-
2.
given via , of successor length , where does not drop, and given a putative -maximal tree on , which is above , then is via iff there is a tree on , via , with the same extenders and tree order as .
Note here that by Lemma 4.9, , a strong cutpoint of , so is indeed a putative -maximal tree on .
Lemma 4.26.
is a short-normal -maximal strategy (hence yields wellfounded models). Moreover, let and be as in Definition 4.26, with . Then:
-
1.
and ,
-
2.
and , so ,
-
3.
for , , and ,
-
4.
if and drops then ,
-
5.
if and does not drop then ,
-
6.
if and drops then and ,
-
7.
if and does not drop then ,
-
8.
if and does not drop then is a -sound -iterate of , is a -sound -iterate of ,
and is the extender of the -iteration map.
Therefore is good.
Proof.
We omit most of the proof, as it follows from the usual calculations. However, for part 8, just note that the action of the - and -iteration maps and on are identical (i.e. ), since , and so
but then the fact that agrees with the -iteration map
is a consequence, since is likewise correct, where (by Lemma 4.12.2) and preserves indiscernibles. ∎
Note that if is as above, with last model , then applying as the next extender (giving a non-short-normal tree), the next model is again an iterate of via .
Definition 4.27.
Say that is -standard iff is a -tree on which is above , for some , and letting , then and is -total, , and is the tree leading from to ; so
and .
Suppose is -standard. We define a strategy for above- short-normal trees on . 434343We use subscript , not , as one can have -standard with . We will later see that, in this case however, . Let and .
If , then follows (recalling that is via ).
Suppose . Let be the above--strategy for given by . Then since is defined by P-construction, induces a short-normal above--strategy for , which follows in this case.
We extend to , for set-generic extensions of , using that extends canonically to .
Lemma 4.27.
is good, and hence so is each .
Proof.
Clearly yields wellfounded models, and we already saw that is good. So with notation as in Definition 4.27, suppose and has successor length, and let be the corresponding above- tree on . Let with long, and . Let . Then and is -total, and . So goodness with respect to is an easy consequence of Lemma 4.11 (note that and are - and -sound -iterates of ). ∎
Lemma 4.27.
Let be a set of ordinals. Then there is an -standard such that is -generic for some . Moreover, if is a non-dropping -iterate of , via maximal tree , then is a -iterate of (see Definition 4.23).
Likewise if is a set-generic extension of and .
Proof.
Let be -total with . Then is a limit of Woodin cardinals of , and . Let be Woodin in . Let be an above- genericity iteration of , for the extender algebra of at , making generic. Note that , so drops immediately to , at degree . Set . The “moreover” clause is a routine consequence, and the extension to is similar. ∎
We can now define the full short-normal strategy for . In the end the method used to define the corresponding strategy for , in §5.6.4 (especially Definition 5.32), will be somewhat different, instead of being a direct generalization. One could probably use the methods of §5.6.4 to define a strategy for below, which would have benefit of making the construction more uniform. But historically, the approach below was found earlier, and the verification that it works involves ideas that do not come up for the methods of §5.6.4, which and seem of interest. So in order to record more information, we use the two different methods, as opposed to aiming for succinctness through uniformity.
Definition 4.28.
Let be the class of all trees on via , of successor length, with non-dropping. For , letting , we will define a good above- short-normal strategy for . We will then define
So fix . Let be -standard and such that is -generic for some , which exists by Lemma 4.12.4. Let be the correct iteration map. By 4.12.3, is -standard. We define
(see [15, 10.3, 10.4] and Remark 4.12.4 below; by -standardness, the minimal -pullback is well-defined, but we verify below that is independent of the choice of 444444Of course, we could have simply chosen in a canonical fashion, and then would be trivially well-defined. But the independence from will be important later.).
We also generalize this to set-generic extensions of . Let be the class of all trees on via (determined by just as is from ), of successor length, with non-dropping. Fix . Let be as above with respect to (but still with , so and also). Let . and be the correct iteration map. Define
Remark 4.28.
Let us summarize how the minimal -pullback determining is defined. It is like a standard copying construction, except that the method for copying extenders is different. Let be the -extender derived from . For via , we will have a tree via , with the same length, tree order, drop and degree structure, and for , a -embedding
and moreover,
and is the associated ultrapower map, and if then
and letting , then
The remaining details are essentially as in [24] and [15], using -standardness for Vsps (the latter ensures that, for example, when or , the ultrapower above determining does indeed produce a segment of ).
Lemma 4.28.
454545Although this lemma logically precedes later parts of the paper, its necessity and proof were actually found later, in particular after the proof of Theorem 5.8, which was found after the proof of Lemma 5.1.1.We have:
-
1.
is well-defined for each .
-
2.
is good.
Proof.
Since doesn’t make a significant difference, we assume .
Part 2: Let on be via , and the minimal -copy, as in Remark 4.12.4. Using the copy maps , we can argue just like in the last part of the proof of Lemma 4.12.2 to see that the long extenders in are correct.
Part 1: Let and be as in the definition, and let respectively be the induced strategies for .
Roughly, we would like to compare with , producing a common iterate and corresponding , and show that both agree with , and hence are equal. However, a standard comparison of doesn’t work for this, as the resulting iteration map could have critical point on one side, which would cause problems. Instead, we form a modified kind of comparison, as follows.
Let be the -total order measure on . Let be the least Woodin of such that . Let be likewise for .
Recall from [20] that the meas-lim extender algebra of a premouse is like the usual extender algebra, except that we only induce axioms with extenders such that is a limit of measurable cardinals of . We will form a simultaneous genericity iteration of and for the meas-lim extender algebras at , above and respectively, arranging that and are generic over one another, and . To help ensure the latter, we also (i) arrange genericity of , which will allow to be recovered in the generic extensions, and (ii) insert short linear iterations which ensure that every measurable of below is a cardinal of , and vice versa; this is like similar arguments in [17] and [16]. However, executing this process in the most obvious manner, using the process for genericity iteration with Jensen indexing on both sides (as described in [20, Theorem 5.8]) seems to lead to the possibility of the trees being non-normal. Thus, instead of this, we produce a sequence of normal trees approximating the eventual desired trees and , with the sequence converging in a natural way.
Here are the details. We initially iterate linearly with the least measurable of which is (hence ), and likewise for , until they reach some common closure point . Suppose we have defined , at some point after this initial phase. These trees will be padded -maximal, of successor length, and if then . We will determine some extenders , or stop the process. First let be the extender selected for the purposes of genericity iteration, for making generic, and given current tree (but not demanding that for all ; if for some , that is okay); we follow the extender selection procedure for genericity iteration for Jensen indexing here (see [20, Theorem 5.8]), and if drops then will be active, and in this case is automatically set as , if no extender with lower index is. (If there is no such extender, set .) Define symmetrically, for making generic. If then let ; if otherwise and does not drop then let , and otherwise let . Define symmetrically. If there is which is -total and and is not a cardinal of , then let the least such , and otherwise let . (If is not a cardinal of for the trivial reason that , and hence drops, then it will follow from Claim 1 below that is active, and so , and in this case, will actually be irrelevant.) Define symmetrically. If and either or then set , and otherwise set ; define symmetrically.
If then we stop the process (setting ). If then let be least such that , and set (as a -maximal tree). If , define symmetrically. If then set , where is least such that either or . And if , proceed symmetrically.
Finally, given for all , where is a limit, define as the natural lim inf of the for , extended with the relevant iteration strategy as necessary. That is, is via , and uses an extender iff uses for eventually all , and if this yields a limit length tree, then we extend it using to successor length.
This determines the mutual genericity iteration. The first claim below is much as in [20, Theorem 5.8] and related arguments in [17]:
Claim 1.
-
1.
is -maximal and if drops then is active; likewise for ,
-
2.
the process terminates at some , giving and , and
-
3.
do not drop (although there can be such that or drops, because of Jensen indexing).
Proof.
Part 2: Suppose not. Fix some large enough regular cardinal . Assume for the sake of illustration that for all there are such that and ; the other case is similar. Let and , noting that and and is a limit cardinal of , and likewise for . Let with everything relevant in and , let be the transitive collapse of and the uncollapse map. So and we have with . Note that and , is a limit cardinal of , , and for all , we have . Likewise for .
As usual, . Let be the first extender used forming , so . Let with . Since is a limit cardinal of , and hence of , either (i) was chosen for genericity iteration purposes, and let , or (ii) drops and . But if (ii) holds then as is usual for genericity iteration with -indexing (see [20]), there is such that is used in (but not along ), and used in , and . So in either case (i) or (ii), is used in and is derived from . But note then that , and therefore we obtain a contradiction like in the usual proof that genericity iteration terminates.
Let and . Note that is a strong cutpoint of , and is -sound; likewise for and .
Claim 2.
.
Proof.
We may assume . By minimality of , is not Woodin in . Let be the Q-structure for . Because of the inserted linear iterations at measurables, is a cardinal of . Note then that by choice of (and smallness), is a strong cutpoint of . But is meas-lim extender algebra generic over at , and is likewise over , also at , because is a cardinal of . Therefore these two premice can be lifted to premice and over . Comparing with (so the comparison is above ) and considering smallness and -soundness, we have .
Now working in , where we have , , , and , we can recover and , where is just like but as a tree on , and likewise. For (i) we have and , and we just proceed by comparing with and with , (ii) determines the branch of at stage , and (iii) the intermediate Q-structures used to guide are segments of and (for example if and the Q-structure for is non-trivial, then is a limit of measurable cardinals of , hence a limit cardinal of , so the Q-structures on both sides do not overlap , which implies that the next extenders used have index beyond the Q-structures (and likewise at all stages after ), so the Q-structures are retained).
So in , where is a regular cardinal, we can execute a slight variant of the termination-of-genericity-iteration proof used above for Claim 1 (with in the role of there). (We may not have the sequence of trees in , but note that the trees we do have are enough.) ∎
Let and and . Note now that (by -soundness and as is a strong cutpoint on both sides), are equivalent modulo a generic above , i.e. letting be , considered as a premouse over , and likewise (we no longer need and ), then . It follows that and , and by uniqueness of iteration strategies, the above- strategy for translates to that of . Finally let be the normal tree equivalent to the stack and that to ; it follows that .
Let and be the correct iteration maps. Now is the correct iteration map (because we wanted this, we couldn’t just compare with in the usual manner). Likewise . So
is also the correct iteration map. So the minimal -pullback of equals the minimal -pullback of (a strategy for ); denote this by . Recall that is the minimal -pullback of , and the minimal -pullback of . It suffices to see that , since then by symmetry, also.
Let be the above- strategy for given by . Let be likewise for . Then by -soundness and since is a cutpoint of , is the minimal -pullback of . But then is the minimal -pullback of ; for trees on with , this uses that and the fine structural translation of to a tree on ; for trees with , it uses minimal hull condensation for , and the fact that the action of and on such trees in induced by . Therefore , as desired. ∎
4.12.5 Normal trees on
So we have a good short-normal strategy , extending . This extends easily to a normal strategy .
Definition 4.29.
We define a -maximal iteration strategy for , determined by the following properties:
-
1.
.
-
2.
Let be on , -maximal, of length , with short-normal and via , and long. Then (by goodness) is a non-dropping iterate of via a tree according to , and . Then acts on trees normally extending by following , until another long extender is used.
-
3.
Likewise, whenever is on , via , and is long, then is a non-dropping -iterate, via a tree , and extends by following , until another long extender is used.
-
4.
If is a limit and there are long extenders used cofinally in , there is a unique -cofinal branch, and is again an iterate via (by normalization for transfinite stacks). In this case, is the least measurable of , so we can have based on , with . This interval is formed using (see Definition 4.23). Letting be least such that does not drop and , then (by normalization) there is a short-normal tree via with last model , and extends by following , until the next long extender.
The following lemma is now easy to see:
Lemma 4.29.
is a good -maximal strategy for . Moreover, for every successor length tree via there is a unique short-normal tree via with the same last model.
Lemma 4.29.
has minimal inflation condensation (mic).
Proof.
We just consider short-normal trees; it is easy to extend this to arbitrary normal trees, and we leave this extension to the reader.
Let be short-normal trees on , via , such that has length for some limit , has successor length, and is a minimal inflation of ; we must show that is also a minimal inflation of . Let and with lower components and upper .
Now has mic, because it follows , which has mic, since does, and by [15, ***Theorem 10.2]. So we may assume . Therefore, has successor length , does not drop, and is based on and is above and uses only short extenders. And are likewise, and note that . Let
(the minimal tree embedding at stage of the inflation), and be the copy map determined by . Then in fact, is a -iterate of where , and is the iteration map (see [15, ***Lemma 4.5]).
Now it suffices to see that has minimal hull condensation (mhc) with respect to extensions of “above ”; that is, whenever are trees on and , above and respectively, with via , and
is a minimal tree embedding with , then is also via .
Let , a (putative) tree on . Then has wellfounded models, and in fact, there is a minimal tree embedding
determined in the obvious manner: for , we have , and for , we have ; this determines .
Claim 1.
is via .
Proof.
If then this is just because follows the strategy induced by in this case, which has mhc.
So suppose . Let be -standard for . Let be the iteration map. Since follows , the minimal -copy of (a tree on ) follows . Let be the minimal -copy of (see [15, ***10.3, 10.4]). Then has wellfounded models, and in fact there is a minimal tree embedding
determined in the obvious manner. But since is via , and this strategy has mhc, because does, therefore is also via , and therefore is via , as desired. ∎
Claim 2.
is via .
Proof.
If , this is again easy, using mhc for . So suppose otherwise. Let be simultaneously -standard for and for . Let be as before, and be the correct iteration map. So and are the minimal -pullback and -pullback of respectively. But , since these are correct iteration maps, and therefore is the minimal -pullback of , which, since is via , proves the claim. ∎
This completes the proof. ∎
The preceding proof does not seem to give that has mhc, because it relies heavily on the fact that , and if were instead just a copy map arising from an arbitrary minimal tree embedding, then it need not be an iteration map (and in fact need not be an iterate of ).
5 The second Varsovian model
5.1 The -short tree strategy for
Definition 5.1.
Let be a non-dropping -iterate of .
Let be a short-normal tree on via , based on , of limit length. Let . Say that is -short iff either drops or , and -maximal otherwise.
We define -short and -maximal analogously for trees on .
It will be shown in [13] that knows its own strategy for -short trees, and, moreover, has a modified P-construction which also computes the correct branch model for -maximal , given that is appropriate for forming a P-construction.
In this paper we explain the main new idea needed to prove this, illustrated with a restricted class of trees (P-illustrative trees) which suffice, for example, for genericity iterations at . This restriction will ensure that for such and limits with being -short and be the correct Q-structure for , the only overlaps of in are long extenders, and this will mean that we have no need for -translation. We will compute via a modified P-construction; a key issue is that the P-construction has a new feature, due to the long extenders on the -side, and the extenders with critical point on the -side. Similarly, for -maximal P-illustrative trees , will also be computed by a modified P-construction. We will need a new argument (5.1.1) to see that the P-construction does indeed compute the correct model. We will actually first consider analogous P-illustrative trees on , and then transfer these results to trees on . We will then adapt the results to -sound non-dropping -iterates of .
P-illustrative trees suffice to construct , and prove a significant amount about it. However, in order to prove that it fully knows how to iterate itself, and related facts, we need to consider arbitrary trees, including the full -short tree strategy. Such facts are moreover used our proof that is the mantle (because it uses a comparison argument, which seems needs iterability with respect to arbitrary trees). In order to deal with arbitrary trees, we need to deal with trees having overlapped Q-structures, and therefore need -translation, adapted to incorporate the modified P-construction. This material is deferred to [13]; at certain points we summarize results from there we need.
5.1.1 P-illustrative trees on
Definition 5.2.
Given a (strategy) premouse and , we say that is a -cutpoint of iff for all , if then , and a strong -cutpoint iff for all , if then .
Definition 5.3.
Let be an iteration tree on an -like premouse and a partial strategy for . We say that is P-illustrative iff there are such that:
-
1.
either
-
(i)
, and , or
-
(ii)
, is -total, , and ,
-
(i)
-
2.
, is normal, of limit length, is above and based on , and letting be the corresponding tree on , we have ,
-
3.
and is a strong -cutpoint of , and is a -cardinal, and if then 464646Note there is no with and , since otherwise is past superstrong.
-
4.
and and does not drop and ,
-
5.
is above ,
-
6.
for each , every Woodin of is ,
-
7.
, is the largest cardinal of , is definable from parameters over , and is extender algebra generic over .
Condition 6 prevents us from requiring -translation.
Definition 5.4.
Let be P-illustrative and as in 5.3. We define the P-construction of over . This is the largest premouse such that:
Remark 5.4.
A key point in the above definition is that in condition 3b, with , we only require and to agree over ordinals, not the full model (although is an initial segment of both sides). In fact (as we require that is a premouse),
because , but , and because must cohere , therefore . However, recall the following fact, which we leave as an exercise for the reader.
Fact 5.4.
Let be a passive premouse, be a cardinal of , be unbounded in and . Then there is at most one active premouse whose reduct is and , and in fact, is -definable over .
(Note though that it is important that is given; there can actually be another active with , but .)
Remark 5.4.
It is not immediate that the P-construction is well-defined, as we have defined it directly as the largest premouse with the above properties, and one also needs one small observation to see that, if well-defined, then is unique (and appropriately locally definable).
Consider instead defining and by recursion on . Note that , so is available as a parameter when making definitions over for some , and is also in the generic extension .
Now given for all , a limit, (all sound), we get a premouse satisfying “ is Woodin”. Suppose is active with . We need to see that we get a premouse , fine structurally equivalent with (modulo the generic). We need to in particular see that there is a unique premouse with the right properties. If , existence is not immediately clear, and will be verified in Lemma 5.1.1. Uniqueness and the manner in which is determined, requires a short argument. We have and can compute , and is cofinal in (where ). By Fact 5.1.1 this (very locally) determines . For the case that , one makes the usual P-construction observations, although the generic equivalence here involves the parameter .
Overall we maintain level by level that
uniformly in (and recalling ), and also that
uniformly in , where is a generic extension, which for definability purposes has has available as a predicate (and similarly for ), and where means that is the premouse which extends , followed by the small forcing extension of extenders in or when , and the extender determined by otherwise, and also that the usual fine structural correspondence holds between the two sides (employing an extender algebra name for ).
Lemma 5.4.
Let be P-illustrative on , via , and , and let be as in Definition 5.3. If is short let , and otherwise let . Then .
Proof.
Let . Working in , we “compare the phalanx with the phalanx , modulo the generic at ”. That is, in the “comparison”, we only use extenders indexed above , with least disagreements determined by the restrictions of extenders to the ordinals, and after composing extenders overlapping on the side with (notation as above). That is, we define normal padded trees on and on , with both corresponding to trees on via ,484848For , the notation means that the exchange ordinal associated to is , so in fact, since , and is a strong -cutpoint of , if then . If then we is directly equivalent to a tree on via . If where and , then a simple instance of normalization produces the tree on , via , corresponding to : If is above but based on , then is the tree on , via , which uses the same extenders and has the same tree structure as does . Note that because are strong -cutpoints of , and by the Mitchell-Steel ISC, ’s natural length , so , so for each such that and , we have that drops in model and degree at to ; and otherwise agree in drop and degree structure, and so their models and embeddings agree in a simple manner. If is as above but does not drop and , then uses first as an extra extender, and note then that . Since is a -cutpoint of , if is above then is directly equivalent to where or in the obvious manner. Finally if is least such that (either with or as above) then are again directly equivalent thereafter. and such that, given , letting be least such that or and either:
-
–
and , or
-
–
(so ) and , or
-
–
,
then and (and the comparison terminates if there is no such ). We need to see that this comparison is trivial, i.e. no extenders are used. So suppose otherwise.
Claim 1.
The comparison terminates in set length.
Proof.
Note that if overlaps then is proper class and
is a cutpoint of , so is above . Therefore there is at most one such . Likewise for . But the comparison after these overlaps becomes standard comparison modulo the small generic at , so the usual argument then shows that the comparison terminates. ∎
So say we get .
Claim 2.
At least one of the trees uses an extender overlapping .
Proof.
Suppose otherwise. Suppose ; the other case is similar. Then the level-by-level translation process described in 5.1.1 works between and , and we get fine structural correspondence above . Suppose that . Let be either the core of if , and otherwise the -core of . Let be likewise from . Let be the core maps respectively. Then by the fine structural correspondence and forcing calculations,
so . But also, the core maps preserve the fact that the level-by-level translation works, so etc (with fine structural agreement up to the relevant level). But we had and for some , and either or came from or respectively, a contradiction. So , so there is no dropping on main branches, and is maximal. But now we can just replace “-core” with the hull of , where is the class of indiscernibles of , or equivalently, , and run the analogous argument, using that are -sound (if , this is because is a strong -cutpoint of , and hence if where with , then , where is the natural length of ). ∎
Now let be least such that or overlaps . The following claim is the most central issue:
Claim 3.
Not both of overlap .
Proof.
Suppose overlaps . Then is a restriction of the iteration map
Similarly, supposing overlaps , is a restriction of the iteration map
so is the restriction of the iteration map
So it suffices to see that
(24) |
as then , contradicting the disagreement of extenders. But (24) holds because
since and constitute the least disagreement. ∎
Now assume for notational simplicity that overlaps ; the other case is very similar. Note that:
-
–
does not drop in model, and
-
–
is above .
As in the proof of Claim 2 we get:
Claim 4.
Neither nor drops on its main branch.
It easily follows that there is such that overlaps . We have and . Let . Let , so
so is a non-whole segment of , by the ISC and smallness of . Let
and the uncollapses. Then because (and note ). Similarly, , but since is not whole. But since , we also have , so , so , contradiction. ∎
We now want to consider similar P-constructions internal to , and also iterates of and their generic extensions.
Definition 5.5.
Let be a non-dropping -iterate of . Let be an iteration tree on . We say that is dl-somewhat-relevant (dsr) iff there are such that:
-
1.
is short-normal,
-
2.
has lower and upper components respectively, has successor length, does not drop, , and (on ) is above ,
-
3.
for each , is the unique Woodin of .
Note that every dl-somewhat-relevant tree on is based on .
Easily:
Lemma 5.5.
Let be a non-dropping -iterate of . Let on be via and -maximal. Then is dsr.
Definition 5.6.
For a non-dropping -iterate of , write for the restriction of to -short trees, and for the restriction of to dsr trees.
Definition 5.7.
Let be a non-dropping -iterate of . Let be an iteration tree on . Let and be -generic. Say is P-suitable for iff there are such that:
-
(a)
is -generic and ,
-
(b)
is short-normal with lower and upper components respectively, exists and is non-dropping, and is based on ,
-
(c)
is via ,
-
(d)
either
-
(i)
and , or
-
(ii)
is short and -total, and ,
-
(i)
-
(e)
and where on is equivalent to ,
-
(f)
either
-
(i)
and is trivial (so ), or
-
(ii)
is long, and the lower component of is just the (successor length) short-normal tree corresponding to (so ),
-
(i)
-
(g)
and is a strong -cutpoint of , is a -cardinal, , and if then ,
-
(h)
has limit length, , is the largest cardinal of , is definable from parameters over , and is -generic over .
Say is dl-relevant (for ) iff is -maximal (hence dsr) P-suitable, as witnessed by .
Definition 5.8.
Let be a non-dropping -iterate of . Let be set-generic over . Let be P-suitable for , as witnessed by . Then denotes the P-construction of over , using , computed analogously to that in Definition 5.4; so when and is long, then is determined by demanding , where .
It is now straightforward to deduce a version of Lemma 5.1.1 for dsr P-suitable trees on , by translating them to trees on and applying 5.1.1. Combined with the minimal inflation method used for , this allows us to compute the -short tree strategy for inside , and also the models for forming the second direct limit system. However, before we proceed to this, we want to also consider the analogous issues for iterates of (and generic extensions thereof). The argument given above does not immediately adapt to such iterates in general, because (i) need not be as sound as , and (ii) need not correspond appropriately to an iterate of . To deal with these possibilities, we will adjust somewhat the conclusion and argument for Lemma 5.1.1, in Lemma 5.1.2 below. Also note that it is not immediate that P-suitability and dl-relevance are first-order over (or ), because of the demand that be via . We will address this issue also, in a manner similar to that for .
5.1.2 DSR trees on iterates of
To deal with issue (ii) mentioned above, it turns out we can replace the use of (or some iterate thereof) with an -like generic extension of (together with such an extension of a related iterate ; see below). It inherits iterability (above ) from the corresponding iterate of :
Lemma 5.8.
Let be a non-dropping -iterate of . Let be -generic and an -like premouse such that and . Let . Then:
-
1.
is -iterable with respect to trees with .
-
2.
is the class of Silver indiscernibles for (with respect to the generator set ). If is -sound where then is -sound. If is -sound then is -sound.
Proof.
Part 1: Let with . Then is -iterable with respect to trees with , because is a cutpoint of , and letting be long, extends to , and is above---iterable, since iterating above is equivalent to iterating above .
So we may assume that , and so . Consider translatable trees on . We get an iteration strategy for such trees induced by , and the resulting iterates of are related according to Lemma 4.12.1. Now suppose is translatable, and let on be its translation to , but is not translatable. Then is a limit ordinal and a limit of stages when uses a long extender, and . But then is just a tree on some where , and is a cutpoint of , and this is also iterable above , like in the previous paragraph.
Part 2: By genericity, form indiscernibles for . Note that is -sound. Let be least such that is -sound. Note that . So . Finally suppose , so . But also is cofinal in and is definable over , so is cofinal in and transitive below , hence contains all of , and hence all of . ∎
Definition 5.9.
Under the hypotheses of Lemma 5.1.2, let be the above--strategy for induced by as in the proof of the lemma. (Note that the components of this strategy which do not translate to a tree on , i.e. on one of the projecting structures in the proof, are uniquely determined by .)
Lemma 5.9.
Let be a -iterate of . Let be the short-normal tree on , via , with last model . Let and . Then
-
1.
for some , and is equivalent to a tree on via , , and is -sound. Likewise for and .
Let and be -generic. Let , on , be dsr-P-suitable and , and as in Definition 5.7. Let be the tree on equivalent to . If is -short let , and otherwise let and
Let . If is set-sized let and otherwise let and be the uncollapse. Then:
-
2.
-
3.
if is -maximal then (and are proper class),
-
4.
if then is an above-, -iterate of (and hence a -iterate of ) and is the iteration map, so .
Proof (sketch).
Part 1: This is straightforward and left to the reader.
Part 2: We will prove this by considering a comparison of two phalanxes. It will take a little work to define the phalanxes and describe their relevant properties.
Let where is the lower component of , the upper component, with based on and above . Then is -sound and is above , and is via , and is -sound and is via .
Let be an -like generic extension of with , and such that are mutually -generic. Let be the generic filter. Since is below , we have and is also -generic, and extends uniquely to an -like generic extension of with ; note . Lemma 5.1.2 applies to , so translates to a tree on , via , and note that .
Let be as in Definition 5.7. Let with (or ). Let . Since is -sound, is -sound. (Note need not be .)
Let , if , and otherwise. Since is a -strong cutpoint of and has largest cardinal , so is , and is also a -strong cutpoint of . Let . Letting be the uncollapse, note that (as and is a strong -cutpoint), and is a -strong cutpoint of , and is -sound. Note that if is proper class then , is a ground of via the extender algebra at (to reach ) followed by some smaller forcing (to reach ), , ,
is -sound, and letting , then are related as are , so , etc.
Let where is the translation of to a tree on . Let if has set size, and otherwise. Write for the lower and upper components of , and correspondingly. Note that we can rearrange as a tree on with equivalent to (so ), and given by normalizing a stack equivalent to , where is the iteration map and is the minimal -copy of . If is set size then and otherwise . Note that is -sound.
Now compare the phalanx versus the phalanx , “above , modulo the generic at and translation for overlapping extenders”, just like in the proof of Lemma 5.1.1, using to iterate the phalanxes (a little bit of normalization shows this works). Because is -sound and is -sound and are -sound, essentially the same proof as before shows that the comparison is trivial, which gives .
We leave part 3 to the reader.
Part 4, sketch:494949We don’t really need this part of the lemma, but it is convenient to have it. Suppose ; then is proper class and . Letting if , and otherwise, we have . Now it need not be that is for some , but this is almost the case. In fact, because is a -strong cutpoint of , we get the following: Let be least such that . Then there is a unique tree extending and such that iff drops, and if non-empty, , and . Moreover, is a -iterate of , via a tree which is a straightforward translation of via a little normalization (in [14] there are similar kinds of calculations, though here it is easier). But is above . Therefore it translates to a tree on whose last model is . We have is an iterate of and . But by the smallness of , and since is above and does not drop on its main branch, it must be via (that is, has nothing remotely resembling a Woodin cardinal , so the Q-structures at limit stages are of are trivial). This completes the sketch. ∎
5.1.3 Definability of and (variants of)
We consider first the question of whether can define its own extender sequence over its universe. We don’t know whether this is the case or not, but in this direction:
Lemma 5.9.
We have:
-
1.
is definable over the universe of .
-
2.
is definable over its universe from the parameter .
Proof.
Part 2: Let be the universe of . Recall that is closed under for maximal trees via . Since is Woodin in , is in fact the unique -cofinal branch in , for such . Moreover, by the (local) definability of the short tree strategy and of maximality, can define the collection of trees in which are maximal via . Therefore working in , from parameter , can be computed. But then the branch through the tree from to can be computed, and hence also also. Therefore we can compute , which is the universe of (by Lemma 4.10). But , so we can identify the universe of , so by Remark 3, we can identify itself. But from , we therefore compute , hence , and hence , by Lemma 4.10. ∎
Lemma 5.9.
Let be a non-dropping -iterate of . Let with and and be -generic.505050When we deal with such generic extensions of such (here and later), we allow to appear in some set-generic extension of , as opposed to demanding . Then is definable over the universe of from the parameter .
Proof.
This is an immediate corollary of Lemma 5.1.3 and ground definability (from the parameter ). ∎
Lemma 5.9.
Let be a -iterate of . Let , let and be -generic. Let . Then:
-
1.
is closed under and is definable over the universe of from the parameter (hence lightface -definable if ).
-
2.
The notions
-
(a)
dsr,
-
(b)
-short/-maximal dsr via ,
-
(c)
dsr-P-suitable, and
-
(d)
dl-relevant,
are each definable over from (hence lightface -definable if ).
-
(a)
-
3.
For each -maximal (hence dsr) P-suitable tree , as witnessed by , letting be the equivalent tree on (which is via ) and , we have
Therefore letting be least such that is -sound (so ), if then and the function (with domain all such with ) is definable over the universe of from the parameter (hence from over if ).
-
4.
Suppose . Then for each -maximal tree via , with , letting be as in part 3, there is a dl-relevant tree , on , and such that, letting be likewise, then is a -iterate of , where and .
Moreover, the definability is uniform in , and hence preserved by iteration maps.
Proof Sketch.
Parts 1, 2: For simplicity we assume , but the general case is very similar. Let be dsr of limit length and via ; we will determine whether is -short or -maximal, and if -short, compute . Let with lower and upper components respectively. Let be long with and where . Let where is the successor length tree corresponding to , and letting be the iteration map (recall this is known to ), is the minimal -copy of (so is also via , by [15, ***10.3, 10.4]). It suffices to compute . So instead assume that is itself in the form of .
Let be -total with and where and and is the tree on equivalent to . Let . Let be a strong -cutpoint and cardinal of with . Now working in , form a minimal inflation of , first iterating the least measurable out to , and then folding in -genericity iteration. Now is dsr (the issue being that we do not introduce new Woodin cardinals below the index of some , condition 3 in the definition of dsr (see 5.5)), because is dsr and the inflationary extenders are only being used for genericity iteration (and the linear iteration at the start). The remaining details of the minimal inflation and overall process are as sketched in §4.2 (but the minimal variant, which is essentially the same), using that has minimal inflation condensation, by Lemma 4.12.5 and [15, ***Theorem 10.2].
Definition 5.10.
Let be a non-dropping -iterate of , and be -generic. Let . Then denotes the strategy for induced by , and denotes its restriction to -short trees, and its restriction dsr--short trees.515151Note that if are both such and , then we get the same strategy for induced by and . Also if is a non-dropping -iterate of , and is a -iterate of , then and denote the restrictions of and to trees in .
Let be P-suitable for , as witnessed by . Let (so is a -class and is a -iterate of ). Then and denote the restriction of to -short and dsr--short trees in , respectively.525252So in the case that is P-suitable, and are equivalent, as are and .
Lemma 5.10.
Let be a -iterate of , , and be -generic. Let . Let be a -maximal tree on , via , and if is P-suitable for then let , where is as above. Then:
-
1.
is closed under and is definable over from , uniformly in ; hence likewise for for -maximal P-suitable trees .
-
2.
The notions
-
–
dsr, and
-
–
-short/-maximal dsr via ,
applied to trees in on , are definable over from , uniformly in .
-
–
-
3.
Suppose is P-suitable. Let be the tree on iterating out to . Let be on and via . Then the stack normalizes to a tree on via .
Moreover, the definability is uniform in , and so preserved by the iteration maps.
Lemma 5.1.2 suffers from a significant drawback, which is that it is restricted to dsr trees. In [13] there is a generalization of this to arbitrary trees, but this involves a further modification of the P-construction, given by merging the preceding methods with -translation. We now summarize the key consequences of this, also proven in [13], which we will need later.
Lemma 5.10.
5.2 The second direct limit system
We now define a system of uniform grounds for , and the associated Varsovian model . This is analogous to the construction of in §4, albeit slightly more involved. For the most part it is similar, and so we omit details and remarks which are like before. We use the results of §5.1, and in particular the modified P-construction, dsr -short tree strategies, etc.
5.2.1 The external direct limit system
Definition 5.11.
By Lemma 5.1.3, is lightface -definable, as are and .
Lemma 5.11.
is a directed partial order, is lightface -definable, and the associated embeddings commute: if then .
Proof Sketch.
For the definability, that is partial order, and the commutativity, see the proof of Lemma 4.3.1. For directedness, let , with lower and upper components and respectively. Let with be -total with and such that correspond to respectively. We may assume , so if then in fact . Therefore is a (possibly trivial) iterate of . Let be the iteration map. Let be the minimal -copy of . Now proceed with a pseudo-comparison of and intertwined with pseudo-genericity-iteration, as in Lemma 4.3.1. ∎
Define the external direct limit system . We have (ug1), (ug2), (ug3), (ug4), (ug5), (ug6), (ug18), and write
(25) |
Let . Then is -generic and hence , so is a ground for via the extender algebra (at , using extenders with critical point (hence )). Thus:
Definition 5.12.
For , let be the canonical class -name for , like in Definition 4.5, but incorporating the appropriate conversion for the overlapping extenders (note the generic filter determines , which in turn determines the “key” to this conversion).
Lemma 5.12.
(ug19) holds: for each , is dense in and dense in , and .
Proof.
Let . That is by Lemma 5.1.3. So let and . We must find with . Let be the maximal tree leading from to , with lower and upper components respectively, and likewise for , and let be likewise for in . Let be long with be sufficiently large that are all translations of one another above some and the various trees are in . Letting and with , then are translations of , so , and agree through their common least Woodin (but not above there if , as is -sound, whereas then the others are not). Let be a -name for , and let be the Boolean value of the statement “ is -like and ”. Working in , we will form a Boolean-valued comparison/genericity iteration of , and all interpretations of below , much as in the proof of Lemma 4.3.1 (in particular incorporating Boolean-valued -genericity). However, because we have not yet established that knows its own -short tree strategy, we cannot quite argue as for Lemma 4.3.1. Thus, we tweak the comparison as in the following sketch (the process will be use an idea from [20, §7]; see especially [20, Corollary 7.5 and Theorem 7.3 (Claim 8)]).
We define a -name for a padded tree on , and define padded trees on and on , recursively on length in the usual manner for comparison. Given (names for) the trees up to length , we will also have some condition , with . Let be the Boolean value, below , of the statement “the least disagreement between and and , if it exists, involves a dsr extender” (that is, satisfying condition 3 of Definition 5.5). We then take the least forced disagreement working below , and use this index and genericity iteration considerations to determine the next extender, etc. Given everything through some limit stage , which is short, the strategies determine branches (as required), and set to be the infimum of . The rest is as usual. The conditions are always non-zero, and in fact where is the generic adding , because are then correct trees on , which were themselves iterates via dsr trees, and by the analysis of comparison in [15, ***§8], the least disagreement must be an ultrapower-image of one of the extenders used in those dsr trees, and hence be itself appropriate for dsr. Because we rule out the use of non-dsr extenders, the Q-structure(s) used in the trees at limit stages do not overlap (except possibly with long extenders). They also agree with one another (in and all interpretations of ), and no extenders in are used later in the comparison (in particular for genericity iteration). This is because in and in , the trees are P-suitable, and the Q-structures are produced by P-construction, and because of the agreement between , they are therefore identical. ∎
5.2.2 The internal direct limit system
We adapt Definition 4.6 in the obvious manner, to which we refer the reader for details:
Definition 5.13.
Work in . Define (weak) -iterability for and as in 4.6. If is -iterable and and is -iterable with , then likewise for , and . Define strong -iterability as before.
Let , and similarly let . The order on is determined by (ug8). Define on likewise. Clearly if then
Define the system .
Given and , recall that is -stable iff for every with .
Remark 5.13.
As in Remark 4.3.2, -iterability actually implies strong -iterability.
The following lemma yields properties (ug7), (ug8), (ug9), (ug10), (ug11), (ug12), (ug13), (ug14), (ug15), (ug16):
Lemma 5.13.
We have:
-
(a)
if and and is -stable, then and is true (see Definition 2.1).
-
(b)
is directed – for , there is with and (note suffices).
-
(c)
is lightface -definable.
Definition 5.14.
Noting that is a club class of generating indiscernibles for , define whenever is a non-dropping iterate of .
For the following, see the proof of Lemma 4.3.2:
Lemma 5.14.
For each , is -stable for every . Therefore property (ug17) holds, as witnessed by some .
We can now (working in ) define the direct limit
(26) |
and the associated -map . This notation is somewhat cumbersome, so let us also write , and we will often write instead of , where there should be no cause for confusion. By Lemmas 2 and 2, is the identity and . Property (ug20) holds as if and then , because is a translation of above ). And (ug21) again holds if is -stable.
So we have established (ug1)–(ug21). For the remaining properties set and (for the witnesses to those properties in §2). This gives (ug22). Recall we defined in Definition 5.12. Write (replacing the notation of §2). As for Lemma 4.3.2:
Lemma 5.14.
We have:
-
1.
For each -stable and each , letting and be the -generic filter for given by , then . Moreover, .
-
2.
(ug24) holds.
-
3.
is the least measurable cardinal of .
-
4.
.
5.2.3 The second Varsovian model as
Definition 5.15.
Recall that is the -map associated to the preceding construction. We define the structure
(27) |
that is, with universe and predicates and . However, as mentioned above, we will often abbreviate with , hence writing .
We next point out that is a -iterate of and is the correct iteration map. We also want to generalize this to other iterates of .
Definition 5.16.
Given a -like Vsp , let and be defined over just as , are defined over , and likewise . If is a correct iterate of , also define (the external direct limit) relative to , as for : given a maximal tree (considered as a tree on ), let and , and let be the direct limit of these models under the iteration maps. If in fact (the model indexed by in the covering system ) for each such , then define as in §2.
Lemma 5.16.
Let be a -sound, non-dropping -iterate of .
Then 535353Recall that the notation is for P-construction over , and for the model of indexed at . for each , and , and is a -sound, non-dropping -iterate of , and hence is a -iterate of . Moreover,
is the iteration map according to . This holds in particular for and for , so is a correct iterate of , and is the iteration map.
Proof.
This is just Lemma 5.1.2 and a consequence thereof, and by standard arguments. ∎
Like with , working in we can compute , so has universe
5.2.4 Uniform grounds of
Lemma 5.16.
Write . We have:
-
1.
.
-
2.
is (the second) Woodin in (and the first).
-
3.
Property (ug23) of uniform grounds holds for at ; that is, “ is regular and is -cc”. Moreover, “ is a complete Boolean algebra”.
Proof.
So by Theorem 2, is a ground of .
5.3 The second Varsovian model as the strategy mouse
Let be the restriction of the -iteration map. Note that for each , if is long, then and is definable in the codes over , and hence in . Moreover, letting , we have and is an iterate of . In this circumstance let
be the iteration map. Now define as the class of all tuples such that , and either
-
–
is short (so ) and , or
-
–
is long and .
Lemma 5.16.
is lightface definable over .
Proof.
Write for . Let with . Let . We claim that iff either
-
–
is short and , or
-
–
is long and (the argument to is , not !),
and moreover, if then is short iff is short. This is proved like in Lemma 4.5, but the case that is long is uses the modified P-construction. ∎
Lemma 5.16.
Let (Definition 2.3, for adding a subset of ). Then is -generic over and .
Proof.
We now adapt Definition 4.10, presenting the second Varsovian model as a strategy mouse analogous to . The sequence will have two kinds of long extenders, corresponding to and :
Definition 5.17.
Write and . Note that
Define the structure
with segments and their passivizations , recursively in as follows:
(28) |
and with and as usual. (We verify well-definedness in Lemma 5.3.)
Definability etc over has the predicate available by default.
Write for .
The fine structural concepts for segments of are defined directly as for segments of (Definition 4.11). The next two lemmas are direct adaptations of Lemmas 4.9, 4.9 respectively:
Lemma 5.17.
Let . Then:
-
(a)
is -definable over .
-
(b)
is isomorphic to a structure which is definable without parameters over .
-
(c)
is sound, with and .
-
(d)
, where is the least such that is admissible. Therefore is passive for every .
Lemma 5.17.
Let be the -generic determined by . For every :
-
1.
and are in ,
-
2.
and are sound,
-
3.
Suppose and let and .545454 Also, and are “generically equivalent in the codes”, and letting be the unique surjective order-preserving map, then are likewise equivalent with for all , but we will not need this. Then
-
(a)
and is -generic,
-
(b)
,555555The notation is explained in 5.3.
-
(c)
,
-
(d)
if and then satisfies the usual premouse axioms with respect to (with Jensen indexing; so is an extender over which coheres , etc),
-
(e)
if and then is a long -extender over and
is a lightface proper class of , uniformly in such , and
-
(f)
if and is long then is a long -extender over and
is a lightface proper class of , uniformly in such .
-
(a)
Remark 5.17.
Lemma 5.17.
-
1.
and have the same universe.
-
2.
.
-
3.
is a lightface class of .
-
4.
is a lightface class of .
5.4 Iterability of in and
Adapting Definition 4.16:
Definition 5.18.
Let be a non-dropping -iterate of . For let
its transitive collapse and the uncollapse map. Recall here that by Lemma 5.1.2, is a -sound -iterate of . Define as the direct limit of the iterates such for .
Recall that is automatically -sound. Let and . We say that is -stable iff whenever , we have and
Adapting Lemmas 4.4, 4.4, 4.11, 4.11 and 4.11 and their proofs (and using that non-dropping -iterates of are always -sound), we have:
Lemma 5.18.
Let be a non-dropping -iterate of and be the -core of . Let . Then:
-
1.
For each , we have .
-
2.
For each there is such that is -stable.
-
3.
and ,
-
4.
and ,
-
5.
is a -sound -iterate of . Moreover, iff iff is a -iterate of iff is -sound.
-
6.
Let be a non-dropping -iterate with . Then
-
(a)
is a -iterate of , and
-
(b)
is just the -iteration map .
-
(a)
-
7.
is a -sound -iterate of and is the -iteration map.
Recall that denotes the restriction of to trees based on . Write .
Lemma 5.18.
Let be a non-dropping -iterate of . Then:
-
(a)
is closed under and is lightface definable over .
-
(b)
Let , let , and be -generic (with appearing in some generic extension of ). Then is closed under and is definable over the universe of from the parameter , uniformly in .565656Regarding trees , cf. Footnote 27.
Moreover, the definability is uniform in .
Proof.
By Lemma 5.1.3, we can define from in , and uniformly so. To compute the -short tree strategy (for ) and determine -maximality, use Lemma 5.1.3 (recall this involves -translation). The computation of branches at -maximal stages is like in the proof of Lemma 4.3.2, using Lemmas 5.4 and 3 (or arguing as in Footnote 28 in place of Lemma 3). ∎
By Lemma 4.12.5 and [15, ***Theorem 10.2], has minimal inflation condensation. So like in Remark 4.3.2, it follows that can also compute the tail strategy for stacks on , based on (restricted to stacks in ), as in fact
Similarly:
Lemma 5.18.
is closed under and is lightface definable over .
Proof.
To compute the -short and -short tree strategies in , proceed much as in the proof of Lemmas 5.4 and 4.9, naturally adapted to . Since is a ground of via and because of the correspondence between , and , we can perform the relevant P-constructions above using in the natural way. For -maximal and -maximal trees, we use the -long and -long extenders in as usual. ∎
5.5 2-Varsovian strategy premice
Definition 5.19.
For a -like , we define the lightface -classes , , and over just as the corresponding classes are defined over .
Also given a -like and with , we define by recursion on by setting , where . Noting that this definition is level-by-level, we similarly define whenever is a -small Vsp such that exists and is an inaccessible limit of -cutpoints of and , level-by-level (starting by defining as is defined (in the codes) over ). We will often suppress the from the notation, writing just .
We now want to axiomatize structures in the hierarchy of to some extent, just like for , adapting Definitions 4.13, 4.14 and 4.15. These are very straightforward adaptations, and the reader could fill it in him/herself, but because they are reasonably detailed, we write them out for convenience:
Definition 5.20.
A base 2-Vsp is an amenable transitive structure such that in some forcing extension there is such that:
-
1.
are 1-Vsps which model , and , and are -small (that is, has no active segments satisfying “There are such that and is Woodin and is strong”, and likewise for ).
-
2.
has a unique Woodin cardinal and a largest cardinal , and is inaccessible in and a limit of -cutpoints of ; likewise for ,
-
3.
, is the least measurable of and ,
-
4.
(defined over like is defined over ) is well-defined, and has least measurable and second Woodin ,
-
5.
is obtained by iterating , via a short-normal tree of length ,
-
6.
is a cofinal -elementary (hence fully elementary) embedding
and there is a -cofinal branch such that , and (so is intercomputable with , and note that by amenability of , is amenable to , and hence so is ),
-
7.
and (so ) and is Woodin in , as witnessed by .
-
8.
is -generic, where is defined over as above was defined over .
Remark 4.10 carries over directly.
Definition 5.21.
A 2-Varsovian strategy premouse (2-Vsp) is a structure
for some sequence of extenders, where either is a premouse or a 1-Vsp, or:
-
1.
and is an amenable acceptable J-structure,
-
2.
has at least two Woodin cardinals, the least two of which are , and has an initial segment which is a base 2-Vsp,
-
3.
, so is the second Woodin of ,
-
4.
if and then either:
-
(a)
satisfies the premouse axioms (for Jensen indexing) with respect to , and , or
- (b)
-
(c)
-
i.
,
-
ii.
has largest cardinal , which is inaccessible in and a limit of -cutpoints of (where -cutpoint applies to both short extenders and long extenders over )
-
iii.
is a well-defined, and satisfies the axioms of a 1-Vsp with existing (but is possibly illfounded), and is -wellfounded, with ,
-
iv.
is a proper class of has least measurable ,
-
v.
is a cofinal -elementary embedding ,
-
vi.
is pseudo-iterate of , via short-normal tree , and there is a -cofinal branch such that (hence is amenable to and inter-definable with over ),
-
i.
-
(a)
-
5.
each proper segment of is a sound 2-Vsp (defining 2-Vsp recursively), where the fine structural language for active segments is just that with symbols for ,
-
6.
some forces that the generic object is a 1-Vsp of height with , and there is an extension to a 1-Vsp such that (so is level-by-level definable over , via inverse P-construction).
We write above (if is not a 1-Vsp).
Definition 5.22.
A 2-Vsp is -like iff it is proper class and in some set-generic extension, for some -like premouse . (Note this is first-order over .)
We write and . Let be -like. We define and analogously (first-order over as in the proof of Lemma 5.3 part 4). In fact, let us define more generally, in the same first-order manner, but allowing to be illfounded, but -like with respect to first-order properties. Also if is a 1-Vsp, let . We write for (the 1-Vsp) . We write for the putative strategy for for trees based on , defined over just as the corresponding restrictions of are defined over , via the proof of Lemma 5.4.
5.6 Iterability of
In this subsection we will define a normal iteration strategy for in .
Definition 5.23.
For , an -long extender is a -extender over , for some premouse, 1-Vsp or 2-Vsp , and some .
Definition 5.24.
Let be a -like 2-Vsp. A -maximal iteration tree on of length is a system with the usual properties for -maximality, except that when is a -long extender, then then is the least such that does not drop and .
Iteration strategies and iterability for (such trees on) are defined in the obvious manner (one detail here is that if does not drop then is a (putative) 2-Vsp, including when is -long).
Definition 5.25.
A short-normal tree on a -like 2-Vsp is a -maximal tree that uses no long extenders. Note that a short-normal tree is of the form , where is based on , either
-
(i)
[ has limit length or drops] and , or
-
(ii)
has successor length, does not drop and is above and based on ,
and if then either
-
(i)
[ has limit length or drops] and , or
-
(ii)
has successor length, does not drop and is above .
Say that and are the lower, upper components respectively, and the -lower component.
5.6.1 Condensation properties for full normalization
Definition 5.26.
We define the notions -relevantly condensing, -sub-condensing and -standard for 2-Vsps just as for 1-Vsps (see Definition 4.24), replacing the role of premice there with 1-Vsps, and replacing with .
Lemma 5.26.
is -standard. (Thus, we take -like to include -standard.)
5.6.2 Tree translation from to
Definition 5.27.
Let be -like. We define 1-translatable trees on like in Definition 4.19, with replaced by as appropriate, but add the demand that uses no -long extenders.
Let on be 1-translatable. The 1-translation of is the tree on defined just as in Definition 4.20.
Remarks 4.12.1 and 4.12.1 carry over directly, replacing with as appropriate. Likewise Lemma 4.12.1 and its proof:
Lemma 5.27.
Let on be -translatable, where is -like. Then:
-
1.
The 1-translation of exists and is unique.
-
2.
and for all .
-
3.
for all such that does not drop.
-
4.
for all .
-
5.
for all .
5.6.3 Trees based on
Toward defining , we first consider trees on based on , adapting Definition 4.21:
Definition 5.28.
Write for the strategy for for short-normal trees based on , induced by . Let denote the putative strategy for short-normal trees on based on , induced by . This makes sense by Lemma 5.2.4.
Remark 4.12.2 adapts routinely. We now partially adapt Lemma 4.12.2, but omit the clause “and in fact, ”, as we will prove this in more generality later, in Lemma 5.6.4. The proof of the rest is a direct adaptation:
Lemma 5.28.
yields wellfounded models. Moreover, let be on , via , and let be the corresponding tree on (so via ). Let
be the natural copy map (where ). Then:
-
(i)
drops iff drops.
-
(ii)
If drops then (cf. Remark 4.12.2 adapted ).
-
(iii)
If does not drop then and where is the correct iteration map,
-
(iv)
; therefore, .
Definition 5.29.
Given a non-dropping -iterate of , let be induced by just as is induced by (this makes sense by Lemma 5.6.3).
5.6.4 Short-normal trees on
Definition 5.30.
Let be a (possibly dropping, putative) iterate of , via a short-normal tree with lower and upper components . We say that is good iff is via , is wellfounded and for every -long , for some -iterate of , and is the corresponding iteration map.
Say that a (partial) iteration strategy for is good iff all putative iterates via are good.
We now extend to a good short-normal -maximal strategy for . We first deal with trees based on :
Definition 5.31.
Write for the putative strategy for , for short-normal -maximal trees based on , as follows:
-
1.
, and
-
2.
given via , of successor length , where does not drop, and given a putative -maximal tree on , which is above , then is (equivalent to a tree) via iff there is a tree on , via , with the same extenders and tree order as .
We adapt Lemma 4.12.4:
Lemma 5.31.
is a short-normal -maximal strategy (hence yields wellfounded models). Moreover, let and be as in Definition 5.31, with . Then:
-
1.
and ,
-
2.
and , so ,
-
3.
for , , and ,
-
4.
if and drops then ,
-
5.
if and does not drop then ,
-
6.
if and drops then and ,
-
7.
if and does not drop then ,
-
8.
if and does not drop then is a (-sound) -iterate of , is a -sound -iterate of ,
and is the extender of the -iteration map.
Therefore if each have successor length, then is good with respect to extenders indexed (or all extenders in , if drops).
Proof.
We now prove a couple of variants of the branch condensation lemma 3 for trees on :
Lemma 5.31.
Let be short-normal on , via , based on , with of limit length, successor length with non-dropping and . Let be -generic. Let where is a non-dropping -cofinal branch with and and
is elementary with . Then .
Proof.
We may assume . Let . Let be least with either or . So is -sound and is on , above . Let be analogous for .
Define in the natural way, extending , like in Lemma 3. Also define analogously. So .
The phalanx is iterable, via lifting trees with .
Let and be the Q-structure, or if . Let be the phalanx , which is also iterable.
Let be a generic expansion of (so is an -like premouse and ). Then can be translated to a tree on , which is above . Let and or accordingly. Then the phalanxes
are iterable, since trees on them translate to trees on . Note that is -sound, and are -sound. But then comparing versus gives . ∎
Lemma 5.31.
Let be short-normal dsr trees on , via , based on , with of limit length. Suppose there is such that does not drop and is above , and there is an analogous such ; fix the least such . Let . Suppose that if is non-dropping then . Let be -generic. Let where is a -cofinal branch such that if is non-dropping then . Let be such that
is elementary and . Then .
Proof.
This is via a straightforward variant of the proof of Lemma 5.6.4, noting that because is dsr, can only overlap with long extenders. ∎
It turns out that the method we used to define is not so well suited to . Instead we proceed as follows:
Definition 5.32.
denotes the (putative) short-normal strategy for , defined as follows. Firstly, . Secondly, let be via , of successor length, such that does not drop, and . We define the action of on above- trees on .
Lemma 5.32.
is good.
Proof.
Clearly is well-defined and yields wellfounded models. So let be via , as in Definition 5.32, and , , , be as there. Let be the minimal -copy of to a tree on . Let and be such that is active with an -long extender. Let . By Lemma 5.6.1, .
Now is a correct iteration extender (via ) based on . For let be the translation of to a tree on , and . If (so ) the correctness of is by Lemma 5.4 part 6 applied to and and . If (so is long) it is because is good (so is correct) and how is defined.
Let be the limit length tree leading from to , and likewise, so where is the ultrapower map. Let be the successor length tree leading from to (given by ). We know that is via the short tree strategy for , and yields the branch . We claim the same holds for and ; that is, is via the -short tree strategy for , and yields .
For if , the Q-structure used in for the limit stage does not overlap , and is embedded by into an iterable Q-structure used in . And if , it is likewise through the -lower component of (until reaching ), and above there, Lemma 5.6.4 applies to the normalizations of and , using a restriction of as the map . (Here and can be -maximal, but one should literally apply Lemma 5.6.4 to the short-normal trees on , iterating to , and on , iterating to ).
Finally let be the -cofinal branch determined by and that determined by . Then we can apply Lemma 5.6.4 to and the stack , using . Therefore is correct. ∎
5.6.5 Normal trees on
Much like in Definition 4.29, it is now easy to see:
Lemma 5.32.
There is a unique -maximal strategy for such that . We write . Every iterate of via is a short-normal iterate of via , and hence is good.
Remark 5.32.
Consider a -maximal tree on and some limit such that uses -long extenders cofinally below . Then is the least measurable of , and in particular . Suppose is short with and total over , or is -long. Then and , and note that the short-normal tree via has . This could be unnatural; letting be the short-normal tree with last model , it might be better to define -maximality by taking least such that , and defining to be the model produce by normally extending with . However, for our purposes here, the more naive notion of -maximality suffices.
Lemma 5.32.
Let be a non-dropping -iterate of , and a non-dropping -iterate of . Let be the iteration map. Let be the above- short-normal strategy for given by , and likewise for . Then is the minimal -pullback of (see [15, ***10.3, 10.4]).
Proof.
Let on be via the -pullback of ; we want to see that is via . Let , which is via . Let . So , also an iteration map.
If then the desired conclusion follows from the fact that has mic. So suppose otherwise.
Let and be the ultrapower maps, and recall and likewise for . So the minimal -copy of , on , translates to a tree on which is via (and above ). We need to see that the minimal -copy of translates to a tree on via . Since has mic (Lemma 4.12.5 and [15, ***Theorem 10.2]) and by [15, ***10.3, 10.4], it therefore suffices to see that that .
Let and
We have
and the associated ultrapower map is just . Given the fine structural correspondence between and , therefore
and the -ultrapower map is just . Although is not the restriction of an iteration map on , it is straightforward to see we still have (that is, is the minimal -copy of ), meaning that:
-
–
has the same tree, drop and degree structure as has ,
-
–
for each , we have ,
-
–
for each , if then , and if is a successor then , and
-
–
the resulting ultrapower maps and (via ) commute with the iteration maps of and .
These are just standard properties of minimal copying, so we already know the corresponding properties hold with respect to , , and . One can now deduce them for with some commutativity, and in particular that
But then because are translations of , and given the fine structural correspondence between and , and likewise between and , it follows that , as desired. ∎
Lemma 5.32.
has minimal inflation condensation (mic).
Proof.
We just discuss short-normal trees. Let and be as before, but with respect to and ; in particular we have
where is a limit ordinal and . We must show that is a minimal inflation of . Now has mic, since does, by Lemma 4.12.5 and [15, ***Theorem 10.2]. So we may assume , so we get like before, with analogous properties (with replacing ). Let be the limit ordinal and the -cofinal branch and
the minimal tree embedding determined by extending the inflation to in the unique possible way. We want .
Let , and and be the ultrapower maps, and recall and likewise for . So the minimal -copy of , on , translates to a tree on which is via and is above . Likewise, translates to a tree on via which is above .
Let . By Lemma 5.6.5, is via . Lifting with , it is easy to see that
and that it suffices to see that
(see [15, ***Theorem 10.7] for details; there is a straightforward correspondence between these inflations and those for ).
So relabelling, we may assume and , so and and . Let be the short-normal tree leading from to . Then
as can be seen by lifting all relevant structures up by the extender with the relevant degree ultrapowers. Letting be but as a tree on (and recall were introduced above), it follows that
Since has mic, therefore
But the ultimate minimal tree embedding determined by this inflation is induced naturally by above, and in particular , so , as desired. ∎
5.7 Self-iterability of
Lemma 5.32.
is definable over its universe from the parameter .
Proof.
Note that in Theorem 5.8, we will improve the lemma above, showing that, in fact, is definable without any parameters over its universe. But just using Lemma 5.7 and adapting Lemma 5.1.3, we have:
Lemma 5.32.
Let be a non-dropping -iterate of . Let with and and be -generic. Then is definable over the universe of from the parameter .
We will now state a key fact on the self-iterability of (and more). As usual, we will give the proof in a special case which illustrates the main new features, but the full proof will be handled by [13], as it involves -translation:
Theorem 5.32.
Let be set generic over , where . Let . Then:
-
1.
is closed under and is lightface definable over .
-
2.
is closed under and is definable over the universe of from the parameter , uniformly in .
-
3.
is closed under and is lightface definable over . (Recall that is a -iterate of .)
-
4.
is closed under and is definable over the universe of from the parameter , uniformly in .
In order to prove the theorem, we again use modified P-constructions (in general, incorporating -translation), in the context of the following notions of P-suitability. The full proof will rely on -translation, and so will be given in [13]. Here we will restrict our attention to dsr (defined in this context below) trees only, for illustration purposes (but the notion of P-suitability below does not have such a restriction). We restrict to trees in (as opposed to ), as this simplifies things, and we can reduce other trees to this case.
Definition 5.33.
Let be an iteration tree on . Say that is P-suitable for iff there are such that:
-
1.
is short-normal on , according to , with -lower and -lower components and upper component ,
-
2.
are -total and -long,
-
3.
is the successor-length tree on induced by ,
-
4.
,
-
5.
,
-
6.
; note is on and is above ,
-
7.
is a strong -cutpoint of ,
-
8.
has limit length, , is the largest cardinal of , is definable from parameters over , and is generic over for the above- extender algebra of at , for some .
Now let be a tree on . Say that is P-suitable for iff the conditions above hold, except that is short-normal on , according to , is the lower component of , is based on and is above , has successor length and does not drop, and is on and is above (so , and note that can also be considered as a tree on , with properties as above).
The corresponding P-constructions are as follows; no proper class models show up, because we are now working up above the real Woodin cardinals. We must now restrict our attention to dsr trees (as defined immediately below).
Definition 5.34.
Let and with , and be -generic.
Let , on either or , be P-suitable for , and adopt notation as in Definition 5.33. Say that is dsr iff has only 2 Woodin cardinals.
Suppose that is dsr, but is not a Q-structure for itself. Then the P-construction of over (recalling that is the largest cardinal of ) is defined like the P-constructions used to compute the -short tree strategy for , noting that the iteration map , which is determined by , is in (and note that there are no 1-long extenders in ).
Lemma 5.34.
Let be dsr P-suitable for , on either or . Suppose is not a Q-structure for itself. Then the P-construction reaches the Q-structure , where or .
Proof.
We first consider P-suitable trees on in . So adopt the notation of Definition 5.33 for this, with . Because is above , the Q-structure exists, where . Suppose . We want to see that the P-construction reaches . To verify this, we run a comparison analogous some earlier in the paper, modulo the generic at , and after appropriate translation of long extenders. We need to specify the phalanxes we compare.
On the P-construction side, we just have .
On the Q-structure side, we proceed as follows. Let be the -core of (this is not , as itself is not -sound). Note that and is -sound. Let be a generic expansion of (to a premouse), via a filter which is -generic (for the same forcing . So . Then translates to a tree on which is above . Let . Define the phalanx
Note that is iterable, as it corresponds to iterating the phalanx
(Note here that the only extenders overlapping in are long, since is dsr.)
We now compare with , above , modulo the generic at , translating extenders with critical point on the side, and those with critical point on the side, much as before. Much like in the proof of Lemma 5.1.2, and using the -soundness of (which is by Lemma 5.1.2), the comparison is trivial, so the P-construction reaches , as desired. Regarding the equivalence modulo the generic at , although is extender algebra generic over , (for an extender algebra at , above some ), it doesn’t seem immediate that it is also generic for the corresponding extender algebra of (although the extenders correspond, it seems there might still be further axioms in which cause problems). However, this is not a problem. Note that
We can force over with , adding , which results in , and similarly
Since was taken -generic for , we can therefore force further with to reach , which computes . But the product can be reversed, and so is also -generic for . Moreover, is definable from parameters over . The same holds for all models that appear above in the comparison. This gives the usual fine structural correspondence between models above and their generic extensions given by adjoining . On the -side, the extension to is via , which is small relative to in . Likewise for all models on the -side of the comparison. So we also get the appropriate fine structural correspondence on the -side.
Now consider trees on ; we adopt the relevant notation from Definition 5.33. If , then since , immediately drops in model to , and this cannot be undone (since is short-normal). Since , where is as in the previous case, with corresponding iteration strategy for such trees, everything in this situation is as above. So suppose . Let with . Let . Then and (since ), translates to a tree on , which is above . Let . It is straightforward to see that has no -long extenders overlapping (recall that , and use the smallness of ), so can only have extenders overlapping with critical point . Define the phalanx
Clearly is iterable. We compare versus , again above etc, like before. This time the equivalence modulo the generic is a little different, because is not -generic, but instead is in . However, over , we adjoin with the extender algebra, then adjoin , reaching . Like in the previous case, this two-step forcing iteration is definable from parameters over and the Woodinness of ensures genericity. But , so is (simply) definable from parameters over , and (simply) defines from parameters. This (together with exactly how these definitions are made and the parameters used) is enough for the fine structural analysis of the comparison. ∎
Without discussing -translation, we are limited to sketching the proof of that can iterate itself and :
Sketch of proof for Theorem 5.7.
Lemma 5.4 handles trees based on .
So consider dsr trees , with lower component , on , based on , and above , non-dropping, and on , above . Let be such that is -long and and . Then letting on result from , is a correct iterate of , and knows the iteration map . So given that computes the restriction of to above- trees correctly, it can use to form minimal copies of trees (of the form above) to correct trees , and then is correct, because has minimal inflation condensation (Lemma 4.12.5), and hence so does , by [15, ***Theorem 10.2]. (Note also that dsr-ness is preserved by the copying.) Finally, arbitrary (dsr) trees can be reduced to P-suitable trees by the usual minimal genericity inflation technique.
By [13], the foregoing generalizes to arbitrary (not just dsr) trees, so that is definable over . Since has minimal inflation condensation, “ has minimal inflation condensation”.
Since the least indiscernible is countable in , and has minimal inflation condensation in , by [15, ***Remark 9.2], extends to canonically to set-generic extensions of (via the method in the proof of [15, ***Remark 9.2]), and letting be the extension, every tree via embeds via a minimal tree embedding arising from minimal inflation into some tree in via , and therefore also agrees with if is -generic. For the definability in from the parameter , use 5.7 to recover , from which we compute(d) the strategy.
For trees on , i.e. computing and , it is very similar, using Lemma 5.6.5. ∎
5.8 The mantle and eventual generic HOD of
In this section we prove the main facts regarding the eventual generic and the mantle:
Theorem 5.34.
Let be the universe of . Then:
-
1.
for all -generics , for all , and likewise for all -generics .
-
2.
has no proper ground, so is the mantle and smallest ground of .
-
3.
is the mantle of all set generic extensions of .
-
4.
is definable without parameters over , and in fact over any set-generic extension of .
Proof.
Work in where is -generic and . Say that is a -candidate iff is a -like 2-Vsp and there is which is -generic and .
Note that is determined in by , by Lemma 5.7, and moreover, by the uniformity of its proof, is definable over (the universe of) . (We can recover the universe of from , via (the proof of) Woodin-Laver, and we can recover from and via (the proof of) Lemma 5.7.) So there are only set-many -candidates. Note that is a -candidate.
Recall here that -like is assumed to include whatever first-order facts satisfied by to make our arguments work. In particular, it should include the statement/proof of Lemma 5.7, and also the statements
Now using this iterability (which holds in with respect to each -candidate ), we want to define a kind of simultaneous “comparison” of all -candidates. For this, we will not directly attempt to compare the -candidates themselves by least disagreement (due to familiar problems with showing that the comparison terminates), but, as we have done elsewhere in the paper, instead compare generic expansions of the , and then use this to infer a comparison of the -candidates (and it doesn’t seem obvious that this comparison of -candidates is by least disagreement).
However, we only have iterability for the generic expansions above their , which isn’t enough to expect a standard comparison of these premice by least disagreement either (they need not agree below their , as this part is just generic). Instead, like in the proof of Lemma 4.12.4, we will first form a “mutual genericity iteration” at an appropriate Woodin cardinal, and after this converges, move to comparison “modulo a generic” above that point.
So, work in , where is -generic. Fix for each -candidate a generic expansion of . So and . (Moving to ensures these s exist.) Let be the iteration strategy for for -maximal trees with given by the proof of Lemma 4.12.4 (translating to trees via , etc). Let be the least -total extender with . Let be the least Woodin cardinal of such that (so ).
Recall the meas-lim extender algebra (see [17]), used in the proof of Lemma 4.12.4. Write for the (meas-lim) extender algebra of , at , formed with extenders such that and is a limit of measurables of , as witnessed by . We will now form a mutual genericity iteration of all as above, for the image of , producing padded trees on , above , based on (and hence immediately drops in model to , noting that ), inserting some linear iterations at successor measurables to space things conveniently. Let be the set of all , for -candidates (where “-candidate” is still as computed in , but ). Fix an enumeration of , and let be a set of ordinals coding . We define a sequence of approximations to the final trees . We start with being the trivial tree on . Suppose we have defined for each . This will be a -maximal successor-length padded tree on , based on , above . Let , where . If drops below the image of then let , and otherwise let , where is the iteration map. Let . Let where codes as
(where is taken as a set of ordinals in a canonical fashion). Let be the least such that is -total and
-
1.
, or
-
2.
is a limit of measurable cardinals of , as witnessed by , and induces an extender algebra axiom false of , or
-
3.
, or is not a cardinal in ,
if there is such an , and otherwise. If there is such that and does not drop below the image of and for all such that , then we stop the construction, and set , and for all . Otherwise, let , and set if , and otherwise. Let be least such that either or , and set (as a -maximal tree, with last extender used being , which might be empty).
Now suppose we have defined for all and , where is a limit. Let . Then is the natural lim inf of the sequence . That is, iff and eventually all have , and is via , and has successor length. This determines .
This determines the entire construction. The first claim is very much like in the proof of Lemma 4.12.4:
Claim 1.
We have:
-
1.
Each is -maximal on , and if drops below the image of then is active, so .
-
2.
.
-
3.
Therefore there is such that does not drop below the image of .
Claim 2.
For every , does not drop below the image of , and .
Proof.
Because does not drop below the image of , and is a limit of measurables of , and , must be a limit cardinal of . Therefore every uses cofinally many non-empty extenders indexed below , is a limit cardinal of , and note that is generic over for its extender algebra at , since if .
Now suppose that drops below the image of , or . Let be the Q-structure for . It is straightforward to see that does not overlap , and note that we can compare versus as premice and over , so by -likeness, it follows that . Expanding to , where is still regular, we can now argue like in the proof of Claim 1 of the proof of Lemma 4.12.4 for a contradiction. (Although , we work in because the reasons for the extenders used in are encoded into , and we need this to obtain the contradiction.) ∎
So is active with an image of , and is -total with . Let . Then is a strong cutpoint of , and both extend to premice over . So we can simultaneously compare all above , modulo this generic equivalence. (With a simple instance of normalization, the resulting trees can easily be rearranged as trees on the phalanxes .) This produces a final iterate of , with , is Woodin in and .
Claim 3.
for all .
Proof.
By §4.5, depends only on the equivalence class . So the corresponding fact holds for . But we can take which are -generic respectively with , and then , which suffices. ∎
Now let be a -candidate and , so . Note that , after normalization, is translatable, where is the tree leading from to . Let on be its (short-normal) translation on . Then , which by the previous claim is independent of . So the trees iterate the various to a common model .
Let where is based on , and is on , and is above . Then translates to a tree on , and . Now essentially translates to a tree on . The extenders used in are just those with indices those used in , together with 1 further -long extender, which is an image of . That is, let , and let be least such that is non-dropping and . Then is a direct translation of , though note that if it is non-trivial, it drops in model immediately to , or some segment thereof. Then, uses an extra extender; if then , and otherwise (which is an image of ). This results in . After this, noting that is 1-translatable on (in particular, uses no -long extenders), we set to be its 1-translation. Write .
So we end up with , but was independent of . So write for this common iterate of the -candidates .
Using the strategies , we can define uniformly in . So let be the proper class of all ordinals fixed by all the iteration maps . Let and the uncollapse map. Since , this determines an elementary by factoring. But is a set-ground of , so by [5], and .
So we have defined over the universe of from the parameter , and so by homogeneity, in fact over the universe of from . The uniformity then gives that we can define over the universe of any set-generic extension of , from no parameter.
We can now easily complete the proof of the theorem. Part 4 was just established above. Part 1: Let be the universe of and be -generic, where . It now easily follows that , so actually . And if is -generic over , then since is an -extension of , it follows that . Part 2: If is a ground of , then we get if is sufficiently large, so , so . Part 3: The fact that is the mantle of all set-generic extensions of now follows from the set-directedness of set-grounds. ∎
Corollary 5.34.
We have:
-
1.
The -mantle of is the universe of , so is the least ordinal with this property.
-
2.
If is -generic then is the universe of .
Proof.
Note that , using Theorem 5.8. So we just need to see that . Let be a set of ordinals in . Let be -total with , and . Then and , so it suffices to find a -ground of with . But this can be done like in the proof of Theorem 4.8, or as follows:575757The method used here was actually the method used in the original proof of Theorem 4.8. Let be the result of the P-construction of over (in the style of that used to construct ). Note that is generic over for the two-step forcing iteration given by followed by , and . So is a -ground of . But , since , and we can inductively compute the extender sequence of above using and . ∎
Acknowledgements
Schindler gratefully acknowledges support by the DFG grant SCHI 484/8-1, “Die Geologie Innerer Modelle.” Schindler and Schlutzenberg gratefully acknowledge partial support by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy EXC 2044390685587, Mathematics Münster: Dynamics–Geometry–Structure. Schlutzenberg teilweise gefördert durch die Deutsche Forschungsgemeinschaft (DFG) – Projektnummer 445387776. Schlutzenberg partly supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – project number 445387776.
References
- [1] E. Closson. The Solovay Sequence in Derived Models Associated to Mice. PhD thesis, University of California, Berkeley, 2008.
- [2] Gunter Fuchs, Joel David Hamkins, and Jonas Reitz. Set theoretic geology. Annals of Pure and Applied Logic, 166(4):464–501, 2015.
- [3] Gunter Fuchs and Ralf Schindler. Inner model theoretic geology. Journal of Symbolic Logic, 81(3):972–996, 2016.
- [4] Haim Gaifman. Elementary embeddings of models of set-theory and certain subtheories. In Axiomatic set theory (Proc. Sympos. Pure Math., Vol. XIII, Part II, Univ. California, Los Angeles, Calif., 1967), pages 33–102. Amer. Math. Soc., Providence, R. I., 1974.
- [5] Joel David Hamkins, Greg Kirmayer, and Norman Lewis Perlmutter. Generalizations of the kunen inconsistency. Annals of Pure and Applied Logic, 163(12), 2012.
- [6] Richard Laver. Certain very large cardinals are not created in small forcing extensions. Annals of Pure and Applied Logic, 149(1–3):1–6, 2007.
- [7] G. Sargsyan. Hod Mice and the Mouse Set Conjecture, volume 236 of Memoirs of the American Mathematical Society. American Mathematical Society, 2015.
- [8] Grigor Sargsyan and Ralf Schindler. Varsovian models I. Journal of Symbolic Logic, 83(2):496–528, 2018.
- [9] Ralf Schindler. A note on the mantle. Handwritten, https://ivv5hpp.uni-muenster.de/u/rds/kappa_mantle.pdf.
- [10] Ralf Schindler. Varsovian models II (parts 1–6). Handwritten, https://ivv5hpp.uni-muenster.de/u/rds/VM2.pdf, https://ivv5hpp.uni-muenster.de/u/rds/VM2_2.pdf, https://ivv5hpp.uni-muenster.de/u/rds/VM2_5.pdf, https://ivv5hpp.uni-muenster.de/u/rds/VM2_6.pdf, https://ivv5hpp.uni-muenster.de/u/rds/VM2_7.pdf, https://ivv5hpp.uni-muenster.de/u/rds/VM2_8.pdf.
- [11] Ralf Schindler. The long extender algebra. Archive for Mathematical Logic, 57:73–82, 2018.
- [12] Ralf Schindler and John Steel. The self-iterability of . Journal of Symbolic Logic, 74(3):751–779, 2009.
- [13] Farmer Schlutzenberg. -translation and Varsovian models. To appear.
- [14] Farmer Schlutzenberg. Background construction for -indexed mice. arXiv:2101.00889v2.
- [15] Farmer Schlutzenberg. Full normalization for transfinite stacks. arXiv:2102.03359v3.
- [16] Farmer Schlutzenberg. Local mantles of . arXiv:2103.12925v2.
- [17] Farmer Schlutzenberg. Ordinal definability in . arXiv:2012.07185v2.
- [18] Farmer Schlutzenberg. Measures in mice. PhD thesis, University of California, Berkeley, 2007. arXiv:1301.4702v1.
- [19] Farmer Schlutzenberg. “ is woodin in HOD” directly from mice. Available at https://www.math.uci.edu/~mzeman/CMI/talk-schlutzenberg-4.pdf, 2016.
- [20] Farmer Schlutzenberg. Iterability for (transfinite) stacks. Journal of Mathematical Logic, 21(2), 2021.
- [21] Farmer Schlutzenberg. Choice principles in local mantles. Mathematical Logic Quarterly, 68(3):264–278, 2022.
- [22] Farmer Schlutzenberg. The definability of the extender sequence from in . The Journal of Symbolic Logic, 89(2):427–459, 2024.
- [23] John R. Steel. Local HOD computation. 2016. Handwritten notes, available at https://math.berkeley.edu/~steel.
- [24] John R. Steel. A Comparison Process for Mouse Pairs. Cambridge University Press, 2022.
- [25] Toshimichi Usuba. The downward directed grounds hypothesis and very large cardinals. Journal of Mathematical Logic, 17(2), 2017.
- [26] Toshimichi Usuba. Extendible cardinals and the mantle. Archive for Mathematical Logic, 58:71–75, 2019.
- [27] W. Hugh Woodin. Email to the second author. Personal communication, dated February 1, 2016.
- [28] W. Hugh Woodin. The continuum hypothesis, the generic-multiverse of sets, and the -conjecture. In Set theory, arithmetic, and foundations of mathematics: theorems, philosophies, volume 36 of Lecture Notes in Logic, pages 13–42. Cambridge University Press, 2011.