Worked solution: Shelah's proof that the Whitehead problem is independent of ZFC (1974)
Using Jensen's diamond principle (true whenever ) 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 was used to build a Suslin tree in the companion proof of Suslin's Hypothesis.
This forces every -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 implies Whitehead's question has the answer "yes" across the board.
Working under , hence assuming , Shelah (1974) showed: given an -free Whitehead group with filtration , the diamond sequence can be used to predict, stationarily often, exactly the kind of "bad" quotient that would obstruct Pontryagin's freeness criterion; whenever such a prediction is confirmed, the vanishing of is used to correct course at that stage, ensuring the obstruction never actually manifests.
Because 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 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 .
Hence 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 satisfies (as in the companion proof of the continuum hypothesis), this shows , where abbreviates "every Whitehead group is free" — one half of the independence result.
- Diamond principle
- A combinatorial "guessing" principle discovered by Ronald Jensen, true whenever : a predetermined sequence of guesses about subsets of is correct stationarily often, no matter which subset one later chooses. It is a powerful oracle for guiding transfinite constructions.