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.
Assuming the Axiom of Choice: , , , and has cofinality
Example
Assume the Axiom of Choice (The Axiom of Choice), which is what makes the beths available at all (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and ). Then
and
so is singular (Cofinality , and regular and singular cardinals).
The first three values are the definition unwound, once is known ( in ZF, by the Cantor set for one injection and by the cuts for the other; so under the Axiom of Choice) and once is available for an arbitrary set (Assuming the Axiom of Choice, , and Cantor's theorem in cardinal form: ). The last is the same cofinality argument that applies to , and for the same reason: the index is a limit reached by an -indexed family, and the beth operation is continuous at limits.
Facts & Assumptions
Given: The Axiom of Choice.
, , and at a limit ; 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 a well-orderable set , is the least ordinal equinumerous with , equinumerous sets receive the same one, and 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, Cardinal (initial ordinal) and cardinality, Equinumerous sets, and ); assuming the Axiom of Choice every set has a cardinality (The well-ordering theorem).
For a limit ordinal : is an infinite cardinal, and every cofinal satisfies (; 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, Cofinal subset of an ordinal).
Every infinite cardinal is a limit ordinal, and a cardinal is infinite exactly when (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).
is a limit ordinal; ordinals satisfy trichotomy, the union of a set of ordinals is its least upper bound, iff or , and every strictly increasing map of ordinals is injective ( is the least limit ordinal, Basic closure properties of ordinals, Trichotomy and well-ordering of the ordinals, Injection, surjection, bijection).
Verification
, by the two base clauses in [L1].
The set exists by Replacement, is contained in by the strict increase in [L1], and is cofinal in , since every lies in some and hence satisfies ; and is injective by that same strict increase, so and by [L4] and [L1].
by [L1] and step 1.1, and this equals by [L3].
is an infinite cardinal by [L1], hence a limit ordinal by [L6], so [L5] applied to step 1.2 gives , while is an infinite cardinal by [L5] and so by [L6]; hence by [L7], and by the strict increase in [L1].
by [L1], step 2.1 and [L2]; and by step 2.1.
Remarks
Where the beths and the alephs are known to agree, and where they are not. by the base clauses. Beyond that, this development proves ( under the Axiom of Choice, because is a cardinal strictly above and is the least such; so injects into ) and nothing sharper: whether is the continuum hypothesis, which What each result on this page costs in choice, and where the continuum escapes what ZFC can decide records as undecided by the axioms in use here.
Why is written two ways. As it is a cardinal computation; as it is a statement about a familiar set. The bridge is the general clause of Assuming the Axiom of Choice, , and Cantor's theorem in cardinal form: , applied at ; without it the two expressions would have to be related by hand.
Singularity at a limit index is generic, not special to . The computation of step 2.2 uses only that the operation is strictly increasing and continuous at , so it applies verbatim to (, computed from the cofinal map ) and to the fixed-point tower of An ordinal with , built as the supremum of the tower , and its cofinality is . What is not generic is the value of the cofinality at other limit indices, which depends on the index and not on the operation.
Depends on
- 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$
- Cardinal sum $\kappa \oplus \lambda$, product $\kappa \otimes \lambda$ and exponentiation $\kappa^{\lambda}$, and why they are written apart from the ordinal operations
- Assuming the Axiom of Choice, $2^{\kappa} = \lvert \mathcal{P}(\kappa) \rvert$, and Cantor's theorem in cardinal form: $\kappa < 2^{\kappa}$
- $\mathbb{R} \approx \mathcal{P}(\mathbb{N})$ in ZF, by the Cantor set for one injection and by the cuts $\{q \in \mathbb{Q} : q < x\}$ for the other; so $\lvert \mathbb{R} \rvert = 2^{\aleph_0}$ under the Axiom of Choice
- 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
- 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
- Cofinality $\operatorname{cf}(\alpha)$, and regular and singular cardinals
- $\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
- Cofinal subset of an ordinal
- The Axiom of Choice
- The well-ordering theorem
- Cardinal (initial ordinal) and cardinality
- Successor and limit ordinals
- $\omega$ is the least limit ordinal
- Basic closure properties of ordinals
- Trichotomy and well-ordering of the ordinals
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- Injection, surjection, bijection
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 165 results over 37 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
- Beth number (Wikipedia) (standard reference, not scraped)
- Cardinality of the continuum (Wikipedia) (standard reference, not scraped)