MathLabs

Worked solution: Gödel and Cohen: the continuum hypothesis is independent of ZFC (1963)

Step 3 of 9: Gödel builds LL: the leanest possible universe of sets
In plain words

Ordinary set theory lets you form the power set of any set — literally every conceivable subset, with no requirement that a subset be describable in any way. Gödel instead built a much thriftier universe, LL, where at each stage you are only allowed to add subsets that can be pinned down by an explicit logical description using elements already present.

Stacking these thrifty stages one on top of another, indexed by the ordinal numbers, for as long as ordinals exist, produces LL: the smallest possible universe of sets that still obeys every rule of set theory, built entirely out of nameable bricks.

L=⋃α∈OrdLα,Lα+1=Def(Lα)L = \bigcup_{\alpha \in \mathrm{Ord}} L_\alpha, \quad L_{\alpha+1} = \mathrm{Def}(L_\alpha)
Detailed analysis

By transfinite recursion on the ordinals: L0=∅L_0 = \emptyset, Lα+1=Def(Lα)L_{\alpha+1} = \mathrm{Def}(L_\alpha) (the collection of all subsets of LαL_\alpha that are first-order definable, with parameters, over the structure ⟨Lα,∈⟩\langle L_\alpha, \in \rangle), Lλ=⋃α<λLαL_\lambda = \bigcup_{\alpha<\lambda} L_\alpha at limit ordinals λ\lambda, and L=⋃α∈OrdLαL = \bigcup_{\alpha \in \mathrm{Ord}} L_\alpha.

Gödel proved in 1938–40 that LL satisfies every ZFC\mathrm{ZFC} axiom, and in fact satisfies the stronger axiom of constructibility V=LV = L ("every set is constructible"). Because LL is built purely from definable steps, it is far more rigid and controllable than the full universe VV of all sets could ever be assumed to be.

Having a rigid, well-understood universe like LL is only useful if one can actually compute inside it what cardinalities look like; the next step shows how a structural fact about LL (the condensation lemma) pins down the size of P(ω)∩L\mathcal{P}(\omega) \cap L exactly, which is what will finally deliver CH\mathrm{CH}.

Terms in this step
Ordinal number
A generalization of "position in a well-ordered sequence" beyond the finite numbers 0,1,2,…0, 1, 2, \ldots, continuing through ω,ω+1,…,ω1,…\omega, \omega+1, \ldots, \omega_1, \ldots; ordinals index the stages of the constructible hierarchy.
First-order definable subset
A subset XX of a structure MM is first-order definable (with parameters) if X={x∈M:M⊨ψ(x,p1,…,pk)}X = \{ x \in M : M \models \psi(x, p_1, \ldots, p_k) \} for some logical formula ψ\psi and parameters p1,…,pk∈Mp_1, \ldots, p_k \in M — that is, XX can be pinned down by a finite logical sentence rather than chosen arbitrarily.
Knowledge used in this step