What each result on this page costs in choice, and where the continuum escapes what ZFC can decide

This item is bookkeeping, in the manner of The proved choice ledger: hypotheses, equivalences, and upper bounds: it records what each result stated here actually costs, so that anything quoting a result from this page knows whether it is quoting a theorem of ZF or a consequence of the Axiom of Choice (The Axiom of Choice).

Theorems of ZF, using no choice principle at all.

• A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used: a well-orderable set has a least equinumerous ordinal, that ordinal is a cardinal, and equinumerous sets receive the same one. The choice hypothesis of Cardinal (initial ordinal) and cardinality is needed only to make every set well-orderable.
• Disjoint union, cartesian product, function space and power set respect equinumerosity, and for ordinals $\alpha ,\beta$ the sets $\alpha \bigsqcup \beta$ and $\alpha \times \beta$ carry explicit well-orders, so their cardinalities exist in ZF, and with it $\oplus$ and $\otimes$ of Cardinal sum $\kappa \oplus \lambda$, product $\kappa \otimes \lambda$ and exponentiation ${\kappa }^{\lambda }$, and why they are written apart from the ordinal operations. The disjoint union and the product of two ordinals are well-ordered by orders written down from the ordinal order.
• Every natural number and $\omega$ are cardinals, every infinite cardinal is a limit ordinal, and on the natural numbers the cardinal operations are the published finite counting operations, with $\mid A\mid$ in the finite sense equal to $\mid A\mid$ in the cardinal sense, the dictionary with finite counting.
• Hessenberg: $\kappa \otimes \kappa =\kappa$ for every infinite cardinal $\kappa$, proved in ZF from the canonical well-order of $\kappa \times \kappa$ and its consequence Absorption: for cardinals $\kappa ,\lambda$ with $\kappa$ infinite and $\lambda \le \kappa$, $\kappa \oplus \lambda =\kappa$, and $\kappa \otimes \lambda =\kappa$ when $\lambda \mathrm{\ne }0$.
• For every set $A$ the Hartogs number $\mathrm{\aleph }(A)$ is a cardinal, and for every cardinal $\kappa$ it is the least cardinal strictly above $\kappa$; this is a theorem of ZF, and with it the whole aleph hierarchy: The clauses at $0$, at a successor and at a limit determine exactly one operation $\alpha \mapsto {\mathrm{\aleph }}_{\alpha }$, in ZF, and — assuming the Axiom of Choice — exactly one operation $\alpha \mapsto {\mathrm{\beth }}_{\alpha }$; each value is an infinite cardinal, each is strictly increasing and continuous at limits, and $\alpha \le {\mathrm{\aleph }}_{\alpha }$ and The successor cardinal ${\kappa }^{+}$, the alephs ${\mathrm{\aleph }}_{\alpha }$, the beths ${\mathrm{\beth }}_{\alpha }$, successor and limit cardinals, and the identifications ${\mathrm{\aleph }}_0=\omega$ and ${\mathrm{\aleph }}_1={\omega }_1$ in their aleph clauses, and clause (a) of Every infinite cardinal is ${\mathrm{\aleph }}_{\alpha }$ for exactly one ordinal $\alpha$, in ZF; and, assuming the Axiom of Choice, every infinite set is equinumerous with exactly one aleph.
• Cofinality $\mathrm{cf}(\alpha )$, and regular and singular cardinals and $\mathrm{cf}(\alpha )\le \alpha$; $\mathrm{cf}(0)=0$ and $\mathrm{cf}(\alpha +1)=1$; for a limit ordinal $\lambda$ the value $\mathrm{cf}(\lambda )$ is an infinite cardinal with $\mathrm{cf}(\mathrm{cf}(\lambda ))=\mathrm{cf}(\lambda )$, so it is regular; and every cofinal subset of $\lambda$ has cardinality at least $\mathrm{cf}(\lambda )$, a value that is attained; and clauses (a) and (c) of ${\mathrm{\aleph }}_0$ is regular in ZF; assuming the Axiom of Choice every successor aleph ${\mathrm{\aleph }}_{\alpha +1}$ is regular; $\mathrm{cf}({\mathrm{\aleph }}_{\omega })={\mathrm{\aleph }}_0$, so ${\mathrm{\aleph }}_{\omega }$ is singular, and under choice it is the least singular infinite cardinal, that ${\mathrm{\aleph }}_0$ is regular and $\mathrm{cf}({\mathrm{\aleph }}_{\omega })={\mathrm{\aleph }}_0$.

Costing the Axiom of Choice, and named as such in their own statements.

• Cardinal exponentiation ${\kappa }^{\lambda }$ itself, because ZF does not well-order a set of functions. Everything reached through it inherits the hypothesis: Assuming the Axiom of Choice, $2^{\kappa }=\mid \mathcal{P}(\kappa )\mid$, and Cantor's theorem in cardinal form: $\kappa <2^{\kappa }$, the beth clauses of The successor cardinal ${\kappa }^{+}$, the alephs ${\mathrm{\aleph }}_{\alpha }$, the beths ${\mathrm{\beth }}_{\alpha }$, successor and limit cardinals, and the identifications ${\mathrm{\aleph }}_0=\omega$ and ${\mathrm{\aleph }}_1={\omega }_1$, The sum ${\sum }_{i\in I}{\kappa }_i$ and the product ${\prod }_{i\in I}{\kappa }_i$ of an indexed family of cardinals, defined under the Axiom of Choice, König's theorem: assuming the Axiom of Choice, if ${\kappa }_i<{\lambda }_i$ for every $i\in I$ then ${\sum }_{i\in I}{\kappa }_i<{\prod }_{i\in I}{\lambda }_i$ and Assuming the Axiom of Choice: $\kappa <{\kappa }^{\mathrm{cf}(\kappa )}$ for every infinite cardinal $\kappa$, and $\mathrm{cf}(2^{\kappa })>\kappa$; in particular $\mathrm{cf}(2^{{\mathrm{\aleph }}_0})>{\mathrm{\aleph }}_0$.
• Clause (b) of Every infinite cardinal is ${\mathrm{\aleph }}_{\alpha }$ for exactly one ordinal $\alpha$, in ZF; and, assuming the Axiom of Choice, every infinite set is equinumerous with exactly one aleph, that an arbitrary infinite set is equinumerous with an aleph.
• Clauses (b) and (d) of ${\mathrm{\aleph }}_0$ is regular in ZF; assuming the Axiom of Choice every successor aleph ${\mathrm{\aleph }}_{\alpha +1}$ is regular; $\mathrm{cf}({\mathrm{\aleph }}_{\omega })={\mathrm{\aleph }}_0$, so ${\mathrm{\aleph }}_{\omega }$ is singular, and under choice it is the least singular infinite cardinal, that successor alephs are regular and that ${\mathrm{\aleph }}_{\omega }$ is the least singular infinite cardinal.

Equivalent to the Axiom of Choice over ZF, so neither weaker nor stronger: comparability of arbitrary sets (Comparability of arbitrary sets, that any two sets admit an injection one way or the other, is equivalent to the Axiom of Choice) and Tarski's square law (Tarski: the Axiom of Choice is equivalent to the statement that $A\times A\approx A$ for every infinite set $A$, so extending Hessenberg's theorem from the alephs to arbitrary sets is exactly as strong as choice). The first is recorded in The proved choice ledger: hypotheses, equivalences, and upper bounds as Hartogs' result, quoted there and proved here.

Countable choice (The Axiom of Countable Choice (${\mathrm{A}\mathrm{C}}_{\omega }$)) is not used anywhere on this page. Where an argument might have needed it, the ordinal structure supplied a canonical least element instead.

What the hypotheses do and do not say. The regularity results named above carry their choice hypotheses explicitly. This ledger records the proofs under those hypotheses; it makes no model-theoretic claim that the hypotheses are necessary. That lower-bound question belongs to the later choiceless-model development.

What this page therefore does and does not settle about $2^{{\mathrm{\aleph }}_0}$. It settles that $2^{{\mathrm{\aleph }}_0}$ is an aleph, granted choice; that it is strictly above ${\mathrm{\aleph }}_0$; and that its cofinality is uncountable. It proves no exact value and makes no independence claim.