Source. E. Glazer, Erdős Problem 501 after adding ω2 random
reals, draft rev10, Lemma 4.3 (generalized Δ-system), physical
p. 5, in the eight-page PDF held by its library source card,
Glazer (2026).
Standing. This is an author-recorded reconstruction. It is not an
independent review and changes no status and assigns no tier. The
following are imported: the Löwenheim--Skolem construction of continuous
chains of elementary submodels (T. Jech, Set Theory, third millennium
edition, Chapter 12); Fodor's theorem and the stationarity of the set of
ordinals below ω2 of cofinality ω1 (Jech, Chapter 8); and
the cardinal arithmetic ℵ1ℵ0=2ℵ0.
Definitions
A family (Aξ)ξ∈T is a Δ-system with root R if
Aξ∩Aζ=R for all distinct ξ,ζ∈T. Write
Sω1ω2={ξ<ω2:cf(ξ)=ω1}. For
a set M, [M]ℵ0 is the set of its countable subsets.
Statement
ZFC+CH⊢every family of ω2 countable sets has a Δ-subsystem of size ω2
(the source's (4.1)). Precisely: if ⟨Sα:α<ω2⟩
is a sequence of countable sets, there are a set T′⊆ω2 of
size ω2, an injection ξ↦αξ on T′, and a
countable R with Sαξ∩Sαζ=R for all distinct
ξ,ζ∈T′.
Proof
Enumerate the family as ⟨Sα:α<ω2⟩. Let
θ be a regular cardinal large enough that the sequence lies in
H(θ). By Löwenheim--Skolem build a chain
⟨Mξ:ξ<ω2⟩ of elementary submodels of H(θ)
such that: ∣Mξ∣=ω1 and ω1⊆Mξ; the sequence
⟨Sα⟩ belongs to M0; the chain is increasing and
continuous (Mξ=⋃η<ξMη at limits ξ, a union of
an elementary chain being elementary); and Mξ+1∩ω2
properly contains Mξ∩ω2. The last clause is arranged at
successor steps by putting into Mξ+1 an ordinal of
ω2∖Mξ, which exists because ∣Mξ∣=ω1<ω2.
Two consequences of the setup are used. First, if a countable set A
belongs to some Mξ, then A⊆Mξ: by elementarity Mξ
contains a surjection f:ω→A (or A is finite and the same
argument applies), and each f(n) is definable in H(θ) from
f and n∈ω⊆Mξ. Second, if α∈Mξ then
Sα∈Mξ, being definable from the sequence and α.
For ξ∈Sω1ω2 choose
αξ∈(Mξ+1∩ω2)∖Mξ, put
Aξ=Sαξ, and let Rξ=Aξ∩Mξ. Since
αξ∈Mξ+1, Aξ∈Mξ+1, and Aξ is countable,
so Aξ⊆Mξ+1. The map ξ↦αξ is injective
on Sω1ω2: for ξ<ζ,
αξ∈Mξ+1⊆Mζ while αζ∈/Mζ.
Bounding the roots. Fix ξ∈Sω1ω2. Since ξ
is a limit, Mξ=⋃η<ξMη, so each of the countably
many elements of Rξ enters the chain at some stage below ξ; as
cf(ξ)=ω1, these countably many stages are bounded by
some η(ξ)<ξ, and Rξ⊆Mη(ξ).
Fodor. The function ξ↦η(ξ) is regressive on the
stationary set Sω1ω2, so by Fodor's theorem it is
constant, with value η say, on a stationary set
T⊆Sω1ω2; in particular ∣T∣=ω2. For
ξ∈T, Rξ∈[Mη]ℵ0.
CH. Since ∣Mη∣=ℵ1,
[Mη]ℵ0=ℵ1ℵ0=2ℵ0=ℵ1
under CH. The map ξ↦Rξ sends the ω2 elements of T
into a set of size ℵ1, so some countable R satisfies
Rξ=R for all ξ in a set T′⊆T of size ω2.
The root. Let ξ<ζ both lie in T′. Then
Aξ⊆Mξ+1⊆Mζ, so
Aξ∩Aζ=Aξ∩(Aζ∩Mζ)=Aξ∩Rζ=Aξ∩R=R,
the last step because R=Rξ=Aξ∩Mξ⊆Aξ. Thus
(Aξ)ξ∈T′=(Sαξ)ξ∈T′ is a Δ-system of
size ω2 with root R.
Boundary. The lemma is applied in
Proposition 4.4
to the countable supports of ω2 names. Those supports need not
be pairwise distinct, since two names may share a support even though
each support contains its own block {α}×ω; this is
why the precise statement above is given for an indexed sequence and
returns an injection on indices rather than ω2 distinct sets.
The sequence form is equivalent to the source's family form: a family of
ω2 sets is the injective case, and a sequence with fewer than
ω2 distinct values takes one value ω2 times, a
Δ-system with that value as root.