Worked solution: Shelah's proof that the Whitehead problem is independent of ZFC (1974)
Shelah's construction uses almost-disjoint and related ladder-system combinatorics: one starts from 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.
Assume Martin's Axiom together with . Using an almost-disjoint family of infinite subsets of (pairwise intersections finite), one builds a specific abelian group of cardinality , generated by symbols tied to each together with a countable free part, glued so that is -free but its filtration cannot be arranged into the well-behaved, club-supported form Pontryagin's criterion demands — so is provably not free.
Showing nonetheless requires solving -many compatible local lifting problems (one at each stage of the filtration) simultaneously; Shelah showed this reduces to finding a filter meeting -many dense subsets of a naturally associated ccc poset, which is exactly what (available since ) guarantees. So under , is a genuine non-free Whitehead group of cardinality .
Since is itself consistent relative to (by Solovay–Tennenbaum's iterated forcing, described in the companion proof of Suslin's problem), this shows , where abbreviates "some Whitehead group is not free" — the second half of the independence result.
- Almost-disjoint family
- A collection of infinite subsets of such that any two of them share only a finite intersection; such families of size always exist in and are a standard combinatorial gadget for building non-free groups and other pathological structures.