Changing measurable into small accessible cardinals
Mohammad Golshani
Abstract.
We give a detailed proof of the properties of the usual Prikry type forcing notion for turning a measurable cardinal into ℵω.
The author’s research has been supported by a grant from IPM (No. 97030417).
1. introduction
In this short note, we present a proof of the following known result.
Theorem 1.1**.**
Assume GCH holds and κ is a measurable cardinal. Then there exists a generic extension in which κ=ℵω.
We try to give the details as much as possible to make it accessible to general audience who has some familiarity with forcing and large cardinals (see [1] for preliminaries).
2. Proof of Theorem 1.1
Suppose that GCH holds and κ is a measurable cardinal. Let U be a normal measure on κ. Let also j:V→M≃Ult(V,)
be the corresponding ultrapower embedding.
Lemma 2.1**.**
There exists H∈V which a Col(κ++,<j(κ))M-generic filter over M.
Proof.
We have
- (1)
V⊨“Col(κ++,<j(κ))M is κ+-closed”
2. (2)
V⊨“∣{A∈M:A is a maximal antichain in Col(κ++,<j(κ))M}∣≤κ+”.
Thus we can easily find the required H.
∎
We are now ready to define our main forcing construction.
Definition 2.2**.**
A condition in P is of the form
[TABLE]
where
- (1)
n<ω.
2. (2)
δ0<⋯<δn−1.
3. (3)
For i<n−1,fi∈Col(δi++,<δi+1).
4. (4)
fn−1∈Col(δn−1++,<κ).
5. (5)
A∈U,* and min(A)>δn−1.*
6. (6)
F* is a function with dom(F)=A.*
7. (7)
For every δ∈A,F(δ)∈Col(δ++,<κ).
8. (8)
[F]U∈H.**
Given a condition p∈P, we denote it by
[TABLE]
We also set
stem(p)=(δ0p,f0p…,δnp−1p,fnp−1p), the stem of p.
u(p)=(Ap,Fp), the upper part of p.
Definition 2.3**.**
Suppose p,q∈P.
p* is an extension of q, p≤q, iff*
- (1)
np≥nq.
2. (2)
For all i<nq,δip=δiq.
3. (3)
For nq≤i<np,δip∈Aq.
4. (4)
For i<nq,fip≤fiq.
5. (5)
For nq≤i<np,fip≤Fq(δip).
6. (6)
Ap⊆Aq.**
7. (7)
For each δ∈Ap,Fp(δ)≤Fq(δ).
p* is a direct extension of q, p≤∗q, iff*
- (1)
p≤q.**
2. (2)
np=nq.
We start by proving the basic properties of the forcing notion P.
Lemma 2.4**.**
(P,≤)* satisfies the κ+-c.c.*
Proof.
Let A⊆P be of size κ+. Then, as
[TABLE]
has size κ, we can find p,q∈A such that stem(p)=stem(q).
We claim that p an q are compatible.
Since [Fp]U,[Fq]U∈H, we can find [F]U∈H
such that [F]U≤[Fp]U,[Fq]U.
Thus
[TABLE]
Set A=A∗∩Ap∩Aq∈U.
Then
[TABLE]
and it extends both of p and q.
∎
Lemma 2.5**.**
Suppose p∈P and m<np. Then
[TABLE]
where
p≥m=(δmp,fmp,…,δnp−1p,fnp−1p,Ap,Fp). Further,
(P/p≥m,≤∗) is δm++-closed.
We now show that the forcing notion (P,≤,≤∗)
satisfies the Prikry property.
Lemma 2.6**.**
Suppose q∈P and ϕ is a statement of the forcing language of (P,≤). Then there exists p≤∗q
which decides ϕ.
Proof.
We assume for simplicity that nq=0 and f0q=∅.
We write q as q=(Aq,Fq).
The proof has four main steps.
Claim 2.7**.**
(Reduction to stems) There exists q1=(A1,F1)≤∗q such that for any stem s,
[TABLE]
Proof.
For each stem s, if there exists s⌢(A,F)≤(Aq,Fq)
which decides ϕ, then let (As,Fs)=(A,F)
and otherwise set (As,Fs)=(Aq,Fq).
Then {[Fs]U:s is a stem}⊆H,
and hence, we can find [F1]U∈H which extends all of them.
For each stem s, set
[TABLE]
Let also
[TABLE]
We show that q1=(A1,F1) is as required. Thus suppose that s is a stem and suppose there exists
s⌢(A,F)≤(A1,F1) which decides ϕ.
It then follows that s⌢(As,Fs) decides ϕ. But, by our construction,
[TABLE]
and hence s⌢(A1,F1) decides ϕ as well.
∎
Let q1=(A1,F1)
be as in Claim 2.7.
Claim 2.8**.**
(Reduction to stem minus top element)
There exists q2=(A2,F2)≤∗q1 such that for any stem s=(δ0,f0,…,δn−1,fn−1), if
s⌢(δn,fn)⌢(A,F)≤(A2,F2) and
[TABLE]
then
[TABLE]
Proof.
Let D be the set of all conditions f∈Col(κ++,<j(κ))M such that for any stem s∈Vκ, if there exists g∈Col(κ++,<j(κ))M such that
[TABLE]
then
[TABLE]
We claim that D⊆Col(κ++,<j(κ))M is dense. Thus suppose that g∈Col(κ++,<j(κ))M.
Let (sα:α<κ) enumerate all stems s∈Vκ, and define a decreasing sequence (fα:α≤κ) of
conditions in Col(κ++,<j(κ))M, such that f0=g and for any α<κ,
[TABLE]
Then f=fκ∈D and it extends g.
Let f=[F2]U. We may assume that [F2]U≤[F1]U, and hence
A∗={δ<κ:F2(δ)≤F1(δ)}∈U.
For any stem s=(δ0,f0,…,δn−1,fn−1), we have As∈U, where
As consists of those
δn∈A1 such that if there exists s⌢(δn,fn)⌢(A,F)≤s⌢(A1,F1) which decides ϕ,
then
[TABLE]
Let
[TABLE]
Then q2=(A2,F2) is easily seen to be as requested.
∎
Claim 2.9**.**
(One point extension uniformization)
There exists q3=(A3,F3)≤∗q2 such that for any stem s, if
s⌢(δn,fn)⌢(A,F)≤(A3,F3) and
[TABLE]
then for all δ∈A3,
[TABLE]
Proof.
Let s be a stem. Set
A0s={δ∈A2:s⌢(δ,F2(δ))⌢(A2,F2)⊩ ϕ}.
A1s={δ∈A2:s⌢(δ,F2(δ))⌢(A2,F2)⊩ ¬ϕ}.
A2s={δ∈A2:s⌢(δ,F2(δ))⌢(A2,F2)∦ϕ}.
Let is<3 be such that As=Aiss∈U. Let A3=△sAs∈U,
and set F3=F2↾A3.
We show that q3=(A3,F3) is as required. Thus suppose that s⌢(δn,fn)⌢(A,F)≤(A3,F3) and
s⌢(δn,fn)⌢(A,F)∥ϕ. Let us suppose that it forces ϕ.
Then δn∈A0s,
and hence for all δ∈A3 such that s⌢(δ,F3(δ))⌢(A3,F3)
is a condition, we have
δ∈A0s, and hence s⌢(δ,F2(δ))⌢(A2,F2)⊩ ϕ. It follows that
[TABLE]
∎
Claim 2.10**.**
(Minimal extension counterexample)
There exists q4=(A4,F4)≤∗q3 which decides ϕ.
Proof.
Suppose not. Let p≤q3≤ decide ϕ, such that np is minimal. By our assumption, np>0
and hence we can write p as
[TABLE]
By Claim 2.9
[TABLE]
Note that if p∗≤s⌢(A3,F3) and np∗>np−1, then for some δ∈A3,p∗≤s⌢(δ,F3(δ))⌢(A3,F3),
and hence
[TABLE]
This is in contradiction with the minimal choice of np.
∎
The lemma follows.
∎
Let G be P-generic over V. Let C=(δn:n<ω) be the added Prikry sequence and for each n<ω
set Gn⊆Col(δn++,<δn+1) be the generic filter added by G.
Lemma 2.11**.**
Suppose A∈V[G] and A⊆δn+. Then A∈V[∏i<nGi].
Proof.
Let p∈G be such that np>n. Let also \smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{A}}} be a P-name for A such that ⊩P“\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{A}}}\subseteq\delta_{n}^{+}”.
Let \smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{B}}} be a P/p≥n-name for a subset of ∏i<nCol(δi++,<δi+1)×δn+ such that
⊩P/p≥n“\forall\alpha<\delta_{n}^{+}[~{}(q,\alpha)\in\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{B}}})\iff q\Vdash_{\prod_{i<n}\operatorname{Col}(\delta_{i}^{++},<\delta_{i+1})}“\alpha\in\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{A}}}” ]”.
Let (xα:α≤δn+) be an enumeration of ∏i<nCol(δi++,<δi+1)×δn+. Define a ≤P∗-decreasing sequence (pα:α≤δn+)
of conditions in P/p≥n such that for each α<δn+,pα+1∥“x_{\alpha}\in\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{B}}}”. This is possible as
(P/p≥n,≤∗) is δn++-closed and satisfies the Prikry property. Then pδn+ decides each “x_{\alpha}\in\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{B}}}”, and so,
assuming pδn+∈G, we have
a={α<κ:∃q∈∏i<nGi,pδn+⊩“(q,\alpha)\in\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{B}}}”}∈V[∏i<nGi].
The result follows.
∎
The following is now immediate.
Lemma 2.12**.**
- Suppose λ<κ is a cardinal.
- (a)
V* and V[G] have the same bounded subsets of δ0.*
3. (b)
CardV[G]∩[δ0,κ)=⋃n<ω{δn,δn+,δn++}**
4. (c)
V[G]⊨“ κ=δ0+ω”.
Now forcing over V[G] by Col(ℵ0,<δ0),
we get a model in which κ becomes ℵω. This completes the proof of Theorem 1.1.