../
Source. E. Glazer, Erdős Problem 501 after adding ω2 random
reals, draft rev10, Theorem 5.1 (forcing interface), physical pp. 6--7,
in the eight-page PDF held by its library source card,
Glazer (2026).
It uses Definition 3.1 from the
Theorem 3.2 page,
Proposition 4.4
and Lemma 4.5.
Standing. This is an author-recorded reconstruction. It is not an
independent review and changes no status and assigns no tier. The
conventions (R1)--(R5) of the
Lemma 4.1 page are
assumed; outer regularity of Lebesgue outer measure is used as a
definition. The instance of the map ρ under Definitions is a
compilation fill.
Definitions
κ=ω2, Θ=κ×ω,
Dα={α}×ω
and B=B(Θ), as on the Proposition 4.4 page;
O, U(c), Im=[m,m+1) and profile certificates as on the
Theorem 3.2 page. Fix a Borel measure-preserving map
ρ:2ω→[0,1) (fair-coin measure to Lebesgue measure) with
null point fibers. One instance: ρ(r)=∑nr(n)2−n−1, redefined
as 0 on the null set of sequences that are eventually 1; it pushes
the fair-coin measure to Lebesgue measure on [0,1), and each fiber is
countable, hence null. Through the enumeration n↦(α,n) of
Dα, 2Dα is identified with 2ω, and through the
enumeration ⟨dn⟩ of D from Proposition 4.4, so is 2D.
A name A˙=(A˙y)y∈R is a name for a
function from the reals of the extension to subsets of those reals; for
a name x˙ for a real, A˙x˙ names its value at x˙.
Statement
ZFC+CH⊢ Bω2⊩∀A[(∀y∈R λ∗(Ay)<1)⟶Prof(A)]
(the source's (5.1)).
Proof
Work in a ground model M⊨ZFC+CH and let
p∈B force
A˙=(A˙y)y∈R satisfies λ∗(A˙y)<1 for every y∈R
(the source's (5.2)). We show that p forces Prof(A˙).
Random points. For α<κ let
r˙α=G˙↾Dα∈2ω, the random real
read from the block Dα, and for m∈Z put
x˙α,m=m+ρ(r˙α)∈Im
(the source's (5.3)).
Names for envelopes. Fix α<κ and m∈Z. In any
extension by a generic containing p, λ∗(Axα,m)<1,
so by the definition of outer measure there is an open set of measure
below one containing Axα,m, and every open set has a code.
By the maximum principle (R3) there is a name c˙α,m with
p⊩A˙x˙α,m⊆U(c˙α,m) and λ(U(c˙α,m))<1
(the source's (5.4)). Mix c˙α,m with a fixed default code
below the complement of p, so that the top condition forces
c˙α,m∈O; this makes it a name for an element of
the standard Borel space O in the sense of (R4). Bundle the
countable sequence into
w˙α=⟨c˙α,m:m∈Z⟩∈OZ,
a name for an element of the standard Borel space OZ.
Homogeneous reading. Apply Proposition 4.4 (in M, which satisfies
CH) to p, X=OZ and (w˙α)α<κ.
Obtain J⊆κ of size κ, the root R, the petals
(Pα)α∈J with Dα⊆Pα, the pair
D⊆P with bijections πα:P→Pα sending
dn to (α,n), and a Borel map
F=⟨Fm:m∈Z⟩:2R×2P→OZ
(the source's (5.5)) with
⊩w˙α=F(G˙↾R,(G˙↾Pα)∘πα)
for α∈J. The set P is countably infinite, since D⊆P
is in bijection with Dα.
The certificate. Let G∋p be B-generic over M and
work in M[G]. Set g=G↾R∈2R and
zα=(G↾Pα)∘πα∈Ω:=2P(α∈J)
(the source's (5.6)). Let ν be the fair-coin product measure on
Ω, a standard Borel probability space, and put
Z={zα:α∈J}. Lemma 4.5, applied in M to the petals
(Pα)α∈J (uncountable in M) and
Γ=Θ∖⋃α∈JPα, gives
ν∗(Z)=1 in M[G] (the source's (5.7)). This is (P1).
For z∈Ω and m∈Z define the raw code
cm0(z)=Fm(g,z), a Borel function of z (a section of the Borel
map Fm at the fixed g), and the truncated code
cm(z)={cm0(z),c∅,λ(U(cm0(z)))<1,λ(U(cm0(z)))≥1
(the source's (5.8)), where U(c∅)=∅. Since
c↦λ(U(c)) is Borel, the case split is over a Borel set and
cm:Ω→O is Borel; and λ(U(cm(z)))<1 for
every z∈Ω (the source's (5.9)). This is (P3). The truncation is
what makes (P3) hold on all of Ω rather than only on Z.
Define
xm(z)=m+ρ(z↾D)
(the source's (5.10)). It is Borel with values in Im. The
restriction z↦z↾D pushes ν to the fair-coin
measure on 2D, and ρ pushes that to Lebesgue measure on [0,1),
so for Borel B⊆R,
ν(xm−1(B))=λ((B−m)∩[0,1))=λ(B∩Im). This is (P2).
Finally let z=zα∈Z with α∈J. In M[G], since
p∈G and w˙α is read by F,
c˙α,mG=Fm(g,zα)=cm0(zα)(m∈Z).
Moreover xm(zα)=x˙α,mG: by the choice of πα,
(zα↾D)(dn)=G(α,n)=r˙αG(n) for every
n, so zα↾D is r˙αG under the fixed
identifications, and xm(zα)=m+ρ(r˙αG). Hence, by
the forced statement (5.4) with p∈G,
λ(U(cm0(zα)))<1andAxm(zα)⊆U(cm0(zα)).
The first inequality says that the truncation leaves the code at
zα unchanged, cm(zα)=cm0(zα), so
Axm(zα)⊆U(cm(zα))
(the source's (5.11)). This is (P4).
Thus (Ω,ν), Z, ⟨xm,cm:m∈Z⟩ is a
profile certificate for A=A˙G in M[G].
Closing the quantifiers. Every generic G∋p satisfies
Prof(A˙G), so p⊩Prof(A˙)
by the forcing theorem. If some condition forced
(∀y λ∗(A˙y)<1)∧¬Prof(A˙),
the argument applied to that condition would contradict it; hence the
top condition forces the implication for A˙. Every family
in M[G] has a name, so the universal statement (5.1) follows.
Boundary. CH is used only through Proposition 4.4. Lemma 4.5 and
Theorem 3.2 are ZFC theorems. The assembly into Theorem 1.1 is on the
Theorem 1.1 page.