Martin’s Maximum and the Diagonal Reflection Principle111
This research is supported by Simons Foundation Grant 318467 and JSPS Kakenhi Grant Number 18K03397.
Sean D. Cox (Virginia Commonwealth University)
Hiroshi Sakai (Kobe University)
Abstract
We prove that Martin’s Maximum does not imply
the Diagonal Reflection Principle for stationary subsets of [ω2]ω.
1 Introduction
In Foreman-Magidor-Shelah [5], it was shown that Martin’s Maximum MM
implies the following stationary reflection principle,
which is called the Weak Reflection Principle:
- WRP≡
For any cardinal λ≥ω2 and any stationary X⊆[λ]ω,
there is R∈[λ]ω1 with R⊇ω1 such that
X∩[R]ω is stationary in [R]ω.
WRP is known to have many interesting cosequences such as
Chang’s Conjecture (Foreman-Magidor-Shelah [5]),
the presaturation of the non-stationary ideal over ω1 (Feng-Magidor [4]),
2ω≤ω2 (folklore) and
the Singular Cardinal Hypothesis (Shelah [12]).
As for stationary reflection principles, simultaneous reflection is often discussed.
Larson [10] proved that MM also implies the following simultaneous reflection principle
of ω1-many stationary sets:
- WRPω1≡
For any cardinal λ≥ω2 and any sequence ⟨Xξ∣ξ<ω1⟩
of stationary subsets of [λ]ω,
there is R∈[λ]ω1 with R⊇ω1 such that
Xξ∩[R]ω is stationary in [R]ω for all ξ<ω1.
Cox [2] formulated the following strengthening of WRPω1,
which is called the Diagonal Reflection Principle:
- DRP≡
For any cardinal λ≥ω2 and any sequence ⟨Xα∣α<λ⟩
of stationary subsets of [λ]ω,
there is R∈[λ]ω1 with R⊇ω1 such that
Xα∩[R]ω is stationary in [R]ω for all α∈R.
Recently, Fuchino-Ottenbreit-Sakai [6] proved that
a variation of DRP is equivalent to some variation of the downward Löwenheim-Skolem theorem
of the stationary logic.
Cox [2] also introduced the following weakning of DRP,
where X⊆[λ]ω is said to be projectively stationary if
the set {x∈X∣x∩ω1∈S} is stationary in [λ]ω
for any stationary S⊆ω1:
- wDRP≡
For any cardinal λ≥ω2 and any sequence ⟨Xα∣α<λ⟩
of projectively stationary subsets of [λ]ω,
there is R⊆[λ]ω1 with R⊇ω1 such that
Xα∩[R]ω is stationary in [R]ω for all α∈R.
Cox [2] proved that MM implies wDRP,
but it remained open whether MM implies DRP.
In this paper, we prove that MM does not imply DRP.
In fact, we prove slightly more.
To state our result, we recall +-versions of the forcing axiom.
For a class Γ of forcing notions and a cardinal μ≤ω1,
MA+μ(Γ) is the following statement:
- MA+μ(Γ)≡
For any P∈Γ, any sequence ⟨Dξ∣ξ<ω1⟩
of dense subsets of P and any sequence ⟨S˙η∣η<μ⟩ of
P-names of stationary subsets of ω1, there is a filter g⊆P
such that
- (i)
g∩Dξ=∅ for any ξ<ω1,
2. (ii)
S˙ηg={α<ω1∣∃p∈g, p⊩P“α∈S˙η”}
is stationary in ω1 for all η<μ.
Let MA+μ(σ\mbox−closed) denote MA+μ(Γ) for
the class Γ of all σ-closed forcing notions.
Also, let MM+μ denote MA+μ(Γ) for the class Γ
of all ω1-stationary preserving forcing notions.
It is well-known that MA+ω1(σ\mbox−closed) holds if a supercompact
cardinal is Lévy collapsed to ω2 and that MM+ω1 holds
in the standard model of MM constructed in Foreman-Magidor-Shelah [5].
Cox [2] proved that MA+ω1(σ\mbox−closed) implies
DRP. So MM+ω1 implies DRP.
In this paper, we prove that MM+ω does not imply DRP:
Main Theorem**.**
Assume MM+ω holds.
Then there is a forcing extension in which MM+ω remains to hold,
but DRP fails at [ω2]ω.
Our proof of the Main Theorem is based on the proof of the classical result, due to Beaudoin [1] and
Magidor, that the Proper Forcing Axiom does not imply the reflection of
stationary subsets of the set {α∈ω2∣cof(α)=ω}.
Similar arguments are used in König-Yoshinobu [8], Yoshinobu [13], [14]
and Cox [3], to separate reflection principles from strong forcing axioms.
We will prove the Main Theorem in Section 3.
In Section 2, we will present our notation and basic facts
used in this paper.
2 Preliminaries
Here we present our notation and basic facts.
See Jech [7] for those which are not mentioned here.
First, we recall the notion of stationary sets in [W]ω.
Let W be a set with ω1⊆W.
Z⊆[W]ω is said to be club in [W]ω
if Z is ⊆-cofinal in [W]ω,
and ⋃n∈ωxn∈Z for any ⊆-increasing sequence
⟨xn∣n<ω⟩ of elements of Z.
X⊆[W]ω is said to be stationary in [W]ω
if X∩Z=∅ for any club Z⊆[W]ω.
For S⊆ω1,
S is stationary in ω1 in the usual sense
if and only if S is stationary in [ω1]ω in the above sense.
We will use the following standard facts without any reference.
Proofs can be found also in Jech [7].
Fact 2.1** ((1) Kueker [9], (2) Menas [11]).**
Suppose W is a set ⊇ω1 and X is a subset of [W]ω.
- (1)
X* is stationary if and only if for any function F:[W]<ω→W
there is a non-empty x∈X which is closed under F, i.e. F(a)∈x for all a∈[x]<ω.*
2. (2)
Suppose W′⊇W. Then X is stationary in [W]ω if and only if
the set {x′∈[W′]ω∣x′∩W∈X} is stationary in [W′]ω.
Here we slightly simplify DRP at [ω2]ω.
Lemma 2.2**.**
Assume DRP at [ω2]ω.
Then, for any sequence ⟨Xα∣α<ω2⟩ of
stationary subsets of [ω2]ω, there is δ∈ω2∖ω1
such that Xα∩[δ]ω is stationary in [δ]ω
for all α<δ.
Proof.
Suppose ⟨Xα∣α<ω2⟩ is a sequence of stationary
subsets of [ω2]ω. We find δ as in the lemma.
For each β<ω2, take a surjection πβ:ω1→β.
Let Z be the set of all x∈[ω2]ω such that
x∩ω1∈ω1 and x is closed under πβ for all β∈x.
Then, Z is club in [ω2]ω.
Moreover, it is easy to see that if ω1⊆R∈[ω2]ω1,
and Z∩[R]ω is ⊆-cofinal in [R]ω,
then R∈ω2∖ω1.
By shrinking X0 if necessary, we may assume that X0⊆Z.
By DRP at [ω2]ω,
take R∈[ω2]ω1 including ω1
such that Xα∩[R]ω is stationary for all α∈R.
Then, R∈ω2∖ω1 since Z∩[R]ω is ⊆-cofinal
in [R]ω. So, δ:=R is as desired.
∎
Next, we present our notation and basic facts about forcing.
Suppose P is a forcing notion and M is a set.
We say that g⊆P∩M is M-generic if
g∩D=∅ for any dense D⊆P with D∈M.
We will use the following well-known fact about forcing axioms:
Fact 2.3** (Woodin [15]).**
Let Γ be a class of forcing notions and μ be a cardinal ≤ω1,
and assume MA+μ(Γ) holds.
Suppose P∈Γ and ⟨T˙ξ∣ξ<μ⟩
is a sequence of P-names for stationary subsets of ω1.
Then, for any regular cardinal θ
with P∈Hθ and any A∈[Hθ]ω1,
there are M∈[Hθ]ω1 and g⊆P∩M
with the following properties.
- (i)
A⊆M≺⟨Hθ,∈⟩.
2. (ii)
g* is an M-generic filter on P∩M.*
3. (iii)
T˙ξg* is stationary in ω1 for any ξ<μ.*
We will also use forcing notions for shooting club sets.
For an ordinal λ≥ω1 and a subset X of [λ]ω,
let R(X) denote the poset of all ⊆-increasing continuous
function from some countable successor ordinal to X,
which is ordered by reverse inclusions.
The following is standard:
Lemma 2.4**.**
Suppose X is a stationary subset of [λ]ω for some ordinal
λ≥ω1.
- (1)
A forcing extension by R(X) adds no new countable sequences of ordinals.
So it preserves ω1.
2. (2)
In VR(X), X contains a club subset of [λ]ω.
3. (3)
In V, suppose Y⊆X and Y is stationary in [λ]ω.
Then Y remains stationary in VR(X).
Proof.
Let R denote R(X).
Before starting, note that the set
{r∈R∣∃ξ∈dom(r), r(ξ)⊇x}
is dense in R for any x∈[λ]ω,
since X is ⊆-cofinal in [λ]ω.
First, we prove (1) and (3). We work in V.
Suppose r∈R, D is a countable family of dense open subsets of R
and F˙ is an R-name for a function from [λ]<ω to λ.
It suffices to find r∗≤r and y∈Y such that
r∗∈⋂D and r∗ forces y to be closed under F˙.
Take a sufficiently large regular cardinal θ.
Since Y is stationary, there is a countable M≺⟨Hθ,∈⟩
such that {λ,X,r,F˙}∪D⊆M and
y:=M∩λ∈Y.
Then, we can construct a descending sequence
⟨rn∣n<ω⟩ in R∩M such that
r0=r and {rn∣n<ω} is M-generic.
Note that any lower bound of {rn∣n<ω} forces y to be closed
under F˙ by the M-genericity of {rn∣n<ω}.
Let r′:=⋃n<ωrn and ζ:=dom(r′).
Then, using the fact mentioned at the beginning,
it is easy to check that ζ is a limit ordinal and
⋃ξ<ζr′(ξ)=y.
Let r∗ be an extension of r′ such that
dom(r∗)=ζ+1 and r∗(ζ)=y.
Then r∗∈R, and r∗ is a lower bound of {rn∣n<ω}.
So r∗ and y are as desired.
Next, we check (2). By (1), the definition of R and the fact mentioned at the beginning,
if G is an R-generic filter over V, then range(⋃G)
is a club subset of [λ]ω consisting of elements of X.
So (2) holds.
∎
3 Proof of Main Theorem
Here we prove the Main Theorem.
Throughout this section, assume that MM+ω holds in the ground model V.
We construct a forcing notion which preserves MM+ω
and adds a counter-example ⟨Xα∣α<ω2⟩ of the consequence
of Lemma 2.2.
Here recall that MM implies wDRP.
So we must arrange our forcing notion so that each Xα is not projectively stationary.
For some technical reason, we also make ⟨Xα∣α<ω2⟩
pairwise disjoint.
Recall the fact, due to Foreman-Magidor-Shelah [5], that MM implies
2ω1=ω2. In V, fix an enumeration ⟨Sα∣α<ω2⟩
of all stationary subsets of ω1.
Let P be the following forcing notion:
P consists of all functions p such that
- (i)
p:δp×[δp]ω→2 for some δp<ω2,
2. (ii)
for any α<δp,
Xp,α:={x∈[δp]ω∣p(α,x)=1}
has size ≤ω1,
3. (iii)
x∩ω1∈Sα for any α<δp and any x∈Xp,α,
4. (iv)
Xp,α∩Xp,β=∅ for any distinct α,β<δp,
5. (v)
for any δ∈δp+1∖ω1, there is α<δ with
Xp,α∩[δ]ω non-stationary in [δ]ω.
p≤p′ in P if p⊇p′.
We observe basic properties of P.
Note that a forcing extension by P preserves all cardinals by (1) and (3) of the
following lemma.
Lemma 3.1**.**
- (1)
∣P∣=ω2.
2. (2)
P* is σ-closed.*
3. (3)
A forcing extension by P adds no new sequences of ordinals of length ω1.
4. (4)
For any p∈P and any δ<ω2, there is p′≤p with
δ≤δp′.
Proof.
(1) This is clear from the definition of P, especially the property (ii) of its conditions,
and the fact that 2ω1=ω2 in V.
(4) Suppose p∈P and δ<ω2.
We may assume δp≤δ.
Let p′:δ×[δ]ω→2 be an extension of p′ such that
p′(α,x)=0 for all ⟨α,x⟩∈/δp×[δp]ω.
It suffices to prove that p′∈P. We only check that p′
satisfies the property (v) of conditions of P. The other properties are easily checked.
Take an arbitrary γ∈δ+1∖ω1.
We find α<δ with Xp′,α∩[γ]ω is non-stationary.
If γ≤δp, then we can find such α since
p∈P and p⊆p′.
Suppose γ>δp. Then Z:=[γ]ω∖[δp]ω is
club in [γ]ω, and Xp′,α∩Z=∅ for any α<γ.
So any α<γ is as desired in this case.
(2) Suppose ⟨pn∣n<ω⟩ is a descending sequence in P.
We find a lower bound p∗ of {pn∣n<ω} in P.
We may assume that ⟨pn∣n<ω⟩ is not eventually constant.
Let δn:=δpn for each n<ω.
Let δ∗:=⋃n<ωδn,
and let p∗:δ∗×[δ∗]ω→2 be an extension of
⋃n∈ωpn such that
p∗(α,x)=0 for all α<δ∗ and
all x∈[δ∗]ω∖⋃n∈ω[δn]ω.
Note that Xp∗,α is non-stationary in [δ∗]ω for any α<δ∗
since Z:=[δ∗]ω∖⋃n<ω[δn]ω
is club in [δ∗]ω and Xp∗,α∩Z=∅.
Then it is easy to see that p∗ is as desired.
(3) Suppose p∈P and ⟨Dξ∣ξ<ω1⟩
is a sequence of dense open subsets of P.
It suffices to find p∗≤p with p∗∈⋂ξ<ω1Dξ.
We recursively construct a strictly descending sequence ⟨pξ∣ξ<ω1⟩
in P as follows. For each ξ<ω1, we let δξ denote
δpξ. First, let p0:=p.
If pξ has been taken, then take pξ+1<pξ with pξ+1∈Dξ.
Suppose ξ is a limit ordinal <ω1 and ⟨pη∣η<ξ⟩
has been constructed. Then define pξ as in the proof of (2). That is,
let δξ:=⋃η<ξδη, and let
pξ:δξ×[δξ]ω→2 be an extension of
⋃η<ξpη such that
pξ(α,x)=0 for all α<δξ and all
x∈[δξ]ω∖⋃η<ξ[δη]ω.
Then pξ is a lower bound of {pη∣η<ξ} in P.
We have constructed ⟨pξ∣ξ<ω1⟩.
Let δ∗:=supξ<ω1δξ and p∗:=⋃ξ<ω1pξ.
Here note that [δ∗]ω=⋃ξ<ω1[δξ]ω.
So p∗:δ∗×[δ∗]ω→2.
Note also that Xp∗,0 is non-stationary in [δ∗]ω
since
[TABLE]
is club in [δ∗]ω and that Xp∗,0∩Z=∅
by the construction of pξ for a limit ξ<ω1.
Then, it is easy to check that p∗ is as desired.
∎
Let G˙ be the canonical P-name for a P-generic filter.
For α<ω2, let X˙α be the P-name
for the set
[TABLE]
Lemma 3.2**.**
For each α<ω2,
X˙α is stationary in [ω2]ω in VP.
Proof.
We work in V.
Take an arbitrary α<ω2.
Suppose p∈P and F˙ is a P-name for a function
from [ω2]<ω to ω2.
It suffices to find p∗≤p and x∈[ω2]<ω such that
p^{*}\Vdash_{\mathbb{P}}\textrm{``}\,x\in\dot{X}_{\alpha}\wedge\mbox{xisclosedunder\dot{F}}\,\textrm{''}.
Take a sufficiently large regular cardinal θ
and a countable M≺⟨Hθ,∈⟩
such that α,P,p,F˙∈M and M∩ω1=α.
Let x:=M∩ω2.
We can take a descending sequence ⟨pn∣n<ω⟩
in P∩M such that p0=p and {pn∣n<ω} is M-generic.
Note that any lower bound of {pn∣n<ω} forces x to be closed under F˙
by the M-genericity.
For each n<ω, let δn:=δpn.
Note that δn∈M∩ω2 for each n<ω and that
δ∗:=supn<ωδn=sup(M∩ω2) by Lemma 3.1 (4).
Let p∗:δ∗×[δ∗]ω→2
be an extension of ⋃n<ωpn such that
p∗(α,x)=1 and p∗(β,y)=0 for any β<δ∗ and
any y∈[δ∗]ω∖⋃n<ω[δn]ω
with ⟨β,y⟩=⟨α,x⟩.
Then, it is easy to check that p∗ and x are as desired.
∎
The following is immediate
from Lemma 2.2, 3.1, 3.2
and the property (v) of conditions of P:
Corollary 3.3**.**
DRP* at ω2 fails in VP.*
We must show that P preserves MM+ω.
The following lemma is a key:
Lemma 3.4**.**
Let Q˙ be a P-name for an ω1-stationary preserving
forcing notion and ⟨T˙n∣n<ω⟩ be a sequence
of P∗Q˙-names for stationary subsets of ω1.
Then there is a P∗Q˙-name γ˙ of an ordinal <ω2V
such that if we let
[TABLE]
then all elements of {Sα∣α<ω2V}∪{T˙n∣n<ω}
remain stationary in VS.
Proof.
Let λ:=ω2V.
Suppose G∗H is a P∗Q˙-generic filter over V.
In V[G∗H], let Xα:=X˙αG for α<λ
and Tn:=T˙nG∗H for n<ω.
Moreover, let Rα denote R([λ]ω∖Xα)
for α<λ.
In V[G∗H], we find γ<λ such that
Rγ forces
all elements of {Sα∣α<λ}∪{Tn∣n<ω}
stationary.
Here note that all Sα and Tn are stationary in V[G∗H]
by the fact that P∗Q˙ is ω1-stationary preserving
and the assumption on ⟨T˙n∣n<ω⟩.
We work in V[G∗H].
For S⊆ω1, let
Sˉ:={x∈[λ]ω∣x∩ω1∈S}.
For X,Y⊆[λ]ω, we write X⊆∗Y if
X∖Y is non-stationary in [λ]ω.
By Lemma 2.4, for S⊆ω1 and α<λ,
Rα does not force S⊆ω1 stationary if and only if
Sˉ⊆∗Xα.
Since ⟨Xα∣α<λ⟩ is pairwise disjoint,
for each n<ω there is at most one α<λ with Tˉn⊆∗Xα.
Since ∣λ∣≥ω1, we can take β<λ such that
Tˉn⊆∗Xβ for any n<ω.
Then Rβ forces Tn stationary for all n<ω.
Thus, if Rβ also forces Sα stationary for all α<λ,
then γ:=β is as desired.
Assume there is α<λ such that Rβ does not force Sα
stationary. By replacing α with α′ such that Sα′⊆Sα
if necessary, we may assume that α=β.
Here note that Xα⊆Sˉα by the property (iii) of conditions of P.
Then, Xα⊆Sˉα⊆∗Xβ
and Xα∩Xβ=∅. Hence Xα is non-stationary
in [λ]ω. Thus Rα is ω1-stationary preserving,
and so γ:=α is as desired.
∎
Now, we can prove that P preserves MM+ω
by a similar argument as Beaudoin [1]:
Lemma 3.5**.**
MM+ω* holds in VP.*
Proof.
Let Q˙ be a P-name for an ω1-stationary preserving
foricng notion.
For each ξ<ω1, let D˙ξ be a P-name
for a dense subset of Q˙, and for each n<ω, let
T¨n be a P-name for a Q˙-name for a stationary subset of ω1.
Take an arbitrary p0∈P.
It suffices to find p∗≤p0 in P such that
if G is a P-generic filter over V with p∗∈G,
then in V[G] there is a filter h⊆Q with the following properties:
- (i)
h∩Dξ=∅ for any ξ<ω1.
2. (ii)
T˙nh is stationary in ω1 for all n<ω.
Here Q, Dξ and T˙n denote
Q˙G, D˙ξG and T¨nG, respectively.
First, we find p∗ as above. We work in V.
We identify each T¨n with a P∗Q˙-name.
Let γ˙ and S be as in Lemma 3.4.
Note that S is ω1-stationary preserving
and each T¨n is stationary in ω1 in VS.
Let R˙ be a P∗Q˙-name for
R([ω2V]ω∖X˙γ˙).
Take a sufficiently large regular cardinal θ.
By Fact 2.3, there are M∈[Hθ]ω1
and k⊆S∩M such that
- (iii)
ω1∪{p0,Q˙,γ˙,S}∪{D˙ξ∣ξ<ω1}∪{T¨n∣n<ω}⊆M≺⟨Hθ,∈⟩,
2. (iv)
k is an M-generic filter on S∩M
with p0∗1Q˙∗1R˙∈k,
3. (v)
T¨nk is stationary in ω1 for any ξ<μ.
Let δ∗:=M∩ω2∈ω2, and let
[TABLE]
Then, g is an M-generic filter on P∩M.
Note that supp∈gδp=δ∗
by Lemma 3.1 (4) and the M-genericity of g0.
Let p∗:δ∗×[δ∗]ω→2 be an extension of ⋃g
such that p∗(α,x)=0 for all ⟨α,x⟩∈/dom(⋃g).
We claim that p∗ is as desired.
For this, we use the transitive collapse of M.
First, we make some preliminaries on it.
Let π:M→M′ be the transitive collapse of M, and let
P′, Q˙′, R˙′, S′, k′ and g′ be
π(P), π(Q˙), π(R˙), π(S), π[k]
and π[g], respectively.
Note that S′=P′∗Q˙′∗R˙′ in M′.
Moreover, k′ is an S′-generic filter over M′, and
g′ is the P′-generic filter over M′ naturally obtained from k′.
Let h′ be the (Q˙′)g′-generic filter over M′[g′]
naturally obtained from k′, and let i′ be the (R˙′)g′∗h′-generic
filter over M′[g′∗h′] naturally obtained from k′.
Now, we start to prove that p∗ is as desired.
First, we prove that p∗∈P.
We only check that Xp∗,γ is non-stationary in [δ∗]ω
for some γ<δ∗. The other properties are easily checked.
First of all, note that π↾(Hω2∩M) is the identity map since
Hω2∩M is transitive and that π(ω2)=δ∗.
Let γ:=π(γ˙)g′∗h′<π(ω2)=δ∗.
Then range(⋃i′) is a club subset of [δ∗]ω
which does not intersect ⋃p′∈g′Xp′,γ=⋃p∈gπ(Xp,γ).
Here note that Xp,γ∈Hω2∩M for all p∈g
by the property (ii) of conditions in P.
So ⋃p∈gπ(Xp,γ)=⋃p∈gXp,γ=Xp∗,γ.
Hence Xp∗,γ is non-stationary in [δ∗]ω
We have shown that p∗∈P.
Note that p∗ is a lower bound of g. Then p∗≤p since p∈g by (iv).
Suppose G is a P-generic filter over V with p∗∈G.
Working in V[G], we find a filter h⊆Q satisfying (i) and (ii).
Let M[G] denote the collection of a˙G for all P-names a˙∈M,
and define π^:M[G]→M′[g′] by π^(a˙G):=π(a˙)g′.
It is easy to see that π^ coincides with the transitive collapse of M[G]
and that π^ extends π.
Let h be the filter on Q generated by π^−1[h′].
Then h satisfies (i) since Dξ∈M[G] and h′∩π^(Dξ)=∅
for all ξ<ω1.
As for (ii), it is easy to see that T˙nh=T¨nk for each n<ω.
Then, h satisfies (ii) by (v).
∎