Adding a lot of random reals by adding a few
Moti Gitik and Mohammad Golshani
Abstract.
We study pairs (V,V1) of models of ZFC such that adding κ-many random reals over V1 adds λ-many random reals over V, for some
λ>κ.
The second author’s research has been supported by a grant from IPM (No. 96030417).
1. Introduction
In [1] and [2], we studied pairs (V,V1) of models of ZFC such that adding κ-many Cohen reals over V1 adds
λ-many Cohen reals over V, for some
λ>κ.
In this paper we prove similar results for random forcing, by producing pairs
(V,V1) of models of ZFC such that adding κ-many random reals over V1 adds
λ-many random reals over V, where by κ-random reals over V we mean a sequence ⟨ri:i<κ⟩
which is R(κ)-generic over V, and R(κ) is the usual forcing notion for adding κ-many random reals (see Section 2). The proofs are more involved than those
given in [1] and [2] for Cohen reals. This is because
random reals, in contrast to Cohen reals, may depend on ω-many coordinates, instead
of finitely many as in the Cohen case. Also the proofs in [1] and [2] were based on the fact that the product of Cohen forcing
with itself is essentially the same as Cohen forcing, while this is not true in the case of random forcing.
2. Random real forcing
In this section we briefly review random forcing and refer the reader to [3] for more details.
Suppose I is a non-empty set and consider the product measure space 2I×ω with the standard product measure μI on it. Let B(I) denote the class of Borel subsets of 2I×ω.
Note that the sets of the form
[TABLE]
where s:I×ω→2 is a finite partial function,
form a basis of open sets of 2I×ω.
For Borel sets S,T∈B(I) set
[TABLE]
where S△T denotes the symmetric difference of S and T. The relation ∼ is easily seen to be an equivalence relation
on B(I).
Then R(I), the forcing for adding ∣I∣-many random reals, is defined as
[TABLE]
Thus elements of R(I) are equivalence classes [S] of Borel sets modulo null sets. The order relation is defined by
[TABLE]
The following fact is standard.
Lemma 2.1**.**
R(I)* is c.c.c.*
Using the above lemma, we can easily show that R(I) is in fact a complete Boolean algebra.
Let \smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{F}}}
be an R(I)-name for a function from I×ω to 2 such that for each i∈I,n∈ω and k<2, \parallel\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{F}}}(i,n)=k\parallel_{{\mathbb{R}}(I)}=p_{k}^{i,n}, where
[TABLE]
This defines R(I)-names \smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{r}}}_{i}\in 2^{\omega},i\in I, such that
[TABLE]
Lemma 2.2**.**
Assume G is R(I)-generic over V and for each i∈I set r_{i}=\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{r}}}_{i}[G]. Then each ri∈2ω
is a new real and for i=j in I,ri=rj. Further, V[G]=V[⟨ri:i∈I⟩].
The reals ri are called random reals. By κ-random reals over V we mean a sequence ⟨ri:i<κ⟩
which is R(κ)-generic over V.
Given b=[T]∈R(I) and ∣I∣-random reals ⟨ri:i∈I⟩ over V, we say ⟨ri:i∈I⟩ extends b if
[TABLE]
This simply says that if i and n are given, then we can extend b to some
[TABLE]
such that
bˉ decides ri↾n. In fact, bˉ⊩“\forall m<n,~{}\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{r}}}_{i}(m)=x(i,m)”.
Note that if ⟨ri:i<κ⟩ is a sequence of ∣I∣-random reals generated by G, then
[TABLE]
The next lemma follows from Lemma 2.1.
Lemma 2.3**.**
The sequence ⟨ri:i<κ⟩ is R(κ)-generic over V iff for each countable set I⊆κ,I∈V,
the sequence ⟨ri:i∈I⟩ is R(I)-generic over V.
3. The first general fact about adding many random reals
In this section we prove the following theorem, which is an analogue of Theorem 2.1 from [1], and use it to get some consequences.
Theorem 3.1**.**
Let V1
be an extension of V. Suppose that in V1:
- (a)
κ<λ* are infinite cardinals,*
2. (b)
λ* is regular,*
3. (c)
there exists an increasing sequence ⟨κn:n<ω⟩ cofinal in κ. In particular cf(κ)=ω,
4. (d)
there exists an increasing (mod finite) sequence ⟨fα:α<λ⟩ of functions in the product n<ω∏(κn+1∖κn),
5. (e)
there exists a club C⊆λ
which avoids points of countable V-cofinality.
Then adding κ-many random reals over V1 produces λ-many random reals over V.
Proof.
There are two cases to consider: (1): λ=κ+
and (2): λ>κ+. We give a proof for the first case, as the second case can be proved similarly, using ideas from [1, Theorem 2.1] (combined with the proof of the first case given below).
We may assume, for clarity of exposition, that min(C)=0.
Thus assume that λ=κ+, and force to add
κ-many random reals over V1. We denote them by ⟨r,τ:,τ<κ⟩. Also let ⟨fα:α<κ+⟩∈V1 be an
increasing (mod finite) sequence in n<ω∏(κn+1∖κn). We define a sequence ⟨sα:α<κ+⟩
of reals as follows:
Assume α<κ+. Let α∗ and α∗∗ be two
consecutive points of C so that α∗≤α<α∗∗. Let ⟨α:<κ⟩ be some fixed enumeration of the interval
[α∗,α∗∗) with α0=α∗. Then for some <κ, α=α.
Let k()=min{k<ω:r,(k)=1}. Set
∀n<ω, sα(n)=rfα(k()+n),fα(k()+n)(0).
The following lemma completes the proof.
Lemma 3.2**.**
⟨sα:α<κ+⟩* is a sequence of κ+-many random
reals over V.*
Proof.
First, we may assume that ⟨r,τ:,τ<κ⟩ is R(κ×κ)-generic over V1.
By Lemma 2.3, it suffices to show that for any
countable set I⊆κ+, I∈V, the sequence ⟨sα:α∈I⟩ is R(I)-generic over V. Thus it suffices to prove
the following:
for every p∈R(κ×κ)
and every open dense subset D∈V
(∗) of R(I), there is
pˉ≤p such that \bar{p}\mbox{\rm|\kern-1.30005pt-}``\langle\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha}:\alpha\in I\rangle extends
some element of D”.
Let p and D be as above. For simplicity suppose that
p=1R(κ×κ)=[2(κ×κ)×ω]. By (e) there are only finitely many α∗∈C such that I∩[α∗,α∗∗)=∅, where
α∗∗=min(C∖(α∗+1)). For simplicity suppose that there are exactly two α1∗<α2∗ in C with this property. Let
n∗<ω be such that for all n≥n∗, fα1∗(n)<fα2∗(n).
Let b=[Tb]∈D, where Tb⊆2I×ω.
For j∈{1,2}, let {αjl:l<kj≤ω} be an
enumeration of I∩[αj∗,αj∗∗). For j∈{1,2} and
l<kj let αj,l=αjl where jl<κ is
the index of αj,l in the enumeration of the interval
[αj∗,αj∗∗) considered above.
For every j1,j2∈{1,2},l1<kj1,l2<kj2
and n1,n2<ω set
[TABLE]
Claim 3.3**.**
The set
Δ={(j1,j2,l1,l2,n1,n2):b≤c(j1,j2,l1,l2,n1,n2)}
is finite. Also, (j1,j2,l1,l2,n1,n2)∈Δ implies (j2,j1,l2,l1,n2,n1)∈Δ.
Proof.
Recall that b=[Tb]. By shrinking Tb if necessary, we can assume that Tb is closed.
Then 2I×ω∖Tb is open, so there are finite partial functions tk:I×ω→2 such that
2I×ω∖Tb=⋃k<ω[tk] and for k=l, [tk]∩[tl]=∅.
For each k set Ωk={t:dom(t)=dom(tk) and t=tk}. Then each Ωk is finite and 2I×ω∖[tk]=⋃t∈Ωk[t]. So
[TABLE]
Also, as μI(Tb)>0, we have
[TABLE]
Note that μI(Tb)=1−∑k<ω2−∣tk∣>0.
Fix an increasing sequence ⟨ηk:k<ω⟩ of natural numbers such that
(†) ∑k<ω2−ηk<1+μI(2I×ω∖Tb)1−μI(2I×ω∖Tb).
Assume, towards a contradiction, that the set Δ is infinite.
For each k<ω let Xk be a finite subset of Δ such that:
- (1)
(j1,j2,l1,l2,n1,n2)∈Xk⟹ at least one of (αj1,l1,n1)
or (αj2,l2,n2) is not in dom(tk).
2. (2)
The set
[TABLE]
has size 2ηk.
3. (3)
Xk’s, for k<ω, are pairwise disjoint.
Set
[TABLE]
For each t∈Ωk let
Λk,t={t′:Yk→2:t′⊇t and ∃(j1,j2,l1,l2,n1,n2)∈Xk,t′(αj1,l1,n1)=t′(αj2,l2,n2)}.
Note that each t′∈Λk,t is well-defined by clause (1)
above.
Let
[TABLE]
Then note that
2ηk=2ξk+ζk, where ξk is the number of those (j1,j2,l1,l2,n1,n2)∈Xk such that both
(αj1,l1,n1)
and (αj2,l2,n2) are not in dom(tk).
Set Tˉ=⋂k<ω(⋃t∈Ωk(⋃t′∈Λk,t[t′])).
Clearly, ∣Ωk∣=2∣tk∣−1, ∣Λk,t∣=22ηk−2ξk and for each t′∈Λk,t,∣t′∣=∣t∣+2ηk=∣tk∣+2ηk, and so
[TABLE]
It follows that
μI(2I×ω∖Tˉ)≤∑k<ω(1−(2∣tk∣−1)(22ηk−2ξk)2−(∣tk∣+2ηk))
=∑k<ω(2ξk−2ηk+2−∣tk∣−2ξk−∣tk∣−2ηk)
≤∑k<ω(2ξk−2ηk+2−∣tk∣+2ξk−∣tk∣−2ηk)
=∑k<ω2ξk−2ηk+∑k<ω2−∣tk∣+∑k<ω2ξk−∣tk∣−2ηk
≤∑k<ω2ηk−2ηk+∑k<ω2−∣tk∣+∑k<ω2ηk−∣tk∣−2ηk (as ξk≤ηk)
=∑k<ω2−∣tk∣+∑k<ω2−ηk+∑k<ω2−∣tk∣−ηk
≤∑k<ω2−∣tk∣+∑k<ω2−ηk+(∑k<ω2−∣tk∣)(∑k<ω2−ηk)
≤μI(2I×ω∖Tb)+∑k<ω2−ηk+μI(2I×ω∖Tb)(∑k<ω2−ηk)
<1 (by (†)).
Hence
[TABLE]
Set bˉ=[Tˉ],
Then bˉ∈R(I) and bˉ≤b. Also note that:
∀x∈Tˉ,∀k<ω,∃(j1,j2,l1,l2,n1,n2)∈Xk, x(αj1,l1,n1)=x(αj2,l2,n2).
Let S′ consists of those y∈2(κ×κ)×ω such that for some k<ω, some (j1,j2,l1,l2,n1,n2)∈Xk and
some
x∈Tˉ
- (1)
y(fαj1l1(n1),fαj1l1(n1),n1)=x(αj1l1,n1).
2. (2)
y(fαj2l2(n2),fαj2l2(n2),n2)=x(αj2l2,n2).
3. (3)
x(αj1l1,n1)=x(αj2l2,n2).
Clearly, μκ×κ(S′)>0.
For each y∈S′ let ky denote the least k as above. Similarly, let (j1y,j2y,l1y,l2y,n1y,n2y) denote the least (j1,j2,l1,l2,n1,n2)∈Xk as above (with respect to some fixed well-ordering of Δ).
For some kˉ<ω and (jˉ1,jˉ2,lˉ1,lˉ2,nˉ1,nˉ2)∈Xk, the set S′′={y∈S′:ky=kˉ and (j1y,j2y,l1y,l2y,n1y,n2y)=(jˉ1,jˉ2,lˉ1,lˉ2,nˉ1,nˉ2)} has positive measure.
Let
[TABLE]
Then \mu_{\kappa\times\kappa}(\bar{S})=$$1\over 4$$\mu_{\kappa\times\kappa}(S^{\prime\prime})>0 and if pˉ=[Sˉ], then pˉ∈R(κ×κ) and
[TABLE]
For each y∈Sˉ, if x (with kˉ and uˉ) is a witness as above, then
\bar{p}\Vdash~{}\text{``}\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha_{\bar{j}_{1},\bar{l}_{1}}}(\bar{n}_{1})=\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{r}}}_{f_{\alpha_{\bar{j}_{1},\bar{l}_{1}}}(\bar{n}_{1}),f_{\alpha_{\bar{j}_{1},\bar{l}_{1}}}(\bar{n}_{1})}(0)
=y(fαjˉ1,lˉ1(nˉ1),fαjˉ1,lˉ1(nˉ1),nˉ1)
=x(αjˉ1,lˉ1,nˉ1) (by (1))
=x(αjˉ2,lˉ2,nˉ2) (by (3))
=y(fαjˉ2,lˉ2(nˉ2),fαjˉ2,lˉ2(nˉ2),nˉ2) (by (2))
=\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{r}}}_{f_{\alpha_{\bar{j}_{2},\bar{l}_{2}}}(\bar{n}_{2}),f_{\alpha_{\bar{j}_{2},\bar{l}_{2}}}(\bar{n}_{2})}(0)
=\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha_{\bar{j}_{2},\bar{l}_{2}}}(\bar{n}_{2})\text{''}.
So \bar{b}\nleq\parallel\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha_{\bar{j}_{1},\bar{l}_{1}}}(\bar{n}_{1})\neq\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha_{\bar{j}_{2},\bar{l}_{2}}}(\bar{n}_{2})\parallel, and since
bˉ≤b, we have
[TABLE]
It follows that (jˉ1,jˉ2,lˉ1,lˉ2,nˉ1,nˉ2)∈/Δ,
which is a contradiction. The second part of the claim is evident and the claim follows.
∎
Say that (j,l) appears in Δ if (j,l)=(j1,l1) for some (j1,j2,l1,l2,n1,n2)∈Δ.
Also set
[TABLE]
Then ∣Λ∣≤2∣Δ∣ is finite.
Let m∗, with n∗≤m∗<ω, be
such that for all n≥m∗
all of the values
[TABLE]
are all different, where (j1,l1),(j2,l2)∈Λ.
Claim 3.4**.**
There exists p1≤p such that for all (j,l)∈Λ,
[TABLE]
Proof.
Let Sp1⊆2(κ×κ)×ω be defined by
[TABLE]
Then μκ×κ(Sp1)=2−∣Λ∣(m∗+1)>0, so
p1=[Sp1]∈R(κ×κ).
Further, for all (j,l)∈Λ and n<m∗,
p_{1}\Vdash``\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{r}}}_{\imath_{jl},\imath_{jl}}(n)=0”, p_{1}\Vdash``\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{r}}}_{\imath_{jl},\imath_{jl}}(m^{*})=1” and thus for (j,l)∈Λ,
[TABLE]
as required
∎
Before we continue, let us make an assumption on Tb. For each n<ω let Φn={(αjl,m):(j,l)∈Λ,m<n}⊆I×ω.
Then for a countable subset T′ of I×ω, {x↾Φn:x∈T′}=2Hn, for all n<ω. As [Tb]=[Tb∪T′],
let us assume without loss of generality that T′⊆Tb.
Set
J={fαjl(m∗+m):(j,l)∈Λ and m<ω}⊆κ.
Note that by our choice of m∗, for all m and all (j1,l1),(j2,l2)∈Λ, fαj1l1(m∗+m)=fαj2l2(m∗+m).
Set
Sˉ={y∈Sp1:∀n<ω,∃x∈Tb,∀(j,l)∈Λ,∀m<n
( y(fαjl(m∗+m),fαjl(m∗+m),m)=x(αjl,m) )}.
By the above remarks, Sˉ is well-defined.
We also have
Sˉ=⋂n<ωSn,
where
[TABLE]
Let
[TABLE]
and
[TABLE]
By our assumption, T′⊆Tb,∣Δn∣=2∣Wn∣, and hence, μκ×κ(⋃t∈Δn[t])=∑t∈Δn2∣t∣=2∣Wn∣2−∣Wn∣=1.
We have
Sn=Sp1∩⋃t∈Δn[t], so
μκ×κ(Sn)=μκ×κ(Sp1)+μκ×κ(⋃t∈Δn[t])−μκ×κ(Sp1∪⋃t∈Δn[t])=μκ×κ(Sp1).
It follows that
μκ×κ(Sp1∖S)=μκ×κ(⋃n<ω(Sp1∖Sn)≤∑n<ωμκ×κ(Sp1∖Sn)=0,
and so
μκ×κ(S)=μκ×κ(Sp1)>0.
Let pˉ=[Sˉ]. Then pˉ∈R(κ×κ) and pˉ≤p.
Claim 3.5**.**
pˉ⊩“\langle\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha_{jl}}:(j,l)\in\Lambda\rangle extends b”.
Proof.
Suppose (j,l)∈Λ and n<ω. Let y∈Sˉ. Thus
we can find x∈Tb such that
[TABLE]
But then
\bar{p}\Vdash~{}\text{``}\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha}(m)=\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha_{jl}}(m)
=\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{r}}}_{f_{\alpha_{jl}}(m^{*}+m),f_{\alpha_{jl}}(m^{*}+m)}(0)
=y(fαjl(m∗+m),fαjl(m∗+m),0)
=x(αjl,m)
=x(α,m)”.
The result follows.
∎
We now consider those (j,l)’s, j∈{1,2},l<kj, which do not appear in Δ. Fix such a pair (j,l). Also let n<ω. Then there
is (j1,l1)∈Λ such that for each m<n, b≰c(j,j1,l,l1,m,m),
i.e., b⊮“\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha_{j,l}}(m)\neq\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha_{j_{1},l_{1}}}(m)”.
So there exists bjln=[Tjln]≤b such that ∀m<n, bjln⊩“\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha_{j,l}}(m)=\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha_{j_{1},l_{1}}}(m)”.
Note that μI(Tjln∖Tb)=0. Since there are only countably many such tuples (j,l,n),
μI(⋃n<ω,(j,l)∈ΛTjln∖Tb)=0.
This implies [Tb]=[Tb∪⋃n<ω,(j,l)∈ΛTjln],
so without loss of generality, each Tjln is contained in Tb where n<ω and (j,l)∈Λ.
Now Claim 3.5 implies the following:
Claim 3.6**.**
pˉ⊩“\langle\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha}:\alpha\in I\rangle extends b”.
(∗) follows, which completes the proof of Lemma 3.2.
∎
Theorem 3.1 follows.
∎
The next theorem follows immediately from Theorem 3.1 and the arguments from
[1].
Theorem 3.7**.**
Suppose that V satisfies GCH,
κ=⋃n<ωκn and ⋃n<ωo(κn)=κ
(where o(κn) is the Mitchell order of κn). Then there
exists a cardinal preserving generic extension V1 of V
satisfying GCH and having the same reals as V does, so that
adding κ-many random reals over V1 produces κ+-many random
reals over V.
Suppose V is a model of GCH. Then there is a generic
extension V1 of V satisfying GCH so that
the only
cardinal of V which is collapsed in V1 is ℵ1 and such that
adding
ℵω-many random reals to V1 produces
ℵω+1-many of them over V.
Suppose V satisfies GCH. Then there is a generic
extension V1 of V satisfying GCH and having the same reals
as V does, so that
the
only cardinals of V which are collapsed in V1 are ℵ2
and ℵ3 and
such that adding ℵω-many random reals to V1
produces ℵω+1-many of them over V.
Suppose that κ is a strong cardinal, λ≥κ is
regular and GCH holds. Then there exists a cardinal preserving
generic extension V1 of V having the same reals as V does,
so that adding κ-many random reals over V1 produces λ-many
of them over V.
Suppose that there is a strong cardinal and GCH holds. Let
α<ω1. Then there is a model V1⊃V having the same
reals as V and satisfying GCH below ℵωV1 such
that adding ℵωV1-many random reals to V1
produces ℵα+1V1-many of them over V.
We can also use ideas of the proof of Theorem 3.1 to get the following theorem,
which is an analogue of [1, Theorem 3.1] for random reals.
Theorem 3.8**.**
Suppose that V satisfies GCH. Then there is a cofinality
preserving generic extension V1 of V satisfying GCH so that
adding a random real over V1 produces ℵ1-many random
reals over V.
4. The second general fact about adding many random reals
In this section, we prove our second general result which is an analogue of Theorem 2.1 form [2].
Then we use the result to obtain similar results as in [2] for random reals.
Theorem 4.1**.**
Suppose κ<λ are infinite (regular or singular) cardinals, and let V1
be an extension of V. Suppose that in V1:
κ<λ* are still infinite cardinals.*
there exists an increasing sequence ⟨κn:n<ω⟩ of regular cardinals, cofinal in κ. In particular cf(κ)=ω.
there is an increasing (mod finite) sequence ⟨fα:α<λ⟩ of functions in the product
∏n<ω(κn+1∖κn).
there is a partition ⟨Sσ:σ<κ⟩ of λ into sets of size λ such
that for every countable
set I∈V and every σ<κ we have ∣I∩Sσ∣<ℵ0.
Then adding κ-many random reals over V1 produces λ-many random reals over V.
Proof.
Force to add
κ-many random reals over V1. Let us write them as ⟨ri,σ:i,σ<κ⟩.
Also in V, split κ into κ-blocks Bσ,σ<κ, each of size κ, and let ⟨fα:α<λ⟩∈V1 be an
increasing (mod finite) sequence in ∏n<ω(κn+1∖κn). Let α<λ. We define a real sα as
follows. Pick σ<κ such that α∈Sσ. Let kα=min{k<ω:rσ,σ(k)}=1 and set
∀n<ω, sα(n)=rfα(n+kα),σ(0).
The following lemma completes the proof.
Lemma 4.2**.**
⟨sα:α<λ⟩* is a sequence of
λ-many random reals over V.*
Proof.
First note that ⟨ri,σ:i,σ<κ⟩ is R(κ×κ)-generic over V1. By Lemma 2.3, it
suffices to show that for any countable set I⊆λ, I∈V,
the sequence ⟨sα:α∈I⟩ is R(I)-generic over
V. Thus it suffices to prove the following
For every p∈R(κ×κ)
and every open dense subset D∈V
(∗) of R(I), there is
pˉ≤p such that \bar{p}\Vdash\ulcorner\langle\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha}:\alpha\in I\rangle extends
some element of D┐.
Let p and D be as above and for simplicity suppose that
p=1R(κ×κ)=[2κ×κ×ω]. Let b=[Tb]∈D, where Tb⊆2I×ω.
As I is countable, we can find {σj:j<ωˉ≤ω}⊆λ
such that
[TABLE]
and each I∩Sσj is non-empty.
By (d), each I∩Sσj is finite, say
[TABLE]
For every j1,j2<ωˉ, l1<kj1,l2<kj2 and n1,n2<ω set
[TABLE]
The following can be proved as in Claim 3.3.
Claim 4.3**.**
The set
Δ={(j1,j2,l1,l2,n1,n2):b≤c(j1,j2,l1,l2,n1,n2)}
is finite. Also, (j1,j2,l1,l2,n1,n2)∈Δ implies (j2,j1,l2,l1,n2,n1)∈Δ.
Let Λ={j<ωˉ: there exists (j1,j2,l1,l2,n1,n2)∈Δ with j=j1}.
Then Λ
is finite. For each j∈Λ, by (c), we can find nj∗<ω such that for all n≥nj∗ and α1∗<α2∗ in I∩Sσj we have
fα1∗(n)<fα2∗(n).
Let
S′=[{x∈2κ×κ×ω:∀j∈Λ(∀n<nj∗,x(σj,σj,n)=0 and x(σj,σj,nj∗)=1)}]
Then μκ×κ(S′)=2−∣Λ∣(nj∗+1)>0, and so
p′=[S′]∈R(κ×κ). Also, for each j∈Λ and l<kj, p′⊩┌kαjl=nj∗┐.
Let
[TABLE]
By our choice of nj∗ there are no collisions and the above definition is well-formed.
Also, by the same arguments as before, μκ×κ(Sˉ)=μκ×κ(S′)>0.
Let
pˉ=[Sˉ].
Then pˉ∈R(κ×κ) is well-defined and for all α=αjl∈I,
where
j∈Λ and l<kj, and all y∈Spˉ we can find x∈Tb such that for m<n,
\bar{p}\Vdash~{}\text{``}\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha}(m)=\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha_{jl}}(m)
=\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{r}}}_{f_{\alpha_{jl}}(n^{*}_{j}+m),\sigma_{j}}(0)
=y(fαjl(nj∗+m),σj,0)
=x(αjl,m)
=x(α,m)”.
This implies
\bar{p}\Vdash\ulcorner\langle\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha_{jl}}:j\in\Lambda,l<k_{j}\rangle extends b┐.
Now, as in the proof of Claim 3.6, we have the following:
Claim 4.4**.**
\bar{p}\Vdash\ulcorner\langle\smash{\underset{\raisebox{1.2pt}[0.0pt][0.0pt]{\sim}}{{s}}}_{\alpha}:\alpha\in I\rangle* extends b┐.*
(∗) follows and we are done.
∎
The theorem follows.
∎
The following theorem follows from Theorem 4.1 and the arguments from [2].
Theorem 4.5**.**
Suppose that GCH holds in V, κ is a cardinal of countable cofinality and
there are κ many measurable cardinals below κ.
Then there is a cardinal preserving forcing extension V1 of V not adding new reals and such that adding κ-many random reals
random reals over
V1 produces κ+-many random reals over V.
Suppose that V1⊇V are such that:
- (1)
V1* and V have the same cardinals and reals,*
2. (2)
κ<λ* are infinite cardinals of V1,*
3. (3)
there is no partition ⟨Sσ:σ<κ⟩ of λ in V1 as in Theorem 3.1(d).**
Then adding κ-many random reals over V1 cannot produce λ-many random reals over V.
The following are equiconsistent:
- (1)
There exists a pair (V1,V2),V1⊆V2, of models of set theory with the same cardinals and reals and a cardinal κ of cofinality ω (in V2) such that adding κ-many random reals over V2 adds more than κ-many random reals over V1.
2. (2)
There exists a cardinal δ which is a limit of δ-many measurable cardinals.
Suppose that V1⊇V are such that V1 and V have the same cardinals and reals and ℵδ is less than the first fixed point of the ℵ-function. Then adding ℵδ-many random reals over V1 cannot produce ℵδ+1-many random reals over V.
Suppose GCH holds and there exists a cardinal κ which is of cofinality ω and is a limit of κ-many
measurable cardinals. Then there is pair (V1,V2) of models of ZFC,V1⊆V2 such that:
- (1)
V1* and V2 have the same cardinals and reals.*
2. (2)
κ* is the first fixed
point of the ℵ-function in V1 (and hence in V2).*
3. (3)
Adding κ-many random reals over V2 adds
κ+-many random reals over V1.