Worked solution: Gödel and Cohen: the continuum hypothesis is independent of ZFC (1963)
Adding new digits to all these lottery tickets could, in principle, secretly create a clever new correspondence that shrinks what used to be an -sized collection down to only -many elements — collapsing cardinals, which would make the previous step's inequality meaningless. Cohen needed to rule this out.
He showed his poset is so "sparse" that any collection of pairwise incompatible conditions must be countable (only countably many finite scraps of information can ever be mutually contradictory at once) — a property called the countable chain condition. This sparseness is exactly strong enough to guarantee no cardinal collapse ever happens, so the ladder of infinite sizes from survives fully intact in .
A poset satisfies the countable chain condition (ccc) if every antichain in (a set of pairwise incompatible conditions, i.e. no two have a common extension) is countable. Cohen showed is ccc: by the Delta-system lemma, every uncountable family of finite domains contains two domains whose intersection is a common root; among the countably many assignments on that root, two conditions are therefore compatible. Hence every antichain is countable.
There is a general preservation theorem in forcing: if is ccc, then forcing with collapses no cardinals and adds no new countable sequences of ordinals that could witness a previously regular cardinal becoming singular or countable. Hence every cardinal of , in particular and , remains a cardinal — indeed remains and respectively — in .
With cardinals confirmed safe, the inequality established in the previous step is genuine and refers to the same throughout, so . Since and , this shows : can never be proved from either.
- Countable chain condition (ccc)
- A poset has the ccc if every antichain (set of pairwise incompatible elements) in it is countable; ccc forcings are the safest kind, since they provably never collapse cardinals.