Worked solution: Shelah's proof that the Whitehead problem is independent of ZFC (1974)
Picture constructing an uncountable group like assembling an infinitely tall building, one countable floor at a time; each finished floor, taken on its own, is a perfectly ordinary free group. The open question is whether the entire skyscraper, viewed as a whole after all floors are in place, is itself free, or whether something subtly non-free can emerge only from how the floors are stacked together.
A fact from homological algebra shows every Whitehead group is automatically built this way — so the search for a non-free Whitehead group is really a search for a way to stack countable free floors that glues together badly enough to fail global freeness, yet well enough that still vanishes overall.
An abelian group of cardinality is -free if it can be written as a continuous increasing chain of countable subgroups, each free, with at limit stages . A standard theorem in the theory of Whitehead groups, using Stein's countable result together with a filtration argument, shows that every Whitehead group of cardinality is -free; this should not be read as the claim that is inherited by arbitrary subgroups without further argument.
-freeness alone does not imply global freeness — that is the crux of the whole problem. A well-known criterion (essentially due to Pontryagin, adapted to this uncountable setting) says an -free group is actually free exactly when the filtration can be chosen so that is free for a "club" (closed unbounded) set of stages — that is, when the way each new floor sits on top of the previous ones is uniformly well-behaved.
Whether such a uniformly well-behaved filtration can always be found for a group with turns out to be undecidable from alone: the next two steps show it can always be arranged under , and can genuinely fail under .
- -free group
- A group of cardinality expressible as a continuous increasing union of countable free subgroups; equivalently, every countable subgroup is contained in a countable free subgroup.
- Filtration
- A continuous increasing chain of subgroups whose union is the whole group, used to reduce questions about an uncountable group to questions about how its countable pieces fit together.