This paper demonstrates, assuming large cardinal axioms, that for all infinite cardinals, the square principle holds and there exists a stationary set with a highly saturated non-stationary ideal, linking combinatorial principles with saturation properties.
Contribution
It establishes the consistency of square principles and saturation of non-stationary ideals simultaneously across all infinite cardinals, under large cardinal assumptions.
Findings
01
Square principles hold for all infinite cardinals.
02
Existence of a stationary set with a highly saturated non-stationary ideal.
03
Consistency results relative to large cardinals.
Abstract
We show that it is consistent relative to a huge cardinal that for all infinite cardinals κ, □κ holds and there is a stationary S⊆κ+ such that NSκ+↾S is κ++-saturated.
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.
Full text
Local saturation and square everywhere
Monroe Eskew
Universität Wien
Institut für Mathematik
Kurt Gödel Research Center
Augasse 2-6, UZA 1 - Building 2
1090 Wien
AUSTRIA
Abstract.
We show that it is consistent relative to a huge cardinal that for all infinite cardinals κ, □κ holds and there is a stationary S⊆κ+ such that NSκ+↾S is κ++-saturated.
The author is grateful to Sean Cox, Yair Hayut, Masahiro Shioya, Toshimichi Usuba, and Martin Zeman for some very helpful discussions. The author would also like to thank the anonymous referee for their valuable suggestions, which led to significant improvements of the manuscript.
1. Introduction
In his work on Suslin’s problem, Jensen introduced the principles square □ and diamond ♢ and proved that they hold everywhere in Gödel’s constructible universe L [12]. More specifically, in L, □κ holds for every infinite cardinal κ, and ♢κ(S) holds for all regular uncountable κ and all stationary S⊆κ. A natural opposite of ♢κ(S) is the statement that the nonstationary ideal on κ restricted to S, denoted NSκ↾S, is κ+-saturated. If such a stationary set S⊆κ exists, we will say that NSκ is locally saturated.
While it is consistent relative to large cardinals that NSκ is locally saturated for a variety of cardinals κ, Gitik and Shelah [10] proved that the unrestricted NSκ can never be κ+-saturated, except in the case κ=ω1. For background on saturated ideals and related topics, see [7].
Forcing NSκ to be locally saturated typically results in the failure of □ in the vicinity of κ as a side-effect. Moreover, Foreman [7] observed that certain structural properties of Booelan algebras of the form P(κ+)/I for κ+-complete ideals I can imply the failure of □κ. A similar result was observed by Zeman in unpublished work, which we reproduce here with his permission. Furthermore, square principles are generally opposed to very large cardinals, while saturation properties of ideals can carry significant large cardinal strength [16]. It is thus natural to ask what is the extent of the tension between these kinds of principles. We address the situation with the following result:
Theorem 1**.**
It is consistent relative to a huge cardinal that for all infinite cardinals κ, □κ holds and NSκ+ is locally saturated.
This improves a result of Foreman [6], who proved that it is consistent relative to a huge cardinal that every successor cardinal κ carries a κ+-saturated ideal. One can check using standard arguments that in his model, ♢κ(S) holds for every regular κ and every stationary S⊆κ. We suspect that □κ fails for all κ≥ω1 in his model because a sufficient amount of stationary reflection holds at successor cardinals. This should follow for successors of regulars by arguments like that for Proposition 5.4 below, and for successors of singulars by arguments along the lines of [3, Theorem 11.1].
The saturation of NSω1 is equiconsistent with a Woodin cardinal; this is due to Shelah and Jensen-Steel [13]. For general successors of regular cardinals, Woodin showed in unpublished work how to force local saturation from an almost-huge cardinal, and details were given by Foreman and Komjath [9]. Because of the particulars of their construction, it was not immediately clear how to extend the result to get the nonstationary ideal to be locally saturated on several successive cardinals at once. We overcome this technical challenge by using a crucial observation of Usuba and by building on the alternative approach to saturated ideals forged by Shioya [18]. In order to achieve the global result, we use Cummings’ method of interleaving posets into Radin forcing [2]. An earlier version of this manuscript used a supercompact-based Radin forcing. The advantage of Cummings’ method is that since it is based on a degree of strongness rather than supercompactness, it is possible to carry out in a universe in which square holds everywhere.
The paper is organized as follows. In Section 2, we present the essential background material on forcing and large cardinals that we will need. In Section 3, we present a “modular” version of the Foreman-Komjath construction that allows us to transform a saturated ideal on a successor cardinal into a localization of the nonstationary ideal while retaining saturation, given that the original ideal satisfies certain combinatorial properties. In Section 4, we define a type of collapse forcing that, when combined with certain large cardinals, forces the existence of saturated ideals on successor cardinals that possess the desired combinatorial properties in a rather indestructible way. At the end of this section, we present a new model in which the nonstationary ideal on the successor of a given regular cardinal is locally saturated, using a forcing considerably simpler than that of [9]. In Section 5, we construct a preparatory model in which square holds everywhere, local saturation holds at the first few successors of every Mahlo cardinal, and there exists a superstrong cardinal. Finally, in Section 6, we complete the proof of Theorem 1 using a version of Radin forcing that achieves the desired property at all successors of limits by ensuring that every such cardinal was a successor of a large cardinal in the preperatory model, while interleaving posets that recreate the desired situation at double successors.
2. Preliminaries
2.1. General forcing facts
We start by recalling some general notions and folklore results about forcing, most of which we state without proof.
A partial order P is said to be separative when p≰q⇒(∃r≤p)r⊥q. Every partial order P has a canonically associated equivalence relation ∼s and a separative quotient Ps, which is isomorphic to P if P is already separative. For every separative partial order P, there is a canonical complete Boolean algebra B(P) with a dense set isomorphic to P.
A map e:P→Q is an embedding when it preserves order and incompatibility. An embedding is said to be regular when it preserves the maximality of antichains. If P⊆Q, we say P is a regular suborder if the identity map from P to Q is a regular embedding. A order-preserving map π:Q→P is called a projection when π(1Q)=1P, and p≤π(q)⇒(∃q′≤q)π(q′)≤p.
Lemma 2.1**.**
Suppose P and Q are partial orders.
(1)
G* is a generic filter for P if and only if {[p]s:p∈G} is a generic filter for Ps.*
2. (2)
e:P→Q* is a regular embedding if and only if for all q∈Q, there is p∈P such that for all r≤p, e(r) is compatible with q.*
3. (3)
The following are equivalent:
(a)
There is a regular embedding e:Ps→B(Qs).
2. (b)
There is a projection π:Qs→B(Ps).
3. (c)
There is a Q-name g˙ for a P-generic filter such that for all p∈P, there is q∈Q such that q⊩p∈g˙.
4. (4)
Suppose π:Q→P is a projection. If G is a filter on P, let Q/G=π−1[G]. The following are equivalent:
(a)
H* is Q-generic over V.*
2. (b)
G=π[H]* is P-generic over V, and H is Q/G-generic over V[G].*
Lemma 2.2**.**
Suppose P and Q are partial orders. B(Ps)≅B(Qs) if and only if the following holds. Letting G˙,H˙ be the canonical names for the generic filters for P,Q respectively, there is a P-name for a function f˙0 and a Q-name for a function f˙1 such that:
(1)
⊩Pf˙0(G˙)* is a Q-generic filter,*
2. (2)
⊩Qf˙1(H˙)* is a P-generic filter,*
3. (3)
⊩PG˙=f˙1f˙0(G˙)(f˙0(G˙)), and ⊩QH˙=f˙0f˙1(H˙)(f˙1(H˙)).
An isomorphism is given by p↦∣∣pˇ∈f˙1(H˙)∣∣B(Qs).
A partial order P is said to be κ-closed when any descending sequence of elements of length less than κ has a lower bound. A weaker property is being κ-strategically closed, which is when the “good” player has a winning strategy in the following game: Bad starts by playing some element p0∈P, and Good must play some p1≤p0. The players alternate in choosing elements of a descending sequence, with Good playing at limit stages. Good wins if a sequence of length κ is produced, and Bad wins if at some stage α<κ, a sequence has been produced with no lower bound. A still weaker property is being κ-distributive, which means that the intersection of fewer than κ dense open sets is dense.
If κ<λ are ordinals, Col(κ,λ) is the collection of function whose domain is a bounded subset of κ and whose range is contained in λ, ordered by p≤q iff p⊇q. We will use the following well-known lemma about κ-closed forcing:
Lemma 2.3**.**
If P is a κ-closed partial order that forces ∣P∣=κ, then B(P)≅B(Col(κ,∣P∣)).
A partial order P has the κ-chain condition (κ-c.c.) if every antichain A⊆P has size <κ.
Lemma 2.4** (Easton).**
Suppose P,Q are partial orders, Q is κ-distributive, and ⊩QP is κ-c.c. Then ⊩PQ is κ-distributive.
Proof.
Suppose G×H is P×Q-generic, and X is a sequence of orindals of length <κ in V[G][H]. Then in V[H], X has a P-name τ, and by the κ-c.c., τ can be assumed to be a subset of V of size <κ. By the distributivity of Q, τ∈V, so τG=X∈V[G].
∎
The above lemma was crucial in Easton’s proof [4] that the continuum function can be “anything reasonable.” There, he introduced the notion of an Easton-support product, which we will use several times. A set of ordinals X is Easton for every regular cardinal κ, ∣X∩κ∣<κ. A collection of partial functions has Easton support if the domain of each function in the collection is an Easton set of ordinals.
We will use several times a stronger version of the κ-c.c. introduced by Shelah [17] which is easier to preserve under other forcings:
Definition**.**
Let κ be a regular cardinal and S⊆κ.
A partial order P is S-layered if there is a ⊆-increasing sequence of regular suborders ⟨Qα:α<κ⟩ such that P=⋃α<κQα, each ∣Qα∣<κ, and for some club C and all α∈S∩C, Qα=⋃β<αQβ.
Lemma 2.5**.**
If S is a stationary subset of κ and P is S-layered, then P is κ-c.c.
Lemma 2.6**.**
Suppose S⊆κ is stationary, P is S-layered, ⊩PQ˙ is Sˇ-layered, and R is regular suborder of P of size <κ. Then:
(1)
P∗Q˙* is S-layered.*
2. (2)
⊩RP/G˙* is S-layered.*
Proof.
For (1), let ⟨Pα:α<κ⟩ witness that P is S-layered, and let ⟨Q˙α:α<κ⟩ be a sequence of P-names for a witness to the S-layeredness of Q. By the κ-c.c., we may assume that we have an increasing sequence ⟨βα:α<κ⟩ of ordinals below κ such that for each α, Q˙α is a Pβα-name. Let C⊆κ be a club such that each γ in C is closed under α↦βα. Now assume γ∈C∩S. Pγ=⋃α<γPα, and ⊩Q˙γ=⋃α<γQ˙α. Hence we may form a Pγ-name for Q˙γ. It is routine to show that Pγ∗Q˙γ is a regular suborder of P∗Q˙.
For (2), let γ be such that R⊆Pγ. Then R is regular in Pα for α≥γ. If G⊆R is generic, then Pα/G=⋃γ≤β<αPβ/G for all α∈S∖γ.
∎
2.2. Large cardinals and generic embeddings
A cardinal κ is called huge if there is an elementary embedding j:V→M with critical point κ, where M is a transitive class such that Mj(κ)⊆M. κ is called almost-huge if the closure requirement of M is weakened to M<j(κ)⊆M. κ is called superstrong if the requirement is weakened further to just Vj(κ)⊆M. The value of j(κ) in each case will be called the target.
It is straightforward to show that κ is huge with target λ iff there is a normal κ-complete ultrafilter on [λ]κ:={z⊆λ:ot(z)=κ}. The first-order characterizations of almost-hugeness and superstrongness are more complicated, and we refer the reader to [14] for details. We will just need the following facts:
Lemma 2.7**.**
Suppose κ is almost-huge with target λ. Then there is an elementary j:V→M with the following properties:
(1)
crit(j)=κ, j(κ)=λ, and M<λ⊆M.
2. (2)
For all x∈M, there is an ordinal α<λ and a function f:α<κ→V such that x=j(f)(j[α]).
3. (3)
supj[λ]=j(λ)<λ+.
4. (4)
The embedding is generated by a tower of measures T⊆Vλ, which we will call a (κ,λ)-tower. The fact that T generates an embedding with the above properties is equivalent to a first-order property in ⟨Vλ,∈,T⟩.
Lemma 2.8**.**
Suppose κ is superstrong with target λ. Then there is an elementary j:V→M with the following properties:
(1)
crit(j)=κ, j(κ)=λ, and Vλ⊆M.
2. (2)
For all x∈M, there is an a∈[λ]<ω and a function f:[κ]∣a∣→V such that x=j(f)(a).
3. (3)
If cf(λ)>κ, then Mκ⊆M.
4. (4)
The embedding is generated by a (κ,λ)-extender E. The fact that E generates an embedding with the above properties is equivalent to a first-order property in ⟨Vλ,∈,E⟩.
Silver observed that if j:M→N is an elementary embedding between models of set theory, P∈M is a partial order, and G is P-generic over M, then j can be extended to an elementary embedding with domain M[G] if and only if we can find a filter G^ that is j(P)-generic over N, with j[G]⊆G^. We now describe some general situations in which almost-huge and superstrong embeddings can be generically extended.
Definition**.**
A partial order Q is (κ,λ)-nice when there is a sequence ⟨Qα:α≤λ⟩ of regular suborders such that:
(1)
*The sequence is ⊆-increasing, ⋃α<λQα=Qλ=Q, and for all α<λ, ∣Qα∣<λ.
*
2. (2)
*For each α≤λ, any two compatible elements of Qα have an infimum in Qα, and every directed subset of Qα of size <κ has an infimum in Qα.
*
Lemma 2.9**.**
Suppose the following:
(1)
j:V→M* is an almost-huge embedding derived from a (κ,λ)-tower.*
2. (2)
P⊆Vκ* is a partial order, and j(P) is λ-c.c. in V.*
3. (3)
Q˙* is a P-name for a (κ,λ)-nice partial order.*
4. (4)
There is a projection π:j(P)→P∗Q˙ such that for p∈P, π(p)=(p,1˙).
If G^ is j(P)-generic over V and G∗H=π[G^], then in V[G^] we can extend j to j:V[G∗H]→M[G^∗H^], such that M[G^∗H^]<λ∩V[G^]⊆M[G^∗H^].
Proof.
Let G^⊆j(P) be generic, and let G∗H=π[G^]. Since π and j are the identity on P, we can extend to j:V[G]→M[G^]. By the λ-c.c. and the closure of M, Ord<λ∩V[G^]⊆M[G^]. We will build the desired H^ in V[G^], so we will get Ord<λ∩V[G^]⊆M[G^∗H^] as well.
Let ⟨Qα:α≤λ⟩ witness the (κ,λ)-niceness of Q in V[G]. For each α<λ, let Hα=H∩Qα, and let mα=infj[Hα], which exists because j[Hα] is an element of M[G^] and a directed subset of j(Qα) of size <j(κ).
Let us observe the following: If α<β<λ and q≤mα is in j(Qα), then q is compatible with mβ. To show this, note that for any r∈Qβ, set Dr={p∈Qα:p⊥r or (∀p′≤p)p′⊥r} is dense in Qα. Suppose towards a contradiction that q≤mα is in j(Qα) and q⊥mβ. Then by the directed closure, q⊥j(r) for some r∈Hβ. But there is p∈Dr∩Hα, and p⊥r. Since q≤mα≤j(p), by elementarity q is compatible with j(r), a contradiction.
Let ⟨Aα:α<λ⟩ list in V[G^] the maximal antichains of j(Q) that live in M[G^]. We inductively build a filter H^ that is j(Q)-generic over M[G^], and contains each mα. This will guarantee j[H]⊆H^, and thus by Silver’s criterion we will be done. Choose an increasing sequence of ordinals ⟨βα:α<λ⟩ such that Aα⊆j(Qβα). Find some a0∈A0 such that mβ0 is compatible with a0, and let q0=mβ0∧a0. Suppose inductively that for some γ<λ, we have constructed a descending sequence ⟨qα:α<γ⟩ such that for each α, qα∈j(Qβα) and qα≤aα∧mβα for some aα∈Aα. By the observation of the previous paragraph, mβγ is compatible with qα for all α<γ. Hence the directed set {mβγ∧qα:α<γ} has an infimum qγ′. Let qγ=qγ′∧aγ for some aγ∈Aγ. This completes the induction.
∎
Lemma 2.10**.**
Suppose the following:
(1)
j:V→M* is an superstrong embedding derived from a (κ,λ)-extender with λ inaccessible.*
2. (2)
P⊆Vκ* is a partial order, and j(P) is λ-c.c. in V.*
3. (3)
P* forces that the quotient j(P)/G is κ+-distributive.*
If G^ is j(P)-generic over V, then κ is superstrong with target λ in V[G^].
Proof.
Since P is κ-c.c., j(A)=A for every maximal antichain A⊆P, so P is a regular suborder of j(P). Let α<κ. Since every subset of α added by j(P) is added by P, reflection gives that there is a regular suborder Q⊆P of size <κ that adds all subsets of α. Thus M satisfies that for every α<λ, there is a regular suborder Q⊆j(P) of size <λ that adds all subsets of α. This is true in V as well, since by the λ-c.c., any j(P)-name τ for a subset of α is equivalent to an Q′-name τ′ for some regular suborder Q′∈Vλ⊆M, and τ′ must be equivalent to a Q-name by what M thinks of Q. Thus λ remains inaccessible after forcing with j(P).
Let G^ be j(P)-generic over V, and let G=G^∩P. We can extend j to j:V[G]→M[G^]. By the λ-c.c., every element of (Vλ)V[G^] is τG^ for some j(P)-name τ∈(Vλ)V. Since Vλ⊆M, (Vλ)M[G^]=(Vλ)V[G^].
For every x∈M[G^], there is a j(P)-name τ such that x=τG^, and there is an a∈[λ]<ω and a function f with domain [κ]∣a∣ in V such that τ=j(f)(a). We may assume that for every b∈domf, f(b) is a P-name. If we define a function g in V[G] by g(b)=f(b)G, then we have x=j(g)(a).
Let Q be the quotient j(P)/G in V[G], and let us write G^ as G∗H⊆P∗Q˙. Let D∈M[G^] be dense open subset of j(Q). Let a,g be a such that a∈[λ]<ω, g∈V[G] is a function with domain [κ]∣a∣, and D=j(g)(a). We may assume that g(b) is a dense open subset of P for all b∈domg. Let E=⋂b∈domgg(b). By the distributivity of Q, E is dense. Thus there is q∈E∩H. Since E⊆g(b) for all b∈domg, j(q)∈j(E)⊆D. Therefore the image j[H] generates a filter H^ which is j(Q)-generic over M[G^]. We may extend the embedding to j:V[G∗H]→M[G^∗H^]. Since (Vλ)V[G^]=(Vλ)M[G^]⊆(Vλ)M[G^∗H^]⊆(Vλ)V[G^], κ is superstrong with target λ in V[G^].
∎
2.3. Ideals and duality
We will be interested in extending embeddings that arise from forcing with Boolean algebras of the form P(Z)/I, where I is an ideal over Z, and in computing what happens to this algebra in generic extensions. To this end, we present an optimal generalization of a result of Foreman [8] on this topic from the author’s thesis [5]. Let us first review some basic facts concerning ideals, which can be found in [7]. An ideal I over a set Z, gives a notion of smallness or “I-measure-zero” for subsets of Z. We will sometimes refer to the family P(Z)∖I as I+ or the “I-positive sets,” and refer to the family {Z∖A:A∈I} as I∗ or the “I-measure-one sets.” Recall that an ideal I over a set Z is called precipitous if whenever G⊆P(Z)/I is generic, then the ultrapower VZ/G is well-founded.
Fact 2.11**.**
Let I be an ideal over Z⊆P(λ). Suppose that I is normal and λ+-saturated. Then I is precipitous, and whenever j:V→M⊆V[G] is a generic ultrapower embedding arising from I, then Mλ∩V[G]⊆M. Furthermore, if κ=μ+, then {z∈Z:cf(supz)=cf(μ)}∈I∗.
Theorem 2.12**.**
Suppose I is a precipitous ideal on Z and P is a Boolean algebra. Let j:V→M⊆V[G] denote a generic ultrapower embedding arising from I. Suppose K˙ is a P(Z)/I-name for an ideal on j(P) such that whenever G∗h is P(Z)/I∗j(P)/K˙-generic and H^={p:[p]K∈h}, we have:
(1)
1⊩P(Z)/I∗j(P)/K˙H^* is j(P)-generic over M,*
2. (2)
1⊩P(Z)/I∗j(P)/K˙j−1[H^]* is P-generic over V, and*
3. (3)
for all p∈P, 1⊮P(Z)/Ij(p)∈K˙.
Then there is P-name J˙ for an ideal on Z and a canonical isomorphism
[TABLE]
Proof.
Let e:P→B(P(Z)/I∗j(P)/K˙) be defined by p↦∣∣j(p)∈H^∣∣. By (3), this map has trivial kernel. By elementarity, it is an order and antichain preserving map. If A⊆P is a maximal antichain, then it is forced that j−1[H^]∩A=∅. Thus e is regular.
Whenever H⊆P is generic, there is a further forcing yielding a generic G∗h⊆P(Z)/I∗j(P)/K˙ such that j[H]⊆H^. Thus there is an embedding j^:V[H]→M[H^] extending j. In V[H], let J={A⊆Z:1⊩(P(Z)/I∗j(P)/K˙)/e[H][id]M∈/j^(A)}. In V, define a map ι:P∗P(Z)/J˙→B(P(Z)/I∗j(P)/K˙) by (p,A˙)↦e(p)∧∣∣[id]M∈j^(A˙)∣∣. It is easy to check that ι is order and antichain preserving.
We want to show the range of ι is dense. Let (B,q˙)∈P(Z)/I∗j(P)/K˙. Without loss of generality, there is some f:Z→V in V such that B⊩q˙=[[f]M]K. By the regularity of e, let p∈P be such that for all p′≤p, e(p′)∧(B,q˙)=0. Let A˙ be a P-name such that p⊩A˙={z∈B:f(z)∈H˙}, and ¬p⊩A˙=Z. 1⊩PA˙∈J+ because for any p′≤p, we can take a generic G∗h such that e(p′)∧(B,q˙)∈G∗h. Here we have [id]M∈j(B) and [f]M∈H^, so [id]M∈j^(A). Furthermore, ι(p,A˙) forces B∈G and q∈h, showing ι is a dense embedding.
∎
Proposition 2.13**.**
If Z,I,P,J˙,K˙,ι are as in Theorem 2.12, then whenever H⊆P is generic, J is precipitous and has the same completeness and normality that I has in V. Also, if Gˉ⊆P(Z)/J is generic and G∗h=ι[H∗Gˉ], then if j^:V[H]→M[H^] is as above, M[H^]=V[H]Z/Gˉ and j^ is the canonical ultrapower embedding.
Proof.
Suppose H∗Gˉ⊆P∗P(Z)/J˙ is generic, and let G∗h=ι[H∗Gˉ] and H^={p:[p]K∈h}. For A∈J+, A∈Gˉ if and only if [id]M∈j^(A). If i:V[H]→N=V[H]Z/Gˉ is the canonical ultrapower embedding, then there is an elementary embedding k:N→M[H^] given by k([f]N)=j^(f)([id]M), and j^=k∘i. Thus N is well-founded, so J is precipitous. If f:Z→Ord is a function in V, then k([f]N)=j(f)([id]M)=[f]M. Thus k is surjective on ordinals, so it must be the identity, and N=M[H^]. Since i=j^ and j^ extends j, i and j have the same critical point, so the completeness of J is the same as that of I. Finally, since [id]N=[id]M, I is normal in V if and only if J is normal in V[H], because j↾⋃Z=j^↾⋃Z, and normality is equivalent to [id]=j[⋃Z].
∎
Theorem 2.12 is optimal in the sense that it characterizes exactly when an elementary embedding coming from a precipitous ideal can have its domain enlarged via forcing:
Proposition 2.14**.**
Let I be a precipitous ideal on Z and P a Boolean algebra. The following are equivalent.
(1)
In some generic extension of a P(Z)/I-generic extension, there is an elementary embedding j^:V[H]→M[H^], where j:V→M is the elementary embedding arising from I and H is P-generic over V.
2. (2)
There are p∈P, A∈I+, and a P(A)/I-name K˙ for an ideal on j(P↾p) such that P(A)/I∗j(P↾p)/K˙ satisfies the hypothesis of Theorem 2.12.
Proof.
(2)⇒(1) is trivial. To show (1)⇒(2), let Q˙ be a P(Z)/I-name for a partial order, and suppose A∈I+ and H˙0 are such that ⊩P(A)/I∗Q˙ “H˙0 is j(P)-generic over M and j−1[H˙0] is P-generic over V.” By the genericity of j−1[H˙0], the set of p∈P such that ⊩P(A)/I∗Q˙j(p)∈/H˙0 is not dense. So let p0 be such that for all p≤p0, ∣∣j(p)∈H˙0∣∣=0. In VP(A)/I, define an ideal K on j(P↾p0) by K={p∈j(P↾p0):1⊩Qp∈/H˙0}. We claim K satisfies the hypotheses of Theorem 2.12. Let G∗h be P(A)/I∗j(P↾p0)/K˙-generic. In V[G∗h], let H^={p∈j(P↾p0):[p]K∈h}.
(1)
If D∈M is open and dense in j(P↾p0), then {[d]K:d∈D and d∈/K} is dense in j(P↾p0)/K. For otherwise, there is p∈j(P↾p0)∖K such that p∧d∈K for all d∈D. By the definition of K, we can force with Q over V[G] to obtain an M-generic filter H0⊆j(P) with p∈H0. But H0 cannot contain any elements of D, so it is not generic over M, a contradiction. Thus if h⊆j(P↾p0)/K is generic over V[G], then H^ is j(P↾p0)-generic over M.
2. (2)
If A∈V is a maximal antichain in P↾p0, then {[j(a)]K:a∈A and j(a)∈/K} is a maximal antichain in j(P↾p0)/K. For otherwise, there is p∈j(P↾p0)∖K such that p∧j(a)∈K for all a∈A. We can force with Q over V[G] to obtain a filter H0⊆j(P) with p∈H0. But H0 cannot contain any elements of j[A], so j−1[H0] is not generic over V, a contradiction.
3. (3)
If p∈P↾p0, ∣∣j(p)∈H˙0∣∣P(A)/I∗Q˙=0, so 1⊮P(Z)/Ij(p)∈K˙.
∎
Lemma 2.15**.**
Suppose the ideal K in Theorem 2.12 is forced to be principal. Let m˙ be such that ⊩P(Z)/IK˙={p∈j(P):p≤¬m˙}. Suppose f and A are such that A⊩m˙=[f], and B˙ is a P-name for {z∈A:f(z)∈H}. Let Iˉ be the ideal generated by I in V[H]. Then Iˉ↾B=J↾B, where J is given by Theorem 2.12.
Proof.
Clearly J⊇Iˉ. Suppose that p0⊩ “C˙⊆B˙ and C˙∈Iˉ+,” and let p1≤p0 be arbitrary. Without loss of generality, P is a complete Boolean algebra. For each z∈Z, let bz=∣∣z∈C˙∣∣. In V, define C′={z:p1∧bz∧f(z)=0}. p1⊩C˙⊆C′, so C′∈I+. If G⊆P(Z)/I is generic with C′∈G, then j(p1)∧b[id]∧m˙=0. Take H^⊆j(P) generic over V[G] with j(p1)∧b[id]∧m˙∈H^. Since b[id]⊩j(P)M[id]∈j^(C), p1⊮C˙∈J˙ as p1∈H=j−1[H^]. Thus p0⊩C˙∈J˙+.
∎
Corollary 2.16**.**
If I is a κ-complete precipitous ideal on Z and P is κ-c.c., then there is a canonical isomorphism ι:P∗P(Z)/Iˉ≅P(Z)/I∗j(P).
Proof.
If G∗H^⊆P(Z)/I∗j(P) is generic, then for any maximal antichain A⊆P in V, j[A]=j(A), and M⊨j(A) is a maximal antichain in j(P). Thus j−1[H^] is P-generic over V, and clearly for each p∈P, we can take H^ with j(p)∈H^. Taking a P(Z)/I-name K˙ for the trivial ideal on j(P), Theorem 2.12 implies that there is a P-name J˙ for an ideal on Z and an isomorphism ι:B(P∗P(Z)/J˙)→B(P(Z)/I∗j(P)), and Lemma 2.15 implies that ⊩PJ˙=Iˉ.
∎
3. A local saturation module
In this section, we show how to transform saturated ideals with certain properties into a restriction of the nonstationary ideal, while retaining saturation. Some key ideas are taken from [9]. Given a set of ordinals S, let C(S) denote the forcing for shooting a club through sup(S) by initial segments.
Lemma 3.1**.**
Assume GCH, μ is regular, κ=μ+, and S⊆κ∩cof(μ) is stationary. Let ⟨Pα,Q˙β:α≤λ, β<λ⟩ be an iteration with <κ-supports such that for each α, there is a Pα-name S˙α for a subset of κ such that ⊩PαQ˙α=C(S˙α∪Sˇ∪cof(<μ)). Then:
(1)
Pλ* is μ-closed.*
2. (2)
Pλ* is κ-distributive.*
3. (3)
Pλ* preserves every stationary T⊆S.*
4. (4)
The set Pλ={p∈Pλ:(∀α<λ)(∃r⊆κ)p↾α⊩αp(α)=rˇ}, is dense in Pλ.
Proof.
(1) is easy. For (2) and (3), fix a stationary T⊆S, let p∈Pλ, and let f˙ be a name for a function from μ to the ordinals. Let θ be a large enough regular cardinal, and let N≺Hθ be elementary such that N<μ⊆N, N∩κ∈T, ∣N∣=μ, and p,f˙,Pλ∈N. List the dense open subsets of Pλ in N as ⟨Dα:α<μ⟩. Note that for all α<κ, the set of q such that for all β∈sprt(q), q↾β⊩supq(β)>αˇ is dense.
Note also that for all q∈Pλ∩N, sprt(q)⊆N.
Using μ-closure, build a descending chain ⟨qα:α<μ⟩⊆N below p such that each qα∈Dα.
Let q be a function with domain N∩λ such that for all β, q(β) is the canonical Pβ-name for ⋃α<μqα(β)∪{N∩κ}. By induction we see that q is a condition in Pλ below each qα: If q↾β is a condition below each qα↾β, then q↾β⊩β “⟨qα(β):α<μ⟩ is a chain of bounded closed subsets of (S˙β∪Sˇ∪cof(<μ))∩N∩κ ordered by end-extension, and {supqα(β):α<μ} is unbounded in N∩κ.” Hence q↾β⊩q(β)≤qα(β) for all α<μ. Limit steps are trivial. Thus q decides f˙ and forces T∩C˙=∅.
For (4), we proceed by induction on λ. Suppose λ=β+1 and the result holds for Pβ. If p∈Pλ, then by κ-distributivity we may extend p↾β to some q∈Pβ such that q⊩p(β)=rˇ for some r⊆κ. If cf(λ)=δ<μ, choose an increasing sequence ⟨λi:i<δ⟩ cofinal in λ. Let p∈Pλ, and build a descending chain ⟨pi:i<δ⟩ below p such that each pi↾i∈Pλi. The function p′ such that for all α∈⋃i<δsprt(pi), p′(α) is a name for ⋃i<δpi(α)∪sup(⋃i<δpi(α)) is a condition below p in Pλ. If cf(λ)>μ, then for any p∈Pλ, p∈Pβ for some β<λ, so we just apply the induction hypothesis. Finally, if cf(λ)=μ, then given a p∈Pλ, we take an elementary substructure N with p∈N as in the previous claims. Using the induction hypothesis, we build a descending chain of length μ of elements below p contained in Pλ, as in the case cf(λ)<μ. We then construct a master condition q below this chain as in the previous claims, which will be in Pλ.
∎
In a context like above where the fixed objects κ,μ,S are clear, we will abbreviate the forcing C(T∪S∪cof(<μ)) by C(T). An iteration of such forcings with <κ-support will be called an S-iteration.
Lemma 3.2** (Foreman-Komjath).**
Assume GCH, μ is regular, κ=μ+, and S⊆κ∩cof(μ) is stationary. Let ⟨Pα,Q˙α:α<λ⟩ be an S-iteration. There is a sequence ⟨πα:α≤λ⟩ such that:
(1)
πα:B(C(∅)×Add(κ,α))→B(C(∅)×Pα)* is a projection.*
2. (2)
For α<β≤λ, πα=πβ↾B(C(∅)×Add(κ,α)).
Proof.
It suffices to show that, after forcing with C(∅), which makes S contain almost all ordinals of cofinality μ, there exists a system of projections that commutes as desired, defined on a dense subset of Add(κ,λ) and mapping into Pλ. Note that since C(∅) adds no new <κ-sequences, if G⊆C(∅) is generic, then Add(κ,λ)V=Add(κ,λ)V[G], and if PλV[G] is S-iteration defined in V[G] using the same sequence of names for subsets of κ, then we see inductively that PλV=PλV[G].
Let us work in a generic extension by C(∅), and let C⊆κ be the generic club. Note that in V[C], there is a κ-closed dense subset of Pλ; namely the set of those p such that for all α∈sprt(p), maxp(α)∈C.
Say a condition p∈Add(κ,λ) is flat if domp=X×ξ for some X⊆λ and some ξ<κ. Clearly, the set of flat conditions is dense.
Fix some bijection f:κ→[κ]<κ such that f(0)=∅. We will define the map πλ, and it will be clear from the construction that the same definition can be run at a different λ′, and the desired coherence condition (2) above will hold.
Let X∈[λ]<κ, and let p:X→[κ]<κ. Let q∈Pλ, with sprt(q)=X. Inductively define q∧p∈Pλ on α∈X by putting (q∧p)(α)=p(α) if:
(1)
p(α) is a closed bounded set end-extending q(α).
2. (2)
maxp(α)∈C.
3. (3)
(q∧p)↾α⊩βpˇ(α)∈Q˙α.
Define (q∧p)(α)=q(α) otherwise.
Let p∈Add(κ,λ) be a flat condition with domain X×ξ. For i<ξ, let pi=p↾(X×i); we will define π(p) as a limit of the π(pi). Let π(p0)=1Pα. Given π(pi), consider the sequence qi=⟨f(p(β,i)):β∈X⟩. Let π(pi+1)=π(pi)∧qi. At limit j, we take π(pj)=infi<jπ(pi).
For p,q∈Pλ, let us say that q is a horizontal extension of p if q(α)=p(α) for α∈sprt(p). Call a flat condition p∈Add(κ,λ) with domain X×ξgood if for every i<ξ and every α∈X, if π(pi+1)↾α has a horizontal extension in Pα deciding whether f(p(α,i))∈Q˙α, then already π(pi+1)↾α decides this. We claim that the set of good conditions is dense, and that π restricted to this set is a projection.
Let p∈Add(κ,λ) be flat with domain X0×ξ. We can recursively add points to X0 until we have a good condition p1′⊇p1. To see this, take an increasing enumeration ⟨αi:i<ot(X0)⟩. Suppose we have p1′↾(αj×1) for j<i. Let p1′′↾(αi×1) be the union of these. If there is a horizontal extension r of π(p1′′↾(αi×1)) that decides whether p1(αi)∈Q˙αi, let p1′↾(αi×1) be such that f(p1′(α,0))=r(α) for all α∈domr∖X. We take p1′ to be the union of these over i<ot(X0). Let domp1′=X1×1.
Next we extend p2 to have domain X1×2, by putting p2′′(α,1)=p1′(α,0) for α∈X1∖X0. Then we apply the same procedure to add points to X1 to produce X2 and p2′, this time also taking care to define p2′(α,0)=0 when a new point α is introduced. This will ensure p2′ is flat, and also not alter the fact that p2′↾X2×1 is good. We continue in this way up to ξ, adding zeros to the lower positions when necessary and simply taking unions at limits.
The resulting condition will extend p, be flat with domain Xξ×ξ, and be good.
Suppose q≤p are good flat conditions, where domp=X×ζ, and domq=Y×η.
We show by induction on i<ζ, and in each case by induction on α<λ, that π(qi)↾α is a horizontal extension of π(pi)↾α. Suppose this is true for j<i and β<α. If i is a limit, the induction proceeds trivially. Suppose i is a successor and α∈Y∖X. Then π(pi) is trivial at α, so π(qi)↾(α+1) is a horizontal extension. Otherwise, we have π(pi)↾α and π(qi)↾α must either both not decide, or both agree whether the set f(p(α,i−1))=f(q(α,i−1)) is in Q˙α. Since by induction π(pi−1)(α)=π(qi−1)(α), we must have π(pi)(α)=π(qi)(α), showing that we may continue the induction along λ in the case of successor i. We conclude in particular that π(q)≤π(p).
Now suppose p∈Add(κ,λ), domp=X×ξ, and q≤π(p) is in Pλ. For each α∈sprt(q), there is rα∈[κ]<κ such that q↾α⊩αq(α)=rˇα. If α∈X, define p′(α,ξ)=f−1(rα). If α∈domq∖X, let p′(α,i)=0 for all i<ξ, and p′(α,ξ)=f−1(rα). Since π(p′↾(sprt(q)×ξ))=π(p), we have π(p′)=q.
∎
Remark 3.3**.**
Suppose we are in the situation as in the previous lemma. Suppose C×Gλ is (C(∅)×Pλ)-generic, and let Gα be the generic for the subforcing Pα for α<λ.
Then for all p∈Add(κ,λ), πλ(p)∈Gλ iff πα(p↾α)∈Gα for all α<λ. It follows that for all α<λ, the identity map is a regular embedding from the quotient Add(κ,α)/Gα into Add(κ,λ)/Gλ. Therefore, if λ is regular and α<κ<λ for all α<λ, then Add(κ,λ)/Gλ is (λ∩cof(κ))-layered.
Theorem 3.4**.**
Suppose the following:
(1)
GCH, μ is regular, and κ=μ+.
2. (2)
I* is a normal κ+-saturated ideal on κ.*
3. (3)
There is a stationary A∈I∗ and a nonstationary B⊆κ+ such that
⊩P(κ)/Ij(Aˇ)=Bˇ.
4. (4)
*There is a projection π:P(κ)/I→Col(μ,κ)×Add(κ,κ+).
*
Let S=κ∩cof(μ)∖A. Then S is stationary, and there is an S-iteration P of length κ+ such that
[TABLE]
Proof.
If j:V→M⊆V[G] is any generic ultrapower arising from I, then cof(μ)M=cof(μ)V[G]. Thus since B not almost all of cof(μ)∩j(κ), S is stationary.
In V, we will construct an S-iteration P of length κ+, and simultaneously construct a sequence of projections from P(κ)/I to P and a sequence of P-names for ideals.
Suppose G⊆P(κ)/I is generic, and j:V→M⊆V[G] is the generic ultrapower embedding. Since B is nonstationary, the forcing C(j(S)∪cof(<μ))M has a κ+-closed dense set in V[G], as does Add(j(κ),j(κ+))M. Since C(j(S)∪cof(<μ))×Add(j(κ),j(κ+)) has the j(κ+)-c.c. in M, and j(κ+)<(κ++)V, there are only j(κ)-many dense open subsets that live in M. Using this and the closure of M, we can build in V[G] a filter H that is generic over M. Fix a P(κ)/I-name for such an object.
In V, let ⟨Sγ0:γ<κ+⟩ enumerate P(κ). We begin our S-iteration by first forcing with C(S00) if S00∈I∗, and forcing with C(κ) otherwise. Since Col(μ,κ) absorbs C(S∪cof(<μ)), Lemma 3.2 gives a projection π1:Col(μ,κ)×Add(κ,1)→C(∅)×C(S00), so that a generic for this first step is absorbed by P(κ)/I. Suppose C0 is a generic club for P1, and G⊆P(κ)/I is a generic absorbing C0 via π1. Note that C0∪{κ} is a condition in j(P1). The generic filter H yields, via the projection of Lemma 3.2, a club C^0⊆j(κ) that is j(P1)↾C0∪{κ}-generic over M.
Thus we can extend the embedding to j1:V[C0]→M[C^0]. By Theorem 2.12, we have in V a P1-name I˙1 for a normal ideal extending I such that B(P1∗P(κ)/I˙1)≅P(κ)/I, where I1 is the collection of X⊆κ for which it is forced that κ∈/j1(X).
Let α↦⟨α0,α1⟩ denote the Gödel pairing function; note that α0,α1≤α. Let α<κ+ and assume inductively that:
(1)
In V, we have an S-iteration ⟨Pβ,Q˙β:β<α⟩.
2. (2)
At each stage β<α, we have chosen an enumeration ⟨S˙γβ:γ<κ+⟩ of P(κ)VPβ.
3. (3)
We have a commuting system of projections
πβ:Col(μ,κ)×Add(κ,β)→Pβ, for β≤α, as given by Lemma 3.2. This implies that P(κ)/I absorbs Pα. Let Cβ denote the generic club added at stage β.
4. (4)
For β<α, it is forced that mβ=⟨(j(γ),Cγ∪{κ}):γ<β⟩ is a condition in j(Pβ).
5. (5)
For β<α, H yields a j(Pβ)↾mβ-generic sequence ⟨C^γ:γ<j(β)⟩. By the coherence of the projections from Lemma 3.2, we have that for β′<β, the sequence associated to β is an end-extension of that associated to β′.
Since we use <κ-supports, for all β<α and all p in the generic filter corresponding to ⟨Cγ:γ<β⟩, mβ≤j(p). Thus for all β<α, we have elementary embeddings jβ:V[⟨Cγ:γ<β⟩]→M[⟨C^γ:γ<j(β)⟩]⊆V[G], which are forced to extend one another. Theorem 2.12 gives that for each β<α, there is a Pβ-name I˙β for a normal ideal on κ equal to the set of X⊆κ for which it is forced that κ∈/jβ(X), and B(Pβ∗P(κ)/I˙β)≅P(κ)/I.
If α=β+1, then we continue the construction by letting Q˙β be a Pβ-name for C(S˙β1β0) if ⊩βS˙β1β0∈I˙β∗ and C(κ) otherwise. We then choose an enumeration of P(κ)VPα. The first three induction hypotheses are easily preserved. For (4), first note that it is preserved at successors because Pα is dense in Pα, and because κ is forced to be in j(Sβ1β0). At limits, it is preserved by the closure of M and because j(Pα) uses <j(κ)-supports. Thus (5) makes sense and follows from Lemma 3.2.
Regarding the final stage κ+, note that if A⊆j(Pκ+) is a maximal antichain in M, then A⊆j(Pβ) for some β<κ+. Thus the filter induced by ⟨C^γ:γ<β⟩ meets A. Thus ⟨C^γ:γ<j(κ+)⟩ is j(Pκ+)-generic over M, and we may extend the embedding to jκ+:V[⟨Cγ:γ<κ+⟩]→M[⟨C^γ:γ<j(κ+)⟩]⊆V[G].
Suppose X˙ is a Pκ+-name for a set in Iκ+∗. Then X˙ is a Pβ-name for some β<κ+ by the κ+-c.c. If ⊮PβX˙∈Iβ∗, then we can take a generic G⊆P(κ)/I such that κ∈/jβ(X). But G also determines an embedding jκ+ extending jβ, and by assumption it is forced that κ∈jκ+(X), a contradiction. Now in VPβ, X=Sγβ for some γ, and there is α≥β such that ⟨α0,α1⟩=⟨β,γ⟩. Thus Qα shoots a club C through X∪(κ∖A), so that in the final model, C∩A⊆X.
∎
4. Obtaining saturated ideals
Let μ<κ be regular cardinals. Deviating slightly from convention, we define:
[TABLE]
Now define:
[TABLE]
It is convenient to identity P(μ,κ) with a collection of partial functions on κ3.
If μ<δ<κ and δ is regular, then P(μ,δ)=P(μ,κ)∩Vδ. Thus if κ is Mahlo, then P(μ,κ) is S-layered, where S is the stationary set of regular cardinals below κ.
The key to our construction is Shioya’s argument [18], which shows that P(μ,κ) can absorb future versions of itself.
Lemma 4.1**.**
Assume GCH. Suppose κ<λ are regular cardinals, and Q is a κ-c.c. partial order of size ≤κ. There is a projection π:Q×P(κ,λ)→Q∗P˙(κ,λ).
Proof.
Using GCH and the chain condition, choose an enumeration {τα:α<λ} of Q-names for ordinals such that whenever η∈[κ,λ] is regular and ⊩σ<ηˇ, there is α<η such that ⊩σ=τα. Let π be defined by ⟨q,p⟩↦⟨q,p˙⟩, where p˙ is the canonical Q-name for the function with the same domain as p, and such that for all α∈domp, ⊩p˙(α)=τp(α).
Suppose ⟨q1,p˙1⟩≤π(q0,p0). By the κ-c.c., there is a set X⊆λ3 such that ⊩domp˙1⊆Xˇ, where:
•
{α:∃β∃γ⟨α,β,γ⟩∈X}⊆[κ,λ) and is Easton.
•
∀α{⟨β,γ⟩:⟨α,β,γ⟩∈X}⊆[α,λ)×α and has size <α.
Define p2 such that p2↾domp0=p0, and if α∈X∖domp0, then p2(α)=δ, where δ<α(1) is such that the following is forced about the Q-name τδ:
“If α∈domp˙1, then τδ=p˙1(α).” If α∈domp0, then q1⊩p˙0(α)=p˙1(α)=p˙2(α). If α∈domp2∖domp0, then q1⊩α∈domp˙1→p˙1(α)=p˙2(α). Thus q1⊩p˙2≤p˙1.
∎
Lemma 4.2**.**
Suppose the following:
(1)
μ<κ≤δ<λ* are regular cardinals, and κ and λ are Mahlo.*
2. (2)
j:V→M* is an almost-huge embedding derived from a (κ,λ)-tower.*
3. (3)
Q˙* is a P(μ,κ)-name for a κ-closed, δ-c.c. poset of size ≤δ.*
Let G∗h∗H be P(μ,κ)∗Q˙∗P˙(δ,λ)-generic. In V[G∗h∗H], there is a normal κ-complete ideal I on [δ]<κ such that P([δ]<κ)/I projects to Col(μ,κ)×Col(κ,δ)×Add(κ,λ), and is S-layered, where S is the set of V-regular α, δ≤α<λ. Any generic embedding arising from forcing with this ideal extends j.
Proof.
Let us first claim that there is a projection from P(μ,λ) to
[TABLE]
which is the identity on P(μ,κ). Note that there is a natural projection from P(μ,λ) to P(μ,κ)×P(κ,λ)×Col(μ,κ), given by
[TABLE]
By Lemma 4.1, the first two factors project to P(μ,κ)∗P˙(κ,λ). Since by Lemma 2.3, Col(α,β)≅Col(α,β)×R, whenever α is regular and R is α-closed and of size ≤β, we see that in VP(μ,κ), P(κ,λ) is forcing-equivalent to P(κ,λ)×P(δ,λ)×Col(κ,δ)×Add(κ,λ). The first factor projects to Q by Lemma 2.3 again. By Lemma 4.1, we get a projection from the first two factors to Q∗P˙(δ,λ). This finishes the argument for the claim.
Now let G∗h∗H be as hypothesized, and let G^⊆P(μ,λ) be a generic projecting to G∗h∗H. By the above argument, G^ also projects to G∗K⊆P(μ,κ)∗P˙(κ,λ), which in turn projects to G∗h∗H. Since P(κ,λ) is clearly (κ,λ)-nice, we get by Lemma 2.9 an extended elementary embedding j:V[G∗K]→M[G^∗K^], such that Ord<λ∩V[G^]⊆M[G^∗K^]. By elementarity, there is some h^∗H^ such that the embedding restricts to j:V[G∗h∗H]→M[G^∗h^∗H^]. By the closure of the relevant forcings, the latter model also has the same Ord<λ as V[G^].
In V[G∗h∗H], let R be the quotient forcing P(μ,λ)/(G∗h∗H). We define the ideal I as {X⊆[δ]<κ:1⊩Rj[δ]∈/j(X)}. Let e:P([δ]<κ)/I→B(R) be defined by e([X]I)=∣∣j[δ]∈j(X)∣∣. It is routine to check that I is normal and κ-complete and that e is a Boolean embedding. Since P(μ,λ) is λ-c.c., I is λ-saturated. It follows from this that e is a complete embedding. For let {[Xα]I:α<δ} be a maximal antichain in P([δ]<κ)/I. Then [∇α<δXα]I=[[δ]<κ]I, so 1⊩Rj[δ]∈j(∇α<δXα). Thus it is forced that j[δ]∈j(Xα) for some α<δ.
To show the isomorphism, let U⊆P([δ]<κ)/I be generic over V[G∗h∗H], and let jU:V[G∗h∗H]→N be the generic ultrapower embedding. Forcing further with R/e[U] yields an embedding j:V[G∗h∗H]→M[G^∗h^∗H^] as above. We have that X∈U if and only if j[δ]∈j(X), so we can define an elementary embedding k:N→M[G^∗h^∗H^] by k([f]U)=j(f)(j[δ]), and we have j=k∘jU. Note that for α≤δ, k(α)=k(ot(jU(α)∩[id]U))=ot(j(α)∩j[δ])=α. Thus crit(k)≥λ.
Let β be any ordinal. Since j:V→M was derived from a (κ,λ)-tower, there is some α<δ and some f∈V such that β=j(f)(j[α]). Let b:δ→α be a surjection in V[G∗h∗H]. Then
[TABLE]
Thus β∈ran(k), so k does not have a critical point and N=M[G^∗h^∗H^].
For any generic G^, if U=e−1[G^], then G^=jU(G). For any generic U, if G^=jU(G), then U={X⊆[δ]<κ:j[δ]∈jU(X)}=e−1[G^]. Thus Lemma 2.2 implies that P([δ]<κ)/I≅B(R).
It follows that P([δ]<κ)/I projects to Col(μ,κ)×Col(κ,δ)×Add(κ,λ) as desired.
It remains to show that P([δ]<κ)/I is S-layered, where S is the stationary set of V-regular cardinals between δ and λ. This follows because the projection π of Lemma 4.1 has the following property: For any p in the quotient R, any α<λ, and any q≤p↾α of rank ≤α which is also in the quotient, we have that p∪q is also in the quotient. Thus ⟨R∩Vα:α<λ⟩ witnesses that R is S-layered.
∎
Although we are ultimately interested in saturated ideals on regular cardinals, rather than sets of the form [δ]<κ, the ideals on such sets will be useful for us because of their resilience under collapses:
Lemma 4.3**.**
Assume GCH. Suppose κ<δ are regular, and I is a normal ideal on [δ]<κ such that P([δ]<κ)/I projects to Col(κ,δ), and is S-layered for some stationary subset S⊆δ+. If g⊆Col(κ,δ) is generic, then in V[G], there is an S-layered ideal J on κ such that P(κ)/J≅(P([δ]<κ)/I)/g. Furthermore, any generic ultrapower arising from forcing with J over V[g] extends one arising from forcing with I over V.
Proof.
Let g⊆Col(κ,δ) be generic. Further forcing yields a generic G⊆P([δ]<κ)/I and an ultrapower embedding j:V→M⊆V[G]. The quotient (P([δ]<κ)/I)/g is S-layered by Lemma 2.6. Since j(Col(κ,δ)) is j(κ)-directed-closed and j[g]∈M is a directed set of size <j(κ), there is a condition m∈j(Col(κ,δ)) below j[g].
A counting argument shows that j(δ+)<δ++, so there are only δ+-many dense subsets of j(Col(κ,δ)) in M. Since j(κ)>δ and Mδ∩V[G]⊆M, we can build a filter g^⊆j(Col(κ,δ)) in V[G] that is generic over M, with m∈g^. Thus we may extend the embedding to j:V[g]→M[g^]. By Theorem 2.12, we get a normal κ-complete ideal J′ on [δ]<κ in V[g] such that P([δ]<κ)/J′≅(P([δ]<κ)/I)/g. By Proposition 2.13, any generic embedding coming from J′ extends one coming from I.
Now since ∣δ∣=κ in V[g], a bijection f:κ→δ yields an ideal J on [κ]<κ given by J={X:{f[z]:z∈X}∈J′}, and clearly P([κ]<κ)/J≅P([δ]<κ)/J′. By normality, κ is a J-measure-one set, so J is essentially an ideal on κ.
∎
4.1. Interlude: Woodin’s theorem
Here we discuss how our techniques yield a new proof of Woodin’s theorem that if κ is almost-huge and μ<κ is regular, then there is a forcing that preserves cardinals ≤μ and forces that κ=μ+ and the nonstationary ideal on κ is locally saturated.
Let λ be least such that there exists a (κ,λ)-tower T. It is easy to see that λ is inaccessible but not Mahlo. Therefore, if A={α<κ:α is inaccessible}, and j:V→M is the embedding derived from T, then κ∈j(A) and j(A) is nonstationary.
Typical Easton-support products up to λ will not be λ-c.c., so we will have to slightly modify our forcing. For regular α<β, let
[TABLE]
The usual Δ-system argument shows that Q(α,β) is β-c.c. when β is inaccessible. The argument for Lemma 4.1 shows that j(Q(μ,κ))=Q(μ,λ) projects to Q(μ,κ)∗[Col˙(κ,<λ)×Add˙(κ,λ)]×Col(μ,κ). The argument for Lemma 4.2 shows that if G∗H⊆Q(μ,κ)∗Col˙(κ,<λ) is generic, then in V[G∗H], there is a normal saturated ideal I on κ such that:
(1)
A∈I∗.
2. (2)
Any generic embedding arising from I will extend j.
3. (3)
P(κ)/I projects to Col(μ,κ)×Add(κ,κ+).
Thus Theorem 3.4 implies that there is a cardinal-preserving forcing extension in which NSκ↾A is κ+-saturated.
5. The preparatory model
We build the preparatory model towards Theorem 1 in three rounds. We warn the reader that we will continually change the reference of “V” to mean whatever ground model on which we are currently focused. Let θ be a huge cardinal. A standard reflection argument shows that there is a large set X⊆θ such that for all α<β in X, α is almost-huge with target β. In the first round, we arrange that for all such α<β, there is an A⊆α and an (α,β)-tower T such that κ∈jT(A) and jT(A) is nonstationary. We then collapse many cardinals so that θ is still very large, the set of cardinals below θ is almost equal to X, and there are many saturated ideals with the properties that make Theorem 3.4 applicable. In the second round, we introduce square at every cardinal while preserving many superstrong cardinals and the desired saturated ideals. In the third round, we arrange local saturation on the first few successors of Mahlo cardinals, while still preserving many superstrongs.
Regarding the structure of the proof:
•
We need to force squares before local saturation, because a standard argument shows that the forcing we use for □κ also forces ♢κ+(S) for any given stationary S⊆κ+, thus ruining local saturation at κ+ (see [15, Lemma 3.11]). However, the reader who is interested only in local saturation and not in the square principles holding simultaneously may opt to simply skip Section 5.2, as the third round of forcing may be carried out on the basis of the first round’s preparations.
•
The forcing of the third round is a product, but it could also be done as an iteration. The latter may be interesting if one wants to preserve larger cardinals while getting local saturation at all successors of regulars, but the former harmonizes more with the techniques of the second round and the Radin forcing of Section 6, which seem not to have such flexibility.
5.1. Many saturated ideals that get stationarity wrong
As described above, Woodin obtained
local saturation at a single successor cardinal by exploiting a precise degree of almost-hugeness: A (κ,λ)-tower was chosen with λ non-Mahlo. Such towers will not serve our purposes here since we want the target to also be almost-huge. In order to get almost-huge towers of very large height that also map some large subset of the critical point to a nonstationary set, we use a forcing argument supplied by Toshimichi Usuba.
Lemma 5.1** (Usuba).**
There is a forcing P such that whenever κ is almost-huge in V with Mahlo target λ, then in VP, there is a (κ,λ)-tower T and an A⊆κ such that κ∈jT(A) and jT(A) is nonstationary.
Proof.
Let P be the Easton-support iteration of adding a Cohen subset of α whenever α is inaccessible. Let j:V→M be an almost-huge embedding generated by a (κ,λ)-tower in V, where λ is Mahlo. Let G be generic for P, and let Gα=G∩Pα. Then j can be extended to j:V[Gκ]→M[Gλ].
It is easy to show that the Cohen-generic function g:κ→2 added at stage κ has the property that if A={α:g(α)=1} and S∈V is a stationary subset of κ, then S∩A and S∖A are both stationary. We now build a subset of λ that is Add(λ)-generic over M[Gλ] with some specific properties. Since j(λ)<λ+, we can list all dense open subsets of Add(λ)M[Gλ] that live in M[Gλ] as ⟨Dα:α<λ⟩. We construct an extension g^ of g as ⋃α<λg^α and along the way choose a continuous, increasing, cofinal sequence of ordinals ⟨βα:α<λ⟩⊆λ with the following properties:
(1)
dom(g^0)=κ+1, g^0↾κ=g and g^0(κ)=1.
2. (2)
For α>0, dom(g^α)=βα+1, and g^α(βα)=0.
3. (3)
For all α, g^α+1∈Dα.
4. (4)
For limit α, βα=supγ<αβγ.
Clearly, g^ is generic over M[Gλ], and {α:g^(α)=1} is disjoint from the club {βα:α<λ}. So we extend the embedding to j:V[Gκ+1]→M[Gλ∗g^].
The method of the proof of Theorem 2.9 lets us build a filter H⊆j(Pλ)/(Gλ∗g^)-generic over M[Gλ∗g^], with j[Gλ]⊆Gλ∗g^∗H, so we can extend the embedding to j:V[Gλ]→M[Gλ∗g^∗H]. By the λ-c.c. of Pλ and the λ-closure of j(Pλ)/Gλ, we have that Ord<λ∩V[Gλ]⊆M[Gλ∗g^∗H]. The appropriate (κ,λ)-tower inducing j exists in V[Gλ], and it is preserved by the λ-closed forcing P/Gλ.
∎
It is not hard to show that the forcing P of the previous lemma preserves huge cardinals as well. Let us therefore work in a model satisfying the conclusion of the previous lemma, and in which there is a huge cardinal θ. Let U be an ultrafilter on θ derived from an embedding witnessing θ is huge. X∈U be such that for α<β in X, α is almost-huge with target β. Let ⟨αi:i<θ⟩ enumerate the closure of X∪{ω}. Let P(κ,λ) denote the product forcing defined in Section 4. Let us force with the following Easton-support iteration ⟨Pi,Q˙i:i<θ⟩:
•
If i is 0 or a successor, let ⊩iQ˙i=P˙(αi,αi+1).
•
If αi is a non-Mahlo limit of X, let ⊩iQ˙i=P˙(αi+,αi+1).
•
If αi is a Mahlo limit of X, let ⊩iQ˙i=P˙(αi,αi+1).
It is routine to check that after forcing with this iteration, the set of cardinals below θ are the ordinals αi and those of the form (αi+)V for αi a non-Mahlo limit of X.
Let μ<δ be either successor cardinals or a Mahlo cardinals after forcing with Pθ. Let i<θ be such that either μ=αi or μ=(αi+)V, and define i′ similarly with respect to δ. Let Gi⊆Pi be generic, and let κ=αi+1. Since ∣Pi∣≤μ, any almost-huge embedding with critical point κ in V extends to one in V[Gi]. Consider the forcing Pi′+1/Gi. It takes the form P(μ,κ)∗Q˙∗P˙(δ,λ), where λ=αi′+1∈X and Q˙ is forced to be κ-closed, δ-c.c., and of size ≤δ. The hypotheses of Lemma 4.2 are satisfied, so there exists an ideal as in the conclusion after forcing with Pi′+1. As the tail-end is λ-closed, this still holds in the extension by Pθ.
Furthermore, many almost-huge cardinals below θ are preserved. For let j:V→M witness the hugeness of θ. If T is the almost-huge tower derived from j, then T∈M. We have j(Pθ)∩Vθ=Pθ, so reflection gives us that, if U is the ultrafilter on θ derived from j, then there are U-many α<θ that are almost-huge with embedding jα, with jα(Pα)=Pθ. Reflecting again yields a set Y∈U such that for all α<β in Y, there is an (α,β)-tower T with jT(Pα)=Pβ. The proof of Lemma 2.9 shows that such embeddings can be extended through the forcing. Let us record what we have as:
Lemma 5.2**.**
It is consistent relative to a huge cardinal that there is an inaccessible θ and a sequence ⟨Sα:α<θ⟩ such that:
(1)
Vθ* satisfies GCH and that there is a proper class of almost-huge cardinals with Mahlo targets.*
2. (2)
Whenever μ is regular and κ=μ+, Sκ is a stationary subset of κ∩cof(μ).
3. (3)
For every pair of cardinals μ<δ<θ which are either successor or Mahlo, if κ=μ+ and λ=δ+, then there is κ-complete normal ideal I on [δ]<κ such that:
(a)
P([δ]<κ)/I* is Sλ-layered.*
2. (b)
There is a stationary A⊆κ∩cof(μ) and a nonstationary B⊆λ such that for any generic embedding j arising from I, κ∈j(A)=B.
3. (c)
P([δ]<κ)/I* projects to Col(μ,κ)×Col(κ,δ)×Add(κ,λ), in a way such that the quotient is forced to be Sλ-layered.*
5.2. Squares
For a cardinal κ, □κ holds if there is a sequence ⟨Cα:α<κ+⟩ such that if α is a limit ordinal,
(1)
Cα is a club subset of α.
2. (2)
If β∈limCα, then Cβ=Cα∩β.
3. (3)
otCα≤κ.
We will refer to a sequence satisfying (1) and (2) as a coherent sequence of clubs and a sequence satisfying all three as a □κ-sequence. A weaker notion, □(κ+), holds when there is a coherent sequence of clubs with the property that there is no “thread” C⊆κ+, a club such that if α∈limC, then Cα=C∩α.
There is some tension between squares and saturated ideals. The following two propositions show that if μ has uncountable cofinality and □μ holds, then there cannot be a saturated ideal on μ+ whose associated forcing is either weakly homogeneous or proper.
Proposition 5.3** (Zeman).**
Suppose I is a normal κ-complete ideal on Z, P(Z)/I is weakly homogeneous, and P(Z)/I preserves that κ has uncountable cofinality. Then □(κ) fails.
Proof.
Suppose ⟨Cα:α<κ⟩ is a coherent sequence of clubs. Let G⊆P(Z)/I be generic, and let j:V→M be the associated embedding. By [7, Section 2.6] , M is well-founded up to κ+. C∗=j(C)(κ) is a thread of ⟨Cα:α<κ⟩. Suppose C′ is another thread. Then C′′=C′∩C∗ is a club in κ, and whenever α∈limC′′, C′′∩α=C′∩α=C∗∩α=Cα. Thus C′=C∗, hence C∗ is definable from parameters in the ground model. By weak homogeneity, C∗∈V.
∎
Proposition 5.4**.**
Suppose I is a normal κ-complete ideal on Z, and P(Z)/I is a proper forcing. Then every stationary subset of κ∩cof(ω) reflects.
Proof.
Let S⊆κ∩cof(ω) be stationary. Let G⊆P(Z)/I be generic and let j:V→M be the associated embedding. Then j(S)∩κ=S, and S is still stationary in V[G]. By elementarity, S∩α is stationary in α for some α<κ.
∎
We will need the following to show the preservation of squares under some cardinal collapses:
Lemma 5.5**.**
Let κ be a cardinal and ζ<κ+. Suppose there is a coherent sequence of clubs ⟨Cα:α<κ+⟩ such that for all α, otCα≤ζ. Then □κ holds.
Proof.
It is easy to show by induction that for each ξ<κ+, there is a short square sequence ⟨Dα:α≤ξ⟩, i.e. a sequence satisfying all requirements for □κ except that its length is <κ+. Fix one for ξ=ζ. For α<κ+, let Cα′={β∈Cα:ot(Cα∩β)∈Dot(Cα)}. For each α, ot(Cα′)=ot(Dot(Cα))≤κ. Suppose β is a limit point of Cα′. Then β is a limit point of Cα, so Cβ=Cα∩β. Also, ot(Cβ) is a limit point of Dot(Cα), so Dot(Cα)∩ot(Cβ)=Dot(Cβ), and therefore Cβ′=Cα′∩β.
∎
For a cardinal δ, let Sδ be the collection of bounded approximations to a □δ sequence. That is, a condition is a sequence ⟨Cα:α∈η⟩ such that η<δ+ is a successor ordinal, each Cα is a club subset of α of order type ≤δ, and whenever β is a limit point of Cα, Cα∩β=Cβ. An induction argument shows that conditions can be extended to arbitrary length, so the forcing introduces a □δ-sequence. The first and third claims of the following lemma are well-known, and the second follows from a general theorem of Ishiu and Yoshinobu [11]. We give a proof for the reader’s convenience.
Lemma 5.6**.**
Let δ be a cardinal.
(1)
Sδ* is (δ+1)-strategically closed.*
2. (2)
If □δ holds, then Sδ is δ+-strategically closed.
3. (3)
For every regular λ≤δ, there is a Sδ-name for a “threading” partial order Tδλ that adds a club C⊆(δ+)V of order type λ and such that whenever α is a limit point of C, C∩α=Cα. Furthermore, Sδ∗T˙δλ has a λ-closed dense subset of size 2δ.
Proof.
For (1), let us pit the players Good and Bad against each other. Let Bad play any condition p0. If Bad plays pα, let Good play any condition pβ+1 strictly longer than pβ, where max(dompβ+1) is a limit ordinal. At limit stages λ, Good plays ⋃γ<λpγ∪⟨λ,{α:(∃β<λ)max(dompβ)=α}⟩. The fact that Good plays at all limit stages ensures coherence. This strategy succeeds in producing conditions in Sδ for (δ+1)-many turns, as the order types never get too large.
For (2), assume there is a square sequence ⟨Dα:α<δ+⟩. Good plays a similar strategy, except at limit λ, she plays ⋃γ<λpγ∪⟨λ,{α:(∃β<λ)max(dompβ)=α and β∈Dλ}⟩. This strategy allows the game to continue for δ+-many turns.
For (3), define Tδλ as the collection of bounded approximations to the desired set. By the strategic closure of Sδ, the collection of ⟨p,q˙⟩∈Sδ∗T˙δλ such that for some x∈V, p⊩q˙=xˇ is dense. If ⟨⟨pα,xˇα⟩:α<β<λ⟩ is a decreasing sequence of such conditions, let xβ=⋃α<βxα, and let pβ=⋃α<βpβ∪⟨supα<β(dompα),xˇβ⟩. This is a condition because for all limit points γ of xβ, xβ∩γ=pβ(γ).
∎
The next lemma will be applied to show that when κ<κ=κ, forcing with Sκ preserves saturated ideals on κ, provided their quotient algebras are moreover S-layered for some stationary S⊆κ+.
Lemma 5.7**.**
If κ<μ=κ, μ≤κ is regular, and P is (κ+1)-strategically closed, then P preserves stationary subsets of κ+∩cof(μ).
Proof.
Let σ be a strategy witnessing that P is (κ+1)-strategically closed, and let p0∈P. Let S⊆κ+∩cof(μ) be stationary and C˙ be a P-name for a club. Let θ be a large regular cardinal, and let ⟨Mα:α<κ+⟩ be an increasing continuous sequence of elementary submodels of ⟨Hθ,∈,P,σ,S⟩, each of size κ, having transitive intersection with κ+, and such that Mα<μ⊆Mα for all successor α. Let α∗ be such that Mα∗∩κ+=α∗∈S. Let ⟨βi:i<μ⟩ be an increasing sequence converging to α∗. Build a descending chain ⟨pi:i<μ⟩⊆Mα∗ below p0 such that at odd i, pi decides some ordinal ≥βi to be in C˙, and even stages are chosen by following σ. Since Mα∗<μ⊆Mα∗, the construction continues, and there is a condition pμ below all conditions chosen. pμ⊩α∗∈C˙∩Sˇ.
∎
We can now perform our second round of forcing. We simply force with the Easton-support product of Sδ, over all infinite cardinals δ<θ. First we check that this preserves superstrong cardinals with Mahlo target. For a set of ordinals X, let PX denote the sub-product where we restrict to indices in X. Let κ be superstrong with target λ. j(Pκ)=Pλ, and Pλ is λ-c.c. Since Pλ∖κ is (κ+1)-strategically-closed and ∣Pκ∣=κ, Easton’s Lemma implies that Pλ∖κ is still κ+-distributive after forcing with Pκ. By Lemma 2.10, κ is still superstrong with target λ after forcing with Pλ. Pθ∖λ does not add sets of rank <λ, so the superstrongness is preserved.
Now we argue that the conclusion of Lemma 5.2 still holds after forcing square everywhere below θ, but with the proper class of almost-huge cardinals replaced with a proper class of superstrong cardinals. It will be important for the argument that we force square to hold everywhere with a product rather than an iteration.
Suppose μ<δ<θ are successor cardinals or Mahlo, and let κ=μ+ and λ=δ+. Let I be the ideal on [δ]<κ as in Lemma 5.2. The forcing Pθ∖δ is (δ+1)-strategically closed. Thus it preserves the stationarity of Sλ, adds no subsets of [δ]<κ, and preserves that I has all the properties as in Lemma 5.2. If κ<δ, consider the forcing P[κ,δ). It is a coordinate-wise projection of
[TABLE]
By Lemma 5.6, this poset is κ-closed and has size δ. Therefore, it is absorbed by Col(κ,δ), and thus by the Boolean algebra P([δ]<κ)/I. If g⊆Col(κ,δ) is generic, then as in Lemma 4.3, forcing with the quotient (P([δ]<κ)/I)/g yields an embedding j:V[g]→M[g^]. If h is the projected generic for P[κ,δ), then the embedding restricts to j:V[h]→M[h^]. By Theorem 2.12, there is a normal κ-complete ideal J on [δ]<κ such that P([δ]<κ)/J is isomorphic to the quotient (P([δ]<κ)/I)/h. This Boolean algebra is still Sλ-layered by Lemma 2.6. If we make sure to use a projection that leaves a copy of Col(κ,δ) behind in the quotient (which can always be done as it is isomorphic to its square), we have that P([δ]<κ)/J still projects to Col(μ,κ)×Col(κ,δ)×Add(κ,λ). Since generic embeddings via J extend those via I, the desired property of mapping a stationary A⊆κ to a nonstationary B⊆λ still holds.
Now we move to the extension by Sμ, and it is here that we use the fact we have already forced with Pθ∖κ. The forcing Sμ∗T˙μμ is μ-closed and of size κ, so it is absorbed by Col(μ,κ) and thus by the ideal P([δ]<κ)/J. Again, let us use a projection that leaves a copy of Col(μ,κ) behind. G be generic for P([δ]<κ)/J and let j:V→M be the generic ultrapower. Notice that since □δ holds in V and λ=j(κ)=(μ+)V[G], □μ holds in V[G] by Lemma 5.5. The projected generic g∗h⊆Sμ∗T˙μμ yields a condition m∈j(Sμ)=SμV[G] that is below all conditions in g. Because □μ already holds, SμV[G] is in fact λ-strategically closed in V[G] (but not necessarily in M). Since (2λ)M=j(κ+)≤j(λ)<(λ+)V, we can use this strategic closure and the <λ-closure of M to build an M-generic g^ with m∈g^. By Theorem 2.12, there is an ideal J′ on [δ]<κ in V[g] such that P([δ]<κ)/J′≅(P([δ]<κ)/J)/g. Since Sμ is κ-distributive, P([δ]<κ)/J′ still projects to Col(μ,κ)×Col(κ,δ)×Add(κ,λ), and it is Sλ-layered.
Finally, consider the remaining forcing Pμ. Since μ is either Mahlo or a successor, it is either μ-c.c., or of the form Pν×Sν, where μ=ν+. Since Pμ has size μ and J′ is κ-complete, if Jˉ′ is the ideal generated by J′ after forcing with Pμ, then every Jˉ′-positive set contains a J-positive set from the ground model. Thus P([δ]<κ)/Jˉ′ remains Sλ-layered, and it projects to the version of Col(μ,κ)×Col(κ,δ)×Add(κ,λ) from the ground model. If μ is Mahlo, then by Lemma 4.1, this projects to version of the same forcing as defined in the extension. If μ is a successor, then it projects to the version as defined in the extension by Sν, for the latter two factors because ∣Sν∣=μ, and for Col(μ,κ) because Sν adds no ν-sequences. Then this version projects to the version as defined in the further extension by Pν, because ∣Pν∣=ν. Let us record what we have done:
Lemma 5.8**.**
It is consistent relative to a huge cardinal that there is an inaccessible θ and a sequence ⟨Sα:α<θ⟩ such that:
(1)
Vθ* satisfies GCH, □κ for every infinite cardinal κ, and that there is a proper class of superstrong cardinals with Mahlo targets.*
2. (2)
Clauses (2) and (3) of Lemma 5.2 hold.
5.3. Frequent local saturation
In order to provide the necessary set-up for the application of Radin forcing, we begin to introduce local saturation in the neighborhood of Mahlo cardinals, many of which will become singular in the end, leave room for some collapsing in between them, and retain superstrongness.
Lemma 5.9**.**
Over a model satisfying the conclusion of Lemma 5.8, there is a cofinality-preserving forcing extension in which there is an inaccessible θ and a sequence ⟨Sα:α<θ⟩ such that: such that:
(1)
Vθ* satisfies GCH, □κ for every infinite cardinal κ, and that there is a proper class of superstrong cardinals with Mahlo targets.*
2. (2)
Whenever μ is Mahlo and κ=μ+n for 1≤n≤4, Sκ is a stationary subset of κ∩cof(μ+n−1).
3. (3)
If μ<θ is a Mahlo cardinal and 1≤n≤3, there is a stationary A⊆μ+n such that P(A)/NS is Sμ+n+1-layered.
4. (4)
For every two Mahlo cardinals μ<δ<θ, if κ=μ+4, and λ=δ+, then there is κ-complete normal ideal I on [δ]<κ such that:
(a)
P([δ]<κ)/I* is Sλ-layered.*
2. (b)
There is a stationary A⊆κ∩cof(μ+3) and a nonstationary B⊆λ such that for any generic embedding j arising from I, κ∈j(A)=B.
3. (c)
P([δ]<κ)/I* projects to Col(μ+3,κ)×Col(κ,δ)×Add(κ,λ).*
Proof.
Let ⟨Sα:α<θ⟩ be the sequence given by Lemma 5.2. Let μ<θ be Mahlo and let κ=μ+n for 1≤n≤3. Substituting δ=κ in clause (3) of Lemma 5.2, we have a normal ideal I on κ satisfying the hypotheses of Theorem 3.4. Let A⊆κ be the stationary set that is forced to be mapped to a nonstationary set B. By shrinking A if necessary, we may assume that Sκ∖A is stationary. Let Pκ be the (κ∩cof(μ+n−1)∖A)-iteration as in the conclusion of Theorem 3.4. Let X={κ<θ:κ=μ+n for μ Mahlo and 1≤n≤3}. We force with the product:
[TABLE]
For clause (1), for the preservation of cofinalities (and thus cardinals and squares) and the GCH, the key is to note that for any regular cardinal μ, (a) Q↾μ+ is (μ+∩cof(μ))-layered, and (b) Q↾[μ+,θ) is μ+-distributive since it is of the form (μ+-distributive)×(μ+-closed). Thus by Easton’s Lemma, the latter retains its distributivity after forcing with Q↾μ+. The desired superstrongness is preserved using Lemma 2.10.
For clause (2), we just need to check the preservation of Sμ+n for μ Mahlo and 1≤n≤4. If μ is Mahlo and 1≤n≤3, then Pμ+n preserves the stationarity of Sμ+n by Lemma 3.1, and thus so does Q↾μ+n+1. Since the tail Q↾[μ+n+1,θ) remains μ+n+1-distributive, Sμ+n remains stationary. If n=4, then Q factors as (μ+n-c.c.)×(μ+n-closed).
For clause (3), let μ<θ be Mahlo and 1≤n≤3. After forcing with Pμ+n, the desired conclusion holds for some stationary A⊆μ+n, and thus it holds after forcing with Q↾[μ+n,θ) by the distributivity of the tail. Temporarily let V denote an extension by Q↾[μ+n,θ). In this model, the forcing Q↾μ+n is still (μ+n∩cof(μ+n−1))-layered. If j:V→M⊆V[G] is a generic embedding arising from forcing with P(A)/NS, then M⊨ “j(Q↾μ+n) is (j(μ+n)∩cof(μ+n−1))-layered,” and this holds in V[G] as well since M is closed under μ+n−1-sequences from V[G]. Since Q↾μ+n is μ+n-c.c., the ideal generated by NS of the ground model is NS of the extension. By Corollary 2.16,
[TABLE]
By Lemma 2.6, the right-hand side is Sμ+n+1-layered, and since ∣Q↾μ+n∣=μ+n, it is forced that the quotient P(A)/NS is Sμ+n+1-layered.
For clause (4), let μ<δ be Mahlo cardinals below θ, and let κ=μ+4. The subforcing Q↾[κ,δ) is κ-closed and of size δ. By the same arguments as in the previous subsection, there is an ideal J on [δ]<κ with the desired properties after forcing with Q↾[κ,δ), and this holds after forcing further with the tail Q↾[δ,θ) by distributivity. Now consider adjoining a generic for the forcing Q↾κ. By precisely the same argument as for (3), the Booelan algebra associated to the generated ideal Jˉ is still Sδ+-layered. Subclause (b) holds by the fact that a generic embedding arising from Jˉ will extend one arising from J, per Proposition 2.13.
For subclause (c), we have that
[TABLE]
Let H∗Gˉ be generic for the left-hand side. If we transfer this generic to one for the right-hand side G∗H^, via the isomorphism ι of Theorem 2.12, we get that G=Gˉ∩P([δ]<κ)V. Furthermore, since j is the identity on Q↾κ, H=H^∩(Q↾κ). By the layeredness of j(Q↾κ), Q↾κ is a regular suborder, and H is generic over V[G]. Thus the map ⟨q,Y⟩↦⟨q,Yˇ⟩ is a regular embedding of (Q↾κ)×P([δ]<κ)/J into Q↾κ∗P([δ]<κ)/Jˉ. Hence, if H⊆Q↾κ is generic over V, then in V[H] there is a projection from P([δ]<κ)/Jˉ to [Col(μ+3,κ)×Col(κ,δ)×Add(κ,λ)]V. This is equal to Col(μ+3,κ)V[H]×[Col(κ,δ)×Add(κ,λ)]V. Since Q↾κ is κ-c.c. and of size κ, Lemma 4.1 gives that the latter factor projects to [Col(κ,δ)×Add(κ,λ)]V[H].
∎
We would like to point out that in the argument for (4c) above, the layeredness of Q↾κ played a substantial role. In general, the κ-c.c. alone is not enough to carry out such arguments. See [1, Theorems 7.3 and 7.4] for further discussion.
6. The final model
In this section, we present a version of Radin forcing with interleaved posets and show how it forces a model of Theorem 1 over a model satisfying the conclusion of Lemma 5.9. We will actually have two Radin forcings, R and R′, and a projection π:R′→R. R′ will be slightly simpler, and will closely resemble the forcing used by Cummings in [2]. We defer to his article for some key lemmas. R will inherit some important properties of R′ and produce the desired model.
R will shoot a club through the measurable cardinals below a sufficiently strong cardinal, and between successive points α<β of this club, interleave a generic for a poset Q(α,β) that first collapses β to have cardinality α+4 and then iterates club shooting on α+4 to make NSα+4 locally saturated. R′ will be similar, except that it interleaves a generic for P(α,β), a simple product of collapses and Cohen forcing which projects to Q(α,β). We assume the posets satisfy that following properties, which as the reader may check, will be sufficient to carry out Cummings’ argument for the Prikry Property and related lemmas.
For Mahlo cardinals α<β, P(α,β), Q(α,β), and πα,β are such that:
(1)
P(α,β) is a partial order that is (2α)++-closed and of size ≤2β.
2. (2)
πα,β:P(α,β)→Q(α,β) is a projection.
3. (3)
If β is measurable and j:V→M is an embedding derived from a normal measure on β, then:
(a)
P(α,β)=P(α,β)M.
2. (b)
There is a filter G⊆P(β,j(β))M that is generic over M.
Suppose j:V→M is an elementary embedding with critical point κ derived from an extender E. Let U be the normal measure on κ derived from j, and let i0,1:V→N1 be the ultrapower embedding by U. Let i1,2:N1→N2 be the ultrapower embedding of N1 by i0,1(U), and let i0,2=i1,2∘i0,1. It follows from (3a) above and elementarity that P(κ,i0,1(κ))N1=P(κ,i0,1(κ))N2. Let
[TABLE]
Suppose G⊆P(κ,i0,1(κ))N1 is generic over N1. Let
[TABLE]
Notice that U can be read off from G∗. Let us define a measure sequence u constructed from (E,G). Let u(0)=κ, and if G∗∈M, let u(1)=G∗. For α>1, inductively let u(α)={X⊆Vκ:u↾α∈j(X)}, in case u↾α∈M.
We will say that (E,G) is an acceptable pair if in addition, E is a (κ,λ)-extender, with [λ]κ⊆M and ∣λ∣≤(2κ)+. This implies that Mκ⊆M and that if k:N1→M is the factor embedding, then k[G] generates an M-generic filter for P(κ,j(κ))M.
Given a measure sequence u constructed by an acceptable pair (E,G), we say that a set X⊆Vu(0) is u-measure-one if there is f∈u(1) such that domf=A2 and A⊆X, and for all α such that 1<α<lenu, X∈u(α).
We inductively define some well-behaved classes: Let U0 be the class of x such that x is either a measure sequence w of length >1 constructed by an acceptable pair, or x=w(0) for such a measure sequence w. Given Un, let Un+1 be the class of x∈Un such that for some measure sequence w∈Un of length >1, either x=w or x=w(0), and Un∩Vw(0) is w-measure-one.
Let U∞=⋂n<ωUn. If u∈U∞ and lenu>1, then by countable completeness, U∞∩Vu(0) is u-measure-one, and u↾α∈U∞ for 1<α<lenu. It is worth noting at this point:
Lemma 6.1** (Cummings).**
Suppose E is a (κ,(2κ)+)-extender witnessing that κ is (κ+2)-strong, (i.e. if j:V→M is the embedding by E, then Vκ+2⊆M). Let i:V→N be the embedding by the normal measure U on κ derived from E, and suppose G is P(κ,i(κ))N-generic over N. Then (E,G) constructs a measure sequence u∈U∞ of length (2κ)+.
Now we are ready to define the forcing Ru relative to a u∈U∞. Let κ=u(0). p is a condition in Ru iff p=⟨Xi:i≤n⟩, where n≥1 and there exists an increasing sequence of Mahlo cardinals κ0<⋯<κn=κ such that:
(1)
X0=⟨κ0⟩.
2. (2)
For 0<i<n, Xi is either a pair ⟨κi,pi⟩ with pi∈Q(κi−1,κi), or a quadruple ⟨wi,Ai,Hi,hi⟩, where:
(a)
wi∈U∞, lenwi>1, and κi=wi(0).
2. (b)
Ai is wi-measure-one and contained in Vκi∖Vκi−1.
3. (c)
If (Ei,Gi) is an acceptable pair that constructs wi, then Hi∈Gi∗.
4. (d)
hi is a function with domain Ai∩κi, and (∀α)hi(α)∈P(κi−1,α).
5. (e)
domHi=[domhi]2.
3. (3)
Xn is a quadruple ⟨wn,An,Hn,hn⟩ with the same properties as above, and wn=u.
If ⟨Xi:i≤n⟩ is a condition with associated sequence of cardinals ⟨κi:i≤n⟩, put κXi=κi. Let p=⟨Xi:i≤m⟩ and q=⟨Yi:i≤n⟩. We put p≤q when:
(1)
m≥n and X0=Y0.
2. (2)
{κXi:i≤m}⊇{κYi:i≤n}.
3. (3)
For 0<i<m, if Xi=⟨κXi,pi⟩,
then one of the following occurs:
(a)
There is j<n such that κXi=κYj. In this case, Yj is a pair ⟨κYj,qj⟩, κXi−1=κYj−1 also, and pi≤qj.
2. (b)
There is no j<n such that κXi=κYj. For the least j≤n such that κXi<κYj, Yj is a quadruple ⟨w,A,H,h⟩ with κXi∈A. If κXi−1=κYj−1, then pi≤πκXi−1,κXi(h(κXi)), and if κXi−1>κYj−1, then pi≤πκXi−1,κXi(H(κXi−1,κXi)).
4. (4)
For 0<i≤m, if Xi is a quadruple ⟨w,A,H,h⟩, then one of the following occurs:
(a)
There is j≤n such that Yj=⟨w,A′,H′,h′⟩. In this case, A⊆A′ and for all (α,β)∈domH, H(α,β)≤H′(α,β). If κXi−1=κYj−1, then for all α∈domh, h(α)≤h′(α). If κXi−1>κYj−1, then for all α∈domh, h(α)≤H′(κXi−1,α).
2. (b)
There is no j≤n such that κXi=κYj, and for the least j≤n such that κXi<κYj, Yj is a quadruple ⟨v,A′,H′,h′⟩ such that w∈A′, A⊆A′, and H(α,β)≤H′(α,β) for all (α,β)∈domH. If κXi−1=κYj−1, then for all α∈domh, h(α)≤h′(α). If κXi−1>κYj−1, then for all α∈domh, h(α)≤H′(κXi−1,α).
Now the forcing Ru′ is the same except that for every α<β Mahlo, we replace Q(α,β) with P(α,β) and πα,β with the identity function. The forcings Ru′ are of the type studied in [2]. In our more general class of forcings Ru, the simpler posets P(α,β) guide us along, until we have decided that α<β are successive points of the Radin sequence, and then we project to Q(α,β).
We say p≤∗q when p≤q and lenp=lenq. It is easy to see that if u∈U∞, p=⟨⟨κ0⟩,X1⟩, then ⟨Ru′↾p,≤∗⟩ is (2κ0)++-closed, and ⟨Ru↾p,≤∗⟩ is (2κ0)++-strategically closed.
Lemma 6.2**.**
If u∈U∞, then there is a length-preserving projection π:Ru′→Ru. Moreover, if q≤π(p), then there is p′≤p such that π(p′)≤∗q.
Proof.
Suppose p=⟨Xi:i≤n⟩∈Ru′. Let π(p)=⟨Yi:i≤n⟩, where Xi=Yi if i=0 or Xi is a quadruple, and if Xi=⟨κi,pi⟩, then Yi=⟨κi,πκi−1,κi(pi)⟩. π is order-preserving because each πα,β is, and by requirement (3b) in the definition of the ordering for Ru.
Suppose p=⟨Xi:i≤n⟩∈Ru′, q=⟨Yi:i≤m⟩∈Ru, and q≤π(p). We need to find a condition p′=⟨Zi:i≤m⟩≤p such that π(p′)≤q. If i=0 or Yi is a quadruple, let Zi=Yi. Suppose i<m is such that Yi is a pair ⟨κ,qi⟩, and let μ=κYi−1. If there is j<n such that κ=κXj, then Xj is a pair ⟨κ,pj⟩, μ=κXj−1, and qi≤πμ,κ(pj). Find pi′≤pj such that πμ,κ(pi′)≤qi, and put Zi=⟨κ,pi′⟩.
If there is no such j<n, then let j≤n be least such that κYi<κXj and Xj is a quadruple ⟨w,A,H,h⟩. If μ=κXj−1, let pi=h(κ), and otherwise let pi=H(μ,κ).
We must have that qi≤πμ,κ(pi). Find pi′≤pi such that πμ,κ(pi′)≤qi, and put Zi=⟨κ,pi′⟩.
It is straightforward to check that p′ is as desired.
∎
The following two lemmas are easy to verify:
Lemma 6.3**.**
Suppose u∈U∞ and p=⟨Xi:i≤n⟩∈Ru. Suppose m0<m1<n are such that Xm0 is a quadruple ⟨w,A,H,h⟩, and Xi is a pair ⟨κi,pi⟩ for m0<i≤m1. Then Ru↾p is isomorphic to
[TABLE]
[TABLE]
Lemma 6.4**.**
Suppose u∈U∞ and G⊆Ru is generic. Let κ=u(0) and let C={α:(∃p=⟨Xi:i≤n⟩∈G)(∃i<n)α=κXi}. Then C is club in κ.
The most important result concerning these forcings is the following, known as the Prikry Property. The proof takes some work, and we refer the reader to [2, Section 3.4] for a complete account.
Theorem 6.5** (Cummings).**
Suppose u∈U∞, p∈Ru′, and σ is a sentence in the forcing language of Ru′. Then there is q≤∗p deciding σ.
Corollary 6.6**.**
The Prikry Property also holds for Ru:
If u∈U∞, p∈Ru, and σ is a sentence in the forcing language of Ru, then there is q≤∗p deciding σ.
Proof.
Let π:Ru′→Ru be the projection given by Lemma 6.2. Let q0∈Ru and let σ be a sentence in the forcing language of Ru. Let p0∈R′ be such that π(p0)≤∗q0. Let p1≤∗p0 decide whether σ holds in the submodel VRu, and let us assume it forces that σ holds. If π(p1) does not force σ, let q1≤π(p1) force ¬σ. Let p2≤p1 be such that π(p2)≤q1. But then p2 forces both that σ and ¬σ hold in the submodel VRu, a contradiction. Thus π(p1)≤∗q0 and π(p1) decides σ.
∎
Corollary 6.7**.**
Suppose u∈U∞, p=⟨Xi:i≤n⟩∈Ru, and X0=⟨κ0⟩. Then Ru↾p adds no subsets of (2κ0)+. Thus if P is a forcing of size ≤(2κ0)+, then Ru adds no subsets of (2κ0)+ over VP.
Now we specify the partial orders P(α,β) and Q(α,β) and the projections πα,β. For Mahlo α<β, let
[TABLE]
In a model satisfying the conclusion of Lemma 5.9, we have by Lemma 4.3 that whenever α<β are Mahlo, Col(α+4,β) forces that there is a saturated ideal on α+4 whose associated forcing projects to Col(α+3,α+4)×Add(α+4,β+). By Lemma 3.4, there is in this model a stationary S⊆Sα+4 (the latter being the one that witnesses layeredness of the ideal on α+3), and there is an S-iteration Cα+4 of length β+ that forces NSα+4 to be locally saturated. By Lemma 3.2, there is a projection
[TABLE]
Thus we let Q(α,β)=Col(α+4,β)∗C˙α+4, and we let
πα,β(p,q,r)=⟨p,σ˙α,β(qˇ,rˇ)⟩.
These specifications clearly fulfill the first two requirements for our partial orders. For the third, if β is measurable, α<β is Mahlo, and j:V→M is an embedding derived from a normal measure on β, then P(α,β)=P(α,β)M because M correctly computes β+. By GCH, β+<j(β+)<β++. Thus by the β+-closure and j(β+)-c.c. in M of P(β,j(β))M, we can build filter G∈V that is generic over M.
For the remainder of this article, when we refer to the forcings Ru and Ru′, we mean those defined in our preparatory model using the above specifications. The important feature of our version of Radin forcing, which is not shared by Cummings’ version, is the chain condition:
Lemma 6.8**.**
Suppose u∈U∞ and κ=u(0). Then Ru is κ+-c.c. Moreover, it preserves κ++-saturated ideals on κ+.
Proof.
Suppose ⟨pα:α<κ+⟩⊆Ru. Let pα=xα⌢⟨u,Aα,Hα,hα⟩. We can assume there is a fixed x=⟨X0,…,Xn−1⟩ such that xα=x for all α. Let U be the ultrafilter associated to u(1) and let jU:V→M be the embedding by U. For each α, [hα]U∈P(κn−1,κ), which is (κ+∩cof(κ))-layered. Let α<β be such that hα,hβ represent compatible conditions. Since Hα,Hβ represent conditions in a filter, pα and pβ are compatible.
To show that Ru preserves saturated ideals on κ+, suppose I is such an ideal and i:V→N⊆V[G] is a generic ultrapower via I. Then the above argument can be carried out in N. In particular, if M′ is the ultrapower of N by i(U), then N satisfies that P(κn−1,κ) is (i(κ+)∩cof(κ))-layered. This is true in V[G] as well since Nκ∩V[G]⊆N. Thus by Corollary 2.16, Ru forces that the ideal generated by I is κ++-saturated.
∎
Lemma 6.9** (Cummings).**
Suppose u∈U∞, u(0)=κ, and lenu≥(2κ)+. Then Ru′ preserves the measurability of κ.
Now fix a cardinal κ which is (κ+2)-strong as witnessed by a (κ,κ++)-extender E, let G be such that (E,G) is an acceptable pair, and let u be a measure sequence of length κ++ constructed by (E,G). Let H⊆Ru be generic. By Lemma 6.9, VκV[H] is a model of ZFC. Let C⊆κ be the Radin club introduced by H, and let κ0=minC. Because of Lemma 6.3, Corollary 6.7, and the interleaved collapses, the set of limit cardinals in κ∖κ0 in V[H] is simply the set of limit points of C. Let h⊆Col(ω,κ0) be generic over V[H]. We claim that VκV[H][h] is a model demonstrating Theorem 1.
First we check that □δ holds for all δ<κ. If μ is a successor cardinal of V[H][h], then μ=ν+ for some cardinal ν of V. □ν holds in V. Although ν may be collapsed, Lemma 5.5 implies that □η holds in V[H][h], where η is the predecessor of μ in the final model.
Now let μ0<μ1 be two successive points of C. Suppose first that μ0 is a limit point. Let p∈H force this, so that p=⟨Xi:i≤n⟩ is such that for some m<n, Xm is a quadruple ⟨w,A,H,h⟩ with w(0)=μ0 and Xm+1 is a pair ⟨μ1,pm+1⟩ By Lemma 6.3,
[TABLE]
In V, NSμ0+ is locally saturated, and this is preserved by Rw by Lemma 6.8. The local saturation of NSμ0++ is preserved since ∣Rw∣=μ0+. The upper factor Q(μ0,μ1)×Ru↾⟨⟨μ1⟩,Xm+2,…,Xn⟩ preserves this, since it adds no further subsets to μ0+3.
For μ0+3, in V there is some stationary A⊆μ0+3 such that P(A)/NS is Sμ0+4-layered. The factor Q(μ0,μ1) preserves the stationarity of Sμ0+4 and adds no subsets of μ0+3, and thus preserves that NSμ0+3 is locally saturated. This is preserved by the small lower factor Rw, and by the upper factor Ru↾⟨⟨μ1⟩,Xm+2,…,Xn⟩, which adds no further subsets of μ0+4.
For μ0+4, the local saturation of NSμ0+4 is explicitly forced by Q(μ0,μ1). This is preserved by the small lower factor Rw, and then by the upper factor Ru↾⟨⟨μ1⟩,Xm+2,…,Xn⟩, which adds no further subsets of μ1+=(μ0+5)V[H].
Now suppose that μ0 is a successor point or the least point of C. If p∈H forces this, then we may assume that p=⟨Xi:i≤n⟩ and
[TABLE]
where P is either trivial or (μ0+∩cof(μ0))-layered. P preserves the local saturation of NSμ0+, and this is preserved by the upper factor, which adds no subsets of μ0++. The local saturation of NSμ0+k for 2≤k≤4 is forced for the same reasons as in the case that μ0 is a limit point.
Finally, all of these saturation properties are preserved by the small forcing Col(ω,κ0), which makes the class of successor cardinals in V[H] above κ0 equal to the class of all successor cardinals.
This concludes the proof of Theorem 1.
Bibliography18
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Sean Cox and Monroe Eskew, Strongly proper forcing and some problems of Foreman , Trans. Amer. Math. Soc. 371 (2019), no. 7, 5039–5068. MR 3934477
2[2] James Cummings, A model in which GCH holds at successors but fails at limits , Trans. Amer. Math. Soc. 329 (1992), no. 1, 1–39. MR 1041044
3[3] James Cummings, Matthew Foreman, and Menachem Magidor, Squares, scales and stationary reflection , J. Math. Log. 1 (2001), no. 1, 35–98. MR 1838355
4[4] William B. Easton, Powers of regular cardinals , Ann. Math. Logic 1 (1970), 139–178. MR 0269497
5[5] Monroe Blake Eskew, Measurability Properties on Small Cardinals , Pro Quest LLC, Ann Arbor, MI, 2014, Thesis (Ph.D.)–University of California, Irvine. MR 3279214
6[6] Matthew Foreman, More saturated ideals , Cabal seminar 79–81, Lecture Notes in Math., vol. 1019, Springer, Berlin, 1983, pp. 1–27. MR 730584
7[7] by same author, Ideals and generic elementary embeddings , Handbook of set theory. Vols. 1, 2, 3, Springer, Dordrecht, 2010, pp. 885–1147. MR 2768692
8[8] by same author, Calculating quotient algebras of generic embeddings , Israel J. Math. 193 (2013), no. 1, 309–341. MR 3038554