How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
is regular in ZF; assuming the Axiom of Choice every successor aleph is regular; , so is singular, and under choice it is the least singular infinite cardinal
Statement
Let , regular and singular be as in Cofinality , and regular and singular cardinals, and let be as in The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and . Then:
(a) In ZF. , so is regular.
(b) Assuming the Axiom of Choice (The Axiom of Choice). is regular for every ordinal .
(c) In ZF. , and , so is singular.
(d) Assuming the Axiom of Choice. Every infinite cardinal below is regular, so is the least singular infinite cardinal.
Clause (b) is where the Axiom of Choice becomes indispensable, and the hypothesis is not decoration. The proof spends it once, to select an injection for each below the cofinality, and there is no canonical such family to fall back on: the sets are ordinals, but the injections are not determined by them. Clauses (a), (c) and the classification half of (d) are choice free.
Facts & Assumptions
Given: ZF, with the Axiom of Choice assumed only in clauses (b) and (d). Throughout, a map is called cofinal when its range is a cofinal subset of the target (Cofinal subset of an ordinal).
; for a limit ordinal , is an infinite cardinal; every cofinal has (; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained, Cofinality , and regular and singular cardinals).
is the least length of a cofinal map into , and a strictly increasing cofinal map of that length exists (Cofinality , and regular and singular cardinals, For every ordinal there is a least ordinal admitting a map with cofinal range, and that map may always be taken strictly increasing).
; is the least cardinal strictly above ; at limits; every is an infinite cardinal and the operation is strictly increasing (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and , The clauses at , at a successor and at a limit determine exactly one operation , in ZF, and — assuming the Axiom of Choice — exactly one operation ; each value is an infinite cardinal, each is strictly increasing and continuous at limits, and , For every set the Hartogs number is a cardinal, and for every cardinal it is the least cardinal strictly above ; this is a theorem of ZF).
Every infinite cardinal is a limit ordinal (claim (b) of Every natural number and are cardinals, every infinite cardinal is a limit ordinal, and on the natural numbers the cardinal operations are the published finite counting operations, with in the finite sense equal to in the cardinal sense, Successor and limit ordinals), and a cardinal is infinite exactly when , that is (Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations, Cardinal (initial ordinal) and cardinality).
For an infinite cardinal and a cardinal with , (Absorption: for cardinals with infinite and , , and when , Hessenberg: for every infinite cardinal , proved in ZF from the canonical well-order of , Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations).
For cardinals iff ; with both well-orderable gives ; is monotone (Commutativity, associativity, distributivity and monotonicity of and , the unit laws, the two exponent laws, and if and only if injects into ).
For a well-orderable set , is the least ordinal equinumerous with , satisfies and , and equals exactly when is a cardinal (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, Equinumerous sets, and ).
Every family of nonempty sets has a choice function (The Axiom of Choice, Choice function).
Ordinals satisfy trichotomy, iff or , the union of a set of ordinals is its least upper bound, every nonempty set of ordinals has an -least element, is the least limit ordinal, and every strictly increasing map of ordinals is injective (Trichotomy and well-ordering of the ordinals, Basic closure properties of ordinals, is the least limit ordinal, Injection, surjection, bijection).
Every infinite cardinal is for exactly one ordinal (Every infinite cardinal is for exactly one ordinal , in ZF; and, assuming the Axiom of Choice, every infinite set is equinumerous with exactly one aleph).
Proof
Claim (a): is a limit ordinal by [L9], so is an infinite cardinal by [L1], hence by [L4]; and by [L1], so .
The set exists by Replacement, is contained in and is cofinal in it, since by [L3] means every lies in some and hence satisfies ; moreover is injective by the strict increase in [L3], so and by [L7].
Setting up claim (b): let , , and suppose , with strictly increasing and cofinal by [L2]; then is a limit ordinal by [L4], so is an infinite cardinal by [L1], and because is a cardinal below the least cardinal strictly above ([L3]); moreover , since for the ordinal also lies in and is for some , putting .
Claim (c): step 1.2 and [L1] give ; and is an infinite cardinal, hence a limit ordinal by [L4], so is an infinite cardinal and by [L1] and [L4]; therefore by the strict increase in [L3], and is singular.
Claim (b): each of step 1.3 lies in , so is a cardinal below and hence by [L3] and [L7], and the set of injections is nonempty; a choice function from [L8] on supplies injections for all at once, and , with the -least having , is then an injection ; so by [L6] and [L5], contradicting , and therefore .
Claim (d) and the conclusion: an infinite cardinal is for exactly one by [L10], and , since would give by the strict increase in [L3]; so is , regular by step 1.1, or for some , regular by step 2.2; with step 2.1 this makes the least singular infinite cardinal.
Remarks
Why regularity of is not a theorem of ZF. The proof of clause (b) selects one injection for each below the cofinality, and that selection is the entire content of the choice hypothesis: a union of countably many countable sets is not provably countable in ZF, and the same phenomenon is what would otherwise force . The choice ledger at the end of this page records how far this can fail.
Why is singular for a completely different reason. Nothing is chosen in clause (c): the map is definable, and it is short and cofinal simply because the index is a limit ordinal reached from below in steps. Singularity of is therefore a fact about the index, not about the size, and clause (c) holds in ZF.
What "least singular" means and what it does not. Clause (d) locates among the alephs: everything below it is regular, under choice. It says nothing about which cardinals above are singular, and it says nothing about , whose position in the aleph hierarchy is not determined by anything on this page. What is determined is a constraint on that position, and it is Assuming the Axiom of Choice: for every infinite cardinal , and ; in particular .
Depends on
- $\operatorname{cf}(\alpha) \le \alpha$; $\operatorname{cf}(0) = 0$ and $\operatorname{cf}(\alpha + 1) = 1$; for a limit ordinal $\lambda$ the value $\operatorname{cf}(\lambda)$ is an infinite cardinal with $\operatorname{cf}(\operatorname{cf}(\lambda)) = \operatorname{cf}(\lambda)$, so it is regular; and every cofinal subset of $\lambda$ has cardinality at least $\operatorname{cf}(\lambda)$, a value that is attained
- Cofinality $\operatorname{cf}(\alpha)$, and regular and singular cardinals
- For every ordinal $\alpha$ there is a least ordinal $\beta$ admitting a map $\beta \to \alpha$ with cofinal range, and that map may always be taken strictly increasing
- Cofinal subset of an ordinal
- The successor cardinal $\kappa^{+}$, the alephs $\aleph_\alpha$, the beths $\beth_\alpha$, successor and limit cardinals, and the identifications $\aleph_0 = \omega$ and $\aleph_1 = \omega_1$
- The clauses at $0$, at a successor and at a limit determine exactly one operation $\alpha \mapsto \aleph_\alpha$, in ZF, and — assuming the Axiom of Choice — exactly one operation $\alpha \mapsto \beth_\alpha$; each value is an infinite cardinal, each is strictly increasing and continuous at limits, and $\alpha \le \aleph_\alpha$
- Every infinite cardinal is $\aleph_\alpha$ for exactly one ordinal $\alpha$, in ZF; and, assuming the Axiom of Choice, every infinite set is equinumerous with exactly one aleph
- For every set $A$ the Hartogs number $\aleph(A)$ is a cardinal, and for every cardinal $\kappa$ it is the least cardinal strictly above $\kappa$; this is a theorem of ZF
- Absorption: for cardinals $\kappa, \lambda$ with $\kappa$ infinite and $\lambda \le \kappa$, $\kappa \oplus \lambda = \kappa$, and $\kappa \otimes \lambda = \kappa$ when $\lambda \ne 0$
- Hessenberg: $\kappa \otimes \kappa = \kappa$ for every infinite cardinal $\kappa$, proved in ZF from the canonical well-order of $\kappa \times \kappa$
- Cardinal sum $\kappa \oplus \lambda$, product $\kappa \otimes \lambda$ and exponentiation $\kappa^{\lambda}$, and why they are written apart from the ordinal operations
- Commutativity, associativity, distributivity and monotonicity of $\oplus$ and $\otimes$, the unit laws, the two exponent laws, and $\kappa \le \lambda$ if and only if $\kappa$ injects into $\lambda$
- 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 $\lvert A \rvert$ in the finite sense equal to $\lvert A \rvert$ in the cardinal sense
- 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
- Cardinal (initial ordinal) and cardinality
- The Axiom of Choice
- Choice function
- Basic closure properties of ordinals
- Trichotomy and well-ordering of the ordinals
- Successor and limit ordinals
- $\omega$ is the least limit ordinal
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- Injection, surjection, bijection
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 128 results over 38 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- UCL, Axiomatic Set Theory, Ch. 4: Cardinal Arithmetic (standard reference, not scraped)
- Regular cardinal (Wikipedia) (standard reference, not scraped)
- Cofinality (Wikipedia) (standard reference, not scraped)