Cardinal exponentiation 2026-10-31
Cardinal exponentiation counts functions from a set of size to one of size . The currying law for cardinal exponentiation gives . These are cardinal operations, distinct from ordinal exponentiation. For example the Generalized continuum hypothesis specifies at infinite cardinals.
Over a model of Generalized continuum hypothesis, add 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 , while nice forcing names for subsets of number at most in the ground model. Cardinal preservation then gives .
Constructible universe Created 2026-10-03 Updated 2026-10-05
The constructible universe is the inner model 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 yields the corresponding relative-consistency implication.
Countability of constructible omega-one Created 2026-10-05 Updated 2026-10-06
This statement says that the first uncountable ordinal of an inner model 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 . The GCH preservation by a finite-function collapse calculation gives the relative consistency result already from the consistency of ZFC.
Put . ZFC gives . König's theorem and the shift of product coordinates give . The single instance of the generalized continuum hypothesis therefore fixes all three displayed values. The strict lower bound explains why countable exponentiation cannot leave this singular cardinal unchanged.
If the ground model satisfies the Generalized continuum hypothesis, a finite-function collapse to countable size of preserves it. The old becomes the new , and there are at most names for subsets of . For every old cardinal there are at most names for subsets of . Cardinal preservation by chain-condition forcing and Cantor theorem turn these upper bounds into the required equalities.
Assume the Generalized continuum hypothesis. For necessity, König theorem for cardinal numbers gives for every infinite cardinal. But implies by the currying law for cardinal exponentiation, so . This direction uses only ZFC. Conversely, uncountable cofinality bounds the range of every countable sequence in . Under GCH, each smaller infinite cardinal satisfies . There are only ordinal bounds to consider, giving and the representation with base and exponent .
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 with critical point , there are at most equivalence classes of functions , so in . The target regards as measurable and contains , so it sees . Under the Generalized continuum hypothesis, this places strictly above the ambient while its ambient cardinality is at most ; hence it is not an ambient cardinal.
Over a Generalized continuum hypothesis ground model, adding one Cohen real preserves every infinite power . For the countable forcing, nice subset forcing names for number at most 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.
For GCH arithmetic at aleph omega, let . Use monotonicity of cardinal exponentiation, the law , and for infinite cardinals in ZFC. Since ,
Thus , and the generalized continuum hypothesis yields
The lower bound embeds binary-valued functions into -valued ones; the upper bound codes each value by a subset and combines the resulting pairs of indices. In particular the equality before applying the hypothesis is a ZFC equality.
The product from the preceding part injects into , where , because each coordinate value is an ordinal below . Combining its strict König lower bound with the exponentiation upper bound gives
Hence
Only the instance of the generalized continuum hypothesis was needed in these three computations, though the question assumes the full hypothesis. No assumption that countable exponentiation leaves this singular cardinal unchanged is valid: König's theorem rules that out.
The generalized continuum hypothesis is
Equivalently, for every ordinal , . Here is the cardinality of the power set of a set of cardinality , and is the least strictly larger cardinal. The hypothesis says that no intermediate cardinal lies between an infinite set and its power set.
The aleph numbers enumerate the infinite initial ordinals by transfinite recursion:
Here is the least cardinal strictly larger than . The Generalized continuum hypothesis is
equivalently for every ordinal in ZFC.
For , monotonicity of cardinal exponentiation gives
The middle equality uses the currying law for cardinal exponentiation, and the final one uses . Hence , even before assuming GCH. Applying the Generalized continuum hypothesis yields
Constant functions give the lower bound . By the Generalized continuum hypothesis, . The currying law for cardinal exponentiation and infinite cardinal arithmetic therefore give
Hence .
The singular cardinals hypothesis is the assertion that for every infinite singular cardinal ,
In particular, for a singular strong-limit cardinal it gives . 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 . The Gimel hypothesis asserts, for every singular cardinal ,
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 , it says , the usual singular cardinals hypothesis case.
Work over a ground model of ZFC+Generalized continuum hypothesis and let . Force with finite binary partial functions on , 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 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 .
A nice forcing name for a subset of uses one countable forcing antichain at each ordinal below . Since the forcing has size , there are at most such forcing names. Ground Generalized continuum hypothesis gives ; for instance apply the Hausdorff formula at and the Generalized continuum hypothesis arithmetic below it. Therefore in the extension. Combining the bounds gives
The ordinal and cardinal 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.