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 sum , product and exponentiation , and why they are written apart from the ordinal operations
Definition
Let and be cardinals (Cardinal (initial ordinal) and cardinality), and recall the notation of Disjoint union, cartesian product, function space and power set respect equinumerosity, and for ordinals the sets and carry explicit well-orders, so their cardinalities exist in ZF:
Sum and product.
Both values exist in ZF and are cardinals: claim (c) of Disjoint union, cartesian product, function space and power set respect equinumerosity, and for ordinals the sets and carry explicit well-orders, so their cardinalities exist in ZF well-orders each of the two sets explicitly, and 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 then supplies the least equinumerous ordinal. No choice principle is used.
Exponentiation.
the number of functions from a set of size to a set of size . The right-hand side is defined exactly when is well-orderable. Assuming the Axiom of Choice (The Axiom of Choice) every set is well-orderable (The well-ordering theorem) and is defined for all cardinals; every statement on this page that writes for an infinite exponent says so in its own hypotheses.
Transport to arbitrary sets. If and are well-orderable with and , then
whenever the sets on the left have cardinalities at all, because and (Equinumerous sets, and ) and the three constructions respect (claim (a) of Disjoint union, cartesian product, function space and power set respect equinumerosity, and for ordinals the sets and carry explicit well-orders, so their cardinalities exist in ZF, Injection, surjection, bijection). So the operations may be computed from any representatives.
Finite and infinite cardinals. A cardinal is finite when and infinite when , that is ; by trichotomy (Trichotomy and well-ordering of the ordinals) and is the least limit ordinal every cardinal is exactly one of the two.
Remarks
The symbols and are not decoration. Ordinal addition and ordinal multiplication (Ordinal addition , Ordinal multiplication ) are defined on the same objects — cardinals are ordinals — and give different values. With read as a cardinal, , whereas the ordinal sum is strictly larger than ; and , whereas the ordinal product is larger still. Writing both operations with and would make every equation on this page ambiguous, so the cardinal operations get their own symbols and the plain and on this page always mean the ordinal ones.
Exponentiation keeps the symbol, under a hard rule. There is no comparably readable alternative to , and Ordinal and cardinal are different operations that share one notation already records that is used for two different operations: as ordinals , while the cardinal counts the functions and is uncountable. The rule adopted here, and followed on this page and its companion, is:
In an exponential, the base and the exponent are always alephs, letters or expressions denoting cardinals — , , , , , — or a natural number read as a cardinal; never , never , and never a letter denoting an ordinal, such as .
So , and are cardinal exponentials, and an expression such as or is never written here at all. Where a value has to be named in both readings, the two are given different letters.
What is being counted, in each case. is the size of two disjoint blocks laid side by side; the tagging in is what makes "disjoint" true even though one of and is always a subset of the other, so their intersection is the smaller of the two. is the size of a rectangle. is the number of ways to choose a value in for each of positions, independently. None of the three is sensitive to the order in which the elements are arranged, which is exactly what distinguishes them from the ordinal operations (Ordinal exponentiation , with the conventions and included), whose values depend on the arrangement.
The zero and one cases are not special. and are cardinals (Ordinal (von Neumann)), and the definitions apply to them unchanged: , , and has exactly one element, the empty function. The resulting unit laws are proved rather than stipulated, in Commutativity, associativity, distributivity and monotonicity of and , the unit laws, the two exponent laws, and if and only if injects into .
Depends on
Disjoint union, cartesian product, function space and power set respect equinumerosity, and for ordinals the sets and carry explicit well-orders, so their cardinalities exist in ZF
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
Injection, surjection, bijection
The Axiom of Choice
The well-ordering theorem
Ordinal addition
Ordinal multiplication
Ordinal exponentiation , with the conventions and
Ordinal (von Neumann)
is the least limit ordinal
Trichotomy and well-ordering of the ordinals