../
Source. E. Glazer, Erdős Problem 501 after adding ω2 random
reals, draft rev10, Proposition 4.4 (homogeneous Borel reading),
physical pp. 5--6, in the eight-page PDF held by its library source card,
Glazer (2026).
It uses Lemma 4.1
and Lemma 4.3.
Standing. This is an author-recorded reconstruction. It is not an
independent review and changes no status and assigns no tier. Imported:
the conventions (R1)--(R5) on the Lemma 4.1 page, and the fact that
there are at most 2ℵ0 Borel maps between two standard Borel
spaces (a Borel map is determined by the preimages of a countable base,
and there are 2ℵ0 Borel sets; A. S. Kechris, Classical
Descriptive Set Theory, Chapter 11).
Definitions
Let κ=ω2, Θ=κ×ω, and
Dα={α}×ω for α<κ; the blocks
Dα partition Θ. For a bijection π:P→P′
between coordinate sets and v∈2P′, write v∘π∈2P for the
pullback; the source writes it π−1(v). For a pair (P′,D′) with
D′⊆P′ countable and a fixed enumeration of D′, its
isomorphism type is determined by the cardinality of P′∖D′,
one of 0,1,2,…,ℵ0; two pairs of the same type admit a
bijection matching the enumerations of the distinguished subsets.
Statement
The following is provable in ZFC + CH. Let p∈B(Θ), let
X be a standard Borel space, and for each α<κ let
w˙α be a name for an element of X. There are
- a set J⊆κ of size κ;
- a countable root R supporting p;
- pairwise disjoint countable petals Pα with
Dα⊆Pα, for α∈J;
- a fixed countable pair D⊆P with an enumeration
⟨dn:n<ω⟩ of D, and bijections
πα:P→Pα with πα(dn)=(α,n);
- a single Borel map F:2R×2P→X
such that
⊩B(Θ)w˙α=F(G˙↾R, (G˙↾Pα)∘πα)(α∈J)
(the source's (4.2)).
Proof
Supports. By (R1) choose a countable R0⊆Θ supporting
p. By Lemma 4.1, for each α<κ choose a countable
Sα⊆Θ reading w˙α through a Borel map
Fα:2Sα→X, and enlarge Sα to contain
R0∪Dα (a reading survives enlargement, as noted on the
Lemma 4.1 page). The sets Sα are countable. They need not be
pairwise distinct, since two names may share a support: Lemma 4.3 as
reconstructed applies to the sequence ⟨Sα:α<κ⟩
as it stands, and a member repeated inside the Δ-subsystem below
equals the root R, so its block lies in R and its index is discarded
under "Blocks inside petals".
Delta-system. Apply Lemma 4.3 to
⟨Sα:α<κ⟩: there are J0⊆κ of
size κ and a countable R with Sα∩Sβ=R for
distinct α,β∈J0. Since R0⊆Sα for all
α, R0⊆R, so R supports p. Put
Pα=Sα∖R for α∈J0; for distinct
α,β∈J0,
Pα∩Pβ=(Sα∩Sβ)∖R=∅.
Blocks inside petals. The countable set R meets only countably many
of the pairwise disjoint blocks Dα. Let J1 be J0 with those
indices removed; ∣J1∣=κ, and for α∈J1,
Dα∩R=∅, so
Dα⊆Sα∖R=Pα.
One isomorphism type. The pairs (Pα,Dα), with
Dα enumerated as ⟨(α,n):n<ω⟩, fall into
countably many isomorphism types. A set of size ω2 is not a
countable union of sets of size at most ω1, so some type contains
κ many indices; let J2⊆J1 be those indices. Fix a
countable pair D⊆P of that type with an enumeration
⟨dn⟩ of D, and for α∈J2 fix a bijection
πα:P→Pα with πα(dn)=(α,n).
Pulling back. For α∈J2, Sα=R⊔Pα, so
2Sα is identified with 2R×2Pα. Define
F~α:2R×2P→X by
F~α(u,v)=Fα(u∪(v∘πα−1)),
a Borel map, being Fα composed with the homeomorphism
(u,v)↦u∪(v∘πα−1) of 2R×2P onto
2Sα. Since
G˙↾Sα=(G˙↾R)∪(G˙↾Pα)
and
G˙↾Pα=((G˙↾Pα)∘πα)∘πα−1,
⊩w˙α=Fα(G˙↾Sα)=F~α(G˙↾R,(G˙↾Pα)∘πα).
Counting. The maps F~α (α∈J2) all belong to
the set of Borel maps 2R×2P→X, which has size at most
2ℵ0=ℵ1 under CH. Since ∣J2∣=ℵ2, some Borel map
F equals F~α for every α in a set J⊆J2
of size κ. This J, R, (Pα)α∈J, D⊆P,
(πα)α∈J and F satisfy the statement.
Boundary. CH enters twice: through Lemma 4.3 and through the count
of Borel maps. The proposition is applied in
Theorem 5.1 with
X=OZ.