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.
Cardinal (initial ordinal) and cardinality
Definition
Write , and say and are equinumerous, when there is a bijection .
An ordinal (Ordinal (von Neumann)) is a cardinal, equivalently an initial ordinal, when
that is, is not equinumerous with any strictly smaller ordinal.
Cardinality, under the Axiom of Choice. Assume the Axiom of Choice (The Axiom of Choice) and let be a set. Then carries a well-order (The well-ordering theorem), which has an order type (Every well-order has a unique order type) and in particular . Now is an ordinal (Basic closure properties of ordinals, claim (c)) whose elements are ordinals (claim (a)) and which contains , so is a nonempty set of ordinals and has an -least element (Trichotomy and well-ordering of the ordinals). This is the cardinality of , written ; it is a cardinal, because with would lie in and contradict the minimality of .
Well-definedness: does not depend on the well-order or on . The recipe above instantiates a well-order of and an order type for it, and will in general carry many well-orders with many different order types, so the value has to be shown independent of both. It is, because is in fact the least ordinal equinumerous with outright, a description in which neither the well-order nor appears. Let be any ordinal with . By trichotomy for ordinals (Trichotomy and well-ordering of the ordinals) exactly one of , , holds. In the first case , so by minimality of . In the other two cases claim (f) of Basic closure properties of ordinals gives , and because , so and hence by claim (f) again; and , so by minimality, whence . In every case , that is . So is the least element of the collection of all ordinals equinumerous with , and any two runs of the recipe, from any two well-orders of , return the same .
Remarks
-
What the well-definedness argument does and does not need. The obligation is that depend on alone, and it is discharged in the definition itself, from two lemmas that are genuine prerequisites of this item and therefore sit in
depsrather than injustified_by: comparability and trichotomy of ordinals (Trichotomy and well-ordering of the ordinals) and the elementary closure facts (Basic closure properties of ordinals). Neither mentions cardinals, so neither points forward, and no separate discharging lemma is needed. The bound is a device for turning "the least ordinal equinumerous with " into a Separation instance over a set; the argument above is what shows that the device does not change the answer. -
The definition is choice-free; the cardinality assignment is not. Being a cardinal is a property of an ordinal and needs no axiom beyond ZF. Attaching a cardinality to an arbitrary set is a different matter: a set that carries no well-order is equinumerous with no ordinal at all, so simply does not exist for it. Without the Axiom of Choice there is no ordinal-valued notion of size for arbitrary sets, and what survives is Hartogs: an ordinal that does not inject into a given set: every set has a smallest ordinal that does not inject into it.
-
Most ordinals are not cardinals. The successor is equinumerous with , by the explicit bijection sending to and each natural number to , which is a bijection because is injective and its image is exactly the nonzero natural numbers. So is an ordinal and not a cardinal, and the same shift applies to the successor of any ordinal containing . Cardinals are sparse among ordinals, which is precisely why the least one equinumerous with a given set is a useful representative.
-
Which ordinals up to and including are cardinals. Every natural number is a cardinal, and so is . Both facts are counting facts rather than order facts, and both come from the pigeonhole principle (The pigeonhole principle on ), proved on the countability page. Every natural number is an ordinal, and so is ( is the least limit ordinal, claim (ii)); and if with a natural number then is itself a natural number, since is a transitive set (On the order is membership: ), with by claim (i) of is the least limit ordinal. So if some had , claim 3 of the pigeonhole principle would force and hence , which claim (b) of Basic closure properties of ordinals forbids; therefore is a cardinal. And if some had , then would be a natural number equinumerous with , which claim 4 of the pigeonhole principle forbids; therefore is a cardinal. Nothing else on this page depends on either fact, and the definition above is stated so that it does not.
-
Notation. The infinite cardinals are traditionally written , with . That last equation can now be stated outright rather than quoted: it says is the least ordinal equinumerous with , which is precisely the assertion that is a cardinal, established in the previous remark from claim 4 of The pigeonhole principle on . Nothing below rests on it. The notation for the Hartogs number of (Hartogs: an ordinal that does not inject into a given set) comes from the same source and is deliberately close: under the Axiom of Choice is the successor cardinal of .
-
Why initial ordinals rather than equivalence classes. The natural definition of "cardinal" as the class of all sets equinumerous with a given one never yields a set, for the same reason as in Burali-Forti: there is no set of all ordinals. Choosing the least ordinal in the class is von Neumann's fix, and it works exactly when the class contains an ordinal, which is exactly when the set can be well ordered.
Depends on
- Ordinal (von Neumann)
- Basic closure properties of ordinals
- Trichotomy and well-ordering of the ordinals
- Every well-order has a unique order type
- The well-ordering theorem
- Hartogs: an ordinal that does not inject into a given set
- The Axiom of Choice
- $\omega$ is the least limit ordinal
- On $\mathbb{N}$ the order is membership: $m < n \iff m \in n$
- The pigeonhole principle on $\mathbb{N}$
Used by
- Absorption: for cardinals κ, λ with κ infinite and λ ≤ κ, κ ⊕ λ = κ, and κ ⊗ λ = κ when λ ≠ 0 Corollary
- Assuming the Axiom of Choice: κ < κ^cf(κ) for every infinite cardinal κ, and cf(2^κ) > κ; in particular cf(2^ℵ₀) > ℵ₀ Corollary
- The clauses at 0, 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 α ≤ ℵ_α Corollary
- Cardinal sum κ ⊕ λ, product κ ⊗ λ and exponentiation κ^λ, and why they are written apart from the ordinal operations Definition
- Cofinality cf(α), and regular and singular cardinals Definition
- The successor cardinal κ⁺, the alephs ℵ_α, the beths ℶ_α, successor and limit cardinals, and the identifications ℵ₀ = ω and ℵ₁ = ω₁ Definition
- The sum ∑_i ∈ I κᵢ and the product ∏_i ∈ I κᵢ of an indexed family of cardinals, defined under the Axiom of Choice Definition
- Under choice, Lindelöf degree L(X) and cellularity c(X) as raw cardinal functions Definition
- Under choice, weight w(X), density d(X), local character χ(x,X), and character χ(X) as raw cardinal minima and a supremum Definition
- An ordinal α with ℵ_α = α, built as the supremum of the tower ℵ₀, ℵ_ℵ₀, ℵ_ℵ_ℵ₀, …, and its cofinality is ℵ₀ Example
- Assuming countable choice, cf(ℵ_ω₁) = ℵ₁, so singular does not mean of countable cofinality Example
- Assuming the Axiom of Choice: ℵ₀^ℵ₀ = 2^ℵ₀ and | ℝ^ℝ | = 2^2^ℵ₀, computed from the exponent laws and Hessenberg Example
- Assuming the Axiom of Choice: ℶ₀ = ℵ₀, ℶ₁ = 2^ℵ₀ = | ℝ |, ℶ₂ = | P(ℝ) |, and ℶ_ω has cofinality ℵ₀ Example
- cf(ℵ_ω) = ℵ₀, computed from the cofinal map n ↦ ℵₙ Example
- ℝ ≈ P(ℕ) in ZF, by the Cantor set for one injection and by the cuts {q ∈ ℚ : q < x} for the other; so | ℝ | = 2^ℵ₀ under the Axiom of Choice Example
- ℵ₀ ⊕ ℵ₀ = ℵ₀ ⊗ ℵ₀ = ℵ₀, ℵ₁ ⊕ ℵ₀ = ℵ₁ and 5 ⊕ ℵ₀ = ℵ₀, computed from absorption and, in the countable cases, independently from the published bijection ω × ω ≈ ω Example
- ℵ₁ ≤ 2^ℵ₀ under the Axiom of Choice, because 2^ℵ₀ is a cardinal strictly above ℵ₀ and ℵ₁ is the least such; so ω₁ injects into ℝ Example
- FALSE: 2^ℵ₀ = ℵ_ω False statement
- FALSE: κ < λ implies κ^μ < λ^μ False statement
- FALSE: κ ⊕ μ = λ ⊕ μ implies κ = λ False statement
- FALSE: ℵ_α is regular for every ordinal α False statement
- 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 Lemma
- Commutativity, associativity, distributivity and monotonicity of ⊕ and ⊗, the unit laws, the two exponent laws, and κ ≤ λ if and only if κ injects into λ Lemma
- Disjoint union, cartesian product, function space and power set respect equinumerosity, and for ordinals α, β the sets α sqcup β and α × β carry explicit well-orders, so their cardinalities exist in ZF Lemma
- For every set A the Hartogs number ℵ(A) is a cardinal, and for every cardinal κ it is the least cardinal strictly above κ; this is a theorem of ZF Lemma
- Under choice, c(X) is a well-defined cardinal Lemma
- Under choice, d(X) is a well-defined cardinal Lemma
- Under choice, L(X) is a well-defined cardinal Lemma
- Under choice, w(X) is a well-defined cardinal Lemma
- Under choice, χ(x,X) and χ(X) are well-defined cardinals Lemma
- Ordinal α^β and cardinal κ^λ are different operations that share one notation Remark
- The choice ledger: what costs the Axiom of Choice and what does not Remark
- What each result on this page costs in choice, and where the continuum escapes what ZFC can decide Remark
- Assuming the Axiom of Choice, 2^κ = | P(κ) |, and Cantor's theorem in cardinal form: κ < 2^κ Theorem
- cf(α) ≤ α; cf(0) = 0 and cf(α + 1) = 1; for a limit ordinal λ the value cf(λ) is an infinite cardinal with cf(cf(λ)) = cf(λ), so it is regular; and every cofinal subset of λ has cardinality at least cf(λ), a value that is attained Theorem
- Comparability of arbitrary sets, that any two sets admit an injection one way or the other, is equivalent to the Axiom of Choice Theorem
- 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 Theorem
- 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 | A | in the finite sense equal to | A | in the cardinal sense Theorem
- Hessenberg: κ ⊗ κ = κ for every infinite cardinal κ, proved in ZF from the canonical well-order of κ × κ Theorem
- König's theorem: assuming the Axiom of Choice, if κᵢ < λᵢ for every i ∈ I then ∑_i ∈ I κᵢ < ∏_i ∈ I λᵢ Theorem
…and 3 more results.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 59 results over 19 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
- Cardinal number (Wikipedia) (standard reference, not scraped)
- Von Neumann cardinal assignment (Wikipedia) (standard reference, not scraped)
- J. T. Moore, MATH 6870: Set Theory (standard reference, not scraped)
- Ordinal number (Wikipedia) (standard reference, not scraped)