This is the Rasiowa–Sikorski lemma. Put and recursively choose
using density. Set
It contains , is upward closed toward weaker conditions, and is directed: if and , then is a common stronger condition in . It meets each through . Thus is the required generic filter for the prescribed countable family of dense sets. For a countable transitive model, externally enumerate its dense sets to obtain a generic filter over the model by this same argument.
The PDF's middle equality is , concerning ordinal exponentiation. The TeX incorrectly turns the exponent into a subscript; preserving would be incompatible with forcing CH over many ground models.
Let and use the countable-condition collapse of onto :
ordered by extension. Countable unions give lower bounds, so closed forcing adds no short ordinal sequences; in particular it adds no reals and preserves . Dense requirements ensure that the union of the generic filter is a total surjection . Thus
Finally forcing preserves ordinals, and the recursion defining ordinal multiplication and exponentiation is absolute. Both models compute as the same order type of successive copies of . This proves the printed middle equality too. Higher cardinals may collapse, which is allowed by the actual PDF.
In the generic extension from the preceding construction, a surjection from onto all reals gives . Cantor theorem gives the reverse inequality, so the Continuum hypothesis holds.
For the exact consistency-strength statement, existence of a countable transitive model is stronger than bare consistency of ZFC. One can formalize the forcing proof syntactically, or use the constructible universe theorem: ZFC proves that its constructible universe satisfies ZFC and the Generalized continuum hypothesis. If there is any model of ZFC, its internal constructible universe is therefore a model of ZFC with CH. By the Godel completeness theorem,
This deduction does not silently replace consistency by existence of a transitive model.

Articles by others on the same topic (0)

There are currently no matching articles.