../
Source. E. Glazer, Erdős Problem 501 after adding ω2 random
reals, draft rev10, Section 3: the coding conventions, Definition 3.1
(profile certificate) and Theorem 3.2 (ZFC core), physical pp. 3--4, in
the eight-page PDF held by its library source card,
Glazer (2026).
The two measure lemmas it uses are reconstructed in
Lemma 2.1 and
Lemma 2.2.
Standing. This is an author-recorded reconstruction. It is not an
independent review and changes no status and assigns no tier. The
instance of the coding space given under Definitions is a compilation
fill: the source fixes "the standard coding" with the two stated Borel
properties and does not spell one out.
Definitions
Families and free sets. Throughout, λ and λ∗ are
Lebesgue measure and Lebesgue outer measure on R. For a family
A=(Ay)y∈R of subsets of R,
Freeω(A) asserts that there is an infinite
X⊆R with x∈/Ay whenever x,y∈X are distinct.
Open-set codes. Fix a standard Borel space O and a map
c↦U(c) from O onto the open subsets of R
such that the relation {(x,c):x∈U(c)}⊆R×O
is Borel and c↦λ(U(c))∈[0,∞] is Borel. One instance:
O=2ω, a fixed enumeration (Jn)n<ω of the
open intervals with rational endpoints, and
U(c)=⋃{Jn:c(n)=1}. Every open set is such a union; the
relation x∈U(c) is open in (x,c); and λ(U(c)) is the
supremum over N of λ(⋃n<N,c(n)=1Jn), each
term a continuous function of finitely many bits of c, so the supremum
is Borel. There is a code c∅ with U(c∅)=∅.
For m∈Z put Im=[m,m+1); these intervals partition
R.
Definition 3.1 (profile certificate). A profile certificate for
A consists of (Ω,ν), a set Z⊆Ω, and
maps ⟨xm,cm:m∈Z⟩ such that:
- (P1) (Ω,ν) is a standard Borel probability space and
ν∗(Z)=1, where ν∗(Z)=inf{ν(B):B⊇Z Borel};
- (P2) each xm:Ω→Im is Borel and has Lebesgue
distribution on Im: ν(xm−1(B))=λ(B∩Im) for every
Borel B⊆R;
- (P3) each cm:Ω→O is Borel and
λ(U(cm(z)))<1 for every z∈Ω;
- (P4) Axm(z)⊆U(cm(z)) for every z∈Z and every
m∈Z.
Prof(A) asserts that a profile certificate for
A exists. The set Z need not be measurable.
Outer measure one. ν∗(Z)=1 holds if and only if Z meets every
Borel H⊆Ω with ν(H)>0. If ν∗(Z)=1 and H is a
positive Borel set disjoint from Z, then Ω∖H is a Borel
superset of Z of measure below one, a contradiction. Conversely, if Z
meets every positive Borel set and B⊇Z is Borel, then
Ω∖B is a Borel set disjoint from Z, hence null, so
ν(B)=1. This meeting property is the only largeness property of Z
used below; the other clauses of (P1), that (Ω,ν) is a standard
Borel probability space, are used for the Borel structure of S2 and
the σ-finiteness of μ.
Statement
For every family A=(Ay)y∈R,
ZFC⊢Prof(A)⟶Freeω(A)
(the source's (3.5)).
Proof
Fix a profile certificate. Put
S=Z×Ω,μ=counting measure×ν,
with Σ the Borel σ-algebra of S. Then S is a standard
Borel space, μ is σ-finite (each {m}×Ω has
measure one) and μ(S)=∞. For t=(m,z)∈S define
x(t)=xm(z),V(t)=U(cm(z))
(the source's (3.6)), and define E⊆S2 by
(t,s)∈E⟺x(t)∈V(s)
(the source's (3.7)). The map (t,s)=((m,z),(n,w))↦(xm(z),cn(w))
is Borel from S2 to R×O, and E is the
preimage under it of the Borel relation x∈U(c), so E is Borel in
S2; for a standard Borel S the Borel sets of S2 are exactly
Σ⊗Σ. Likewise x:S→R is Borel.
Column bound. Let s=(n,w). Then
Es={t:x(t)∈V(s)}=⋃m{m}×xm−1(V(s)), so by (P2)
applied to the open set V(s),
μ(Es)=m∈Z∑ν{z:xm(z)∈V(s)}=m∈Z∑λ(V(s)∩Im)=λ(V(s))<1
(the source's (3.8)); the middle equality is countable additivity over
the partition (Im), and the final inequality is (P3). So Lemma 2.1 and
Lemma 2.2 apply with K=1.
Null fibers. Let a∈R and let ma be the unique m with
a∈Im. Since xm takes values in Im, the fiber
{t:x(t)=a} is {ma}×xma−1({a}), and (P2) gives
ν(xma−1({a}))=λ({a}∩Ima)=0. So every fiber of
x is μ-null.
Recursion. We construct Borel sets Cj⊆S of infinite
measure and points tj=(mj,zj)∈Cj with zj∈Z. Start with
C0=S. Given Cj, Lemma 2.1 says that Q(Cj) is Borel with
μ(Q(Cj))>0. Since
μ(Q(Cj))=∑mν{z:(m,z)∈Q(Cj)}, some mj∈Z makes
the Borel section
Hj={z∈Ω:(mj,z)∈Q(Cj)}
(the source's (3.9)) of positive ν-measure. By the meeting property
of ν∗(Z)=1, choose zj∈Z∩Hj and put tj=(mj,zj); then
tj∈Q(Cj)⊆Cj. Define
Cj+1=Cj∖(Etj∪Etj∪{s:x(s)=x(tj)})
(the source's (3.10)). By Lemma 2.2, Cj+1 is Borel with infinite
measure. The sets decrease: Cj+1⊆Cj.
Independence. Put yj=x(tj). Let i<j. Then
tj∈Cj⊆Ci+1, and Ci+1 omits three sets:
- it omits {s:x(s)=x(ti)}, so yj=yi;
- it omits Eti={t:x(t)∈V(ti)}, so yj∈/V(ti);
- it omits Eti={s:x(ti)∈V(s)}, so yi∈/V(tj).
Since zi,zj∈Z, (P4) gives
Ayi=Axmi(zi)⊆U(cmi(zi))=V(ti) and likewise
Ayj⊆V(tj). Consequently yj∈/Ayi and
yi∈/Ayj. The set {yj:j<ω} is therefore infinite and
independent, which is Freeω(A).
Boundary. The relation x∈Ay is used only at the certified
profiles zj∈Z, through (P4); every measure-theoretic step concerns
the Borel graph E. The forcing module of
Theorem 5.1
produces the certificate.