Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)verified 2026-07-26 (claude-opus-5)
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 X≈Y, and say X and Y are equinumerous, when there is a bijection X→Y.

An ordinal κ (Ordinal (von Neumann)) is a cardinal, equivalently an initial ordinal, when

no α∈κ satisfies α≈κ,

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 X be a set. Then X carries a well-order (The well-ordering theorem), which has an order type α (Every well-order has a unique order type) and in particular α≈X. Now α+=α∪{α} is an ordinal (Basic closure properties of ordinals, claim (c)) whose elements are ordinals (claim (a)) and which contains α, so C={ξ∈α+:ξ≈X} is a nonempty set of ordinals and has an ∈-least element κ (Trichotomy and well-ordering of the ordinals). This κ is the cardinality of X, written ∣X∣; it is a cardinal, because β∈κ with β≈κ≈X 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 X and an order type α for it, and X 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 X outright, a description in which neither the well-order nor α appears. Let β be any ordinal with β≈X. By trichotomy for ordinals (Trichotomy and well-ordering of the ordinals) exactly one of β∈α+, β=α+, α+∈β holds. In the first case β∈C, 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 α∈C, so κ⊆α by minimality, whence κ⊆β. In every case κ⊆β, that is κ≤β. So κ is the least element of the collection of all ordinals equinumerous with X, and any two runs of the recipe, from any two well-orders of X, return the same κ.

Remarks

  • What the well-definedness argument does and does not need. The obligation is that ∣X∣ depend on X alone, and it is discharged in the definition itself, from two lemmas that are genuine prerequisites of this item and therefore sit in deps rather than in justified_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 X" 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 ∣X∣ 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 A has a smallest ordinal ℵ(A) that does not inject into it.

  • Most ordinals are not cardinals. The successor ω+=ω∪{ω} is equinumerous with ω∈ω+, by the explicit bijection sending ω to 0 and each natural number n to σ(n), 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 N), proved on the countability page. Every natural number is an ordinal, and so is ω (ω is the least limit ordinal, claim (ii)); and if α∈n with n a natural number then α is itself a natural number, since N is a transitive set (On N the order is membership: m<n  ⟺  m∈n), with α<n by claim (i) of ω is the least limit ordinal. So if some α∈n had α≈n, claim 3 of the pigeonhole principle would force α=n and hence n∈n, which claim (b) of Basic closure properties of ordinals forbids; therefore n is a cardinal. And if some α∈ω had α≈ω, then α would be a natural number equinumerous with N=ω, 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 ℵ0,ℵ1,…, with ℵ0=ω. 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 N. Nothing below rests on it. The notation ℵ(A) for the Hartogs number of A (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 ℵ(A) is the successor cardinal of ∣A∣.

  • 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

Used by

…and 27 more results.

Dependency tree · two levels

39 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources