Capturing sets of ordinals by normal ultrapowers
Miha E. Habi\v{c}, Radek Honz\'ik

TL;DR
This paper explores how ultrapowers by normal measures can accurately reflect powersets for larger cardinals, introducing and analyzing the capturing properties and their consistency strengths in set theory.
Contribution
It introduces the local capturing property, analyzes its properties, and determines its exact consistency strength, extending previous results on the capturing property.
Findings
$ ext{LCP}(oldsymbol{ ext{kappa}}, oldsymbol{ ext{kappa}^+})$'s consistency strength is identified.
$ ext{CP}(oldsymbol{ ext{kappa}}, oldsymbol{ extlambda})$ can hold at the least measurable cardinal.
The paper extends the understanding of ultrapower correctness properties in set theory.
Abstract
We investigate the extent to which ultrapowers by normal measures on can be correct about powersets for . We consider two versions of this questions, the capturing property and the local capturing property . holds if there is an ultrapower by a normal measure on which correctly computes . is a weakening of which holds if every subset of is contained in some ultrapower by a normal measure on . After examining the basic properties of these two notions, we identify the exact consistency strength of . Building on results of Cummings, who determined the exact consistency strength of , and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Mathematical and Theoretical Analysis · Computability, Logic, AI Algorithms
Capturing sets of ordinals by normal ultrapowers
Miha E. Habič
Bard College at Simon’s Rock
84 Alford Road
Great Barrington, MA 01230
USA
[email protected] https://mhabic.github.io and
Radek Honzík
Department of Logic
Faculty of Arts
Charles University
nám. Jana Palacha 2
116 38 Praha 1
Czech Republic
[email protected] logika.ff.cuni.cz/radek
Abstract.
We investigate the extent to which ultrapowers by normal measures on can be correct about powersets for . We consider two versions of this question, the capturing property and the local capturing property . Both of these describe the extent to which subsets of appear in ultrapowers by normal measures on . After examining the basic properties of these two notions, we identify the exact consistency strength of . Building on results of Cummings, who determined the exact consistency strength of , and using a variant of a forcing due to Apter and Shelah, we show that can hold at the least measurable cardinal.
Key words and phrases:
Capturing property, local capturing property, measurable cardinal, normal measure
2020 Mathematics Subject Classification:
03E55, 03E35
The authors are grateful to Arthur Apter, Omer Ben-Neria, James Cummings, and Kaethe Minden for helpful discussions regarding the topics in this paper. We also thank the referee for their careful reading of the manuscript and their suggestions, which significantly improved the exposition in this paper.
The first author was supported in part by the ESIF, EU Operational Programme Research, Development and Education, the International Mobility of Researchers in CTU project no. (CZ.02.2.69/0.0/0.0/16_027/0008465) at the Czech Technical University in Prague, and the joint FWF–GAČR grant no. 17-33849L: Filters, Ultrafilters and Connections with Forcing.
The second author was supported by GAČR-FWF grant Compactness principles and combinatorics.
1. Introduction
It is well known that the ultrapower of the universe by a normal measure on some cardinal cannot be very close to ; for example, the measure itself never appears in the ultrapower. It follows that these ultrapowers cannot compute correctly. In the presence of GCH, this is equivalent to saying that the ultrapower is incorrect about . But if GCH fails, it becomes conceivable that a normal ultrapower could compute additional powersets correctly. This conjecture turns out to be correct: Cummings [4], answering a question of Steel, showed that it is relatively consistent that there is a measurable cardinal with a normal measure whose ultrapower computes correctly; in fact he showed that this situation is equiconsistent with a -strong cardinal . In this paper we will study this capturing property and its local variant further.
Definition 1**.**
Let and be cardinals. We say that the local capturing property holds if, for any , there is a normal measure on such that . We shall say that (or ) captures .
The full capturing property will amount to having a uniform witness for the local version.
Definition 2**.**
Let and be cardinals. We say that the capturing property holds if there is a normal measure on that captures all subsets of ; in other words, a normal measure such that .
Some quick and easy observations: increasing clearly gives us stronger properties, implies , and holds for any measurable cardinal .
Using this language, we can summarize Cummings’ result as follows:
Theorem 3** (Cummings).**
If is -strong, then there is a forcing extension in which holds. Conversely, if holds, then is -strong in an inner model.
We should mention that is provably false: if it held, then some normal ultrapower would contain all families of subsets of , in particular the measure from which it arose, which is impossible. Therefore a failure of GCH is necessary for to hold. By work of Gitik [7], this means that has consistency strength at least that of a measurable cardinal with Mitchell rank , and the actual consistency strength of a -strong cardinal is only slightly beyond that.
The following are the main results of this paper. In Section 2 we analyse the consistency strength of and show that it is only a small step below the strength of the full capturing property.
Main Theorem 1**.**
Assuming GCH, if holds, then . Conversely, if , then holds in an inner model.
In Section 3 we continue the analysis in the case that GCH fails at and show that the first part of the previous theorem, namely that has high Mitchell rank, fails dramatically if .
Main Theorem 2**.**
If is -strong, then there is a forcing extension in which holds and is the least measurable cardinal.
This last theorem is a nontrivial improvement of Cummings’ result. Since the forcing he used to achieve was relatively mild, remained quite large in the resulting model; for example, it was still a measurable limit of measurable cardinals. Our theorem shows that, while has nontrivial consistency strength, it does not directly imply anything about the size of in (beyond being measurable).
We will list questions that we have left open wherever appropriate throughout the paper.
2. The local capturing property
Let us begin our analysis of the local capturing property with some simple observations.
Lemma 4**.**
If holds, then it can be witnessed by measures for which and agree on cardinals up to and including .
Proof.
Using a pairing function we can code a family of bijections for as a single subset . If we want to capture in an ultrapower as in the lemma, we simply capture (a disjoint union of) and using . ∎
Proposition 5**.**
* fails for any measurable .*
Proof.
If held, there would have to be a normal measure ultrapower with critical point such that was correct about cardinals up to and including , by Lemma 4. But no such ultrapower can exist, since the ordinals and are cardinals in and both have size in . ∎
The following lemma is quite well known, but it will be key in many of our observations.
Lemma 6**.**
Suppose that is an elementary embedding with critical point and consider the diagram
[TABLE]
where is the ultrapower by the normal measure on derived from and is the factor map. Then the critical point of is strictly above .
Proof.
It is clear that the critical point of is above . Consider some ordinal . Fix a surjective map in (and note that both and compute correctly). Since every ordinal up to and including is fixed by , it follows that is a surjection from to and so is a surjection onto . It follows that we must have . ∎
Using an old argument of Solovay, we can see that the optimal local capturing property automatically holds at sufficiently large cardinals.
Proposition 7**.**
If a cardinal is -supercompact, witnessed by an embedding , then holds in both and .
Proof.
We first show that holds in . Suppose it fails. Then there is some which is not captured by any normal measure on . The model agrees that this is the case, since it has all the normal measures on and all the functions that could represent . Let and be as in Lemma 6. By that same lemma, the model computes correctly and it also believes that there is some which is not captured by any normal measure on . This is fixed by , so also believes that is not captured by any normal measure on , and agrees. But this is a contradiction, since is captured by the ultrapower . Therefore holds in .
Observe that only depends on , the normal measures on , and the representing functions . The ultrapower has all of these objects, therefore must agree that holds. ∎
In particular, if is -supercompact, then there are many for which holds.
The above argument seems to break down if is only -supercompact for some , even if we are only aiming to capture subsets of ; one simply cannot conclude that has all the necessary measures to correctly judge whether a set is a counterexample to or not. Thus, the following question remains open.
Question 8**.**
Suppose that is -supercompact for some . Does it follow that holds?
The same conclusion as in Proposition 7 follows even if is merely -strong.
Proposition 9**.**
If a cardinal is -strong, witnessed by an embedding , then holds in both and .
Proof.
The argument works just like in Proposition 7. Note that has all the functions and all the normal measures on . Furthermore, has all the subsets of (use a wellorder of in of ordertype ). It follows that and have all the same counterexamples to . ∎
Reflecting back from to , this last proposition implies that below a -strong cardinal there are many cardinals satisfying . This observation, together with Cummings’ Theorem 3, tells us that the consistency strength of is strictly lower than that of . Let us determine this consistency strength exactly.
Recall that the Mitchell order on a measurable cardinal is a relation on the normal measures on , where if appears in the ultrapower by . It is a standard fact that is wellfounded, and the Mitchell rank of is the height of this order.
Proposition 10**.**
If holds, then .
Proof.
This is essentially the proof that the large cardinals mentioned in the previous two propositions have maximal Mitchell rank. We shall recursively build a Mitchell-increasing sequence of normal measures on . So suppose that has been constructed for some . Using a pairing function we can code each measure as a subset of , and then code the entire sequence as a subset of as well. By there is a normal measure on which captures this subset, and thus the whole sequence of measures. We can then simply let . ∎
To show that the lower bound from this proposition is sharp we will pass to a suitable inner model. Recall that a coherent sequence of normal measures of length (where is an ordinal or ) is given by a function and a sequence
[TABLE]
where each is a normal measure on and for each , if is the corresponding ultrapower map, we have
[TABLE]
Here and .
Theorem 11**.**
Suppose that where is a coherent sequence of normal measures of length with . Then holds.
Proof.
We shall show that, given any , there is some such that . The theorem then immediately follows since, given , we can find a as described, and the ultrapower by of contains , and therefore .
So fix some and let be a large regular cardinal so that . Since GCH holds, we can find an elementary submodel of size such that and . Let be the Mostowski collapse map.
Note that is an ordinal below and that all ordinals below are fixed by . Moreover, will fix all subsets of in (since these can be described by sequences of ordinals of length ), and therefore also all the measures for (since each of these can be coded by a subset of ). It follows that is (in ) a coherent sequence of normal measures of length with , and that . Therefore for some . Since was fixed by as well, we get . ∎
Even if, starting from a measurable cardinal of Mitchell order , one could construct a coherent sequence of normal measures with , it seems to be an open question (according to [15]) whether it is necessarily the case that remains coherent in . We avoid this issue by using a result of Mitchell [13], who showed in ZFC that there is a sequence of filters (possibly empty, possibly of length , or anything in between) such that satisfies GCH, is a coherent sequence of normal measures in and . The model we need will be exactly this .
Corollary 12**.**
Assume that . Then holds in a transitive model of GCH.
Proof.
We may assume that is the largest measurable cardinal; if not, we can cut off the universe at the next inaccessible in order to achieve this. Let be the sequence of filters described above. By Mitchell’s results we know that the sequence is a coherent sequence of normal measures in and . Since is the largest measurable, the length of is , and it follows from Theorem 11 that holds in . ∎
In fact, these canonical inner models satisfy a strong form of , where there is a single function which represents any desired subset of in an appropriate normal ultrapower.
Definition 13**.**
Let be a measurable cardinal. An -guessing Laver function for is a function with the property that for any there is an ultrapower embedding by a normal measure on such that .
It is obvious that the existence of an -guessing Laver function for implies . The first author [9, Theorem 28] showed that this stronger property holds in appropriate extender models, in particular the one from Corollary 12.
Starting with a cardinal of high Mitchell rank, we obtained a model of the local capturing property by passing to an inner model. We are unsure whether one can obtain the local capturing property from the optimal hypothesis via forcing.
Question 14**.**
Suppose that GCH holds and . Is there a forcing extension in which holds?
It is important to note that the hypothesis in Proposition 10 is quite strong: we need to be able to capture all subsets of in order to be able to conclude that the Mitchell rank of is large. One might wonder whether some large cardinal strength beyond measurability can be derived even from weaker local capturing properties, for example assuming . As we shall see in the following section, the answer is an emphatic no.
3. The capturing property at the least measurable cardinal
In this section we will give a proof of our second main theorem. Our argument owes a lot to Cummings’ original proof of Theorem 3 and to the forcing machinery introduced by Apter and Shelah. Nevertheless, we shall strive to give a mostly self-contained account, especially with regard to the forcing notions used.
Let us first explain why we cannot simply use the proof from Theorem 3 and afterwards make into the least measurable cardinal just by applying the standard methods of destroying measurable cardinals, such as iterated Prikry forcing or adding nonreflecting stationary sets. In his argument, Cummings starts with a -extender embedding, lifts it through a certain iteration of Cohen forcings (which will, among other things, ensure that , a necessary condition as we explained), and concludes that the lifted embedding is in fact equal to the ultrapower by some normal measure on and captures all the subsets of in the extension. One would now hope to be able to lift this new embedding further, through any of the usual forcings which would make into the least measurable cardinal. However, for this strategy to work, we should somehow ensure that is not measurable in . Otherwise lifting the embedding through any of the usual forcing iterations to destroy all the measurables below over would require us to also destroy the measurability of over . But if we did that and maintained the capturing property at the same time, there would be enough agreement between the extensions of and that would necessarily be nonmeasurable in the extension of as well. All this is to say that, since is very much measurable in after the forcing done by Cummings, a different approach is necessary.
Instead of first forcing the capturing property and then making into the least measurable, the solution is to destroy all the measurable cardinals below and blow up at the same time. The tools to make this approach work are due to Apter and Shelah [1, 2].
3.1. The forcing notions
Let us review the particular forcing notions that will go into building our final forcing iteration. The material in this subsection is contained, in some form or another, in Sections 1 of [1, 2].
Since we will be discussing the strategic closure of some of these posets, let us fix some terminology. If is a poset and is an ordinal, the closure game for of length consists of two players alternately playing conditions in a descending sequence of length , with player II playing at limit steps. Player II loses the game if at any stage she is unable to make a move; otherwise she wins. If is a poset and is a cardinal, we shall say that:
- •
is -strategically closed if player II has a winning strategy in the closure game for of length .
- •
is -strategically closed if player II has a winning strategy in the closure game for of length .
- •
is -strategically closed if it is -strategically closed for all .
Recall that, if is a cardinal, a poset is called -distributive (or -distributive) if forcing with does not add any new sequences of ordinals of length (or ). This is equivalent to saying that the intersection of (or ) many open dense subsets of is dense open.
If is a cardinal and is an ordinal, we let be the usual forcing notion to add many Cohen subsets of . We think of conditions in as filling in a grid with many columns of height with 0s and 1s. Each condition is only allowed to fill in fewer than many cells in the grid. Eventually, the generic will fill in the entire grid, and each column of the grid will be a Cohen subset of .
If is a regular cardinal, we let be the forcing to add a nonreflecting stationary subset of , consisting of points of countable cofinality.111In our argument we could use any other fixed cofinality below the large cardinal in question. We sacrifice a bit of generality in order to avoid carrying an extra parameter with us throughout the proof. The specific choice of countable cofinality also simplifies some arguments. A condition in is simply a bounded subset of , consisting of points of countable cofinality and satisfying the property that is nonstationary in for every limit of uncountable cofinality. The conditions in are ordered by end-extension. It is a standard fact that is -strategically closed and, if , is -cc (see [5, Section 6] for more details). Note that the generic stationary set added will also be costationary, since it avoids all ordinals of uncountable cofinality.
If is a costationary set, let be the forcing to shoot a club through ; conditions are closed bounded subsets of . Again, if , then will be -cc ([5, Section 6] has more details). In the cases we will be interested in, will also be -distributive (see Lemma 16).
Before we continue with the exposition, let us fix some terminology.
Definition 15**.**
Let and be posets. We say that and are forcing equivalent if they have isomorphic dense subsets.
This is not the most general definition of forcing equivalence that has appeared in the literature, but it has the advantage of being obviously upward absolute between transitive models of set theory.
Lemma 16**.**
If is a cardinal satisfying then , where is the name for the generic nonreflecting stationary set added by , is forcing equivalent to .
Proof.
This is standard; the iteration has a dense -closed subset of size , which is equivalent to by [5, Theorem 14.1]. ∎
Suppose that and are regular cardinals, , and is a ladder system (meaning that each is a -sequence cofinal in ; the are called ladders). The forcing consists of conditions where
- (1)
is a condition in the Cohen forcing , seen as filling in many columns of height with 0s and 1s. We will denote by the set of indices of the nonempty columns of . 2. (2)
is a uniform condition, meaning that all of its nonempty columns have the same height. 3. (3)
is a set of ladders from the ladder system and each ladder is a subset of .
The conditions in are ordered by letting if and , and for any , if is the index of a row that was empty in but is nonempty in , then both sets and are unbounded in . In other words, when strengthening the Cohen part of the condition, the are promises that we will not add a row whose values stabilize when restricted to the columns indexed by .
The poset is similar to the poset defined in [1, Section 4], with some differences which we believe will simplify the poset. For example, our definition permits an arbitrary ladder system, whereas Apter and Shelah work with a very specific one. For our applications, the specific case studied by Apter and Shelah would have sufficed, but the poset can nevertheless be defined more generally. We believe the additional generality will make the role of the side conditions in the arguments more transparent and clarify where additional assumptions on the parameters in the definition of are required.
Some comments are in order regarding the forcing . It is similar enough to the Cohen poset that one would hope that it is just as simple to show that this forcing also adds new subsets of and so on. But with the addition of the side conditions this is no longer clear. It is not even immediate that generically we will fill out the entire binary matrix. On the other hand, if we want to use this forcing as the main part of our construction to destroy many measurable cardinals, then it cannot be too close to plain Cohen forcing after all. This tension between the poset and the Cohen poset is controlled by the ladder system , so we will have to choose these ladder systems carefully in our proof.
The following facts are parallel to the ones Apter and Shelah give in [1, 2]; we give proofs for the sake of completeness, but the reader familiar with their exposition should expect no surprises.
Lemma 17**.**
Two conditions and in of equal height are compatible if and only if their Cohen parts are compatible.
Proof.
The forward implication is immediate. For the reverse, assume that and are compatible, so that is a Cohen condition. Notice that has the same height as and , and that each nonempty column in was either present already in both and , or else it was present already in and was empty in , or vice versa. If we let , it then follows that is a common strengthening of both and . This is because, as far as ladders are concerned, no new rows were added to the Cohen part when it was strengthened from to , and similarly for . ∎
Corollary 18**.**
*For any regular , the poset is -Knaster (meaning that any collection of many conditions has a subset of size of pairwise compatible conditions) if and only if the poset is -Knaster. *
Proof.
For the forward direction, start with a family of Cohen conditions for , and associate to each the condition . Since is -Knaster, there is a subset of size such that the conditions for are pairwise compatible. This, of course, means that the conditions for are pairwise compatible.
Conversely, suppose that is -Knaster and let for be conditions in . If there are many conditions among these with the same Cohen part we are done, since all of those will be pairwise compatible. So let us assume that this doesn’t happen. Since , there is a subset of size such that all conditions have the same height. By our assumption and since is regular, we can thin out further to assume that for distinct . Since is -Knaster, we can thin out even further until the conditions for are all pairwise compatible. But since we already arranged them all to have the same height, Lemma 17 implies that the conditions for are also pairwise compatible in . ∎
This corollary will be convenient when we need to gauge the chain condition or the Knasterness of the poset . Typical applications will have inaccessible, a finite successor of and GCH between and . In those cases, a standard -system argument will guarantee that (and therefore also ) is -Knaster.
Lemma 19**.**
Suppose that is regular, is regular, and is a ladder system on some subset of . Then is -closed.
The outright closure of the poset is a slight improvement over the presentation that Apter and Shelah chose; they could only guarantee strategic closure, but the difference will not be significant.
Proof.
Start with a descending sequence of conditions for . We can get a candidate for a lower bound by simply taking unions in each coordinate, letting and , but we need to verify that . Consider any ladder and look at the restrictions and . For each new row in , we can find a with such that that row appears already in . But because we assumed that , it must be the case that that row has unboundedly many 0s and 1s. ∎
Going forward, we will focus particularly on ladder systems supported on very sparse sets, meaning those without any stationary initial segments. The following is essentially [1, Lemma 2] and also [2, Lemma 2]: although Apter and Shelah state the result for a very special ladder system, an inspection of their proof shows that the argument works in general.
Lemma 20**.**
Let be inaccessible and regular. Suppose that is nonstationary in its supremum and all of its initial segments are nonstationary in their suprema as well. Let be a ladder system on . Then there are (nonempty) final segments of each such that the are pairwise disjoint.
Let us briefly explain why this lemma will be useful. Suppose that we have a condition and we would like to strengthen its Cohen part. We cannot just blindly extend , since the ladders in exert some control over what the rows of any extension of might look like. If the ladders in are all pairwise disjoint, then this isn’t a significant issue: we can fill in one cell of and consider each ladder in separately, filling in more of the row to ensure that unboundedly many 0s and 1s appear in the columns mentioned by . This naive strategy seems less solid when the ladders in overlap, since it might happen that, while satisfying the requirements given by one ladder , we inadvertently violate those given by a different .
The point of Lemma 20 is to allow us, under certain circumstances, to pretend that the ladders in really are pairwise disjoint. More precisely, instead of the ladders in , we are going to focus on their (pairwise disjoint) final segments as provided by Lemma 20. The point is that, if we want to strengthen the Cohen part of to by filling in a cell in row , it suffices, for each , to have and be unbounded in , instead of the same requirement where is replaced by , since is a cofinal subset of .
Lemma 21**.**
Suppose is inaccessible and is regular. Suppose that and that all of its proper initial segments are nonstationary. Let be a ladder system on . Then a generic for is a total function on and each of its columns is a new subset of .
Proof.
We only need to show that, given a condition , we may extend that condition in order to fill any given empty cell with an arbitrary value. This is sometimes easy to do: if the height of is and we wish to fill a cell below height , we can simply fill that cell (and even its column up to height ) in whatever way we want. The reason is that the cell will only be empty if its whole column is empty (since is uniform), but that means that no ladder in mentions that column. Consequently, the side condition plays no part when strengthening the Cohen part in that column.
Let us now consider the case when we are attempting to fill in a cell in row , meaning the first new row above the height of . We start building the stronger Cohen condition by filling in that new cell in the desired way. We still need to make this new Cohen condition uniform (all previously nonempty columns now need to get an entry in row , but also the column we just added an entry to might have empty cells below row if it was empty prior to this step), and pay attention to the promises we made regarding the ladders in .
If the column we just added to was empty, we can fill it up to height in whatever way we want. The reason is the same as before: this column doesn’t appear in , so no ladder in mentions it, and therefore the side condition has nothing to say about how we extend this column. So let us focus on adding entries in row to columns that were nonempty in .
Since is inaccessible, has size less than . Since is regular, the ladders in are bounded below and we can pick some so that each ladder in is a subset of . By assumption is nonstationary in and all of its initial segments are nonstationary in their suprema as well. It follows that we can apply Lemma 20 to (seen as a ladder system on ) in order to find pairwise disjoint final segments of each .
For each , there is at most one such final segment for which . If there is no such , we fill the cell in row and column with a 0. On the other hand, if such a exists, we fill the cells in row and columns in in an alternating pattern to make sure that there are unboundedly many 0s and 1s. The key fact is that these specifications do not contradict each other, since the sets are pairwise disjoint. In this way, we extend to a uniform condition of height . If we were filling in a cell in a previously nonempty column, then , and otherwise , where is the index of the empty column in that we filled cells in. Using the reasoning described after Lemma 20, it is also clear that : given any , consider the values for . Let be the associated final segment. Our construction made sure that and for unboundedly many , and therefore also for unboundedly many , so it follows that .
Having seen how to fill a cell in row of a condition of height , we can use the same process to fill a cell in any row above as well. We simply use the same argument to increase the height of one step at a time and the closure of from Lemma 19 to pass through limit steps, until we reach the desired cell to be filled in. ∎
If is a regular cardinal and is stationary, recall that a -sequence is a ladder system such that for any unbounded there is some such that .222The principle is usually stated in the apparently stronger form where there are stationarily many for which . This formulation is equivalent to the one we use; see [14, Observation I.7.2].
Lemma 22**.**
Suppose that are regular cardinals, with inaccessible and for all .333Again, it is best to think of the case when is a finite successor of and GCH holds for cardinals in the interval . Let be a nonreflecting stationary set consisting of points of countable cofinality, and let be a -sequence. Then forces that is not measurable.
Proof.
The proof follows the strategy of [2, Lemma 3]. We start with a condition and a name for a countably complete ultrafilter on . For each , let be the canonical name for the subset of whose characteristic function is given by the th column of the generic, and let be the name for its complement. For each we can find a stronger condition which decides whether or . By thinning out if necessary, we may assume that all of the Cohen parts have the same height, and that the value of determining which of is forced to be in , is independent of and equal to some . Moreover, we may further strengthen these conditions to ensure that for all . Our cardinal arithmetic assumption implies that and, according to Corollary 18, are -Knaster, so we can find an unbounded set such that the conditions for are pairwise compatible.
We now use the -sequence: there is an for which . We can now let and . Since the conditions were all pairwise compatible, is also a Cohen condition, stronger than each . Moreover, since the conditions and have the same height, is actually a strengthening of each (the argument is the same as in the proof of Lemma 17).
Now consider the (even stronger) condition ; it really is a condition since each was in the support of , so . This condition forces that for . Since is countable, it follows that also forces that the intersection is in .
We now show that the condition also forces that the above intersection is bounded in . Suppose otherwise, that there is a stronger condition forcing that the intersection has an element above the height of . This can only happen if has as the entries in row and columns . But this is impossible, since the definition of the ordering in and the fact that require there to be unboundedly many 0 entries as well as unboundedly many 1 entries in row and columns in .
This shows that the countably complete ultrafilter is forced to have a bounded element. Therefore it cannot be a normal ultrafilter on , so is not measurable in the forcing extension. ∎
The following lemma is [1, Lemma 1] (and also [2, Lemma 1]); the reader may find the proof there. The argument is much like the proof that forces .
Lemma 23**.**
Let be a regular cardinal satisfying . Then forces that holds, where is the generic stationary set added.
Since we now know that adds a -sequence, it makes sense to consider the iteration , where is a -sequence added by the first stage of forcing. Lemma 22 implies that this iteration will definitely make nonmeasurable (assuming we start from GCH or a similar hypothesis). The following lemma is a complement to that result and can be used to show that the measurability of may be resurrected. It corresponds to [2, Lemma 4].
Lemma 24**.**
Let be regular cardinals with inaccessible and satisfying . Then the iteration , where is an arbitrary ladder system on , is equivalent to .
Proof.
We stick closely to the argument from [2]. Lemma 16 already told us that is equivalent to , so it only remains to show that, in the resulting extension , is equivalent to . Since in , the formerly stationary set is no longer stationary, nor does it have any stationary initial segments, Lemma 20 implies that we can disjointify the ladder system by picking final segments for each .
The set can now be decomposed into the disjoint union of the plus the remainder . The key realization (as in the proof of Lemma 21) is that we can honour the promises given by a condition by strengthening carefully on each (and these regions are pairwise disjoint and do not interfere with each other), and strengthening quite freely on the remainder .
To make this precise, let us write, given , for the subposet of conditions for which . Let us also write for the subposet of those conditions for which . Each of the posets is a -closed poset with the induced ordering, and each has size . This means that each is equivalent to by [5, Theorem 14.1]. On the other hand, since the conditions in have empty side conditions, the induced ordering there behaves exactly like .
Given a condition , we can decompose it into the sequence of restrictions and . We would like to say that this decomposition gives rise to an isomorphism between and (where the product is taken with -support). Unfortunately, that is not quite the case: this map is not surjective, as its range consists exactly of those conditions in the product whose Cohen components in each factor have the same height. However, the range is still dense in the product, which shows that and are equivalent.
Putting together the equivalences from the last two paragraphs, we obtain an equivalence between and , where the product is taken with -support, and we can conclude that is equivalent to . ∎
3.2. Some additional facts about forcing and elementary embeddings
In this subsection we collect some facts about forcing and ultrapowers, some more standard than others, that we will need throughout our paper. We indicate at each the parallel result from [3] or [5], where proofs are also given.
Fact 25** ([5, Proposition 9.1]).**
Suppose that and are transitive models of ZFC and is an elementary embedding. Let be a poset, let be -generic over and let be -generic over . If then can be extended to an elementary embedding satisfying .
Fact 26** ([3, Section 1.2.2, Fact 3]).**
With the notation of the previous fact, if is a -extender embedding, then so is the lift . In particular, if is the ultrapower by a normal measure on , then so is .
Fact 27** ([3, Section 1.2.2, Fact 2]).**
With the notation of the previous fact, suppose that is a -extender embedding and that is -distributive in . Then generates a -generic filter over .
Fact 28** ([5, Proposition 8.1]).**
Let be an inner model of ZFC, let be a poset and let be a cardinal. Suppose that is -strategically closed (in ) and that the set of maximal antichains of in has cardinality at most in . Then there is a -generic filter over in .
Fact 29** ([3, Section 1.2.3, Fact 3]).**
Let be an inner model of ZFC, let be a poset and let be a cardinal. Suppose that and that is -cc in . Let be -generic over . Then is an inner model of and in .
Recall that if is a poset and is a -name for a poset, the term forcing poset consists of -names for elements of , ordered by letting if .
Fact 30** ([3, Section 1.2.5, Fact 1]).**
If and are generic over , then is generic over .
Lemma 31** ([3, Section 1.2.5, Fact 2]).**
Suppose that is a cardinal satisfying and let be a -cc forcing of size . Let be the -name for in the extension. Then is forcing equivalent, in , to .
Lemma 32**.**
Let be a measurable cardinal satisfying and let be the ultrapower by a normal measure on . Given any finite , the forcings and are equivalent in .
Cummings gave a proof of this lemma for in [3, Section 1.2.6, Fact 2] (attributing the proof to Woodin), and Gitik and Merimovich proved the generalization to all in [8, Lemma 3.2].
Lemma 33**.**
*Let be a regular cardinal, let be some -distributive forcing notion, and let be a -cc forcing notion. If forces that is -cc, then forces that is -distributive. *
Proof.
Let be -generic over and consider a sequence of ordinals in of some length less than . We wish to see that . Since and is -cc in , we can find a nice -name for in that can also be coded by a sequence of ordinals of length . Since is -distributive, this name is already in , and so must appear in , as desired. ∎
The following key observation was already implicit in Cummings’ proof of Theorem 3. It shows that, as long as one can arrange the value of appropriately, the apparently difficult part of the capturing property tends to follow for free from the construction.
Lemma 34**.**
Suppose that is a -extender embedding and . Then is the ultrapower by a normal measure on .
Proof.
Let be the ultrapower by the normal measure derived from and let be the factor embedding. Consider some . Since is a -extender embedding, we can write for some and some function with domain . By Lemma 6 the critical point of is above and therefore
[TABLE]
which shows that is surjective. On the other hand, is an elementary embedding, so it is also injective. It follows that is an isomorphism of transitive structures and thus trivial, so we can conclude that . ∎
3.3. The proof
We are now ready to prove the second main theorem. We restate it here for convenience.
Theorem 35**.**
If is -strong, then there is a forcing extension in which holds, , and is the least measurable.
This theorem shows that the hypothesis in Proposition 10 is in some sense optimal: if then is not enough to conclude that the Mitchell rank of is large. In fact, even can hold at the least measurable cardinal.
Proof.
We make some simplifying assumptions to start with. We may assume that GCH holds and that the -strongness of is witnessed by a -extender embedding . We have the usual diagram
[TABLE]
where is the induced normal ultrapower map. Using the GCH and Lemma 6, we can see that the critical point of is . Using the argument from [4], we may also assume that, in , there is an -generic filter over .
The following observation will be important, and we include the straightforward proof.
Lemma 36**.**
The map is a -extender embedding. That is,
[TABLE]
Proof.
We assumed that we could write in the form
[TABLE]
Now take an arbitrary element of . We can rewrite it as . If we now take , it is not hard to see that , showing inclusion in one direction.
For the other direction, take an element of the form . The function itself is of the form for some function with domain , since is the ultrapower of by a normal measure on . This means we can write , since the critical point of is above . Let be a bijection, and define a function by , where and where the definition only makes sense if is a function with in its domain (in other cases we can define arbitrarily). It is now straightforward to see, using elementarity, that . ∎
We now specify the forcing we will use. Let be the Easton support iteration of length which forces at inaccessible with , where is some -sequence added by .444It does not matter much how we pick these -sequences. One possible way is to fix in advance a wellordering of some large and always pick the least appropriate name. Let be -generic over . We can factor as
[TABLE]
where is the -sequence used by the forcing at stage in and is the remainder of the forcing between and . The full forcing that will give us our result is then
[TABLE]
Let us carefully try to lift the embedding through this forcing.
First, we can rewrite as
[TABLE]
where and are defined similarly to and in the case of above. Since is generic over all of , it is definitely generic over and . The forcing is below the critical point of the embedding , so we can easily lift it to . Moreover, since is -cc, will be closed under -sequences in .
We now claim that, in , there is an -generic over , and moreover that this generic amounts to a nonstationary subset of (which is an ordinal of cofinality in ) in . This follows from Lemma 16, which tells us that the iteration is equivalent to . Since has an -generic over (as this forcing is -closed in and only has many dense subsets from ), we can also extract the generic for . Furthermore, this generic stationary set will be nonstationary in , as witnessed by the generic club added by .
So let be -generic over . This means that is, in , a nonreflecting stationary subset of . In particular, none of its proper initial segments are stationary in their supremum. This statement is upwards absolute, so agrees about the nonstationarity of the initial segments of . But more than this, itself is nonstationary in its supremum , as we noted in the previous paragraph. Finally, observe that ; this is because and has size in , since is the ultrapower by a normal measure on . Together, these facts imply that is a condition in the real . Let be some -generic over containing . The embedding lifts again to ; this is because the critical point of is , which means that by the choice of .
Now consider the -sequence used by at stage . Since the critical point of is , the sequence is simply an initial segment of the sequence used by at stage .555We could have arranged matters so that was also a -sequence in , but this will not be important for the argument. It follows that, if we look at the forcing in , we can write it as a product
[TABLE]
There is a slight abuse of notation in the second factor, since the set is not an ordinal. Nevertheless, we trust that our meaning is clear. Observe also that, since does not add bounded subsets to , we know
[TABLE]
Let be -generic over ; in particular, it is also generic over . Since is generic for a forcing that is -cc in , it follows that is still closed under -sequences in . We can conclude from this that is -strategically closed in . This is because this poset is such in , being an Easton support iteration all of whose iterands are at least -strategically closed according to Lemma 19. As we mentioned, the model is closed under -sequences in , and therefore the winning strategy in the closure game for of length in remains winning in the larger model (since any losing play would be of length shorter than and available in the smaller model). This, together with the fact that has only many dense open subsets from (and therefore only many maximal antichains), allows us to build, using 28 in , a -generic over and lift the embedding to
[TABLE]
We can now force over , using the factorization (1), to complete to which is fully -generic over . In the extension we can finally also lift the map through the last two stages of forcing and obtain
[TABLE]
where is the filter generated by the pointwise image of . The lift through is straightforward: the critical point of is , so . On the other hand, the forcing is at least -strategically closed in , so 27 together with the knowledge that is a -extender embedding show that the pointwise image of really does generate a generic filter.
Composing the two lifts of and gives us a lift of . The situation is summarized in the following diagram; we should keep in mind that the pictured embeddings exist in .
[TABLE]
As the final act of forcing, let be -generic over . We claim that is our desired final extension. Recall that Lemma 24 tells us that we can also write this extension as for some generic and . We will work from now on in this final model, using this alternative representation, and try to lift the embedding .
By Lemma 31 we know that is forcing equivalent to in . It follows from this by elementarity that the poset is equivalent to in . Now we return to an assumption we made at the start of the proof. Since has an -generic over , we can use this equivalence to also find a -generic over . Using 30, we can combine this term forcing generic with the -generic to extract an -generic over in . Since the forcing is -distributive in , 27 again tells us that the pointwise image generates a -generic filter over . It is not necessarily the case that , but we can surgically666See [5, Theorem 25.1] or [4, Theorem 1, Second step] for fairly detailed examples of this concrete use of the surgery method. alter to obtain another -generic over for which this will be the case, and we are able to lift to
[TABLE]
We can now forget about the maps and and focus solely on . To complete the lift, observe that remains -distributive in by Easton’s lemma, and so 27 implies that the filter generates a generic over , which gives us our final lift
[TABLE]
Since was originally a -extender embedding, the same remains true for the lifted embedding, by 26. Since we clearly have in the final model, Lemma 34 tells us that the lift is the ultrapower by a normal measure.
Lemma 37**.**
The embedding witnesses in .
Proof.
Let us write . We need to show that every subset of in appears in . To that end, we will first show that is already in . This follows from Lemma 33: the forcing to add is -distributive in , and is -cc (and therefore trivially -cc) in , since it is equivalent to in that model, as we explained in the proof of Lemma 24. Moreover, because of the distributivity of the forcing to add , the poset is -cc in the model as well. Lemma 33 then implies that the forcing to add to could not have added , and so is already in that model.
We next show that has a name in . To start with, let be a nice -name for . Observe that is actually a subset of (even though it is not an element of ), so the name is as well. Moreover, since is -cc, has size . But as a -sized subset of , the name could not have been added by the -distributive forcing to add , and we conclude that . Now, since is -cc and , we know that , so the name also appears in .
It follows that we can interpret the name by the generic filter in to find the set in that model. Finally, we can conclude that contains all the subsets of from , and so does as well. ∎
We have shown that holds in . To finish the proof we also need to see that is the least measurable cardinal in that model. This follows easily from the way we designed the forcing . If were measurable in , it must definitely be inaccessible in . It follows that we did some nontrivial forcing at stage in the iteration and Lemma 22 implies that after the stage forcing is not measurable. The remaining forcing to get from that model to the model is at least -strategically closed, which means that it could not have possibly added any measures on . We can therefore conclude that remains nonmeasurable in . ∎
The iteration we used is essentially the one described in [1, Section 4]. It follows from the results outlined there that, had we additionally assumed in Theorem 35 that were -supercompact, this would remain true in the resulting extension.
Corollary 38**.**
If GCH holds and is -supercompact, then there is a forcing extension in which holds, and is -supercompact and the least measurable.
By starting with a stronger large cardinal hypothesis and modifying the forcing iteration appropriately, we can push up the value of beyond just and capture even more powersets. In order to state the results as simply as possible, we make the following definition to add some convenient stages to the hierarchy of strong cardinals.
Definition 39**.**
If is a set, a cardinal is called -strong if there is an elementary embedding with critical point and a transitive inner model with .
Theorem 40**.**
Assume GCH holds and suppose that is -strong for some regular cardinal which is not the successor of a cardinal of cofinality less than . Then there is a forcing extension in which is the least measurable cardinal, , and holds (meaning that a single normal measure on captures every for ).
Note that this is a strict improvement over Theorem 35 (we can pick in the present theorem to recover the previous one). In particular, the value of is optimal in the presence of , since this capturing property implies for each , and those in turn imply that , as we remarked earlier.
Proof.
The argument is much like the proof of Theorem 35, with a handful of changes: we will modify the forcing used slightly, and, more importantly, instead of preparing the model as in [4], we use a preparation due to the second author. The different preparatory forcing also leads to the additional hypothesis on and, even assuming GCH in the ground model, will require some cardinal arithmetic calculations in order to be able to apply Lemma 22.
As mentioned, we first use [12, Corollary 2.7] to pass to a forcing extension of in which the following hold:
- (1)
and . 2. (2)
is -strong and this is witnessed by a -extender embedding ; moreover, is closed under -sequences. 3. (3)
There is a function such that is regular and not the successor of a cardinal of cofinality less than for all inaccessible , and . 4. (4)
There is in an -generic filter for the poset .
The hypothesis on the values of in (3) will allow us to conclude some cardinal arithmetic facts in , as we will describe momentarily. But first, let us briefly sketch the key parts of the preparatory forcing (details can be found in [12, Section 2.2]). First, we force, if necessary, with Woodin’s fast function forcing to add a function (see [12, Section 2.1]) which satisfies for some embedding witnessing the -strongness of . This may be assumed to have the properties described in the previous paragraph.
The following forcing is the Easton supported product of a collection of -closed forcings , where runs through the set , where is the set of measurable closure points of the function . Each is a lottery sum of forcing notions which are very close to being equal to ; more precisely, they are equal to , where is the ultrapower embedding derived from some normal measure on (see [12, Section 3.1] for more details on the connection between the and Cohen forcing at ). In any case, the forcing notions constituting live morally speaking on successors of cardinals in , so the product-style definition of is more natural (the Easton support iteration is usually indicated when nontrivial forcing is done on a stationary set below ). Additionally, and equally important, the product-style definition allows us to deal first with and only later with the rest of , using the mutual genericity of the respective forcing notions. See [12, Lemma 2.3, Lemma 2.4] for more details.
Lemma 41**.**
In , if is Mahlo and then .
Proof sketch.
It will suffice to show that for any Mahlo , any satisfying , and any inaccessible . Given such a , we can split up the product by grouping coordinates with indices less than separately, and those with indices greater than or equal to separately. The forcing is -closed, so it will not affect the value of . Let us focus on .
Since is inaccessible in , we know that it cannot belong to any interval , since the forcing forced . In other words, we know that for all in . It follows that has size at most . From here, a simple calculation shows that there are at most many nice -names for functions . Since GCH holds in , we get if and if . This means that, in , there are either or many functions , depending on the cofinality of . Now recall that we wish to see that in . We already know that , so the required inequality is immediate in the case that . In the other case, when , we recall that we assumed that was not the successor of a cardinal of cofinality less than . Since , it cannot be that is equal to , so , as required. ∎
A similar argument also shows that if then, in , we have for all .
The point of these calculations is to conclude that starting from , we can apply Lemma 22 to successively destroy the measurability of all cardinals below , even without assuming GCH.
Let us now move on from the preparatory forcing. In the interest of simpler notation, we will write just instead of , and assume that all the properties enumerated above hold in . The initial iteration will now be an Easton support iteration which forces at inaccessible cardinals with the forcing , with being an appropriate -sequence, provided that is inaccessible in .
Since factors at each inaccessible into a two-step iteration of a small forcing (definitely of size less than ) and a -strategically closed forcing, we can readily see that remains a strong limit cardinal after forcing with . Moreover, since is -cc, will remain inaccessible and there will be nontrivial forcing at stage of the iteration , so we can write
[TABLE]
The full forcing that will give us the theorem is then
[TABLE]
The argument now proceeds very much like the proof of Theorem 35, but with some simplifications due to the difference between the preparations from [4] and [12]. We sketch the argument here, referring to the previously given proof and noting the main differences.
Let be -generic over . We wish to lift the embedding to the extension in the model . Given the factorization of above, we need to find a -generic over . Previously we worked with the embeddings and , but now we will be able to do without.777In fact, we could have employed the methods of [12] even in the previous theorem, but we decided to give more details for the specific case .
Consider any dense open subset of in . Since was a -extender embedding, this has the form for some and some . For each fixed like this, the set is an element of , since and this model can evaluate this function and the resulting names and collect them together. Let be the subset of those elements of the form that are dense open subsets of . Then is also an element of , since . The set has size (at most) in . Since the first stage of forcing in occurs beyond , the forcing is -strategically closed in . This means that is a dense open subset of , and is also a subset of .
Finally, observe that there are many functions (counted in ), and therefore only many dense sets . Since the forcing is composed of a -cc part, a -distributive part, and another -cc part, applying 29 twice allows us to conclude that is closed under -sequences in . It follows that remains -strategically closed in , which will allow us to line up and meet all the dense sets in turn, and so build a generic for . This allows us to lift the embedding to
[TABLE]
in .
For the final step of the lift, we use Lemma 24 to see as the iteration . The lift through the forcing proceeds as in the proof of Theorem 35, except that we deal directly with the embedding instead of passing through and as before. We apply Lemma 31 to in and use our starting assumption that we have an -generic for that poset in ; a surgery argument like the one we alluded to before allows us to build a suitable -generic over and lift to
[TABLE]
The lift through the final forcing is handled exactly as in the proof of Theorem 35.
It remains for us to see that this lifted embedding witnesses in the final model and that is the least measurable cardinal there.
We need to show that every bounded subset of in appears in the target model of the lifted embedding . This works almost exactly as in Lemma 37. We first use Lemma 33 to show that is already in . Then we argue that has a name in . This is because we can find a nice -name for in , of size less than , that is a subset of . Since the forcing to add is -distributive, this name could not have been added by it, so . But since is -cc and (as witnesses the -strongness of ), it follows that . As in the previous proof, this means that we can interpret in to find in that model, as well as in the target model of . So the lifted embedding really does witness .
To see that is the least measurable cardinal in the final model, we simply inspect our construction of the forcing . If were measurable in the final model, it must necessarily be Mahlo in the intermediate extension , and so some nontrivial forcing must have occurred in the next step. It follows from Lemma 41 that, over this model, the next step of forcing with destroyed the measurability of , and the remainder of the forcing possesses too much closure to ever recover this measurability. ∎
Conversely, we can extend Cummings’ argument to show that the large cardinal hypothesis we used above is optimal.
Theorem 42**.**
Suppose that holds for some regular cardinal . Then is -strong in an inner model. Moreover, this inner model satisfies GCH, and so is -strong there, where .
Proof.
This is essentially standard. Suppose that is an ultrapower embedding by a normal measure witnessing ; it follows that .888Recall that implies , so being in is weaker than being in , where . In particular, might not be -strong in . We assume that there is no inner model with a strong cardinal and let be the core model with the (nonoverlapping) extender sequence . It follows that is the result of a normal iteration of and, since the critical point of is , the first extender applied in this iteration must have index for some . Since is coherent, the sequence has no extenders with indices for . But since captured all of , we must have , and so and must agree up to . It follows that and so (and is -strong) in .
Since satisfies GCH, is a transitive set of size there. It follows that the transitive closure of each element of has size strictly less than , so these elements appear in the codomain of the embedding witnessing the -strongness of in . ∎
The preparation from [12] works even for singular of cofinality strictly above (if the cofinality of is equal to , we get in (1) above). It is unclear, however, whether Theorem 40 can allow for this weaker hypothesis (in particular, Lemma 24 seems to rely crucially on the second parameter in the forcing being regular).
Question 43**.**
Can Theorem 40 be improved to allow for arbitrary of cofinality strictly above ?
Another question raised by Theorem 40 is whether can fail for the first time at some . The following theorem shows that the answer is yes.
Theorem 44**.**
Suppose that there is no inner model with a strong cardinal and let be the core model. Suppose that is -strong. Then there is a forcing extension in which is the least measurable cardinal, , and holds while fails.
Proof.
We will use the same forcing as in the proof of Theorem 40, letting (note that the core model satisfies GCH, so the hypotheses of that theorem are satisfied). That is, we shall force with
[TABLE]
using the notation from the proof of Theorem 40. We already know that after forcing with this we obtain and , while becomes the least measurable cardinal. To obtain the desired extension, we shall force with .
Lemma 45**.**
The forcing remains -distributive in .
Proof.
This is essentially a version of Easton’s lemma. Let us write . We can rewrite as
[TABLE]
using Lemma 24. It follows from [12, Lemma 2.3] that is -cc, and, of course, is -closed in .
Now let be an -name for a -sequence of ordinals. For an ordinal , a condition , and an -name for a condition in , say that the pair is -good if there is a maximal antichain of conditions such that decides the value of . We will see that any condition in can be strengthened to one whose latter two coordinates are -good for all .
Pick and as above and consider the set of all such that decides . This is an open set of conditions, so we may pick a maximal antichain from this set, and it will remain an antichain as a subset of . If is already a maximal antichain in , then is 0-good. Otherwise we can find some which is incompatible with every condition in . We can also find some which decides . Using a mixing argument, let be an -name such that and . Now consider the set of all such that decides . This set includes as well as , so we may again pick a maximal antichain from it. If turns out to be maximal in , then is 0-good, and otherwise we can keep going.
We continue recursively, constructing larger and larger antichains . At limit stages we take unions of the previously constructed antichains and use the -closure of and the (forced) -closure of to find lower bounds for the sequences of conditions and . The closure suffices to continue this construction for all (although notice that the degree of closure in the component is too low to find a putative lower bound ). However, the construction must in fact stop at some stage before , otherwise the union would be an antichain in of size , contradicting the chain condition of that poset. Once the construction stabilizes, we’ve reached a 0-good pair , as witnessed by the maximal antichain . Notice that and .
Repeating the same argument for all , we see that, starting with any and , we can find and such that is -good. Since any pair stronger than an -good pair is itself -good, we can use closure in both coordinates one last time to find, below any , a pair which is -good for all .
Finally, let be generic. By the density property just described, we can find a condition whose latter two coordinates are -good for all . But given such a condition, we can find by consulting where the generic (or even ) meets the maximal antichain witnessing the -goodness of . Therefore we can find , which is what we needed to show. ∎
The poset has size in (since we have GCH), so it remains -cc in the extension by . Since Lemma 45 shows that this poset is also -distributive in the extension by , it follows that cardinals are preserved to the final extension by and that remains the least measurable cardinal. Moreover, the ultrapower embedding witnessing lifts to the extension by 27 and, since the extension by does not add any subsets of , the lifted embedding still witnesses .
Lemma 46**.**
* fails in the final extension.*
Proof.
Recall that we are forcing over using the poset
[TABLE]
which we can rewrite in the form
[TABLE]
Let be generic over for this poset. Now suppose that holds in the final extension . This means that there is a normal ultrapower
[TABLE]
on which captures both and (which can be coded as a subset of , since GCH holds in ). Above, we intended to be -generic over , to be -generic over , and to be generic over for the remaining Cohen forcing. Since no cardinals were collapsed between and the final extension and we insisted that , we can conclude that this model computes correctly.
Since is an elementary embedding of a generic extension of the core model, its restriction to is an iteration of the core model itself, and therefore is an inner model of .999This is the only place we use the fact that we started this construction in the core model. This implies that (since we explicitly put this powerset into ) and also that GCH holds in .
Consider the forcing , where is the factor of indexed at . Note that really is an initial segment of , since we necessarily have for . The forcing has size , and it follows from the precise description of in [12, Section 2.2] and Lemma 32 that is equivalent, over , to . Since satisfies GCH, this poset is -Knaster in . As the product of two -Knaster posets, is itself -Knaster in , which implies that its square is -cc in .
Unger [16, Lemma 2.4] showed that any poset whose square was -cc for some regular has the -approximation property, which states that any set of ordinals in the extension, all of whose subsets of size less than are in the ground model, must itself be in the ground model. As a special case, such forcings cannot add fresh subsets of (recall that a set of ordinals is fresh over a model if it is not in that model but all of its initial segments are). Applying this to our situation, we can see that forcing over by does not add any new fresh subsets of . Of course, is a fresh subset of over , and since and have the same bounded subsets of , it is also fresh over . Therefore is not added to by . Moreover, the tail forcing is -closed over by [12, Lemma 2.3], and therefore does not add any subsets of to the extension of by by Easton’s lemma. Hence, does not appear in .
Now let us write , where is generic for , and is generic for . As was the case above, really is an initial segment of , for the same reason. The forcing has size and therefore cannot add to by another application of Unger’s result. On the other hand, the forcing to add is -distributive and therefore also cannot add .
Note that satisfied and by [12, Corollary 2.7]. This remains true after adding as well, and Corollary 18 tells us that the forcing is -Knaster, which implies that its square is -cc. Applying Unger’s result yet again, we see that does not appear in . On the other hand, the tail forcing adding is -closed, and also does not add .
Finally, observe that the forcing to add is at least -distributive, so it definitely cannot add to . But this contradicts our original assumption that . ∎
To summarize, we’ve obtained a forcing extension of in which is the least measurable cardinal, holds, but fails, as required. ∎
One would expect that it should be possible to force and starting from a large cardinal hypothesis weaker than an -strong cardinal ; an -strong and -tall cardinal likely suffices (recall that is -tall if there is an elementary embedding with critical point such that is closed under -sequences and ; see [11]).
Question 47**.**
What is the consistency strength of and holding at the least measurable cardinal but failing?
It is also unclear whether the anti-large cardinal hypothesis and use of the core model are crucial for the above result. The only use of that hypothesis comes when we wish to understand the nature of generic embeddings of the ground model. It is plausible that one could use Hamkins’ results on elementary embeddings in generic extensions with the approximation and cover properties (see [10]) to prove a more general result, but those theorems do not interact well with the product nature of our preparation . One potential approach would be to mimic the proof of Theorem 35 but to weave more complicated forcing into the preparation.
Question 48**.**
Can one obtain a model as in Theorem 44 without starting from the core model?
At the end of the paper, let us give another example of the power of Lemma 34 in showing that holds in known forcing extensions. As we have seen, does not have any implications for the outright size of , since it may consistently hold at the least measurable cardinal . But one might try to measure its effects slightly differently. While the capturing property says that there is a normal measure on which is quite “fat”, in the sense that it captures all subsets of , perhaps must inevitably also carry some, or many, “thin” measures which do not capture much at all. In other words, perhaps has some implications about the number of normal measures on . A combination of Lemma 34 and a theorem of Friedman and Magidor will show us that this is not the case.
Theorem 49**.**
If is the minimal extender model with a -strong cardinal and is a cardinal, then there is a forcing extension in which carries exactly many normal measures and each of them witnesses . In particular, it is consistent that has a unique normal measure and holds.
Proof.
The hard part of the proof was done by Friedman and Magidor [6, Theorem 19], who showed that, starting from a model as in the hypothesis of this theorem, there is a forcing extension satisfying in which carries exactly many normal measures. They also show that each of these normal measures is derived from a lift of the ground model extender embedding witnessing the -strongness of . However, Lemma 34 implies that these lifts are themselves already ultrapowers by a normal measure on . Finally, an analysis of their proof shows that the forcing used to obtain the model can be written as where is a -cc poset which is regularly embedded in , and is forced to be -distributive. It follows that every subset of in has a nice name in and therefore appears in . ∎
It is unclear whether one can obtain similar results at the least measurable cardinal . It seems likely that, to do so, it would be necessary to adapt the forcing to incorporate the Sacks forcing machinery that Friedman and Magidor used in their arguments.
Question 50**.**
Is it consistent that the least measurable cardinal carries a unique normal measure and holds?101010In a personal communication, James Cummings has answered this question in the affirmative. He showed that in the Friedman–Magidor model described in Theorem 49 is the only measurable cardinal.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Arthur W. Apter and Saharon Shelah, Menas’ result is best possible , Transactions of the American Mathematical Society 349 (1997), no. 5, 2007–2034. MR 1370634
- 2[2] by same author, On the strong equality between supercompactness and strong compactness , Transactions of the American Mathematical Society 349 (1997), no. 1, 103–128. MR 1333385
- 3[3] James Cummings, A model in which GCH holds at successors but fails at limits , Transactions of the American Mathematical Society 329 (1992), no. 1, 1–39. MR 1041044
- 4[4] by same author, Strong ultrapowers and long core models , The Journal of Symbolic Logic 58 (1993), no. 1, 240–248. MR 1217188
- 5[5] by same author, Iterated forcing and elementary embeddings , Handbook of set theory. Vols. 1, 2, 3, Springer, Dordrecht, 2010, pp. 775–883. MR 2768691
- 6[6] Sy-David Friedman and Menachem Magidor, The number of normal measures , The Journal of Symbolic Logic 74 (2009), no. 3, 1069–1080. MR 2548481
- 7[7] Moti Gitik, The negation of the singular cardinal hypothesis from o ( κ ) = κ + + 𝑜 𝜅 superscript 𝜅 absent o(\kappa)=\kappa^{++} , Annals of Pure and Applied Logic 43 (1989), no. 3, 209–234. MR 1007865
- 8[8] Moti Gitik and Carmi Merimovich, Possible values for 2 ℵ n superscript 2 subscript ℵ 𝑛 2^{\aleph_{n}} and 2 ℵ ω superscript 2 subscript ℵ 𝜔 2^{\aleph_{\omega}} , Annals of Pure and Applied Logic 90 (1997), no. 1-3, 193–241. MR 1489309
