MathLabs

Worked solution: Shelah's proof that the Whitehead problem is independent of ZFC (1974)

Step 6 of 8: Under MA+¬CH\mathrm{MA}+\neg\mathrm{CH}: an almost-disjoint family builds a non-free Whitehead group
In plain words

Shelah's construction uses almost-disjoint and related ladder-system combinatorics: one starts from ℵ1\aleph_1 many infinite subsets of the natural numbers with pairwise finite intersections, then performs a carefully chosen algebraic gluing. The almost-disjoint family alone does not determine a Whitehead group; the additional relations and forcing argument are essential.

MA+2ℵ0>ℵ1  ⟹  ∃ W, ∣W∣=ℵ1, Ext1(W,Z)=0, W not free\mathrm{MA} + 2^{\aleph_0}>\aleph_1 \implies \exists\, W,\ |W|=\aleph_1,\ \mathrm{Ext}^1(W,\mathbb{Z})=0,\ W \text{ not free}
Detailed analysis

Assume Martin's Axiom together with 2ℵ0>ℵ12^{\aleph_0} > \aleph_1. Using an almost-disjoint family {aξ:ξ<ℵ1}\{ a_\xi : \xi < \aleph_1 \} of infinite subsets of ω\omega (pairwise intersections finite), one builds a specific abelian group WW of cardinality ℵ1\aleph_1, generated by symbols tied to each aξa_\xi together with a countable free part, glued so that WW is ℵ1\aleph_1-free but its filtration cannot be arranged into the well-behaved, club-supported form Pontryagin's criterion demands — so WW is provably not free.

Showing Ext1(W,Z)=0\mathrm{Ext}^1(W, \mathbb{Z}) = 0 nonetheless requires solving ℵ1\aleph_1-many compatible local lifting problems (one at each stage of the filtration) simultaneously; Shelah showed this reduces to finding a filter meeting ℵ1\aleph_1-many dense subsets of a naturally associated ccc poset, which is exactly what MAℵ1\mathrm{MA}_{\aleph_1} (available since 2ℵ0>ℵ12^{\aleph_0} > \aleph_1) guarantees. So under MA+¬CH\mathrm{MA} + \neg\mathrm{CH}, WW is a genuine non-free Whitehead group of cardinality ℵ1\aleph_1.

Since MA+¬CH\mathrm{MA} + \neg\mathrm{CH} is itself consistent relative to ZFC\mathrm{ZFC} (by Solovay–Tennenbaum's iterated forcing, described in the companion proof of Suslin's problem), this shows Con(ZFC)  ⟹  Con(ZFC+¬Free(Wh))\mathrm{Con}(\mathrm{ZFC}) \implies \mathrm{Con}(\mathrm{ZFC} + \neg\mathrm{Free}(\mathrm{Wh})), where ¬Free(Wh)\neg\mathrm{Free}(\mathrm{Wh}) abbreviates "some Whitehead group is not free" — the second half of the independence result.

Terms in this step
Almost-disjoint family
A collection of infinite subsets of ω\omega such that any two of them share only a finite intersection; such families of size ℵ1\aleph_1 always exist in ZFC\mathrm{ZFC} and are a standard combinatorial gadget for building non-free groups and other pathological structures.
Knowledge used in this step