This paper explores the potential for global versions of Chang's Conjecture involving singular cardinals, establishing ZFC limitations and consistency results relative to large cardinals.
Contribution
It demonstrates ZFC limitations and shows that Chang's Conjecture can be consistently extended between all pairs of limit cardinals below .
Findings
01
ZFC imposes limitations on global Chang's Conjecture with singular cardinals
02
Consistency of Chang's Conjecture between all limit cardinals below established relative to large cardinals
03
Results advance understanding of the interplay between singular cardinals and Chang's Conjecture
Abstract
We investigate the possibilities of global versions of Chang's Conjecture that involve singular cardinals. We show some ZFC limitations on such principles, and prove relative to large cardinals that Chang's Conjecture can consistently hold between all pairs of limit cardinals below ℵωω.
Equations85
∣B∩κ∣∣B∩λ∣≥∣B∩δ∣.
∣B∩κ∣∣B∩λ∣≥∣B∩δ∣.
gC(i)={sup{gβ(i)+1:β∈C}0 if μi>∣C∣, otherwise.
gC(i)={sup{gβ(i)+1:β∈C}0 if μi>∣C∣, otherwise.
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.
We investigate the possibilities of global versions of Chang’s Conjecture that involve singular cardinals. We show some ZFC limitations on such principles and prove relative to large cardinals that Chang’s Conjecture can consistently hold between all pairs of limit cardinals below ℵωω.
The Löwenheim-Skolem theorem asserts that for every pair of infinite cardinals κ>μ and every structure A on κ in a countable language, there is a substructure B⊆A of size μ. “Chang’s Conjecture” is a type of principle strengthening this theorem to assert similar relationships between sequences of cardinals. For example (κ1,κ0)↠(μ1,μ0) says that for every structure A on κ1 in a countable language, there is a substructure B of size μ1 such that ∣B∩κ0∣=μ0. The following basic observation puts some constraints on this type of principle:
Proposition 1**.**
Suppose κ,λ≤δ and κλ≥δ. Then there is a structure A on δ such that for every B≺A,
[TABLE]
Corollary \thecorollary.
If (κ1,κ0)↠(μ1,μ0), ν≤κ0, and κ0ν≥κ1, then μ0min(μ0,ν)≥μ1.
From this, we immediately see that under GCH, (κ+,κ)↠(μ+,μ) can only occur when cf(κ)≥cf(μ). (The consistency of contrary cases is unknown.) This inspires the following bold conjecture:
Definition** (Global Chang’s Conjecture).**
We say that the Global Chang’s Conjecture holds if for all infinite cardinals μ<κ with cf(μ)≤cf(κ), (κ+,κ)↠(μ+,μ).
In the paper [6], we showed, assuming the consistency of a huge cardinal, that there is a model of ZFC+GCH in which (κ+,κ)↠(μ+,μ) holds whenever κ is regular and μ<κ is infinite. Surprisingly, the full Global Chang’s Conjecture is inconsistent (even without assuming GCH), as we show in Theorem 2. Indeed, there is a tension between instances of Chang’s Conjecture at successors of singular cardinals and at double successors of singulars.
Next, we investigate other forms of Global Chang’s Conjecture:
Definition** (Singular Global Chang’s Conjecture).**
We say that the Singular Global Chang’s Conjecture holds if for all infinite μ<κ of the same cofinality, (κ+,κ)↠(μ+,μ).
Obtaining the Singular Global Chang’s Conjecture seems to be hard. We present here a partial result, showing that there is a model in which the Singular Global Chang’s Conjecture holds for cardinals below ℵωω.
The paper is organized as follows. In Section 2 we discuss some relationships between Chang’s Conjecture and PCF-theoretic scales, and derive some ZFC limitations on the simultaneous occurrence of some instances of Chang’s Conjecture. In Section 3, we introduce the technology for obtaining (ℵα+1,ℵα)↠(ℵβ+1,ℵβ) for various choices of α and β of countable cofinality. In Section 4 we construct a model in which (ℵα+1,ℵα)↠(ℵβ+1,ℵβ) holds for all limit ordinals 0≤β<α<ωω. In Section 5, we show the consistency of (ℵα+1,ℵα)↠(ℵβ+1,ℵβ) holding for a fixed β but for α ranging over a longer interval of limit ordinals. We conclude with some open questions.
2. Limitations on Global Chang’s Conjecture
A useful strengthening of Chang’s Conjecture is the following, introduced by Shelah [21]:
Definition**.**
We say (κ1,κ0)↠ν(μ1,μ0) if for all structures A on κ1 in a countable language, there is a substructure B such that ∣B∣=μ1, ∣B∩κ0∣=μ0, and ν⊆B.
Note that nothing more is asserted by adding the subscript ν when ν<ω1. These versions of Chang’s Conjecture are robust under mild forcing:
Lemma \thelemma.
Suppose (κ1,κ0)↠ν(μ1,μ0) and P is a ν+-c.c. partial order. Then ⊩P(κ1,κ0)↠ν(μ1,μ0).
Of particular interest is the case ν=μ0. The following lemma gives a stepping-up of the Chang’s Conjecture if the distance between the cardinals considered is not too great, or enough GCH holds relatively close to the upper end. A proof is contained in [8, Section 2.2.1].
Lemma \thelemma.
Suppose (κ1,κ0)↠ν(μ1,μ0).
(1)
If κ0=μ0+ν, then (κ1,κ0)↠μ0(μ1,μ0).
2. (2)
If λ≤μ0 and there is κ≤κ0 such that κ0=κ+ν and κλ≤κ0, then (κ1,κ0)↠λ(μ1,μ0).
When the hypotheses of the above lemma cannot be applied, some GCH at the lower end allows a similar conclusion in a special case.
Lemma \thelemma.
Suppose μ<ν=μ, and (κ+,κ)↠(μ+,μ). Then (κ+,κ)↠ν(μ+,μ).
Proof.
If κν=κ, then the conclusion follows from (2) of Lemma 2. Otherwise, let A be a structure on κ+ which is isomorphic to a transitive elementary substructure of (Hκ++,∈,⊲,μ,ν), where ⊲ is a well-order of Hκ++. It is easy to see that the conclusion of Proposition 1 applies to A with respect to the cardinals κ,ν,κ+. If B≺A witnesses Chang’s Conjecture, then ∣B∩κ∣∣B∩ν∣=μ∣B∩ν∣≥∣B∩κ+∣=μ+. Thus ∣B∩ν∣=ν.
Let δ∈B∩ν. Corollary 1 implies that κδ=κ. Let ⟨fα:α<κ⟩∈B list all functions from δ to κ. Let B′=HullA(B∪δ). If β∈κ∩B′, then there is function f∈δκ∩B and γ<δ such that β=f(γ). Thus B′∩κ={fα(γ):α∈B∩κ and γ<δ}, which has size μ. Now let C=HullA(B∪ν). Since B is cofinal in ν, C=⋃{HullA(B∪δ):δ∈B∩ν}, so ∣C∩κ∣=μ.
∎
Versions of Chang’s Conjecture involving singular cardinals have a strong influence on the combinatorics in their neighborhood, even without cardinal arithmetic assumptions. Recall that if κ is singular, a scale for κ is a collection of functions ⟨fα:α<κ+⟩ contained in some product ∏i<cf(κ)κi, where ⟨κi:i<cf(κ)⟩ is an increasing and cofinal sequence of regular cardinals below κ, such that the functions fα are increasing and cofinal in the partial order of the product where we put f<g when ∣{i:f(i)≥g(i)}∣<cf(κ). It is easy to construct scales under the assumption 2κ=κ+, but Shelah proved in ZFC that scales exist for all singular cardinals (see [1]).
A scale ⟨fα:α<κ+⟩ is good at α when there is a sequence g=⟨gi:i<cf(α)⟩ and j⋆<cf(κ), such that for all j≥j⋆, ⟨gi(j)∣i<cf(α)⟩ is increasing and g and ⟨fβ:β<α⟩ are interleaved (i.e., cofinal in each other). A scale is bad at α when it is not good at α. A scale is better at α if there is a club C⊆α such that for all β∈C there is j<cf(κ) such that fγ(i)<fβ(i) for i≥j and γ∈C∩β. Note that if cf(α)>cf(κ), then being better at α implies being good at α. A scale is simply called good (or better) if it is good (or better) at every α such that cf(α)>cf(κ). The key connection with Chang’s Conjecture is the following (see [10] or [21]):
Lemma \thelemma.
If κ is singular and (κ+,κ)↠cf(κ)(μ+,μ), then there is no good scale for κ. Moreover, every scale ⟨fα:α<κ+⟩ for κ is bad at stationarily many α of cofinality μ+.
We now show that the full Global Chang’s Conjecture is inconsistent with ZFC.
Lemma \thelemma.
Suppose κ is regular, μ<κ is singular, and (κ+,κ)↠(μ+,μ). Then μ carries a better scale. Moreover, if cfμ=ω then □μ∗ holds.
Proof.
Let us start with a general observation, following [9, Theorem 2.15].
Claim \thelemma.
Let μ<κ=cf(κ) be cardinals. Let θ be a regular cardinal above κ+. If H is the transitive collapse of some elementary substructure of Hθ of size κ+ containing κ+, and M≺H is such that ∣M∩κ+∣=μ+ and ∣M∩κ∣=μ, then cf(sup(M∩κ))=cf(μ).
Proof.
Fix in such an H a sequence ⟨xα:α<κ+⟩ of “strongly almost disjoint” unbounded subsets of κ. That is, for every α<κ+, there is a sequence ⟨γβα:β<α⟩∈H of ordinals below κ such that ⟨xβ∖γβα:β<α⟩ is pairwise disjoint. This principle, due to Shelah, is called ADSκ and it holds for κ regular (see [4] and [22]).
Let M≺H be as above. Let f:μ→M∩κ be a bijection. If cf(sup(M∩κ))=cf(μ), then for each α<M∩κ+ there is δα<μ such that f[δα]∩xα is cofinal in M∩κ. Since ∣M∩κ+∣=μ+, there is a set Y⊆M∩κ+ of size μ+ and a fixed δ<μ such that δα=δ for all α∈Y. Let ζ∈M∩κ+ be large enough so that ∣Y∩ζ∣=μ. Note that ⟨γβζ∣β<ζ⟩∈M and thus for every β∈M∩ζ, γβζ∈M∩κ.
For β∈Y∩ζ, let yβ=f[δ]∩xβ∖γβζ. Then {f−1[yβ]:β∈Y∩α} is a collection of μ-many pairwise disjoint subsets of δ, which is impossible.
∎
Let us return to the proof of the lemma.
By a theorem of Shelah [21],
κ carries a “partial weak square”, a weak square sequence that misses only cofinality κ. That is, there is a sequence ⟨Cα:α<κ+⟩ such that whenever ω≤cf(α)<κ, then Cα is a nonempty collection of size ≤κ such that each C∈Cα is a club subset of α of size <κ, and if C∈Cα and β∈limC, then C∩β∈Cβ.
Let M≺H be as above, with C∈M a partial weak square at κ. Let π:M→N be the transitive collapse. Let D=π(C). Since ot(M∩κ+)=μ+ and ∣M∩Cα∣≤μ for each α∈M∩κ+, D is a sequence ⟨Dα:α<μ+⟩, such that each Dα has size ≤μ, if D∈Dα and β∈limD, then D∩β∈Dβ, and Dα is nonempty whenever α is a limit ordinal such that cf(π−1(α))=κ. If α is such that cf(π−1(α))=κ, then there is an increasing cofinal map f:κ→π−1(α) in M, which implies that cf(α)=cf(μ). Therefore, Dα is nonempty whenever cf(α)=cf(μ). Furthermore, if D∈Dα, then ot(D)<π(κ).
Next, we modify D to a sequence E with the same properties except that ∣C∣<μ whenever C∈Eα and α<μ+. It is easy to show by induction that for each η<μ+, there is a “short square” of length η—a coherent sequence of clubs ⟨Eα:α<η⟩ such that ∣Eα∣<μ for each α<η. Fix such a sequence ⟨Eα:α<π(κ)⟩. For each α<μ+, let Eα={{β∈D:ot(D∩β)∈Eot(D)}:D∈Dα}. Clearly each element of each Eα has size <μ. If C∈Eα and β∈limC, then there is D∈Dα such that β∈limD and C={β∈D:ot(D∩β)∈Eot(D)}. Thus D∩β∈Dβ and ot(D∩β)∈limEot(D), so C∩β∈Eβ.
Note that E is a partial weak square, avoiding only ordinals of cofinality cfμ. Thus if cfμ=ω, one can easily obtain a weak square sequence by completing the missing points in E.
Fix a scale for μ, ⟨fα:α<μ+⟩⊆∏i<cf(μ)μi. Let us inductively construct a better scale ⟨gα:α<μ+⟩ as follows. Let g0=f0. If Eα is empty, let gα=fγ, where γ≥α and fγ eventually dominates gβ for each β<α. If Eα is nonempty, first, for all C∈Eα, define
[TABLE]
Then let gα=fγ, where γ≥α and fγ eventually dominates gβ for each β<α and gC for each C∈Eα.
Clearly ⟨gα:α<μ+⟩ is a scale. To check betterness, if cf(α)>cf(μ), let C∈Eα. If β∈limC, then
C∩β∈Eβ. There is i<cf(μ) such that gC∩β(j)>gγ(j) for i<j<cf(μ) and γ∈C∩β. Thus if C′ is the set of limit points of some C∈Eα, then for all β∈C′ there is i<cf(μ) such that gβ(j)>gγ(j) for i<j<cf(μ) and γ∈C′∩β.
∎
Suppose κ is singular, λ>κ is regular, (λ+,λ)↠(κ+,κ), and cf(κ)≤μ<κ. Then (κ+,κ)↠cf(κ)(μ+,μ). Thus if μ<cf(κ)=μ, then (κ+,κ)↠(μ+,μ).
Corollary \thecorollary.
[ℵ0,ℵω]* is the maximal initial interval of cardinals on which the Global Chang’s Conjecture can hold.*
The negative direction follows from Theorem 2 and the positive direction is proven in [6, Section 5].
It seems to be unknown whether (κ+,κ)↠(μ+,μ) is equivalent to (κ+,κ)↠μ(μ+,μ) for regular μ. However, further analysis of scales allows us to rule out some instances of Chang’s Conjecture in ZFC, and to show that these two notions are not in general equivalent for singular μ, even under GCH. The authors are grateful to Chris Lambie-Hanson for showing us how to prove the following:
Theorem 3**.**
Suppose κ is a singular cardinal and f=⟨fα:α<κ+⟩ is a scale for κ. There is a club C⊆κ+ such that for all regular cardinals μ,ν such that cf(κ)<μ<μ+3≤ν<μ+cf(κ)≤κ, f is good at every α∈C of cofinality ν.
Proof.
Suppose cf(κ)<μ<μ+3≤ν<μ+cf(κ)≤κ. By [1, Theorem 2.21], there is a club Cμ,ν⊆κ+ such that for every α∈Cμ,ν of cofinality ν, ⟨fβ:β<α⟩ has an exact upper bound g such that cf(g(i))≥μ for all i. g being an exact upper bound means that g is an upper bound to ⟨fβ:β<α⟩, and for every h<g, there is β<α such that h<fβ.
The arguments for Lemmas 6–8 of [17] show that cf(g(i))=ν on a cobounded set of i<cf(κ), which implies f is good at α. For the reader’s convenience: Let ⟨αj:j<ν⟩ be cofinal in α. We cannot have that cf(g(i))>ν for all i in an unbounded set X⊆cf(κ). For then there would be an i∗<cf(κ), an unbounded Y⊆ν, and an h<g such that fαj(i)<h(i)<g(i) for i∈X∖i∗ and j∈Y, contradicting that g is an exact upper bound. Thus there is some ν′∈[μ,ν] and an unbounded X⊆cf(κ) such that cf(g(i))=ν′ for all i∈X. Let ⟨gk:k<ν′⟩ be a pointwise increasing sequence such that supk<ν′gk(i)=g(i) for all i∈X. Since g is an exact upper bound, for each k<ν′, there is j<ν such that gk↾X<fαj↾X. Also, for each j<ν, there is i∗<cf(κ) such that fαj(i)<g(i) for i∈X∖i∗, and thus some k<ν′ such that fαj↾X<gk↾X. This implies ν′=ν.
Finally, we can take the intersection of all the Cν,μ for regular ν,μ<κ+ to get the desired club C.
∎
Therefore, if κ is singular, (κ+,κ)↠cf(κ)(μ+,μ) fails whenever cf(κ)+3≤μ<cf(κ)+cf(κ).
However, it is possible that the version of Chang’s Conjecture holds when we drop the subscript “cf(κ)” on the arrow:
Proposition 4**.**
Suppose there is a 3-huge cardinal. Then there are singular cardinals λ<δ such that cf(δ)<λ<cf(δ)+cf(δ) and (δ+,δ)↠(λ+,λ).
Proof.
Let j:V→M have critical point κ, with Mj3(κ)⊆M. Let δ=j2(κ)+j(κ) and let λ=j(κ)+κ. Let A be any structure on δ+. In M, j[A]≺j(A), and we have that ∣j[A]∣=δ+ and ∣j[A]∩j(δ)∣=δ. Reflecting through j, we have that there is B≺A such that ∣B∣=j(κ)+κ+1=λ+ and ∣B∩δ∣=j(κ)+κ=λ.
∎
3. Chang’s Conjecture between successors of various singulars
Recall that a partial order is (κ,λ)-distributive if forcing with it adds no functions from κ to λ. The following lemma is a mild generalization of a lemma that was proved in [6].
Lemma \thelemma.
Let γ<κ be such that κ+γ is a strong limit cardinal and κ is κ+γ+1-supercompact, as witnessed by an embedding j:V→M. If U is the ultrafilter on κ derived from j, then there is A∈U such that for every α<β in A∪{κ} and every iteration P∗Q˙ of size <β+γ, such that P is α+γ+1-Knaster and ⊩PQ˙ is (α+γ+1,α+γ+1)-distributive,
[TABLE]
Proof.
We show that for a set A∈U, for every α∈A and every iteration P∗Q˙ satisfying the hypothesis for β=κ forces (κ+γ+1,κ+γ)↠α+γ(α+γ+1,α+γ). Then standard reflection arguments yield the desired conclusion. By Lemma 2, it suffices to prove that for all α∈A, every such P∗Q˙ forces (κ+γ+1,κ+γ)↠γ(α+γ+1,α+γ), since by the assumptions that κ+γ is a strong limit and ∣P∗Q˙∣<κ+γ, it is forced that for some λ∈[κ,κ+γ), λκ<κ+γ, so we may increase the subscript to α+γ. If the claim fails, then on a set B∈U, for every α∈B, there is an iteration Pα∗Q˙α and a name for a function f˙α:(κ+γ+1)<ω→κ+γ such that it is forced that for every X⊆κ+γ+1 of size α+γ+1 with γ⊆X, the closure of X under f˙α contains α+γ+1-many ordinals below κ+γ. We may assume that f˙α is forced to be closed under compositions.
In M, let P∗Q˙=j(⟨Pα∗Q˙α:α<κ⟩)(κ) and let f˙=j(⟨f˙α:α<κ⟩)(κ). Let X=j[κ+γ+1]. Note that X is a subset of j(κ+γ+1) containing γ and of size κ+γ+1. By hypothesis, ⊩P∗Q˙M∣f˙[X<ω]∣=κ+γ+1. Since j(κ+γ) is singular, it is forced that there is a sequence ⟨b˙α:α<κ+γ+1⟩⊆X such that ⟨f˙(b˙α):α<κγ+1⟩ is a strictly increasing sequence of ordinals below j(κ+ξ), for some ξ<γ. Let ν<γ and (p0,q˙0)∈P∗Q˙ be such that ∣P∗Q˙∣<j(κ+ν) and (p0,q˙0)⊩f˙(b˙α)<j(κ+ν) for all α<κ+γ+1.
Since Q˙ adds no subsets to X, there is a P-name Y˙ and a condition (p1,q˙1)≤(p0,q˙0) such that (p1,q˙1)⊩⟨b˙α:α<κ+γ+1⟩=Y˙. Next, for each α<κ+γ+1, find rα≤p1 and aα∈(κ+γ+1)<ω such that rα⊩Pj(aˇα)=Y˙(α). Since P is κ+γ+1-Knaster, there is Z⊆κ+γ+1 of size κ+γ+1 such that rα and rβ are compatible for α,β∈Z. Therefore, for α<β in Z, there is r∈P such that (r,q˙1)⊩f˙(j(aˇα))<f˙(j(aˇβ))<j(κ+ν).
Reflecting these statements to V, we have that for α<β in Z, there are γ<κ and (p,q˙)∈Pγ∗Q˙γ such that ∣Pγ∗Q˙γ∣<κ+ν and (p,q˙)⊩Pγ∗Q˙γVf˙γ(aˇα)<f˙γ(aˇβ)<κ+ν. This defines a coloring of [κ+γ+1]2 in κ+ν-many colors. Since κ+γ is a strong limit, the Erdős-Rado Theorem implies that there is a set H⊆Z of size κ+ν+1 such that all pairs in [H]2 get the same color. Thus we have a fixed η and a fixed (p,q˙)∈Pη∗Q˙η such that (p,q˙)⊩f˙η(aα)<f˙η(aβ)<κ+ν for α<β in H. This is a contradiction.
∎
Corollary \thecorollary.
If there is a (+ω+1)-supercompact cardinal, then there is a forcing extension in which (ℵα+1,ℵα)↠(ℵβ+1,ℵβ) holds for all limit ordinals 0≤β<α<ω2.
Proof.
Let κ be κ+ω+1-supercompact, and let A⊆κ be given by Lemma 3. Let ⟨αi:i<ω⟩ enumerate the first ω elements of A. Let
[TABLE]
Clearly, P forces that αn+ω=ℵω⋅n for all n. For a fixed n, we can factor P as Q0×Col(αn+ω+2,αn+1)×Q1. By Lemma 3, the product of the first two factors forces
(αn+1+ω+1,αn+1+ω)↠αn+ω(αn+ω+1,αn+ω). Since Q1 remains αn+1+ω+2-distributive after this, the instance of Chang’s Conjecture is preserved.
Since Chang’s Conjecture is transitive, i.e. (κ1,κ0)↠(μ1,μ0) and (μ1,μ0)↠(ν1,ν0) implies (κ1,κ0)↠(ν1,ν0), the conclusion follows.
∎
The limitation of our argument so far is that we only get Chang’s Conjecture between successors of singulars for which there are tail-end sequences of cardinals below that are order-isomorphic. We will overcome this with a forcing that collapses singular cardinals to onto others of different types while preserving their successors and the desired instances of Chang’s Conjecture.
Theorem 5**.**
Assume GCH. Suppose α<β are countable limit ordinals and κ is κ+β+1-supercompact. Then there is a forcing extension in which (ℵβ+1,ℵβ)↠(ℵα+1,ℵα).
The proof breaks into cases depending on the “tail types” of α and β. For ordinals α≥β, let α−β be the unique γ such that α=β+γ. For an ordinal α, let τ(α) (the tail of α) be minβ<α(α−β). Let ι(α) be the least β such that α=β+τ(α). An ordinal α is indecomposable iff α=τ(α), and all tails are indecomposable.
Case 1: τ(α)=τ(β)=γ, or α=0. Note that ι(β)≥α, and let δ=ι(β)−α. Let A⊆κ be given by Lemma 3 (with respect to γ). Let ζ<η be in A, and force with Col(ζ+γ+δ+2,η), so that the ordertype of the set of cardinals between ζ+γ and η+γ becomes δ+γ. By Lemma 3, we have (η+γ+1,η+γ)↠ζ+γ(ζ+γ+1,ζ+γ). If α=0, force with Col(ω,ζ+γ), and if α>0, force with Col(ℵι(α)+1,ζ). In both cases, Chang’s Conjecture is preserved, and we get ∣ζ+γ∣=ℵα and η+γ=ℵα+δ+γ=ℵβ.
For the other cases, we will use a variation on the Gitik-Sharon forcing [12], which singularlizes a large cardinal while collapsing a singular cardinal above it.
A structure ⟨P,≤,≤∗⟩ is a Prikry-type forcing when ≤ and ≤∗ are partial orders of P (called extension and direct extension respectively), with p≤∗q⇒p≤q, and such that whenever σ is a statement in the forcing language of ⟨P,≤⟩ and p∈P, then there is q≤∗p deciding σ. Such a forcing is called weakly κ-closed for a cardinal κ if ⟨P,≤∗⟩ is κ-closed.
It is easy to see that if P is of Prikry type and weakly κ+-closed, then it is (κ,κ)-distributive.
Suppose γ<δ are limit ordinals of countable cofinality, and γ=⟨γi:1≤i<ω⟩, δ=⟨δi:1≤i<ω⟩ are sequences such that:
(1)
γ is strictly increasing with supiγi=γ.
2. (2)
δ is nondecreasing with γ≤δ1 and ∑iδi=δ.
Suppose κ>δ is κ+γn-supercompact for each n≥1, and μ<κ is regular. For 1≤n<ω, let Un be a κ-complete normal measure on Pκ(κ+γn), and let jn:V→Mn≅Ult(V,Un) be the ultrapower embedding. By the closure of the ultrapowers and GCH, we may choose an Mn-generic Kn⊆Col(κ+δn+2,jn(κ))Mn. Let U=⟨Un:n<ω⟩ and K=⟨Kn:n<ω⟩.
With these choices made, we may define the forcing P(μ,γ,δ,U,K), which will have the following properties:
•
The forcing is of Prikry type, weakly μ-closed, and κ+γ-centered (and thus has the κ+γ+1-c.c.).
•
κ is forced to become μ+δ.
•
(κ+γ)V is collapsed to κ.
Conditions in P(μ,γ,δ,U,K) are sequences
[TABLE]
where:
(1)
For 1≤i≤n, xi∈Pκ(κ+γi), and κi:=xi∩κ is inaccessible.
2. (2)
For 1≤i<n, xi⊆xi+1, and κi+1>∣xi∣.
3. (3)
f0∈Col(μ,κ), and ran(f0)⊆κ1 if x1 is defined.
4. (4)
For 1≤i<n, fi∈Col(κi+δi+2,κi+1).
5. (5)
fn∈Col(κn+δn+2,κ).
6. (6)
For i>n, domFi∈Ui.
7. (7)
For i>n and x∈domFi, x⊇xn and κx:=x∩κ is an inaccessible cardinal greater than ∣xn∣+sup(ranfn).
8. (8)
For i>n and x∈domFi, Fi(x)∈Col(κx+δi+2,κ).
9. (9)
For i>n, [Fi]Ui∈Ki.
Suppose p=⟨f0,…,xn,fn,Fn+1,…⟩ and q=⟨f0′,…,xm′,fm′,Fm+1′,…⟩. We say q≤p when:
(1)
m≥n.
2. (2)
fi′⊇fi for i≤n, and xi=xi′ for 1≤i≤n.
3. (3)
For n<i≤m, xi′∈domFi and fi′⊇Fi(xi′).
4. (4)
For i>m, domFi′⊆domFi, and Fi′(x)⊇Fi(x) for x∈domFi′.
For p as above, let stem(p)=⟨f0,…,xn,fn⟩, and say the length of p is n. (The stem of a length-0 condition is of the form ⟨f0⟩.)
Lemma \thelemma.
Suppose μ,γ,δ,U,K are as above, and p=⟨f0,x1,…,xn,fn⟩⌢F is a condition of length n>0. Then P(μ,γ,δ,U,K)↾p is canonically isomorphic to
[TABLE]
where for each sequence s∈{γ,δ,U,K,F}, s′ is the sequence such that s′(m)=s(n+m) for m≥1.
We say q≤∗p when q≤p and they have the same length. If q≤p and stem(p) is an initial segment of stem(q), we say q is an end-extension of p, or q⪯p. Given a sequence F=⟨Fi:1≤i<ω⟩ such that ⟨∅⟩⌢F is a condition of length 0, and another condition p=stem(p)⌢⟨Hi:n<i<ω⟩, define
[TABLE]
Note that p∧F is both ⪯ and ≤∗p, but p∧F is not necessarily ≤⟨∅⟩⌢F. For a given stem s and sequence F as above, we define s∧F=p∧F, where p is the weakest condition with stem s.
It is easy to see that P(μ,γ,δ,U,K) is κ+γ-centered, and a density argument shows that it forces all cardinals in [κ,κ+γ] to have countable cofinality. The fact that not more damage is done than intended is a consequence of the Prikry Property, which follows from a more basic combinatorial property. If P is a partial order and c:P→{0,1,2}, we say c is a decisive coloring if whenever c(p)>0 and q≤p, then c(q)=c(p).
Lemma \thelemma.
Let c be a decisive coloring of P(μ,γ,δ,U,K).
(1)
There is a sequence F such that for every condition p, every two r,r′⪯p∧F of the same length have the same color.
2. (2)
For every condition p, there is q≤∗p such that every two r,r′≤q of the same length have the same color.
Proof.
Let P=P(μ,γ,δ,U,K). For (1), we prove the following claim by induction: For all n<ω and all decisive colorings of the conditions of length n, there is F such that for all m≤n and every condition p of length m, every two r,r′⪯p∧F of length n have the same color. Suppose n=0 and c is such a coloring. For every s∈Col(μ,κ), choose if possible some Fs such that c(⟨s⟩⌢Fs)>0. Using the closure of the higher collapses and diagonal intersections, we may select a single sequence F such that ⟨s⟩∧F≤⟨s⟩⌢Fs for all s. By decisiveness, F witnesses the claim for n=0.
Suppose the claim is true for n−1. Let c be any decisive coloring of the conditions of length n. Using the closure of Col(κ+δn+2,jUn(κ))Mn, the genericity of Kn, and the decisiveness of jUn(c), we can find a function f∗∈Kn such that for every stem s of length n−1, if there are some g and F such that g⊇f∗ and s⌢⟨jUn[κ+γn],g⟩⌢F has color >0, then s⌢⟨jUn[κ+γn],f∗⟩⌢F already has this color. If Fn represents f∗, then for all stems s of length n−1, there is As∈Un and a color cs<3 such that for all x∈As, either there is Fs,x=⟨Fks,x:n+1≤k<ω⟩ such that s⌢⟨x,Fn(x)⟩⌢Fs,x has color cs>0, or for all x∈As and all g⊇Fn(x), any p of length n with stem s⌢⟨x,g⟩ has color 0. Let A be the diagonal intersection of the sets As.
Using the directed-closure of the filters Kk and diagonal intersections, we may select a single sequence F that plays the role of Fs,x for all s and x. Putting F′=⟨Fn↾A⟩⌢F, we have that for any condition p of length n−1, all q⪯p∧F′ of length n have the same color. This defines a decisive coloring c′ of the conditions of length n−1 of the form p∧F′, by coloring them whatever color an arbitrary length-n end-extension receives. By induction, there is F′′ such that for every m≤n−1, for every condition p of length m, every q⪯p∧F′′ of length n−1 receives the same color under c′. This means that every such p∧F′′ receives the same color under c when end-extended to a condition of length n.
To finish the argument for (1), let c be a decisive coloring of P. We have for each n a sequence Fn such that the restriction of c to conditions of length n satisfies the inductive claim. Using the countable closure of the filters Km, we can find the desired F by taking a lower bound to all the conditions of the form ⟨∅⟩⌢Fn.
For (2), let F be given by (1) and let p∈P. If there is s≤stem(p) such that some end-extension of s∧F has color >0, then pick such an s which achieves such a color c∗ by end-extending to length n, where n is as small as possible. Then every r,r′≤s⌢F have color 0 if their length is <n, and color c∗ otherwise.
∎
Corollary \thecorollary.
⟨P(μ,γ,δ,U,K),≤,≤∗⟩* is a Prikry-type forcing.*
Proof.
If σ is a sentence in the forcing language of P(μ,γ,δ,U,K), then we color a condition 0 if it does not decide σ, 1 if it forces σ, and 2 if it forces ¬σ. This is decisive, so for every p, there is q≤∗p such that all extensions of q of the same length have the same color. If q does not decide σ, then there are r,r′≤q of the same length forcing opposite decisions about σ, contradicting the property of q.
∎
Case 2 (of Theorem 5): τ(α)>τ(β)=γ. Again, we have ι(β)≥α, so let ξ=ι(β)−α.
Let A⊆κ be given by Lemma 3 (with respect to γ). Find ν<μ in A such that ν is ν+γ+1-supercompact. Let G⊆Col(ν+γ+ξ+2,μ) be generic over V. In V[G], (μ+γ+1,μ+γ)↠ν+γ(ν+γ+1,ν+γ) holds, and ν is still ν+γ+1-supercompact. Let γ=⟨γi:1≤i<ω⟩ be an increasing sequence converging to γ. Since τ(α)>γ, we may find a nondecreasing sequence α=⟨αi:1≤i<ω⟩ such that γ≤α1 and ∑iαi=α.
Since ν is ν+γ+1-supercompact, we can construct U and K as above according to the sequences γ,α.
Let H⊆P(ω,γ,α,U,K) be generic over V[G]. Since this forcing is ν+γ+1-c.c., Chang’s Conjecture is preserved. In the extension, ν=ℵα, (ν+γ+1)V[G]=(ν+)V[G][H], and μ+γ=ℵα+ξ+γ=ℵβ.
The third case requires a more detailed analysis of the Gitik-Sharon forcing.
Suppose P(μ,γ,δ,U,K) is built as above, around a sufficiently supercompact κ. Associated to a generic filter G are sequences ⟨xn:1≤n<ω⟩, and ⟨Cn:n<ω⟩ determined by the stems of all conditions in G, where C0 is generic for Col(μ,κ1), and for n≥1, Cn is generic for Col(κn+δn+2,κn+1) and xn∈Pκ(κ+γn). From this sequence, we can recover G by taking all conditions ⟨f0,x1,f1,…,xn,fn,Fn+1,…⟩ such that:
(1)
⟨xi:1≤i≤n⟩ is an initial segment of ⟨xi:1≤i<ω⟩.
2. (2)
For i≤n, fi∈Ci.
3. (3)
For i>n, xi∈domFi, and Fi(xi)∈Ci.
The collection of such conditions is a filter containing G, so it must equal G by the maximality of generic filters.
Lemma \thelemma.
Let V be a model of set theory, and let ⟨Pi,κi,Gi:i<n⟩ be such that:
(1)
⟨κi:i<n⟩* is an increasing sequence of regular cardinals in V.*
2. (2)
For each i, Pi is a partial order in V that is (κi,κi)-distributive and of size ≤κi+1.
3. (3)
For each i, Gi is Pi-generic over V.
Then ∏i<nGi is ∏i<nPi-generic over V.
Proof.
We show this by induction on m≤n. Suppose that ∏i<mGi is ∏i<mPi-generic over V. Since Pm is (κm,κm)-distributive, forcing with it adds no antichains to ∏i<mPi. Thus ∏i<mGi is ∏i<mPi-generic over V[Gm], and so ∏i≤mGi is ∏i≤mPi-generic over V.
∎
Lemma \thelemma.
(x,C)* generates a generic for P(μ,γ,δ,U,K) over V iff the following hold:*
(1)
For every sequence F=⟨Fn:1≤n<ω⟩ such that ⟨∅⟩⌢F is a condition of length 0, there is m such that for all n≥m, xn∈domFn and Fn(xn)∈Cn.
2. (2)
C0* is generic for Col(μ,κ1), and Cn is generic for Col(κn+δn+2,κn+1) for all n>0.*
Proof.
The forward direction is clear. For the reverse direction, let D∈V be a dense open subset of P=P(μ,γ,δ,U,K), and let G be the filter generated by (x,C). Let c:P→2 be defined by c(p)=0 if p∈/D and c(p)=1 otherwise. This is decisive, so let F be given by Lemma 3. Let m be given by (1).
Consider the condition p=⟨∅,x1,∅,…,xm−1,∅⟩⌢⟨Fi:m≤i<ω⟩. Let D′={q∈D:q≤p}. D′ projects to a dense subset of Col(μ,κ1)×Col(κ1+δ1+2,κ2)×⋯×Col(κm−1+δm−1+2,κm).
By (2) and Lemma 3, there is a sequence ⟨fi:i<m⟩ that is in the projection of D′ intersected with C0×⋯×Cm−1. Thus there is some condition of the form
[TABLE]
that is in D′. But by the homogeneity property of F, we also have that
[TABLE]
Therefore, D∩G=∅.
∎
Case 3 (of Theorem 5): 0<τ(α)=γ<τ(β). Let δ=β−ι(α). We can find a nondecreasing sequence δ=⟨δi:1≤i<ω⟩ such that δ1≥γ and ∑iδi=δ. Let γ=⟨γi:1≤i<ω⟩ be an increasing sequence converging to γ. Let j be an embedding witnessing that κ is κ+γ+1-supercompact, and let A⊆κ be given by Lemma 3 (with respect to γ). For each n≥1, let Un be a κ-complete normal measure on Pκ(κ+γn) derived from j, so that A is in the projection of each Un to κ. Let μ=ℵι(α)+1, and let us force with P=P(μ,γ,δ,U,K) for where K is a sequence of filters as in the construction.
Let p0 be a condition of length 0 forcing every Prikry point to be in A. Let p1≤p0 be a condition of length 1 deciding the statement σ:= “(κ+,κ)↠(μ+γ+1,μ+γ).” We claim p1⊩σ.
Let us define an iteration of ultrapowers. Let N1=V. Given a commuting system of elementary embeddings jm,m′:Nm→Nm′ for 1≤m≤m′≤n, let jn,n+1:Nn→Ult(Nn,j1,n(Un+1))=Nn+1 be the ultrapower embedding, and let jm,n+1=jn,n+1∘jm,n for 1≤m<n. For 1≤n<ω, let jn,ω:Nn→Nω be the direct limit embedding.
Nω is well-founded, and thus can be identified with a transitive class, because of the following generalization of a well-known theorem of Gaifman (see [25]).
Fact \thefact.
If E is a set of countably complete ultrafilters, and jα,β:Nα→Nβ, α<β≤θ, is a system of elementary embeddings defined by taking at each α<θ the ultrapower map jα,α+1:Nα→Ult(Nα,U)=Nα+1 for some U∈j0,α(E), and taking direct limits at limit stages, then each Nα is well-founded.
Let stem(p1)=⟨f0,x1,f1⟩, and let C0×C1⊆Col(μ,κ1)×Col(κ1+δ1+2,κ) be a filter that contains ⟨f0,f1⟩ and is generic over V. For n>1, let yn=jn−1,n[j1,n−1(κ+γn)], and let xn=jn,ω(yn), and let Cn=j1,n−1(Kn).
Claim \thelemma.
⟨xn:1≤n<ω⟩* and ⟨Cn:n<ω⟩ together generate a generic filter for j1,ω(P) over Nω.*
Proof.
We need to verify the two conditions of Lemma 3. For (1), suppose F=⟨Fn:1≤n<ω⟩ is such that ⟨∅⟩⌢F∈j1,ω(P) is a condition of length 0. Let m<ω be such that F=jm,ω(F′) for some F′. For n≥m, domjm,n(Fn+1′)∈j1,n(Un+1), and Nn⊨[jm,n(Fn+1′)]j1,n(Un+1)∈j1,n(Kn+1). Thus for n≥m, yn+1∈domjm,n+1(Fn+1′), and fn+1:=jm,n+1(Fn+1′)(yn+1)∈Cn+1. Note that fn+1 is an object of rank <j1,n+1(κ)=crit(jn+1,ω). Thus for n>m, xn∈domFn and fn=Fn(xn)∈Cn.
To verify (2), note that for each n>1, Nn−1⊨j1,n−1(Kn) is generic for Col(j1,n−1(κ+δn+2),j1,n(κ)) over Nn. It is also generic over the submodel Nω. Note also for each n>1, κn:=xn∩j1,ω(κ)=j1,n−1(κ).
∎
Let G be the generated filter for j1,ω(P). Note that j1,ω(p1)∈G. We claim that Nω[G] is closed under κ-sequences from V[C0×C1]. Since C0×C1 is generic for a forcing of size κ, it suffices to show that Nω[⟨xn:2≤n<ω⟩] is closed under κ-sequences from V, an idea due to Bukovsky [3] and independently to Dehornoy [5]. This follows from the fact that every element of Nω is of the form j1,ω(f)(x2,…,xn) for some function f∈V and some n<ω. Let ⟨fα:α<κ⟩ be a sequence of functions in V, such that for each α, there is nα such that domfα=Pκ(κ+γ2)×⋯×Pκ(κ+γnα). Then ⟨j1,ω(fα)(x2,…,xnα):α<κ⟩ can be computed from j1,ω(⟨fα:α<κ⟩) and ⟨xn:2≤n<ω⟩.
For all α<j1,ω(κ), there are n<ω and β<j1,n(κ) such that α=jn,ω(β), and α=β since crit(jn,ω)=j1,n(κ). By GCH and the nature of the measures, for 2≤n<ω, κ+γn<j1,n(κ)<κ+γ. Therefore, j1,ω(κ)=κ+γ. Furthermore, an easy counting argument shows that j1,ω(κ+γ+1)=κ+γ+1.
By Lemma 3, V[C0×C1]⊨(κ+γ+1,κ+γ)↠(μ+γ+1,μ+γ). Let A∈Nω[G] be an algebra on κ+γ+1=(j1,ω(κ)+)Nω[G]. In V[C0×C1], there is B≺A of size μ+γ+1 such that ∣B∩κ+γ∣=μ+γ. By the closure of Nω[G], B∈Nω[G]. This shows that Nω[G] satisfies the desired instance of Chang’s Conjecture, and thus by elementarity that p1 forces (κ+,κ)↠(μ+γ+1,μ+γ). This completes the proof of Theorem 5.
Corollary \thecorollary.
Suppose P=P(μ,γ,δ,U,K) is as above. Then there is a condition p∈P of length 0 that forces
[TABLE]
[TABLE]
for 1≤m<n<ω.
Proof.
Note that it is forced that μ+γ=κ1+γ, and for each n≥1, κn+δn+γ=κn+1+γ=μ+∑1nδi+γ. Let p be a condition of length 0 that forces all Prikry points to be in the set A given by Lemma 3. Fix 1≤m<n<ω, and let q≤p be a condition of length n. By Lemma 3, P↾q is isomorphic to a restriction of
[TABLE]
where s′ denotes the shift of a sequence s by n. By Lemma 3, this product forces
(κn+γ+1,κn+γ)↠(κm+γ+1,κm+γ)↠(μ+γ+1,μ+γ).
The last two terms of the product are isomorphic to a restriction of
P(κn−1+δn−1+2,γ′′,δ′′,U′′,K′′) to a condition of length 1, where s′′ denotes the shift of the original sequence s by n−1.
By the argument for Case 3 of Theorem 5, this forces (κn+∑n∞δi+1,κn+∑n∞δi)↠(κn+γ+1,κn+γ).
∎
Our methods are not limited to getting (ℵβ+1,ℵβ)↠(ℵα+1,ℵα) where α and β are countable. For example, if we opt not to interleave collapses in the Gitik-Sharon forcing, we obtain:
Porism 6**.**
Let α≥ω be a countable limit ordinal, and let κ be a κ+α+1-supercompact cardinal. Then there is a generic extension in which (λ+,λ)↠(ℵα+1,ℵα), and another in which (λ+α+1,λ+α)↠(λ+,λ), where in both cases cf(λ)=ω and ℵλ=λ.
4. Singular Global Chang’s Conjecture below ℵωω
In this section we will prove the following theorem:
Theorem 7**.**
If there is a model of ZFC with a cardinal δ which is δ+ω+1-supercompact and Woodin for supercompactness, then there is a model in which (ℵα+1,ℵα)↠(ℵβ+1,ℵβ) holds for all limit β<α<ωω (including β=0).
This theorem is an attempt to strengthen Corollary 3, into a global result. Unfortunately, we do not know how to obtain the desired global result, or even the more natural one in which Chang’s Conjecture holds between (ℵα+1,ℵα) and (ℵβ+1,ℵβ) for all β<α countable limit ordinals. We believe that this is a limitation of our method and not an actual ZFC-barrier.
Before diving into the technical details, let us sketch the main ideas behind the forcing construction: After a suitable preparation, we obtain a model in which many instances of Chang’s Conjecture occur between pairs of cardinals of the form κ+ω and its successor and μ+ω and its successor.
In this model we also have many supercompact cardinals, and this is the reason that we start with a stronger large cardinal hypothesis.
In order to obtain more instances of Chang’s Conjecture, we need to apply the “tail changing” forcing, which is a Prikry-type forcing resembling the Gitik-Sharon forcing [12]. Since we would like to do that simultaneously for more than a single pair of cardinals, we define a Magidor- or Radin-like variant of the Gitik-Sharon forcing. Unfortunately, the diagonal nature of the forcing does not allow us to use a Mitchell-increasing sequence of measures, and we are forced to let the domain of measures increase (a similar issue was encountered in [2]). This limits the result of the theorem.
Definition**.**
A cardinal δ is called Woodin for supercompactness when for every A⊆δ, there is κ<δ such that for all λ∈[κ,δ), there is a normal κ-complete ultrafilter U on Pκ(λ) such that jU(A)∩λ=A∩λ.
Like Woodin cardinals, Woodin for supercompactness cardinals need not be even weakly compact, but they have higher consistency strength than supercompact cardinals. Every almost-huge cardinal is Woodin for supercompactness. Woodin for supercompact cardinals are the same as Vopěnka cardinals (see [19]).
Lemma \thelemma.
Suppose GCH and δ is δ+ω+1-supercompact and Woodin for supercompactness. Then there is a model of ZFC in which GCH holds, there is a supercompact cardinal, and
for all α<β,
[TABLE]
Furthermore, any such instance of Chang’s Conjecture is preserved by forcing over this model with a (α+ω+1,α+ω+1)-distributive forcing of size <β+ω.
Proof.
Let A⊆δ be given by Lemma 3. Let ⟨αi:i<δ⟩ enumerate the closure of A. Force with the following Easton support iteration ⟨Pi,Q˙j:i≤δ,j<δ⟩:
(1)
Q0=Col(ω,α0+ω)∗Col˙(α0+ω+2,α1).
2. (2)
If i>0 and αi∈A, ⊩iQ˙i=Col˙(αi+ω+2,αi+1).
3. (3)
If i>0 and αi∈/A, ⊩iQ˙i=Col˙(αi+,αi+1).
It is easy to see that this iteration forces that for all infinite α<δ,
[TABLE]
for some β∈A. By standard arguments, δ remains inaccessible in VPδ.
Suppose that in VPδ, α<α+ω<β<δ, and let i<j be such that
[TABLE]
Then Pδ factors as Pi∗Pj/Pi∗Pδ/Pj, where ∣Pi∣≤αi+ω, Pj/Pi is forced to be αi+ω+2-closed and of size ≤αj, and Pδ/Pj is forced to be αj+ω+2-closed.
Suppose Q is an (αiω+1,αiω+1)-distributive forcing of size <αj+ω in VPδ. Then Q∈VPj. Since Pi forces that Pj/Pi∗Q is (αi+ω+1,αi+ω+1)-distributive, Lemma 3 implies that Pj∗Q forces (αj+ω+1,αj+ω)↠(αi+ω+1,αi+ω). This is preserved by Pδ/Pj, which remains (αj+ω+1,∞)-distributive after forcing with Q.
Finally, we need to find a supercompact. In V, let κ<δ be given by Woodin for supercompactness with respect to A. Let λ>κ be an inaccessible limit point of A. Let U be a normal κ-complete ultrafilter on Pκ(λ) such that jU(A)∩λ=A∩λ. We have that jU(Pκ)=Pκ∗Pλ/Pκ∗Q, for some Q that is forced to be λ+-closed. Let Gδ⊆Pδ be generic, and let Gλ=Gδ↾Pλ. By GCH, jU(κ)<λ++ and jU(λ++)=λ++, so we may build H⊆Q in V[Gλ] that is generic over M[Gλ]. Thus we can extend the embedding to j:V[Gκ]→M[Gλ∗H]. Since M[Gλ∗H] is λ-closed in V[Gλ] and Pλ/Gκ is κ-directed-closed, there is p∈jU(Pλ)/(Gλ∗H) below j[Gλ/Gκ]. Since ∣Pλ∣=λ and jU(λ+)<λ++, we can build K⊆jU(Pλ)/(Gλ∗H) below p in V[Gλ] that is generic over M[Gλ∗H]. Thus we can extend the embedding to j:V[Gλ]→M[Gλ∗H∗K]. This shows that κ is λ-supercompact in V[Gλ], a property that is preserved by Pδ/Gλ. Thus, Vδ[Gδ]⊨ “There is a supercompact cardinal.”
∎
Let us work in a model satisfying the conclusion of the above lemma. We define by induction on 1≤n≤ω the class of “order-n Gitik-Sharon forcings” (abbreivated by GSn). Formally, we fix a large enough regular θ and define these inductively as subsets of Hθ, but it will be clear that choice of θ is irrelevant, and for θ<θ′, GSnHθ=GSnHθ′∩Hθ.
Each order-n forcing will add a club of ordertype ωn to a large cardinal κ, consisting of former inaccessibles, while preserving κ as a cardinal, collapsing κ+ω⋅n to κ, and preserving larger cardinals.
GS1 is the collection of forcings of the form P(μ,ω,ω2,U,K), as defined in the previous section, where ω is the identity sequence ⟨1,2,3,…⟩, and ω2 is the constant sequence ⟨ω,ω,ω,…⟩.
Definition**.**
A sequence d=⟨Uα,Kα:α<ω⋅n⟩ is a GSn-sequence if
(1)
There is a κ>ω such that each Uα is a κ-complete ultrafilter. We call κ the critical point of the sequence d.
2. (2)
For 1≤n<ω, Un is a normal ultrafilter on Pκ(κ+n) and for ω≤α<ω⋅n successor, Uα is a normal ultrafilter on Pκ(Hκ+α).
3. (3)
For successor α<ω⋅n, if jα:V→Mα is the ultrapower embedding from Uα, then Kα is Col(κ+α+ω+2,jα(κ))Mα-generic over Mα.
A partial order P∈GSn will be determined by the choice of a GSn-sequence d and a regular cardinal μ<crit(d). Suppose n>1 and that we have defined GSm for m<n, and we have a function defined on pairs (μ,d)∈Hθ that outputs a partial order P(μ,d)∈GSm whenever d is a sequence of length ω⋅m as above and μ<crit(d) is regular.
Let d=⟨Uα,Kα:α<ω⋅n⟩ be as above and let μ<crit(d) be regular. Conditions in P(μ,d)∈GSn take the form:
[TABLE]
The stem of p is the initial segment obtained by removing F. The length of p as above is l. We require:
(1)
For 1≤i≤l:
(a)
∣xi∣<κ, xi≺Hκ+ω⋅(n−1)+i, κi:=xi∩κ is inaccessible, the transitive collapse of xi is Hκi+ω⋅(n−1)+i, and ⟨Uα,Kα:α<ω⋅(n−1)⟩∈xi.
2. (b)
Let π:xi→H be the transitive collapse map. Put π(⟨Uα,Kα:α<ω⋅(n−1)⟩):=⟨uαi,kαi:α<ω⋅(n−1)⟩:=di. We require that di is a GSn−1-sequence, ai is a sequence of functions ⟨bαi:α<ω⋅(n−1)⟩ such that dom(bαi)∈uαi and [bαi]uαi∈kαi.
2. (2)
f0∈Col(μ,κ), and if l>0, then ⟨f0⟩⌢e1⌢a1∈P(μ,d1), where f0⌢e1 is the stem of the condition.
3. (3)
For 1≤i<l, xi∈xi+1, and ⟨fi⟩⌢ei+1⌢ai+1∈P(κi+ω⋅n+2,di+1), where fi⌢ei+1 is the stem.
4. (4)
fl∈Col(κl+ω⋅n+2,κ).
5. (5)
F is a sequence of functions ⟨Fα:α<ω⋅n⟩ such that for each α, domFα∈Uα and [Fα]Uα∈Kα.
Suppose we have two conditions
[TABLE]
[TABLE]
We put q≤p when:
(1)
m≥l, and for 1≤i≤l, xi=xi′.
2. (2)
For i≤l, fi′⊇fi.
3. (3)
For 1≤i≤l, ⟨fi−1′⟩⌢ei′⌢ai′≤⟨fi−1⟩⌢ei⌢ai in the relevant partial order from GSn−1.
4. (4)
For l<i≤m, xi′∈domFω⋅(n−1)+i and fi′⊇Fω⋅(n−1)+i(xi).
5. (5)
F↾ω⋅(n−1)∈x if x=xi′ for l<i≤m, or if x∈domFω⋅(n−1)+k′ for k>m.
6. (6)
Put fk=Fω⋅(n−1)+k(xk′) for l<k<m. If l<i≤m and π:xi→H is the transitive collapse map, then ⟨fi−1′⟩⌢ei′⌢ai′≤⟨fi−1⟩⌢π(F↾ω⋅(n−1)).
7. (7)
For each α<ω⋅n, domFα′⊆domFα, and for each x∈domFα′, Fα′(x)⊇Fα(x).
Finally, we may define the order-ω forcings which generically stack the order-n forcings for finite n. Everything looks quite similar, except now our sequences of functions F have length ω2, and stems of length n>0 look like stems of length-1 conditions from forcings in GSn+1.
Remark**.**
Unlike the standard supercompact Radin forcing (such as in [14]), the generic Radin point xα for limit α is strictly larger than ⋃β<αxβ. This discontinuity plays an important role in the proof of the Prikry Property.
We define some notions to describe the conditions in our forcings. A type-1 sequence is a natural number. For n>1, a type-n sequence is a finite sequence of type-(n−1) sequences. We can define inductively a partial order on these sequences. For a type-1 sequence, this is just the usual linear order. If s=⟨t1,…,tl⟩ and s′=⟨t1′,…,tm′⟩ are of type-n, then we say s′≥s when m≥l and ti′≥ti for 1≤i≤m. It is easy to see by induction that this ordering is upward-directed.
If p∈P∈GS1, then by the shape of p we mean its length. If s=⟨t1,…,tl⟩ is a type-n sequence, and
[TABLE]
then we say, inductively, that the stem of phas shape s if each ⟨fi−1⟩⌢ei⌢ai has shape ti. If s=⟨t1,…,tl⟩ is such that each ti is a type-i sequence, and p∈P∈GSω takes the same form as above, then we say p has shape s if each ⟨fi−1⟩⌢ei⌢ai has shape ti. Note that if q≤p, then the shape of q is greater or equal to the shape of p in the ordering on sequences. Since the shape of a condition only depends on its stem, we will also speak of the shapes of stems and their subsequences.
Suppose P∈GSn for n≤ω. For conditions p,q∈P, we say p≤∗q if p≤q and they have the same shape. If p≤q and stem(p) is an initial segment of stem(q), then we say p⪯q. We have an operation p∧F defined similarly as before, in the discussion preceding Lemma 3.
Lemma \thelemma.
Suppose P(μ,d)∈GSn, μ>ω, and c:P→3 is a decisive coloring.
(1)
There is a sequence F such that for every condition p, every two r,r′⪯p∧F of the same shape have the same color.
2. (2)
For every condition p, there is q≤∗p such that every two r,r′≤q of the same shape have the same color.
Proof.
The case n=1 was proven in Lemma 3.
Assume n>1 and the lemma holds for GSm, m<n. Let P(μ,d)∈GSn, with crit(d)=κ and ω<μ<κ. Like before, we prove (1) by showing the following claim by induction: For all l<ω and all decisive colorings of the conditions of length l, there is Fl such that for all m≤l and every condition p of length m, every two r,r′⪯p∧F of the same shape and of length l have the same color. This suffices, since we can find F that is a lower bound to the countably many Fl. Suppose l=0 and c is such a coloring. For every s∈Col(μ,κ), choose if possible some Fs such that c(⟨s⟩⌢Fs)>0. Using the directed closure of the collapses and diagonal intersections, we may select a single sequence F such that ⟨s⟩∧F≤⟨s⟩⌢Fs for all s.
Suppose the claim is true for m<l. Let c be a decisive coloring of the conditions of length l. For each stem s=⟨f0s,…,(xl−1s,al−1s),fl−1s⟩ of length l−1, and each candidate (x,a) for the last node in a one-step extension containing s, we can define a coloring cs,x on conditions of the form ⟨fl−1s⟩⌢e⌢a∈P(κl−1+ω⋅n+2,dx) as follows. First, as in the proof of Lemma 3, we find a sequence F=⟨Fα:α<ω⋅n⟩ such that for each stem s, each x∈domFω⋅(n−1)+l, and each choice of e and a such that there are f and H such that s⌢⟨e,(x,a),f⟩⌢H is a condition below s⌢F with color >0, then already s⌢⟨e,(x,a),Fω⋅(n−1)+l(x)⟩⌢F has this color.
We can then define cs,x(⟨fl−1s⟩⌢e⌢a)=c(s⌢⟨e,(x,a),Fω⋅(n−1)+l(x)⟩⌢F). By the induction hypothesis on the order of Gitik-Sharon forcing, for each such s,x, there is a choice of as,x such that cs,x(⟨fl−1s⟩⌢e⌢as,x) depends only on the shape of e, for conditions below ⟨fl−1s⟩⌢as,x. For each x, we can use diagonal intersections to select a sequence ax such that for all s, ⟨fl−1s⟩∧ax≤⟨fl−1s⟩⌢as,x.
In the ultrapower by U=Uω⋅(n−1)+l, the function x↦ax represents a sequence of functions G strengthening F↾ω⋅(n−1)=π(jU(F↾ω⋅(n−1))), where π is the transitive collapse of jU[Hκ+ω⋅(n−1)+l]. Let F′ be F with the intial segment below ω⋅(n−1) replaced by G.
Thus we have for each stem s of length l−1, a set As∈Uω⋅(n−1)+l such that for all x∈As, ax=πx(F′↾ω⋅(n−1)), and the color of s⌢⟨e,(x,ax),Fω⋅(n−1)+l′(x)⟩⌢F′ depends only on the shape of e, if ⟨fl−1s⟩⌢e⌢ax≤⟨fl−1s⟩⌢ax. Let A∗ be the diagonal intersection of the As, and let F′′ be F′ restricted to A∗ at coordinate ω⋅(n−1)+l.
Now for any condition p of shape ⟨t1,…,tl−1⟩, the color under c of any q⪯p∧F′′ of shape ⟨t1,…,tl−1,t⟩ depends only on t. So for each type-(n−1) sequence t, let ct color the length-(l−1) conditions accordingly. Note that each ct inherits decisiveness from c.
By the induction hypothesis, for each t, there is a sequence Ft such that for all m<l−1 and all p of length m, every q⪯p∧Ft of length l−1 has a color under ct depending only on the shape of q. If F′′′ is a lower bound to the countably many sequences Ft, then F′′′ satisfies the inductive claim for l. This concludes the argument for (1).
To show (2), let us assume inductively that it holds for GSm, m<n. Let P∈GSn, let c:P→3 be decisive, and let F be given by (1).
Let p∈P, with stem(p)=⟨f0,…,fl−1,el,(xl,al),fl⟩.
For every end-extension q=stem(p)⌢s⌢F of p∧F, the color of q depends only on the shape of s. Using the closure of Col(κl+ω⋅n+2,κ), we can find fl′⊇fl such that for every strengthening s of the initial segment of stem(p) before fl, and every type-n sequence t, if there is f⊇fl′ such that some s′ of shape t with s⌢⟨f⟩⌢s′⌢F≤p∧F has color >0, then already s⌢⟨fl′⟩⌢s′⌢F has this color.
Now for each type-n sequence t, and each strengthening s of stem(p) before fl−1, we have a coloring cs,t of the conditions
⟨f⟩⌢e⌢a≤⟨fl−1⟩⌢el⌢al according to the color under c of
s⌢⟨f,e,(xl,a),fl′⟩⌢s′⌢F,
where s′ is anything of shape t, such that the resulting condition is below p∧F. Using the inductive hypothesis and the weak closure of P(κl−1+ω⋅n+2,dl), we find ⟨fl−1′⟩⌢el′⌢al′≤∗⟨fl−1⟩⌢el⌢al such that any two extensions of the former of the same shape have the same color under every cs,t. As a result, we have that for any s strengthening stem(p) before fl−1, for any two r,r′ of the same shape below s⌢⟨fl−1′,el′,(xl,al′),fl′⟩⌢F,
for which s is an initial segment of both, c(r)=c(r′). We continue this process in the same fashion down the stem of p, in a total of l steps, so that at step k≤l, we find ⟨fl−k−1′⟩⌢el−k′⌢al−k′≤∗⟨fl−k−1⟩⌢el−k⌢al−k, such that for every strengthening s of the initial segment of stem(p) before fl−k−1, any two conditions r,r′ of the same shape, with s as an initial segment, and below s⌢⟨fl−k−1′,el−k′,(xl−k,al−k′),fl−k′,…,(xl,al′),fl′,F⟩,
we have c(r)=c(r′). Eventually we reach the desired condition q≤∗p.
The inductive argument for GSω is entirely similar.
∎
Corollary \thecorollary.
If P(μ,d)∈GSn, 1≤n≤ω<μ, then ⟨P(μ,d),≤,≤∗⟩ is a Prikry-type forcing.
Furthermore, for a condition p0 of the form
[TABLE]
P(μ,d)↾p0* is canonically isomorphic to*
[TABLE]
where Q is a weakly κm+ω⋅m+2-closed Prikry-type forcing.
Proof.
Let σ be a sentence in the forcing language, and color conditions 0 if they do not decide σ, 1 if they force σ, and 2 if they force ¬σ. Let p∈P(μ,d), and let q≤∗p be such that any two extensions of q of the same shape have the same color. If q does not decide σ, then by the fact that the ordering on sequences is upward-directed, we can find r,r′≤q of the same shape that force opposite decisions about σ, a contradiction.
For the second claim, the map is the obvious one, where the elements of Q are the tail-ends beyond place m, of conditions below p0. Let us write P(μ,d)↾p0 as R×Q. From any decisive coloring c of the conditions in Q, we can define a decisive coloring c′ of R×Q by setting c′(r,q)=c(q). Given any q∈Q, we can find p≤∗(1,q) such that any two p′,p′′≤p of the same shape have the same color under c′. This means that any two q′,q′′≤q of the same shape have the same color under c. Then we apply the argument of the previous paragraph.
∎
If P(μ,d)∈GSn for 1<n<ω, with crit(d)=κ, and G⊆P(μ,d) is generic over V, then we have a sequence ⟨xi,Gi:1≤i<ω⟩ such that:
(1)
Each xi is a typical point in Pκ(Hκ+ω⋅(n−1)+i).
2. (2)
⟨xi:1≤i<ω⟩ is ∈- and ⊆-increasing, with ⋃ixi=Hκ+ω⋅n.
3. (3)
G1 is P(μ,d1)-generic, and for i>1, Gi is P(κi−1+ω⋅n+2,di)-generic, where κi and di are as in the definition of GSn.
From ⟨xi,Gi:1≤i<ω⟩, we can recover G as the collection of all conditions
⟨f0,e1,(x1,a1),f1,…,el,(xl,al),fl,F⟩ such that:
(1)
⟨x1,…,xl⟩ is an initial segment of ⟨xi:1≤i<ω⟩.
2. (2)
For i>l, F↾ω⋅(n−1)∈xi∈domFω⋅n+i.
3. (3)
For 1≤i≤l, ⟨fi−1⟩⌢ei⌢ai∈Gi.
4. (4)
Putting fi=Fω⋅n+i(xi) for i>l, ⟨fi−1⟩⌢F↾ω⋅(n−1)∈Gi.
We need the following characterization of genericity, proof of which is essentially the same as for Lemma 3:
Lemma \thelemma.
Suppose d=⟨Uα,Kα:α<ω⋅n⟩ and P(μ,d)∈GSn, with ω<μ<crit(d)=κ.
Suppose in some outer model W⊇V, there is a sequence ⟨xi,Gi:1≤i<ω⟩ as above.
Then this sequence generates a V-generic filter G for P(μ,d) iff for every sequence F=⟨Fα:α<ω⋅n⟩ such that ⟨∅⟩⌢F is a condition, there is m<ω such that for all k≥m, F↾ω⋅(n−1)∈xk∈domFω⋅(n−1)+k, and
[TABLE]
where πk+1 is the transitive collapse of xk+1.
To prove the main theorem, we will show by induction that, in a model satisfying the conclusion of Lemma 4, if μ=ν+ω⋅k+2 and P(μ,d)∈GSn, for 1≤k,n<ω, then P(μ,d) forces that (ν+α+1,ν+α)↠(ν+β+1,ν+β) holds for all limit ordinals ω≤β<α≤ωn+1. Note that we include the case ν=0 so that the lower pair may be (ℵ1,ℵ0).
For the base case, suppose μ=ν+ω⋅k+2, for 1≤k<ω, and P(μ,d)∈GS1, with crit(d)=κ. By Lemma 3 and the preservation claim of Lemma 4, we have that in VP(μ,d), (ν+ω⋅i+1,ν+ω⋅i)↠(ν+ω⋅j+1,ν+ω⋅j) holds for all 1≤j<i<ω. Using again the fact that for α<κ, (κ+ω+1,κ+ω)↠(α+ω+1,α+ω) is indestructible by any α+ω+2-closed forcing of size κ, the iterated ultrapower construction in the previous section
shows that P(μ,d) also forces (κ+,κ)↠(ν+ω⋅i+1,ν+ω⋅i) for 1≤i<ω.
Assuming that the inductive claim holds for n, let us first argue for the weaker claim that if μ=ν+ω⋅k+2, for 1≤k<ω, and P(μ,d)∈GSn+1, then P(μ,d) forces (ν+α+1,ν+α)↠(ν+β+1,ν+β) to hold for all limit ordinals ω≤β<α<ωn+2 (where the last inequality is strict). A generic G⊆P(μ,d) introduces a Prikry sequence of generics for GSn forcings, ⟨Gi:1≤i<ω⟩, where G1 is generic for P(μ,d1), and for i≥2, Gi is generic for P(κi−1+ω⋅(n+1)+2,di). In V[G1], κ1=ν+ωn+1, its successor is (κ1+ω⋅n+1)V, and we have (ν+α+1,ν+α)↠(ν+β+1,ν+β) for all limit ordinals ω≤β<α≤ωn+1. This is preserved by adjoining ⟨Gj:2≤j<ω⟩, which adds no subsets of (κ1+ω⋅n+1)V.
For i>1, we have that in V[Gi],
[TABLE]
holds for all limit ordinals 0≤β<α≤ωn+1. For each such i, these instances of Chang’s Conjecture are preserved by adjoining ⟨Gj:i<j<ω⟩, which adds no subsets of (κi+ω⋅n+1)V, the (ωn+1+1)st cardinal above κi−1 in the extension, and also by adjoining G1×⋯×Gi−1, which is generic for a κi−1+ω⋅n-centered forcing. By the transitivity of Chang’s Conjecture, we can combine finitely many instances to bridge the different intervals that lie between adjacent Prikry points, and get the weaker conclusion for n+1.
The hard part is to improve the final inequality to allow α=ωn+2. If the critical point of d as above is κ, then by applying transitivity again, it suffices to show that the extension satisfies (κ+,κ)↠(κi+,κi) for infinitely many i. Towards this, we generalize Claim 3 and produce an iterated ultrapower for which we can find a generic filter for (the image of) a forcing P∈GSn+1.
Claim \thelemma.
Suppose 1≤n<ω, W is a model of ZFC, and P(μ,d)∈GSnW, with crit(d)=κ. Suppose p∈P(μ,d) is a condition of length l,
p=⟨f0,…,fl⟩⌢F. If l>0, let ν=κl+ω⋅n+2 and let R be such that P(μ,d)↾p≅R×Q, as in Corollary 4. Otherwise let ν=μ and let R be trivial.
There is an elementary embedding j:W→W′, where W′ is transitive, critj=κ, j(κ)=κ+ω⋅n, and κ+ω⋅n+1 is a fixed point of j.
If there is a W-generic filter
H⊆R×Col(ν,κ),
then there is a W′-generic filter G⊆j(P(μ,d)) in W[H] such that j(p)∈G.
Moreover, W[H] and W′[G] have the same κ-sequences of ordinals.
Proof.
First, let us introduce a temporary notation in order to describe generic filters for P(μ,d).
Every ordinal α<ωω, can be represented using Cantor Normal Form as a sum
[TABLE]
where ki<ω for all i. For α=0, let n⋆(α)=min{r∣kr=0} and let m⋆(α)=kn⋆(α).
A generic G⊆P(μ,d) can be unraveled into a sequence ⟨xα:1≤α<ωn⟩⊆Pκ(Hκ+ω⋅n) and filters ⟨Cα:α<ωn⟩, from which we can recover G. If ρα=xα∩κ, then the ρα are increasing, continuous, and cofinal in κ. C0 is generic for Col(μ,ρ1), and for α≥1, Cα is generic for Col(ρα+ω⋅n⋆(α)+ω+2,ρα+1). If β<α and n⋆(β)≤n⋆(α), then xβ∈xα.
Let us note that by unraveling the criteria for being in the filters associated to the sequences, we can recover G in the following way. Let F=⟨Fα:α<ω⋅n⟩ be a sequence of functions. For each α<ωn, define a finite sequence
⟨Fα0,…,Fαn−n⋆(α)−1⟩
by putting Fα0=Fω⋅n⋆(α)+m⋆(α), and for 0<k<n−n⋆(α), Fαk=π(Fαk−1), where π is the transitive collapse of xα+ωn−k, if that object is in domπ. Put Fα′=Fαn−n⋆(α)−1. Then we have ⟨∅⟩⌢F∈G iff for all α<ωn, Fα′ is defined, xα∈domFα′, and Fα′(xα)∈Cα.
Given a GSn-sequence d, let us construct an iterated ultrapower and a sequence ⟨xα,Cβ∣1≤α<ωn,β<ωn⟩ as above. We will assume, by induction on n (simultaneously for all models of ZFC, all GSn-sequences d and all generics H) that this process provides a generic filter for the limit ultrapower.
Let μ,d,H,W be as hypothesized, and let d=⟨Uα,Kα∣α<ω⋅n⟩.
Let us define by induction on ωn−1⋅l<α≤ωn, a model Nα and elementary embeddings jβ,α:Nβ→Nα. The choice of the measures which are applied at each step resembles the iterated ultrapower for obtaining a Radin generic filter (see [18]).
Let α0=ωn−1⋅l+1, and let Nα0=W.
For limit ordinals α, let Nα be the direct limit of the system ⟨Nβ,jβ,γ∣β<γ<α⟩ and let jβ,α be the corresponding limit embeddings.
For α=β+1, let jβ,α:Nβ→Nα≅Ult(Nβ,jα0,β(Uω⋅n⋆(β)+m⋆(β))), and let jγ,α=jβ,α∘jγ,β for γ<β. By Fact 3, Nωn is well-founded. By counting arguments similar to those in the previous section, we can show that jα0,ωn(κ)=κ+ω⋅n, and jα0,ωn(κ+ω⋅n+1)=κ+ω⋅n+1.
Let us define a sequence of filters ⟨Ci∣i<ωn⟩ and a sequence of sets ⟨xi∣1≤i<ωn⟩.
For i≤ωn−1⋅l we extract Ci and xi from the W-generic filter H.
Let us define the Prikry points for α>ωn−1⋅l.
Let Xα=κ+m⋆(α) if n⋆(α)=0, and Xα=Hκ+ω⋅n⋆(α)+m⋆(α) otherwise. Let yα=jα,ωn[jα0,α(Xα)].
Note that
yα=jα+1,ωn(jα,α+1[jα0,α(Xα)]),
and in particular it is in Nωn.
In other words, we take yα to be the seed of the measure jα0,α(Uω⋅n⋆(α)+m⋆(α)),
pushed by the map jα+1,ωn to the limit model Nωn. Since the critical point of the elementary map jα+1,ωn is above the cardinality of yα, it acts pointwise.
If n⋆(α)=n−1, let xα=yα. Otherwise, let π be the Mostowski collapse of yα+ωn⋆(α)+1 and let xα=π(yα). Let Cα=jα0,α(Kω⋅n⋆(α)+m⋆(α)).
Let us verify that the obtained filter satisfies the requirements of Lemma 4.
Let m>l. Let Gm be the filter for the forcing P(ρωn−1⋅(m−1)+ω⋅n+2,dm)Nωn−1⋅m, where dm=jα0,ωn−1⋅m(d)↾ω⋅(n−1), which is derived from the sequences ⟨xα∣ωn−1⋅(m−1)≤α<ωn−1⋅m⟩ and ⟨Cα∣ωn−1⋅(m−1)≤α<ωn−1⋅m⟩. Let us assume, by induction, that Gm is an Nωn−1⋅m-generic filter. Note that
[TABLE]
and that Gm is also Nωn-generic. For m≤l, Gm is derived from the W-generic filter H, and thus it is clearly Nωn-generic.
Let zi=xωn−1⋅i for 1≤i<ω.
Let us check that for every sequence F=⟨Fi∣i<ω⋅n⟩∈Nωn there is some k such that for all m>k, F↾ω⋅(n−1)∈zm∈domFω⋅(n−1)+m, and ⟨Fω⋅(n−1)+m(zm)⟩⌢πm+1(F↾ω⋅(n−1))∈Gm+1.
Let us show that for α0≤α<ωn, if F∈Nα is a sequence of functions such that ⟨∅⟩⌢F is a condition in jα0,α(P(μ,d)), then for every β>α,
[TABLE]
The relation jα,ωn(F↾ω⋅n⋆(β))∈yβ holds simply because F↾ω⋅n⋆(β)∈(Hjα0,α(κ)+ω⋅n⋆(β)+1)Nα.
The other claims are true since yˉβ:=jβ+1,ωn−1(yβ) is the seed of the measure jα0,β(Uω⋅n⋆(β)+m⋆(β)) and the domain of jα,β(Fω⋅n⋆(β)+m⋆(β)) is large with respect to this measure. Moreover, this function represents an element of jα0,β(Kω⋅n⋆(β)+m⋆(β)). But
[TABLE]
Note that for ωn−1⋅l<α<ωn, the sequence ⟨yα,yα+ωn⋆(α)+1,…,yα+ωn−1⟩ is both ∈- and ⊆-increasing. Thus to compute xα, we get the same result by taking the image of yα under the transitive collapse yα+ωn⋆(α)+1, as by first collapsing yα+ωn−1, then collapsing the image of yα+ωn−2, etc., until we take the image of yα under n−n⋆(α)−1 successive collapses. The point is that the latter process parallels exactly the sequence of collapses applied to a sequence of functions F to determine whether ⟨∅⟩⌢F is in the filter generated from the sequences ⟨xα,Cβ:1≤α<ωn,β<ωn⟩.
Hence, if
[TABLE]
then jα,ωn(F)β′∈xβ∈domjα,ωn(F)β′, and jα,ωn(F)β′(xβ)∈Cβ.
So if F∈Nα, the genericity criteria holds for jα,ωn(F) for the cofinal segment above α. Since Nωn is a direct limit, the generated filter G is generic.
We would like to claim now that Nωn[G] has the same κ-sequences as W[H]. Indeed, since the forcing that introduces H has cardinality κ, any sequence of ordinals in W[H] has a name of cardinality κ and thus can be coded using a sequence of ordinals of length κ from W.
Let ⟨ξi∣i<κ⟩ be a sequence of ordinals in W. In Nωn, for every ordinal there is a representing function fi, and a finite sequence si⊆⟨yα:ωn−1⋅l<α<ωn⟩, such that jα0,ωn(fi)(si)=ξi. By our choices of xi and Ci, the sequence ⟨yα:ωn−1⋅l<α<ωn⟩ can be computed from the generic filter G.
Since jα0,ωn(⟨fi∣i<κ⟩) and jα0,ωn(⟨si∣i<κ⟩) are in Nωn, and since ⟨yα∣ωn−1⋅l<α<ωn⟩∈Nωn[G] we conclude that ⟨ξi∣i<κ⟩∈Nωn[G].
∎
Let us return to the proof of the theorem. Recall that, assuming the inductive claim holds for GSn, we must only show that for every P(μ,d)∈GSn+1 with crit(d)=κ, it is forced that (κ+,κ)↠(κi+,κi) holds for infinitely many i. Let p be a condition of length l, let H⊆R×Col(ν,κ) be as in Claim 4, with H generic over V. Note that V[H]⊨∣(κl+ω⋅n)V∣=κl, and (κl+ω⋅n+1)V=κl+. By Lemma 4, (κ+ω⋅(n+1)+1,κ+ω⋅(n+1))↠(κl+,κl) holds in V[H]. Let j:V→M and G be given by Claim 4, with j(p)∈G.
Let A∈M[G] be any structure on j(κ+ω⋅(n+1)+1)=κ+ω⋅(n+1)+1=(j(κ)+)M[G]. By Chang’s Conjecture in V[H], there is a B≺A of size κl+ω⋅n+1 such that ∣B∩κ+ω⋅(n+1))∣=∣B∩j(κ)∣=κl+ω⋅n. By the closure of M[G], B∈M[G], and thus M[G]⊨(j(κ)+,j(κ))↠(κl+,κl). By elementarity, the desired conclusion follows.
5. Chang’s Conjecture with the same target
In this section we will discuss two restricted versions of the Singular Global Chang’s Conjecture.
Theorem 8**.**
Suppose that κ is ν+-supercompact, where cfν=κ+ and ν is a limit of measurable cardinals, and α⋆ is a countable ordinal. Then there is a generic extension in which
[TABLE]
for all μ<ℵα⋆.
Theorem 9**.**
Suppose there are two supercompact cardinals and α⋆>0 is a countable limit ordinal. Then there is a generic extension in which
[TABLE]
for all singular μ, ℵα⋆<μ<ℵω1.
The proof of both theorems follows closely the ideas from [13], which in turn are motivated by the forcing arguments from [17].
Let us assume that κ is Laver-indestructible (with respect to κ-directed closed forcing notions of cardinality ≤ν+) and that GCH holds above κ. If this is not the case, we can always force it using Laver forcing [16]. Let ⟨ζβ∣β<κ+⟩ be a continuous increasing sequence with supζβ=ν, ζ0=κ, and ζβ+1 measurable for each β<κ+.
For every α<κ+ of countable cofinality, let us pick an increasing cofinal ω-sequence sα:ω→α. Let us assume that for each α, sα(0)=0, and s(n) is a successor ordinal for n>0.
Let us consider the forcing
[TABLE]
where E(μ,δ) is the Easton-support product of Col(μ,η) over all inaccessible η<δ. The product in the definition of Cα is taken with full support. For properties of the Easton collapse, see [24].
For each α<κ+ of countable cofinality, after forcing with Cα,
[TABLE]
By the arguments of [6] related to Lemma 3, there is ρα<κ such that
[TABLE]
and this remains true after forcing with Dα=Col(ω,ρα)∗Col˙(ρα+,<κ). In fact, (ζα+,ζα)↠(ρα+,ρα) must already hold in V, by the distribuitivity of Cα.
Since the forcing Cα is weakly homogeneous, the value of ρα depends only on α and does not depend on the generic filter for Cα. Therefore, the function α→ρα belongs to the ground model, V, and has the property that
[TABLE]
By the κ+-completeness of NSκ+, there is a stationary set S⊆κ+ and a cardinal ρ⋆<κ such that for all α∈S, ρα=ρ⋆. Let D be the common value of Dα for α∈S. There is n0<ω such that for every club C⊆κ+, {sα(n0):α∈C∩S} is unbounded. By Fodor’s Lemma, we may assume that sα↾n0 is constant on S.
Let us define a partial order P that searches for a “thread” of the sequences sα for α∈S. A condition t∈P is a continuous increasing function from a countable successor ordinal γ into κ+, such that rant⊆S∪⋃α<κ+ransα, and for every limit ordinal β<γ, ranst(β)⊆rant. As in [13], we have:
Claim \thelemma.
For every t∈P, every γ<ω1, and every ξ<κ+, there is a stronger condition t′⊇t with γ⊆domt′ and sβ(n0)>ξ for limit β∈domt′∖domt.
In particular, we can find a thread of any countable length. Let t be a thread of length α⋆. Define a sequence s:α⋆→ν as follows. If β is an infinite limit ordinal, then s(β)=ζt(β)+, and otherwise s(β)=ζt(β). Consider the forcing:
[TABLE]
First let us claim that in the generic extension by
D×C, we have (ℵβ+1,ℵβ)↠(ℵ1,ℵ0) for limit β<α⋆. As in [13], the projection properties of the Levy collapse, together with the fact that ransβ⊆rant for limit β<α⋆, imply that for each limit β<α⋆, there is a projection πβ:Cβ→C. If A is a structure on ζβ+ in VD×C, then in VD×Cβ, there is an elementary B≺A such that ∣B∣=ρ⋆+=ℵ1, and ∣B∩ζβ∣=∣ρ⋆∣=ℵ0. Since the quotient forcing adds no sets of ordinals of size <κ=ℵ2, the instance of Chang’s Conjecture holds in VD×C.
To obtain the result for successors below α⋆, we consider instead the forcing D∗C˙, where C˙ is the forcing with the same definition as C, but constructed in VD rather than V. By [23], there is a projection from D×C to D∗C˙ that is the identity on D. By the same argument as above, the relevant instances of Chang’s Conjecture at limit ordinals also hold in VD∗C˙.
Suppose β<α⋆ is zero or a successor ordinal. Let ζ=s(β)=ζt(β), and let η be the predecessor of ζ in the extension by D∗C˙, which is regular.
Since ζ is measurable, in the extension
[TABLE]
there is a normal ideal I on ζ such that P(ζ)/I contains a countably closed dense set—in particular the boolean algebra is a proper forcing. By [20], the following version of Strong Chang’s Conjecture holds in this model: If M is a countable elementary submodel of Hζ+ then there is an elementary M′⊇M such that M∩η=M′∩η and M∩ζ=M′∩ζ. By Lemma 15 of [6], (ζ,η)↠(ℵ1,ℵ0) is preserved by the formerly ζ-closed quotient ∏β≤γ<α⋆E(s(γ),s(γ+1)).∎
Remark**.**
Note that the assumption that ν is a limit of measurable cardinals is used in order to get Chang’s Conjecture between successors of regulars and ω1. If we only want Chang’s Conjecture to hold between successors of singulars and ω1, we can drop this assumption.
Let κ0<κ be supercompact, and let α⋆>0 be a fixed countable limit ordinal. First force Martin’s Maximum (MM) while turning κ0 into ℵ2, as in [7]. By [15], MM is indestructible under ℵ2-directed-closed forcing. Then, force with Laver’s forcing, which is ℵ2-directed-closed, to force that κ is indestructibly supercompact and GCH holds above κ.
Next we need, for large enough μ<κ, a forcing Dμ that turns κ into ℵα⋆+3
while preserving ω1 and satisfying the hypotheses of Lemma 3. If τ(α⋆)=ω, let Dμ=Col(ℵι(α⋆)+1,μ)×Col(μ+ω+2,<κ). If τ(α⋆)>ω, let γ be the identity sequence converging to ω, and let δ be a non-decreasing sequence summing to τ(α⋆), with δ1≥ω. Let Dμ=P(ℵι(α⋆)+1,γ,δ,U,K)×Col(μ+ω+2,<κ), where U and K are ω-sequences such that Un is a normal μ-complete ultrafilter on Pμ(μ+n), and Kn is
sufficiently generic filter, as in Section 3.
Working in a model of MM, let us repeat the arguments from the beginning of the proof of Theorem 8. For each α<κ+ of countable cofinality, choose a cofinal increasing sequence sα:ω→α with sα(0)=κ and sα(n) is a double successor ordinal for n>0. For each α<κ+ of countable cofinality, define
[TABLE]
For each α, there is μα<κ such that
[TABLE]
As above, let S⊆κ+ be a stationary set of countable cofinality ordinals such that μα has the same value for all α∈S, and that the threading forcing P satisfies Claim 5. In particular, there is n0<ω such that for all club C⊆κ+, {sα(n0):α∈S∩C} is unbounded, and sα↾n0 is the same for all α∈S.
Let D=Dμα for any α∈S. We now claim that P preserves stationary subsets of ω1. This is a reminiscent of the forcing for Friedman’s Problem (see [7, Theorem 9]).
Fix a stationary set A⊆ω1 and a condition t0∈P. Let C˙ be a P-name for a club subset of ω1, and let
[TABLE]
be such that M∩κ+=δ∈S, where ⊲ is a well-order of Hκ++. Let us assume further that M is the union of an increasing sequence of models Mn such that Mn∈Mn+1. We may also assume that sδ(n0)>sup(M0∩δ).
Let Nn′≺Mn be the Skolem hull of the finite set ransδ∩Mn. For α<ω1 and n<ω, let Nn′[α] be the Skolem hull of Nn′∪α. There is some α<ω1 such that for all n<ω, Nn′[α]∩ω1=α∈A. Let Nn=Nn′[α] for such an α. Let N=⋃Nn, so N≺M is countable, sup(N∩κ+)=δ, ransδ⊆N, and N∩ω1∈A.
Let ⟨Dn:n<ω⟩ enumerate the dense subsets of P in N, such that Dn∈Nn. Using Claim 5, we can build a sequence t0≥t1≥t2≥… such that for n>0, tn∈Dn∩Nn and ransδ∩Nn⊆rantn. We achieve that by working inside Nn. We first extend tn−1 by the finite set ransδ∩Nn and then extend this condition to meet Dn. Let γ=ot(⋃ntn), and let t=⋃ntn∪{⟨γ,δ⟩}. Then t is an (N,P)-master condition, and so it forces A∩C˙=∅.
Applying MM, we find a thread t of length ω1. Let s:ω1→κ+ be such that s(α)=t(α)+2 for limit α>0 and s(α)=t(α) otherwise. Let us consider the forcing
[TABLE]
For every β∈S, there is a projection from Cβ to C. Therefore, since the quotient adds no sets of ordinals of size <κ, D×C forces the desired conclusion.
∎
Remark**.**
By slightly modifying the proof of Theorem 9, one can strengthen the conclusion of the theorem as follows. Suppose MM holds and there is a supercompact cardinal. For every β<ω2 and every nonzero α⋆<β of countable cofinality, there is an ω1-preserving generic extension in which (μ+,μ)↠(ℵα⋆+1,ℵα⋆) for all μ<ℵβ, such that cfμ=ω and μ>ℵα⋆.
6. Open Problems
The construction in Section 4 is limited to instances of Chang’s Conjecture between successors of singular cardinals below ℵωω. In order to push this mechanism forwards, one needs to start with a model in which there is a cardinal κ which is κ+α+1-supercompact and Chang’s Conjecture holds between any pair of singular cardinals in the interval [κ,κ+α]. Since our method to produce an interval with such properties with limits of limit cardinals includes Prikry forcing, it cannot preserve supercompactness.
Question 1**.**
Is it consistent relative to large cardinals that (μ+,μ)↠(ν+,ν) holds whenever μ and ν have countable cofinality?
The known limitations on Global Chang’s Conjecture do not seem to rule out the consistency of a strengthening of Theorem 8 to a global statement:
Question 2**.**
Is it consistent relative to large cardinals that (κ+,κ)↠(ω1,ω) holds for all infinite cardinals κ?
Bibliography25
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Uri Abraham and Menachem Magidor, Cardinal arithmetic , Handbook of set theory. Vols. 1, 2, 3, Springer, Dordrecht, 2010, pp. 1149–1227. MR 2768693
2[2] Omer Ben-Neria, Chris Lambie-Hanson, and Spencer Unger, Diagonal supercompact Radin forcing , Ann. Pure Appl. Logic 171 (2020), no. 10, 102828, 17. MR 4103778
3[3] Lev Bukovský, Iterated ultrapower and Prikry’s forcing , Comment. Math. Univ. Carolinae 18 (1977), no. 1, 77–85. MR 0446978
4[4] James Cummings, Matthew Foreman, and Menachem Magidor, Squares, scales and stationary reflection , J. Math. Log. 1 (2001), no. 1, 35–98. MR 1838355 (2003 a:03068)
5[5] Patrick Dehornoy, Iterated ultrapowers and Prikry forcing , Ann. Math. Logic 15 (1978), no. 2, 109–160. MR 514228
6[6] Monroe Eskew and Yair Hayut, On the consistency of local and global versions of chang’s conjecture , Transactions of the American Mathematical Society 370 (2018), no. 4, 2879–2905.
7[7] M. Foreman, M. Magidor, and S. Shelah, Martin’s maximum, saturated ideals, and nonregular ultrafilters. I , Ann. of Math. (2) 127 (1988), no. 1, 1–47. MR 924672
8[8] Matthew Foreman, Smoke and mirrors: combinatorial properties of small cardinals equiconsistent with huge cardinals , Adv. Math. 222 (2009), no. 2, 565–595. MR 2538021