This paper proves the consistency of the square principle 2 with all 2-Aronszajn trees being special for any regular kappa, extending results to all regular cardinals using advanced set-theoretic methods.
Contribution
It establishes the consistency of 2 with the special Aronszajn tree property at 22 for all regular cardinals, a significant extension in set theory.
Findings
01
2 is consistent with all 2-Aronszajn trees being special.
02
The result applies simultaneously to all regular 2.
03
It shows 2 cannot generally be strengthened to 2.
Abstract
We show that for any regular cardinal κ, □κ,2 is consistent with "all κ+-Aronszajn trees are special." By a result of Shelah and Stanley this is optimal in the sense that □κ,2 may not be strengthened to □κ. Using methods of Golshani and Hayut we obtain our consistency result simultaneously for all regular κ.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems · Algebraic Geometry and Number Theory · Coding theory and cryptography
Full text
The Special Aronszajn Tree Property
at κ+ and □κ,2
John Susice111email: [email protected]
222This material is based upon work
supported by the National Science Foundation under Grants No. DMS-1363364 and DMS-1800613
Department of Mathematics,
University of California at Los Angeles
Abstract
We show that for any regular cardinal κ,
□κ,2 is consistent with “all
κ+-Aronszajn trees are special.”
By a result of Shelah and Stanley [1]
this is optimal in the sense that
□κ,2 may not be strengthened to
□κ. Using methods of Golshani and
Hayut [2] we obtain our consistency
result simultaneously for all regular κ.
Acknowledgments
The author would like to thank Itay Neeman for his
assistance in revising this paper.
1 Introduction
Given some infinite cardinal κ, a κ-Aronszajn
tree is a tree of height κ without cofinal branches all of
whose levels have cardinality <κ. By classical results of
König and Aronszajn, respectively, there are no ℵ0-Aronszajn
trees but there are ℵ1-Aronszajn trees.
Of particular interest to us are special Aronszajn trees. For any
successor cardinal κ+, we say that a κ+-Aronszajn tree
T is special if there exists a function
f:T→κ
such that if x<Ty then f(x)=f(y).
Following [2], if there are Aronszajn trees of height κ+ and
all such trees are special, we say that the Special Aronszajn Tree Property holds
at κ+, and denote this by SATP(κ+).
By a result of Baumgartner, Malitz, and Reinhardt [3] the forcing
axiom
MAℵ1 implies SATP(ℵ1). Laver and
Shelah [4] showed that SATP(ℵ2) is consistent assuming the
existence of a weakly compact cardinal. The forcing which achieves this result is a Levy Collapse
of κ to ℵ2 followed by an iteration of length ≥κ+ of posets
which successively specialize all new κ-Aronszajn trees arising in the extension.
Golshani and Hayut [2] showed that under the same assumption it is consistent that
SATP(ℵ1) and SATP(ℵ2) hold simultaneously, and achieved a global
result by showing that it is consistent that SATP(κ+) holds simultaneously for all
regular κ, assuming the existence of a proper class of supercompact cardinals.
This result is achieved by adapting the methods of [4] to specialize all possible
names for trees of height κ+ while anticipating the specialization of trees of height κ.
Another class of combinatorial principles of interest to set theorists are square principles.
The original square principle □κ was introduced by Jensen [5], who also
introduced a weak variant □κ∗. Later Schimmerling [6]
investigated principles □κ,λ
of intermediate strength. Suppose κ is an infinite cardinal and
λ is a nonzero (but potentially finite) cardinal. A □κ,λ sequence is
a sequence C=⟨Cα:α∈Lim(κ+)⟩
such that:
(1)
For all α∈Lim(κ+), 1≤∣Cα∣≤λ.
2. (2)
For all α∈Lim(κ+) and C∈Cα,
C is club in α and otpC≤κ.
3. (3)
For all α∈Lim(κ+), every C∈Cαthreads⟨Cβ:β<α⟩ in the sense that
C∩β∈Cβ for all β which are limit points of C.
We say □κ,λ holds if such a sequence exists. Jensen’s original principle
□κ is □κ,1, and the weak square principle □κ∗
is □κ,κ. In this paper we will be concerned exclusively with
□κ,2.
We show that the result of Laver and Shelah may be improved by establishing the consistency
of SATP(ℵ2) with □ω1,2. By a result of Shelah and Stanley
[1] SATP(ℵ2) is incompatible with □ω1, so this
result is optimal. Our result is obtained by using an iteration similar to that of Laver-Shelah,
with the exception that we use a poset of Cummings and Schimmerling [7]–which collapses
weakly compact κ to ℵ2 while adding a □ω1,2-sequence simultaneously–in
place of the Levy Collapse.
Furthermore, we show that our methods are compatible with the anticipatory framework of
Golshani and Hayut, and thus we are also able to obtain the analogous global result–namely the
consistency of SATP(κ+) plus □κ,2 for all regular κ.
2 The Cummings-Schimmerling Poset
We describe here a poset introduced by Cummings and Schimmerling
[7]
which, given cardinals μ<κ with μ regular and
κ inaccessible, will simultaneously collapse
κ to become μ+ and add a □μ,2 sequence.
We will denote this poset by P(μ,<κ).
A conditiion p in P(μ,<κ) is a function
such that:
The domain of p is a closed set of ordinals below κ
of cardinality <μ.
2. 2.
If α∈domp is a successor ordinal, say α=αˉ+1,
then the unique element of p(α) is {αˉ}.
3. 3.
If α∈domp is a limit ordinal with cofinality <μ then
1≤∣p(α)∣≤2 and each element of
p(α) is a club subset of α with order type
<μ.
4. 4.
If α∈domp is a limit ordinal with cofinality ≥μ then
p(α)={C}, where C is some closed subset
of α with order type <μ such that
maxC=sup(domp∩α).
5. 5.
(Coherence) If α∈domp, C∈p(α),
and β∈C, then β∈domp. If moreover
β∈LimC, then
C∩β∈p(β).
The ordering of the poset is defined by q≤p iff
domq⊇domp and:
(a)
q(α)=p(α) for all α∈domp of
cofinality <μ.
2. (b)
If α is of cofinality ≥μ,
p(α)={C}, and
q(α)={D}, then
C=D∩(maxC+1).
The Cummings-Schimmerling poset will not be <μ-closed but will still be
sufficiently closed so as to not add bounded subset of μ:
Definition 1**.**
Suppose that ν is some ordinal. A poset P is said to be
ν-strategically closed if Player II has a winning strategy in the
following game G(P,ν) of length ν:
[TABLE]
In this game the two players alternate building a descending chain ⟨pξ:1≤ξ<ν⟩
with Player II playing at all even ordinals (including limits) and Player II loses if he is unable to make a legal move.
Suppose that μ is some cardinal. We say that P is <μ-strategically closed if
it is ν-strategically closed for all ν<μ.
Lemma 2**.**
Suppose that μ<κ are cardinals with
μ regular and κ inaccessible.
Then P(μ,<κ) is <μ-strategically closed and
κ-Knaster.
Moreover, in the generic
extension by P(μ,<κ),
κ=μ+ and □μ,2 holds.
Proof.
We prove strategic closure. Fix ν<μ. We define
a winning strategy for Player II in the game G(P(μ,<κ),ν).
Suppose that ξ<ν is even and ⟨pζ:1≤ζ<ξ⟩
have already been played.
If ξ is a successor ordinal then Player II plays
an arbitrary extension pξ of pξ−1 such that
sup(dom(pξ)) is strictly greater than
sup(dom(pξ−1)).
Now suppose that ξ is a nonzero limit ordinal and let
[TABLE]
We define a condition pξ with domain Dˉ=D∪Lim(D)
which extends all ⟨pζ:1≤ζ<ξ⟩.
First, if α∈D with cf(α)<μ, we let
pξ(α)=pζ(α) for any 1≤ζ<ξ such that
α∈dom(pζ).
If α∈D with cf(α)≥μ then for each
1≤ζ<ξ let Cζ be the unique element of
pα(ζ) and let pξ(α)={C}, where
[TABLE]
If α∈LimD∖D is below supD then
choose β∈D least such that α<β. Note that β must
be a limit ordinal by conditions (2), (5) in the definition of P(μ,<κ). We claim
cf(β)≥μ.
Suppose otherwise and let E be an element of pξ(β) (note that
pξ(β) has already been defined). If α is not a limit point of
E, then let γ be the least element of E above α. Then
α<γ<β, and by condition (5) in the definition of P(μ,<κ)
we have γ∈D, contradicting choice of β.
Thus cf(β)≥μ as desired, and so if we let
E be the unique element of pξ(β) (again, this has already been defined)
then clause (4) in the definition of P(μ,<κ) guarantees
max(E)=α, and we may define pξ(α)={E}.
Finally, if α=supD, let
[TABLE]
It should be clear that pξ as defined above is a condition in
P(μ,<κ) and the strategy described is a winning
strategy for Player II in G(P(μ,<κ),ν).
The rest of the lemma may be proved exactly as in [7].
∎
Note that an argument similar to the one above will show that if μ=ℵ1 then
P(μ,<κ) is in fact countably closed.
In the proof of our consistency results it will be crucial
that for μ<κ0<κ1 with μ regular and
κ0, κ1 inacessible, P(μ,<κ0)
may be viewed as a factor of P(μ,<κ1).
In order to precisely state the necessary factorization result,
we first define two auxilliary posets:
Suppose that C=⟨Cα:α<μ+⟩
is a □μ,2-sequence. We let T=TC be the poset of
closed bounded C⊆μ+ of order-type <μ such that
C threads ⟨Cα:α≤maxC⟩ in the sense
that C∩α∈Cα for all α∈LimC.
For C,D∈T, we set D≤C if and only if D is an end-extension of
C.
Finally, if G is the generic added by P(μ,<κ0),
then Q=Qμ,κ0,κ1,G is the poset
defined in V[G] by setting q∈Q iff:
(1)
The domain of q is a set of limit ordinals in the interval
(κ0,κ1) of size <μ.
2. (2)
If α∈domq has cofinality <μ then
1≤∣q(α)∣≤2 and each element of
q(α) is a club subset of α with order type
<μ.
3. (3)
If α∈domq has cofinality ≥μ then
q(α)={C}, where C is a club subset of
α with order type <μ such that
maxC≥sup(domq∩α).
4. (4)
(Coherence) If α∈domq, C∈q(α), and
β∈LimC, then:
(A)
If β>κ0, then β∈domq and C∩β∈q(β).
2. (B)
If β<κ0, then C∩β∈Cβ, where
⟨Cβ:β<κ0⟩ is ⋃G.
For two elements p,q∈Qμ,κ0,κ1,G, we set p≤q
iff:
(1)
domq⊆domp.
2. (2)
For all α∈domq:
(a)
If α has cofinality <μ then p(α)=q(α).
2. (b)
If α has cofinality ≥μ, p(α)={C}, and
q(α)={D}, then C is an end-extension of
D.
Lemma 3**.**
Suppose that μ<κ0<κ1 are cardinals with μ regular and κ0,
κ1 inaccessible, and G˙ is the canonical name for the
P(μ,<κ0)-generic. Then if we let T˙=Tˇ⋃G˙, Q˙=Qˇμ,κ0,κ1,G˙, there is
an isomorphism between a dense subset of P(μ,<κ1) and a dense
subset of P(μ,<κ0)∗T˙∗Q˙.
In particular these two forcings are equivalent, and so informally we may view them as
being equal.
Suppose that μ<κ are cardinals with μ regular and κ inaccessible.
Let P=P(μ,<κ), let G˙ be the canonical name for
the P-generic, and let T˙=Tˇ⋃G˙.
Then there is a dense subset of P∗T˙ which is
<μ-closed and so in particular P∗T˙ is
forcing equivalent to Col(μ,κ).
Proof.
Let D be the dense set of conditions in P∗T˙ of the form
(p,tˇ) which are flat in the sense that max(domp)=maxt.
We claim that D is as desired. To see this, suppose that ν<μ is a limit
ordinal and let
⟨(pξ,tˇξ):ξ<ν⟩
be a descending sequence of conditions in D. We find a lower bound
p∗ for ⟨pξ:ξ<ν⟩ as in the
limit case of Lemma 2, except that we
set
[TABLE]
where
[TABLE]
Then (p∗,tˇ∗)∈D is our desired lower bound. Since D is
<μ-closed, ∣D∣=κ, and D forces ∣κ∣=μ, D
is forcing equivalent to Col(μ,κ) by a well-known result due to Solovay
(see, e.g. Lemma 2.3 of [8]).
∎
3 Specializing Trees with Anticipation
In this section we review the methods of [2] for specializing trees
while anticipating subsequent forcing.
First we introduce the modified Baumgartner forcing which specializes a single tree
while anticipating a single subsequent forcing.
Suppose that μ<κ are regular cardinals in V and I2∗I˙1 is a
κ-c.c. two-step iteration which forces κ=μ+. Suppose moreover that T˙ is
an I2∗I˙1-name for a κ-Aronszajn tree, which
we view as a subset of κ×μ. Then Bμ,I1(T˙)
is defined in VI2 as the poset of partial functions
f:κ×μ→μ of size <μ such that if
s,t∈domf and f(s)=f(t), then
[TABLE]
The forcing is ordered by reverse inclusion.
If μ is understood (as it usually is) then we suppress the dependence on μ and write
BI1(T˙) in place of Bμ,I1(T˙).
Suppose μ<κ are regular cardinals and, I2∗I˙1 is
a κ-c.c. forcing which forces κ=μ+, T˙ is an I2∗I1-name for a κ-Aronszajn tree, and G is I2-generic.
Then in V[G] the following
hold:
(a)
BI1(T˙)* is <μ-closed.*
2. (b)
In the extension by the generic for BI1(T˙) there is
a function F:κ×μ→μ which is
a specializing function for the tree T˙[G][H] for anyI1-generic H.
Now we describe the general form of iterations I2 and I1 such that
I2 specializes allκ-Aronszajn trees while anticipating forcing
by I1.
Definition 7**.**
Suppose that μ<κ<κ+≤δ are regular cardinals in V, and the iterations
[TABLE]
are as follows:
•
I12=P(μ,<κ), the forcing which collapses
κ to μ+ while adding □μ,2.
•
Iγ2 is the iteration with <μ-support
of ⟨J˙γ′2:γ′<γ⟩. In other
words, if γ is a limit ordinal of cofinality ≥μ, then
Iγ2 is the direct limit of ⟨Iγ′2:γ′<γ⟩, if γ is a limit ordinal of cofinality <μ, then
Iγ2 is the inverse limit of ⟨Iγ′2:γ′<γ⟩, and if γ=γˉ+1 is a successor ordinal then
Iγ2=Iγˉ2∗J˙γˉ2.
•
Each I˙γ1 is an Iγ2-name for a
μ-c.c. poset.
•
J˙γ2 is a name for the poset
BIγ1(T˙γ), where
T˙γ is an Iγ2∗I˙γ1-name
for a κ-Aronszajn tree, chosen according to some appropriate bookkeeping function.
Then we refer to I2 as an “iteration which collapses κ to μ+, adds □μ,2 and
specializes all κ-Aronszajn trees while
anticipating the subsequent iteration I1” (or some similar locution for the sake of
brevity).
Suppose that μ<κ<δ are regular cardinals and I2 is an
iteration of length δ which collapses κ to μ+, adds □μ,2,
and anticipates the iteration I˙1 in the sense described above.
Let γ≤δ be some ordinal and
suppose that M is an elementary substructure of H(θ) (θ sufficiently large)
of cardinality κ such that Vκ∪M<κ∪{γ}⊆M and
M contains all relevant parameters.
Furthermore, let ϕ:κ→M be a
bijection and for all α<κ set Mα=ϕ‘‘α. We say that
I2, I˙1 are suitable for M, ϕ, γ if:
(1)
For all γˉ≤γ,
⊩Iγ2 “I˙γˉ1 is
μ-c.c.”
2. (2)
For all α<κ and γˉ∈Mα∩γ, if:
(a)
Iγˉ2∩Mα is a regular subposet of
Iγˉ2∩M.
2. (b)
⊩Iγˉ2∩M “I˙γˉ1∩Mα is a regular subiteration of I˙γˉ1∩M.”
3. (c)
T˙γˉ∩Mα is an (Iγˉ2∩Mα)∗(I˙γˉ1∩Mα)-name for an
α-Aronszajn tree.
Then forcing with (Iγˉ2∩M)∗(I˙γˉ1∩M)/G, where G is generic for
(Iγˉ2∩M)∗(I˙γˉ1∩Mα),
doesn’t add any new branches to the tree named by T˙γˉ∩Mα.
We will need to make use of the following basic lemma about forcings which don’t add branches to trees:
Suppose that T is a κ-tree and P is a
κ-Knaster poset. Then forcing with P doesn’t
add a branch to T.
4 Obtaining □ω1,2 + SATP(ℵ2) +
SATP(ℵ1)
Theorem 10**.**
Suppose that μ<κ<κ+≤δ are cardinals with
μ, δ regular and κ weakly compact.
Suppose moreover that
[TABLE]
are two iterations such that I2 collapses κ to μ+,
adds □μ,2, and specializes all κ-Aronszajn trees while
anticipating I1 (in the sense described in the previous section).
Finally, suppose that for all ordinals γ≤δ
there exists M elementary in H(θ) (θ sufficiently large)
of cardinality κ such that Vκ∪M<κ∪{γ}⊆M, M contains
all relevant parameters, and I2, I˙1 are suitable
for M, ϕ, γ (for some fixed bijection ϕ:κ→M).
Then the generic extension by Iδ2∗I˙δ1
satisfies
[TABLE]
The majority of the remainder of this section is devoted to giving a proof of this result.
We follow closely the proof of the main theorem in [2].
Lemma 11**.**
For every γ≤δ, Iγ2 is <μ strategically
closed.
Proof.
The forcing Iγ2 is a <μ-strategically closed forcing
(namely, P(μ,<κ)) followed by the <μ-support iteration of
<μ-closed posets.
∎
Lemma 12**.**
For every γ≤δ, ⊩Iγ2‘‘I˙γ1 is
μ-c.c.” and ⊩Iδ2‘‘I˙γ1 is μ-c.c.”
Proof.
This is immediate from the definition of suitability of I2, I˙1.
∎
Lemma 13**.**
For every γ≤δ, Iγ2 is κ-Knaster.
Proof.
By induction on γ. For the base case, we know I12≃P(μ,<κ) is κ-Knaster by Lemma 2. So suppose γ≤δ
and each Iγ′2 is κ-Knaster for all γ′<γ.
We seek to show that Iγ2 is also κ-Knaster.
If γ is a limit ordinal and μ≤cfγ=κ
this is immediate since any subset of Iγ2 of cardinality
κ may be refined
to a subset of Iγ′2 of cardinality κ for some γ′<γ.
If γ is a limit ordinal with cfγ=κ this follows from a
Δ-system argument.
Thus suppose that either γ is a limit ordinal with
cfγ<μ or γ=γˉ+1 for
some ordinal γˉ. Fix M as in the hypothesis of the theorem, and in
either case fix an increasing sequence
{γi:i<cfγ} in M which is cofinal in γ (if
γ=γˉ+1 is a successor ordinal we say its cofinality is 1 and we let
γ0=γˉ, so in this case {γi:i<1} is cofinal in γ).
Let R be a subset of Vκ which encodes both M and ϕ (where ϕ is the bijection from
the hypothesis of Theorem 10).
Fix a <κ-complete normal filter F on κ which extends the club
filter and satisfies
[TABLE]
for each formula ψ which is Π11 over Vκ.
For all α<κ set
Mα=ϕ‘‘α.
Assume that γˉ∈γ∩M, and for all
γˉˉ∈γˉ∩M we have that Iγˉˉ2 is κ-Knaster and
T˙γˉˉ is an Iγˉˉ2∗I˙γˉˉ1-name
for a κ-Aronszajn tree. Then there exists X=Xγˉ∈F such that for all
α∈X and γˉˉ∈γˉ∩Mα:
α* is inaccessible.*
2. 2.
Mα∩κ=α.
3. 3.
Mα<α⊆Mα.
4. 4.
Iγˉˉ2∩Mα* is a regular subposet of
Iγˉˉ2∩M
and is α-c.c.*
5. 5.
Iγˉˉ1∩Mα* is equivalent to an
Iγˉˉ2∩Mα-name.*
6. 6.
(Iγˉˉ2∗I˙γˉˉ1)∩Mα* is a
regular subposet of
(Iγˉˉ2∗I˙γˉˉ1)∩M.*
7. 7.
(Iγˉˉ2∗I˙γˉˉ1)∩Mα* forces that
Tγˉˉ∩(α×μ) is an α-Aronszajn tree.*
Proof.
Let X=Xγˉ be the set of all α<κ that satisfy these requirements for all
γˉˉ∈γˉ∩Mα.
The claim follows immediately from a Π11 reflection argument together with the fact that
F extends the club filter. In (7) we make use of the fact that
(Iγˉˉ2∗I˙γˉˉ1)∩M
forces that Tγˉˉ is a κ-Aronszajn tree, which follows from observing
that (Iγˉˉ2∗I˙γˉˉ1)∩M
is a regular subposet of Iγˉˉ2∗I˙γˉˉ1
(this is itself a consequence of the fact that Iγˉˉ2∗I˙γˉˉ1
has the κ-c.c., by the inductive hypothesis).
∎
Suppose that p∈Iγ2∩M is some condition and α<κ.
Write p=⟨p(ξ):ξ<γ⟩. Then p↾Mα denotes the
condition ⟨p′(ξ):ξ<γ⟩, where p′(ξ) is the trivial condition if
ξ∈/Mα and p′(ξ)=p(ξ)∩Mα otherwise.
We say that p is α-compatible if
p↾Mα forces that p is a determined condition in
(Iγ2∩M)/(GIγ2∩Mα).
Claim 17**.**
Let X=Xγˉ be as in the previous claim. Then for every α∈X,
γˉˉ∈(γˉ+1)∩Mα,
pˉ∈Iγ2∩Mα, α-compatible pL,pR∈Iγ2∩M with
pˉ=pL↾Mα=pR↾Mα,
and every pair (x˙L,x˙R) of
(Iγˉˉ2∩M)∗(Iγˉˉ1∩Mα)-names for
nodes in Tγˉˉ above level α,
there are
α-compatible conditions p∗L,p∗R∈Iγ2∩M,
pˉ∗∈Iγ2∩Mα, and a sequence
[TABLE]
(for some ϑ<μ) in Mα such that:
(a)
p∗L≤pL, p∗R≤pR and
pˉ∗=p∗L↾Mα=p∗R↾Mα.
2. (b)
For all η<ϑpˉ∗⊩Iγ2∩Mαrη∈I˙γ1∩Mα.
3. (c)
For all η<ϑ, ξη<α and xηL, xηR are elements of
{ξη}×μ with
xηL=xηR.
4. (d)
(p∗L↾γˉˉ,rη↾γˉˉ)⊩xˇηL≤x˙L* and
(p∗R↾γˉˉ,rη↾γˉˉ)⊩xˇηR≤x˙R.*
5. (e)
pˉ∗⊩Iγ2∩Mα{r˙η:η<ϑ}* is a maximal antichain in
I˙γ1.*
Proof.
Suppose α∈X,
γˉˉ∈(γˉ+1)∩Mα, and
fix names x˙L, x˙R for nodes in Tγˉˉ of level
≥α and conditions pˉ, pL, pR as in the
statement of the claim. It follows from the choice of
α that for any (Iγˉˉ2∩M)∗(I˙γˉˉ1∩Mα)-generic G
the branches in Tγˉˉ↾α below
x˙L, x˙R are not in
V[G∩(Iγˉˉ2∗Iγˉˉ1)∩Mα].
Subclaim 18**.**
For any pair (sL,t), (sR,t) of conditions in
(Iγ2∩M)∗(I˙γ1∩Mα) such that sL, sR are α-compatible
and sL↾Mα=sR↾Mα,
there is another pair (qL,r), (qR,r) of conditions in
(Iγ2∩M)∗(I˙γ1∩Mα) such that:
•
(qL,r)≤(sL,t) and (qR,r)≤(sR,t)
•
(qL↾γˉˉ,r↾γˉˉ), (qR↾γˉˉ,r↾γˉˉ) force incompatible values for the branches below
x˙L and x˙R
•
qL, qR are α-compatible
•
qL↾Mα=qR↾Mα.
Proof.
This is done exactly as in [2]. We give the proof for the convenience
of the reader. Suppose the opposite for the sake of a contradiction, and consider
pairs (sL,t), (sR,t) witnessing the negation.
Let H be (Iγˉˉ2∗I˙γˉˉ1)∩Mα-generic with (sL↾γˉˉ)↾Mα=(sR↾γˉˉ)↾Mα∈H and Ji be
(Iγˉˉ2∩M)/(Iγˉˉ2∩H)-mutually
generic with (si↾γˉˉ,t)∈Ji (for i∈{L,R}).
If Ki is any
[(Iγˉˉ2∗I˙γˉˉ1)∩M]/(H∗Ji)-
generic (i∈{L,R}) then in V[H][Ji][Ki] there is a branch bi in the tree
Tγˉˉ∩(α×μ) consisting of nodes which lie below
xi. Moreover, by condition (2) of Definition 8, we have
bi∈V[H][Ji] (note, however, that V[H][Ji] may not recognize that all nodes in
bi are below xi, or even that Tγˉˉ itself is a tree).
Nonetheless, by condition (1) of Definition 8
there exists μ0i<μ and a collection
{bˇξi:ξ<μ0i} of names for elements of
V[H][Ji] which are cofinal branches through Tγˉˉ∩(α×μ) such that in V[H][Ji] the following holds:
[TABLE]
where b˙i is the canonical name for the branch bi described above.
Moreover, by the assumption of the subclaim, there must exist
ξL<μ0L and ξR<μ0R such that
bξLL=bξRR. Denoting this common value by b, we have
[TABLE]
and since JL, JR were chosen to be mutually generic we have
b∈V[H]. But this is a contradiction since
(Iγˉˉ2∗I˙γˉˉ1)∩Mα
forces Tγˉˉ∩(α×μ) to be
an α-Aronszajn tree.
∎
Invoking this claim, we may find a pair of conditions (p0L,r0),
(p0R,r0) in (Iγ2∩M)∗(I˙γ1∩Mα) with p0L≤pL,
p0R≤pR, and p0L↾Mα=p0R↾Mα
together with ξ0<α and elements x0L, x0R in {ξ0}×μ such that
[TABLE]
Furthermore, we may assume that if we let t0L be the unique element of
p0L(0)(α) and t0R be the unique element of
p0R(0)(α) then
[TABLE]
are flat conditions in P(μ,<α)∗T˙α,
where T˙α=Tˇ⋃G˙P(μ,<α).
Proceeding inductively, suppose ν<μ and we have defined the pairs
(pηL,r˙η), (pηR,r˙η) in (Iγ2∩M)∗(I˙γ1∩Mα),
pˉη in Iγ2∩Mα, and tˇηL,
tˇηR in T˙α∩M together with
ξη and xηL, xηR∈{ξη}×μ,
such that:
•
The sequences ⟨pηL:η<ν⟩ and
⟨pηR:η<ν⟩ are decreasing and
for each ηpηL and pηR are α-compatible.
•
pˉη=pηL↾Mα=pηR↾Mα.
•
pˉη⊩Iγ2∩Mαr˙η∈I˙γ1∩Mα.
•
For η0<η1<ν, pˉη1⊩Iδ2∩Mαr˙η0, r˙η1 are incompatible.
•
ξn<α, xηL, xηR∈{ξη}×μ
and xηL=xηR.
•
(pηL↾γˉˉ,r˙η↾γˉˉ)⊩xˇηL≤x˙L.
•
(pηR↾γˉˉ,r˙η↾γˉˉ)⊩xˇηR≤x˙R.
•
tηL is the unique element of pηL(0)(α).
•
tηR is the unique element of pηR(0)(α).
•
(pηL↾Mα)(0)∗tˇηL, (pηR↾Mα)(0)∗tˇηR are flat conditions in
P(μ,<α)∗T˙α, where
T˙α=Tˇ⋃G˙P(μ,<α).
If ν is a successor ordinal let qνL=pν−1L, qνR=pν−1R.
Otherwise, let
[TABLE]
and let qνL, qνR be lower bounds of
{pηL:η<ν}, {pηR:η<ν}
such that bothtνL, tνR appear on the (approximations to) square sequences
qνL(0), qνR(0). These lower bounds may be seen to exist by an argument
similar to that used to prove strategic closure in Lemma 2. Namely, each initial
segment of tηL, tηR of limit order type has already been placed on pηL(0),
pηR(0) for some η<ν, and therefore we may place tνL, tνR on
qνL(0), qνR(0) without any danger of violating coherence.
Observe that this is the part of the argument where we exploit the “two-ness” of the principle
□κ,2 (and hence of the poset used to force it). Namely, we seek to ensure that
p∗L, p∗R agree on Mα, and so must put both threads on both conditions.
Finally, note that in either case (ν successor or limit) we have
qνL,qνR are α-compatible conditions in Iγ2∩M
and qνL↾Mα=qνR↾Mα.
Let qˉν=qνL↾Mα=qνR↾Mα.
If
[TABLE]
we halt the construction and set pνL=qνL, pνR=qνR.
Otherwise proceed exactly as when obtaining r0, except now working below sν. Namely,
find a condition sν forced to be incompatible with
every rη (η<ν) and choose (pνL,rν), (pνR,rν),
pˉν, ξν<α, and xνL,xνR∈{ξν}×μ such that:
•
(pνL,rν),(pνR,rν)∈(Iγ2∩M)∗(I˙γ1∩Mα).
•
pνL, pνR are α-compatible.
•
(pνL,rν)≤(qνL,sν) and (pνR,rν)≤(qνR,sν).
•
pˉν=pνL↾Mα=pνR↾Mα.
•
(pνL↾γˉˉ,r˙ν↾γˉˉ)⊩xˇνL≤x˙L.
•
(pνR↾γˉˉ,r˙ν↾γˉˉ)⊩xˇνR≤x˙R.
•
tνL is the unique element of pνL(0)(α).
•
tνR is the unique element of pνR(0)(α).
•
(pνL↾Mα)(0)∗tˇνL,
(pνR↾Mα)(0)∗tˇνR are flat conditions
in P(μ,<α)∗T˙α, where
T˙α=Tˇ⋃G˙P(μ,<α)
By Lemma 12 this process terminates after
<μ many steps. At its completion we get an ordinal
ϑ<μ, descending sequences ⟨pηL:η≤ϑ⟩
and ⟨pηR:η≤ϑ⟩ of conditions in
Iγ2∩M, as well
as sequences ⟨pˉη:η<ϑ⟩,
⟨rη:η<ϑ⟩, and ⟨(ξη,tˇηL,tˇηR,xˇηL,xˇηR):η<ϑ⟩ such that:
•
(pηL,rη),(pηR,rη)∈(Iγ2∩M)∗(I˙γ1∩Mα).
•
pηL, pηR are α-compatible.
•
pˉη=pηL↾Mα=pνR↾Mα.
•
xηL,xηR∈{ξη}×μ.
•
(pηL↾γˉˉ,r˙η↾γˉˉ)⊩xˇηL≤x˙L.
•
(pηR↾γˉˉ,r˙η↾γˉˉ)⊩xˇηR≤x˙R.
•
tηL is the unique element of pηL(0)(α).
•
tηR is the unique element of pηR(0)(α).
•
(pηL↾Mα)(0)∗tˇηL,
(pηR↾Mα)(0)∗tˇηR are flat conditions
in P(μ,<α)∗T˙α, where
T˙α=Tˇ⋃G˙P(μ,<α)
Finally, set p∗L=pϑL, p∗R=pϑR.
Then this
pair (p∗L,p∗R) together with ⟨rη,ξη,xˇηL,xˇηR:η<ϑ⟩ are as desired.
∎
Following [2], let
us call the sequence ⟨(rη,ξη,xˇηL,xˇηR):η<ϑ⟩
an α-separating witness for the nodes x˙L, x˙R relative to p∗L, p∗R.
We now continue with the proof of Lemma 13:
Claim 19**.**
There is X∈F such that for every condition
p∈Iγ2∩M and α∈X there are conditions
pL,pR≤p (both in M) such that pL↾Mα=pR↾Mα and for every γ′∈γ∩Mα, any pair of elements above
α in dom(pL(γ′))×dom(pR(γ′)) has an
α-separating witness in Mα relative to pL↾γ,
pR↾γ.
We call such a pair (pL,pR) an α-separating pair.
Proof.
Recall that we chose a sequence {γi:i<cfγ}
cofinal in γ. For each i<cfγ let Xγi be as in
Claim 17, and let X=⋂i<cfγXγi. This
X suffices, as may be seen by applying Claim 17cfγ many times
and using the <μ-strategic closure of Iγ2.
∎
Returning to the proof of the κ-c.c., let X be as in Claim 19 and
let ⟨pα:α<κ⟩∈M be a sequence of
conditions in Iγ2. For every α∈X we may extend
pα to an α-separating pair (pαL,pαR)∈M.
Let sα∈Mα be the list of separating witnesses and let
pˉα denote pαL↾Mα=pαR↾Mα.
The function α↦(sα,pˉα) is regressive, and so by normality of
F there is a set Y which is positive with respect to
this filter and a pair (s∗,pˉ∗) such that for all α∈Y(sα,pˉα)=(s∗,pˉ∗). By further thinning we may assume that for
every α0,α1∈Y with α0<α1 we have
pα0L,pα1R∈Mα1. Similarly, we may assume without loss of
generality that
[TABLE]
is a Δ-system with root R.
We claim that for any α0<α1 in Y, pα0 is compatible with
pα1, as witnessed by the condition q given by
q(γ′)=pα0L(γ′)∪pα1R(γ′) for every
γ′<γ.
We must show that q so defined is a condition. Clearly ∣dom(q)∣<μ and
so it remains only to show that q↾γ′ forces that
q(γ′) is a condition in J˙γ′2 for all
γ′<γ. We proceed by induction on γ′. For
γ′=0q(γ′)∈P(μ,<κ),
since pα0L(γ′), pα1R(γ′) have identical intersection with
Mα0 and are disjoint above α0.
Now assume γ′>0 and q↾γ′ is a condition.
Without loss of generality T˙γ0′
is an Iγ′2∗I˙γ′1-name for a
κ-Aronszajn tree, as otherwise J˙γ′2 is a name for
the trivial forcing. We may also assume γ′∈R, since otherwise
q(γ′) is either pα0L(γ′) or pα1R(γ′).
In order to show that q↾γ′⊩q(γ′) is a condition
we must show that if x˙L,x˙R∈dom(q(γ′)) and
q↾γ′⊩q(γ′)(x˙L)=q(γ′)(x˙R), then
[TABLE]
Since pα0L↾Mα0=pˉ=pα1R↾Mα1,
we may assume without loss of generality that both x˙L, x˙R are names for nodes
above level α0. Letting s∗=⟨rη,ξη,xˇηL,xˇηR:η<ϑ⟩ be our fixed separating witness,
we have:
[TABLE]
By the induction hypothesis q↾γ′ is a condition extending
both pα0L↾γ′ and pα0R↾γ′
and so in particular, since xˇηL=xˇηR, for all η<ϑ we have
[TABLE]
Since {r˙η:η<ϑ} is forced to be a maximal antichain, we have
[TABLE]
as desired.
∎
Remark*.*
It behooves us to observe that the proof of Lemma 13 actually gives us something
stronger–namely that for any S⊆δ such that
Iδ2↾S is a regular subposet of Iδ2, and
for any Iδ2↾S-generic K, the quotient
Iδ2/K is κ-Knaster. The proof of this is almost
identical to that of Lemma 13, but we must observe that
every name T˙γ for a κ-Aronszajn tree considered in the
iteration remains a name for a κ-Aronszajn tree in V[K].
This is true since any such tree is κ-Aronszajn (in fact, special)
in V[K][L], where L is generic for Iδ2/K.
Suppose that T is an κ-Aronszajn tree in
V[GI] and let T˙ be a
canonical name for it. Then for some
γ<δ it is an Iγ-name
and T˙=T˙γ. By construction of the
forcing poset, ⊩Iγ+1‘‘T˙ is special”
and since V[GIγ+1] and V[GI] have the same
cardinals T remains special in the latter generic extension.
∎
Suppose that there is a weakly compact cardinal. Then in some generic
extension of V the following holds:
[TABLE]
Proof.
Let κ be weakly compact and let
[TABLE]
be two iterations such that I2 collapses κ to ℵ2,
adds □ω1,2, and specializes all κ-Aronszajn trees while
anticipating I˙1–where I˙1 is an
I2-name for the Baumgartner forcing–i.e. a finite support iteration of
posets of finite approximations to specializing functions of trees chosen according to
some appropriate bookkeeping function. For each ordinal γ≤δ let M
be an arbitrary elementary substructure of
H(θ) (θ sufficiently large) of cardinality κ such that
Vκ∪M<κ∪{γ}⊆M and M contains all relevant parameters, and
let ϕ:κ→M be an arbitrary bijection. Then
I2, I˙1 are suitable for M,
ϕ, γ by the remark after the proof of Lemma 13
together with [3]. Therefore the result follows immediately from
Theorem 10.
∎
5 The Global Result
Using the methods of [2] we are able to obtain our
result simulaneously at ω many successive cardinals.
Theorem 25**.**
Let μ be an uncountable regular cardinal and assume that there are ω many supercompact
cardinals above μ. Then there is a generic extension of V in which
□μ+n,2+SATP(μ+n+1) holds for all n≥0.
Furthermore, if μ=ℵ1, we may ensure that SATP(ℵ1) holds
as well.
Proof.
Let ⟨κn:n<ω⟩
be an increasing sequence of indestructibly supercompact cardinals above μ and
let δ=(supn<ωκn)++.
In the following it will be convenient to write κ−1=μ.
If μ=ℵ1, let R=ω∪{−1}, and otherwise
let R=ω.
Let h:δ∖{0}→R be a function
such that for all n∈R, h(α)=n for unboundedly
many α<δ. We define an iteration
[TABLE]
as well as auxilliary forcings
Iγ(>κn), I˙γ(κn), and I˙γ(<κn)
for n∈R, γ≤δ such that:
(a)
Iγ≃Iγ(>κn)∗I˙γ(κn)∗I˙γ(<κn)
2. (b)
Iγ(>κn) is
<κn-strategically closed.
3. (c)
For all n≥0, ⊩Iγ(>κn)I˙γ(κn)
is κn-c.c. and <κn−1-
strategically closed, and for
n=−1, ⊩Iγ(>κn)I˙γ(κn)
is c.c.c.
4. (d)
For all n≥0, ⊩Iγ(>κn)∗I˙γ(κn)I˙γ(<κn)
is κn−1-c.c. and
<μ-closed.
Set I1=∏n<ωP(κn−1,<κn),
where the product is taken with full support, and
then let
•
I1(<κn)=∏m<nP(κm−1,<κm) for n≥0 and
is the trivial forcing for n=−1.
•
I1(κn)=P(κn−1,<κn) for n≥0 and is the trivial forcing for n=−1.
•
I1(>κn)=∏m>nP(κm−1,<κm),
also taken with full support.
Now suppose that 2≤γ≤δ and we have already
defined Iγ′, Iγ′(>κn),
I˙γ′(κn), and
I˙γ′(<κn) for all γ′<γ
and n∈R. We define Iγ,
I˙γ(>κn), and
I˙γ(<κn) as follows:
•
If γ is a limit ordinal then
Iγ is the set of all
p with domain γ such that
p↾γ′∈Iγ′
for all γ′<γ, for all
n≥0 we have ∣supp(p)∩h−1(n)∣<κn−1, and for n=−1 we have ∣supp(p)∩h−1(n)∣ finite.
•
If γ=γˉ+1 is a successor ordinal
and n=h(γˉ) then let
T˙γˉ be an
Iγˉ-name for a
κn-Aronszajn tree
chosen according to
some bookkeeping function, and let
[TABLE]
Observe that B˙Iγˉ(<κn)(T˙γˉ)
is an Iγˉ(>κn−1)-name (if n=−1 we mean here that it
is an Iγˉ-name) and so may be viewed as
an Iγˉ(κn)-name in the extension by
Iγˉ(>κn).
For n∈R let
[TABLE]
Then Iγ(>κn) is a regular subforcing of
Iγ. We let I˙γ(κn) be an
Iγ(>κn)-name for the poset
[TABLE]
and let I˙γ(<κn) be an Iγ(>κn)∗I˙γ(κn)-name for the poset
[TABLE]
Observe that Iγ≃Iγ(>κn)∗I˙γ(κn)∗I˙γ(<κn).
Lemma 26**.**
Let G>κn be generic for Iγ(>κn) and
G˙κn be an Iγ(>κn)-name for the
generic for I˙γ(κn). If
n≥0, then V[G>κn]⊨ “Iγ(κn) is
<κn−1-strategically closed” and V[G>κn∗G˙κn]⊨ “I˙γ(<κn) is
<μ-strategically closed.”
Proof.
Clearly
[TABLE]
since Iγ(κn) may be defined as an iteration with <κn−1-support
in V[G>κn] where each iterand has the requisite closure. The fact that
[TABLE]
may be argued similarly.
∎
Lemma 27**.**
Let G>κn, G˙κn be as in the statement of Lemma 26.
Then V[G>κn]⊨ “Iγ(κn) is
κn-Knaster” and V[G>κn∗G˙κn]⊨ “I˙γ(<κn) is κn−1-Knaster.” Moreover, we actually have
V[G>κn]⊨ “Iγ(κn)/L is κn-Knaster,”
for any L which is generic for a regular subiteration of Iγ(κn).
Proof.
We prove these simultaneously using induction on n.
For each m>n let Gκm denote the generic for
Iγ(κm) and let T˙(κm)=Tˇ⋃G˙κm
be the Iγ(κm)-name for the poset which threads ⋃Gκm with conditions of
size <κm−1. An argument similar to that given in Lemma 4 tells us that
Iγ(κm)∗T˙(κm) is <κm−1-closed. Moreover, it
is clear that this poset forces ∣κm∣=κm−1 and has size ≤δ.
Let T˙(>κn) be the Iγ(>κn)-name for
[TABLE]
where T(κm)=T˙(κm)[Gκm] and the product is taken with
full support. Then Iγ(>κn)∗T˙(>κn) is
<κn-closed, forces ∣κm∣=κn for all m>n, and has
cardinality ≤δ, and so there is a regular embedding from
Iγ(>κn)∗T˙(>κn) into
Col(κn,δ)–in fact we have Col(κn,δ)≃(Iγ(>κn)∗T˙(>κn))×Col(κn,δ).
Let (G>κn∗H˙>κn)×Kn
be generic for the latter poset.
Then to show that Iγ(κn)
is κn-Knaster in V[G>κn] it suffices to show that it satisfies this property in
V[(G>κn∗H˙>κn)×Kn]. But (Iγ(>κn)∗T˙(>κn))×Col(κn,δ)≃Col(κn,δ) is
<κn-directed closed and therefore κn is supercompact (and in particular weakly compact)
in V[(G>κn∗H˙>κn)×Kn]. Thus Iγ(κn)
is κn-Knaster in this generic extension by Lemma 13 from the proof
of Theorem 10.
More precisely, we apply Lemma 13 to the pair
Iγ(κn), I˙γ(<κn).
Note that in order to do so we must have that this pair is suitable (with regard to sufficiently closed
elementary substructures of H(θ)) in the sense of Definition 8.
But part (1) of this definition follows from the inductive hypothesis of the current lemma and
part (2) follows from Lemma 9 in conjunction with the inductive hypothesis.
For the “moreover” part of the lemma, use the remark after the proof of Lemma 13
rather than Lemma 13 itself.
Finally, for the second part of the lemma, recall that by the inductive hypothesis we have
[TABLE]
Since G>κn−1=G>κn∗G˙κn,
Iγ(<κn)≃Iγ(κn−1)∗I˙γ(<κn−1), and
V[G>κn−1]⊨ “I˙γ(κn−1) is κn−1-Knaster”
by the inductive hypothesis, we have
[TABLE]
as desired.
∎
Now Theorem 25 follows immediately from
Lemmas 26 and 27.
∎
Finally we may use an Easton-support iteration of the ω-block posets given by Theorem 25
exactly as in [2] to obtain a global result:
Theorem 28**.**
Assume that there are class many supercompact cardinals with no inaccessible limit.
Then there is a class forcing extension of V in which □κ,2+SATP(κ+) holds for all regular κ.
Bibliography10
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Saharon Shelah and Lee Stanley. Weakly compact cardinals and nonspecial Aronszajn trees. Proc. Amer. Math. Soc. , 104(3):887–897, 1988.
2[2] Mohammad Golshani and Yair Hayut. Special aronszajn tree property, 2016.
3[3] J. Baumgartner, J. Malitz, and W. Reinhardt. Embedding trees in the rationals. Proc. Nat. Acad. Sci. U.S.A. , 67:1748–1753, 1970.
4[4] Richard Laver and Saharon Shelah. The ℵ 2 subscript ℵ 2 \aleph_{2} -Souslin hypothesis. Trans. Amer. Math. Soc. , 264(2):411–417, 1981.
5[5] R. Björn Jensen. The fine structure of the constructible hierarchy. Ann. Math. Logic , 4:229–308; erratum, ibid. 4 (1972), 443, 1972. With a section by Jack Silver.
6[6] Ernest Schimmerling. Combinatorial principles in the core model for one Woodin cardinal. Ann. Pure Appl. Logic , 74(2):153–201, 1995.
7[7] James Cummings and Ernest Schimmerling. Indexed squares. Israel J. Math. , 131:61–99, 2002.