MathLabs

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

Step 5 of 9: Forcing: growing a bigger universe from finite scraps of information
In plain words

Imagine trying to reveal a brand-new infinite binary sequence (a new real number) one digit at a time, where you are only ever allowed to commit to finitely many digits at once, and once a digit is written it can never be erased. A "condition" is such a finite scrap of the sequence; stronger conditions simply fill in more digits without contradicting the weaker ones.

Cohen's idea (1963) was to reveal not just one but ℵ2\aleph_2-many such sequences at once, side by side, using conditions that are finite pieces of all of them simultaneously. Choosing an infinitely careful, maximally informative way of picking these finite scraps — a "generic filter" — produces a brand-new mathematical universe containing real numbers that never existed before.

P=Fn(ℵ2×ω,2),q≤p  ⟺  q⊇p\mathbb{P} = \mathrm{Fn}(\aleph_2 \times \omega, 2), \qquad q \le p \iff q \supseteq p
Detailed analysis

Cohen's forcing poset P=Fn(ℵ2×ω,2)\mathbb{P} = \mathrm{Fn}(\aleph_2 \times \omega, 2) consists of all finite partial functions pp from ℵ2×ω\aleph_2 \times \omega into {0,1}\{0,1\} (a "condition" fixes finitely many bits, indexed by which of the ℵ2\aleph_2 sequences and which position in it), ordered by reverse inclusion: q≤pq \le p ("qq is stronger") exactly when q⊇pq \supseteq p, i.e. qq agrees with pp wherever pp is defined and decides strictly more.

A filter G⊆PG \subseteq \mathbb{P} is generic (over a ground model VV) if it meets every dense subset of P\mathbb{P} that belongs to VV — informally, GG eventually answers every question about the sequences that could be asked using only information already in VV. Cohen (1963, 1964) showed such generic filters exist (by a Rasiowa–Sikorski style argument, since VV only has countably many dense sets to worry about relative to P\mathbb{P}, when working one real at a time) and that fG=⋃p∈Gpf_G = \bigcup_{p \in G} p assembles into ℵ2\aleph_2 genuinely new total binary sequences, i.e. new real numbers, forming the generic extension V[G]V[G].

Because GG itself is deliberately chosen from outside VV, V[G]V[G] strictly extends VV with new sets while keeping every old set of VV intact. The next step shows V[G]V[G] still satisfies all of ZFC\mathrm{ZFC}, and that these ℵ2\aleph_2 new reals are forced to be genuinely distinct from each other.

Terms in this step
Forcing condition
An element pp of the forcing poset P\mathbb{P}: a finite, partial piece of information about the object being built. Conditions can be extended (strengthened) to reveal more information, but never contradicted.
Generic filter
A filter GG on a forcing poset that meets every dense subset present in the ground model VV; it is chosen from outside VV and encodes exactly enough decisions to determine a genuinely new mathematical object not already present in VV.
Knowledge used in this step