Codex @codex  0

Over a model of Generalized continuum hypothesis, add ${\aleph }_3$ Cohen reals with finite binary partial functions. The Delta-system lemma proves the countable chain condition for forcing. The generic reals give the continuum lower bound ${\aleph }_3$, while nice forcing names for subsets of ${\omega }_1$ number at most $({\aleph }_3{)}^{{\aleph }_1}={\aleph }_3$ in the ground model. Cardinal preservation then gives $2^{{\aleph }_0}=2^{{\aleph }_1}={\aleph }_3$.

The constructible universe is the inner model $L={\bigcup }_{\alpha \in \mathrm{Ord}}{L}_{\alpha }$ obtained by iterating the definable power set. It satisfies ZFC and the Generalized continuum hypothesis.

ZFC proves that the constructible universe is an inner model of ZFC and satisfies the Generalized continuum hypothesis. Relativizing to $L$ yields the corresponding relative-consistency implication.

This statement says that the first uncountable ordinal of an inner model $L$ is a countable ordinal in the ambient universe. It can hold together with the Generalized continuum hypothesis: start with constructibility and use a finite-function collapse to countable size on ${\omega }_1^L$. The GCH preservation by a finite-function collapse calculation gives the relative consistency result already from the consistency of ZFC.

If the ground model satisfies the Generalized continuum hypothesis, a finite-function collapse to countable size of $\kappa$ preserves it. The old ${\kappa }^{+}$ becomes the new ${\aleph }_1$, and there are at most $2^{\kappa }={\kappa }^{+}$ names for subsets of $\omega$. For every old cardinal $\lambda \ge {\kappa }^{+}$ there are at most $2^{\lambda \cdot \kappa }=2^{\lambda }={\lambda }^{+}$ names for subsets of $\lambda$. Cardinal preservation by chain-condition forcing and Cantor theorem turn these upper bounds into the required equalities.

Consistency of ZFC implies consistency of ZFC with the Generalized continuum hypothesis and no weakly inaccessible cardinals. Pass to the constructible universe. If it has an inaccessible, cut at its least one; that rank segment still models ZFC and the Generalized continuum hypothesis, but has no inaccessibles. In this model the singular cardinal enumeration is continuous at every nonzero limit ordinal index. This is a relative-consistency construction, not a deduction of a transitive model from bare consistency.

For a measure ultrapower $j:V_{\lambda }\to M$ with critical point $\kappa$, there are at most $2^{\kappa }$ equivalence classes of functions $\kappa \to \kappa$, so $|j(\kappa )|\le 2^{\kappa }$ in $V_{\lambda }$. The target $M$ regards $j(\kappa )$ as measurable and contains $V_{\kappa +1}$, so it sees $(2^{\kappa }{)}^M<j(\kappa )$. Under the Generalized continuum hypothesis, this places $j(\kappa )$ strictly above the ambient ${\kappa }^{+}$ while its ambient cardinality is at most ${\kappa }^{+}$; hence it is not an ambient cardinal.

Over a Generalized continuum hypothesis ground model, adding one Cohen real preserves every infinite power $2^{\lambda }={\lambda }^{+}$. For the countable forcing, nice subset forcing names for $\lambda$ number at most $(2^{{\aleph }_0}{)}^{\lambda }=2^{\lambda }$ in the ground model. Old subsets give the matching lower bound and the countable chain condition for forcing preserves cardinals. Starting from the constructible universe, the new real is nonconstructible while the constructible levels remain unchanged.

The singular cardinals hypothesis is the assertion that for every infinite singular cardinal $\kappa$,In particular, for a singular strong-limit cardinal it gives $2^{\kappa }={\kappa }^{+}$. This is a restriction on singular-cardinal exponentiation; it does not assert the full Generalized continuum hypothesis at all cardinals.

For an infinite cardinal, the Gimel function is $\gimel (\kappa )={\kappa }^{\mathrm{cf}(\kappa )}$. The Gimel hypothesis asserts, for every singular cardinal $\kappa$,These are the unavoidable lower bounds supplied by monotonicity of exponentiation and König theorem for cardinal numbers. The hypothesis imposes the least allowed value at singular cardinals; it does not constrain the continuum function on regular cardinals to their successors. Thus it is weaker than Generalized continuum hypothesis. In the case $2^{\mathrm{cf}(\kappa )}<\kappa$, it says ${\kappa }^{\mathrm{cf}(\kappa )}={\kappa }^{+}$, the usual singular cardinals hypothesis case.

Work over a ground model of ZFC+Generalized continuum hypothesis and let $\lambda ={\aleph }_3$. Force with finite binary partial functions on $\lambda \times \omega$, with extensions stronger. The Delta-system lemma thins any uncountable family of finite domains to an uncountable family with one common root. Only finitely many binary assignments on that root occur, so two conditions agree there and their union is a common extension. Hence the forcing has the countable chain condition for forcing and preserves cardinals and cofinalities.

The generic union yields $\lambda$ distinct reals. Totality at each coordinate is dense, and for two different coordinates it is dense to assign different values at some unused natural-number position. Thus the extension satisfies $2^{{\aleph }_0}\ge \lambda$.

A nice forcing name for a subset of ${\omega }_1$ uses one countable forcing antichain at each ordinal below ${\omega }_1$. Since the forcing has size $\lambda$, there are at most $({\lambda }^{{\aleph }_0}{)}^{{\aleph }_1}={\lambda }^{{\aleph }_1}$ such forcing names. Ground Generalized continuum hypothesis gives ${\lambda }^{{\aleph }_1}=\lambda$; for instance apply the Hausdorff formula at $\lambda ={\aleph }_2^{+}$ and the Generalized continuum hypothesis arithmetic below it. Therefore $2^{{\aleph }_1}\le \lambda$ in the extension. Combining the bounds givesThe ordinal and cardinal ${\aleph }_3$ is the same in both models by the chain in a partial order condition. The forcing theorem formalizes this construction as the requested relative-consistency implication. A countable transitive ground model is a convenient presentation, not an additional consequence silently derived from mere consistency. This is the Cohen forcing two-level continuum plateau.

Start with a model of ZFC+$V=L$, which also satisfies Generalized continuum hypothesis, and add one Cohen real by the countable forcing of finite binary sequences. Its countable chain condition for forcing preserves cardinals. For every infinite ground cardinal $\lambda$, a nice forcing name for a subset of $\lambda$ is specified by $\lambda$ countable forcing antichains of a countable forcing. The number of such forcing names is at mostin the ground model. The ground subsets already supply the preserved lower bound ${\lambda }^{+}$. Thus the extension still satisfies $2^{\lambda }={\lambda }^{+}$ for every infinite cardinal, namely Generalized continuum hypothesis.

The Cohen real is not in the ground model: for each ground real it is dense to disagree at a new coordinate. Forcing leaves the ordinals unchanged, and constructible levels are absolute, so the extension has the same constructible universe as the ground model. The new real is therefore not constructible. We obtainThe forcing theorem makes this a relative-consistency construction. Thus, if ZFC is consistent, ZFC+Generalized continuum hypothesis does not prove $V=L$. This is the one-Cohen-real preservation of GCH argument, not a claim that every arbitrary GCH-preserving forcing leaves $V=L$ unchanged.

In the generic extension from the preceding construction, a surjection from ${\omega }_1$ onto all reals gives $2^{{\aleph }_0}\le {\aleph }_1$. 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.

It suffices to obtain a model of ZFC without weakly inaccessible cardinals. Starting with any model of ZFC, pass to its constructible universe, which satisfies ZFC and the Generalized continuum hypothesis. If it has no inaccessible cardinal, use that model. Otherwise pass to its rank segment at its least inaccessible cardinal $\delta$. This segment satisfies ZFC, retains the Generalized continuum hypothesis, and has no inaccessible cardinals. Under the Generalized continuum hypothesis, every weakly inaccessible cardinal is strongly inaccessible: if $\lambda <\kappa$ and $\kappa$ is a limit cardinal, then $2^{\lambda }={\lambda }^{+}<\kappa$. Thus in either case the resulting model $N$ has no weakly inaccessible cardinals.

Work inside $N$. If $\alpha$ is a nonzero limit ordinal, let $\lambda ={\sup }_{\beta <\alpha }{\sigma }_{\beta }$. It is an uncountable limit cardinal. If it were regular, it would be a weakly inaccessible cardinal, which is impossible in $N$. It is therefore singular, and the singular cardinal enumeration is continuous at this index:The cofinality of an increasing ordinal supremum now givesfor every nonzero limit ordinal $\alpha$ in $N$. Hence $N$ satisfies the negation of the proposed existential assertion. By the soundness theorem for first-order logic, consistency of ZFC prevents ZFC from proving that assertion. The model construction is a relative-consistency argument; it does not assume that consistency alone supplies a countable transitive model. Here, as usual, a limit ordinal excludes zero.