MathLabs

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

Step 5 of 8: Under V=LV=L: diamond forces every Whitehead group free
In plain words

Using Jensen's diamond principle ♢\diamondsuit (true whenever V=LV = L) as a fortune-teller, Shelah showed one can guide the construction of the filtration floor by floor so that every troublesome gluing gets predicted and defeated in advance, exactly as ♢\diamondsuit was used to build a Suslin tree in the companion proof of Suslin's Hypothesis.

This forces every ℵ1\aleph_1-free Whitehead group to admit the well-behaved filtration Pontryagin's criterion demands, hence to be genuinely free; a further argument extends the same idea to Whitehead groups of every infinite cardinality, so V=LV = L implies Whitehead's question has the answer "yes" across the board.

V=L  ⟹  ♢ℵ1  ⟹  every Whitehead group is freeV=L \implies \diamondsuit_{\aleph_1} \implies \text{every Whitehead group is free}
Detailed analysis

Working under V=LV = L, hence assuming ♢ℵ1\diamondsuit_{\aleph_1}, Shelah (1974) showed: given an ℵ1\aleph_1-free Whitehead group WW with filtration ⟨Wα:α<ω1⟩\langle W_\alpha : \alpha < \omega_1 \rangle, the diamond sequence can be used to predict, stationarily often, exactly the kind of "bad" quotient Wα+1/WαW_{\alpha+1}/W_\alpha that would obstruct Pontryagin's freeness criterion; whenever such a prediction is confirmed, the vanishing of Ext1(W,Z)\mathrm{Ext}^1(W, \mathbb{Z}) is used to correct course at that stage, ensuring the obstruction never actually manifests.

Because ♢\diamondsuit guarantees stationarily many correct predictions, every possible obstruction gets caught and defeated, so the filtration ends up well-behaved on a club of stages, and Pontryagin's criterion certifies WW is free. Shelah extended this argument, by an additional induction on cardinality (a technique later systematized as "singular compactness"), to Whitehead groups of every infinite cardinality, not just ℵ1\aleph_1.

Hence V=LV = L implies every Whitehead group is free: combined with Stein's countable case, this settles Whitehead's question with the answer "yes" throughout the entire constructible universe. Since LL satisfies ZFC\mathrm{ZFC} (as in the companion proof of the continuum hypothesis), this shows Con(ZFC)  ⟹  Con(ZFC+Free(Wh))\mathrm{Con}(\mathrm{ZFC}) \implies \mathrm{Con}(\mathrm{ZFC} + \mathrm{Free}(\mathrm{Wh})), where Free(Wh)\mathrm{Free}(\mathrm{Wh}) abbreviates "every Whitehead group is free" — one half of the independence result.

Terms in this step
Diamond principle ♢\diamondsuit
A combinatorial "guessing" principle discovered by Ronald Jensen, true whenever V=LV = L: a predetermined sequence of guesses about subsets of ω1\omega_1 is correct stationarily often, no matter which subset one later chooses. It is a powerful oracle for guiding transfinite constructions.
Knowledge used in this step