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 Cantor's theorem in cardinal form:
Statement
Assume the Axiom of Choice (The Axiom of Choice), so that every set has a cardinality (The well-ordering theorem, 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). Let be a cardinal (Cardinal (initial ordinal) and cardinality) and read as a cardinal. Then:
(a) (Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations), and more generally for every set ;
(b) .
Clause (b) is Cantor's theorem: transcribed into cardinal arithmetic. The underlying combinatorial fact — that there is no surjection — is a theorem of ZF and needs no choice at all; what the Axiom of Choice buys here is only the right to write and as cardinals in the first place.
Facts & Assumptions
Given: The Axiom of Choice, a cardinal , and a set .
, where is the set of functions (Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations).
There is no surjection , and , that is and (Cantor's theorem: , Equinumerous sets, and ).
For a well-orderable , , the value is a cardinal, and equinumerous sets receive the same one (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).
For cardinals, if and only if ; and with both well-orderable gives (claim (a) of Commutativity, associativity, distributivity and monotonicity of and , the unit laws, the two exponent laws, and if and only if injects into ).
Assuming the Axiom of Choice every set is well-orderable, hence has a cardinality (The Axiom of Choice, The well-ordering theorem).
Ordinals satisfy trichotomy, and a map with a two-sided inverse is a bijection (Trichotomy and well-ordering of the ordinals, Injection, surjection, bijection).
Proof
The map sending to its characteristic function, for and otherwise, has the two-sided inverse , so it is a bijection and .
By [L2], and .
Claim (a): by [L6] both and have cardinalities, equal by step 1.1 and [L3], so by [L1]; and for an arbitrary set , by [L3] gives by [L4], hence .
By [L5] applied to step 1.2, ; and , since otherwise by [L3], contradicting step 1.2.
Therefore by trichotomy, which with step 2.1 is claim (b).
Remarks
Why and not some other base. The characteristic function of a subset takes two values, so the power set is the function space with base ; that is the whole content of step 1.1, and it is why rather than is the object cardinal arithmetic manipulates. For infinite , any base with gives the same value once , by monotonicity, the second exponent law and Hessenberg: for every infinite cardinal , proved in ZF from the canonical well-order of , and the companion page computes one such case; for finite the bases genuinely differ, .
No fixed point. Clause (b) holds for every cardinal, so no cardinal satisfies and the hierarchy of cardinals never terminates. The corresponding statement one level up — that has no fixed point — is false, and the companion page exhibits one; the two operations behave quite differently, and it is the power operation, not the successor operation, that is unboundedly expansive.
Where the Axiom of Choice is and is not spent. Cantor's theorem: is choice free, and so is step 1.1. The hypothesis is used only to know that a set has a cardinality: at and at for clause (b), and again at and in the general form of clause (a). In ZF alone, may fail to be well-orderable, and then is not an ordinal and the inequality of clause (b) has no cardinal to compare with — while the underlying statement "there is no surjection " remains a theorem.
Depends on
Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations
Cantor's theorem:
Equinumerous sets, 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
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
Commutativity, associativity, distributivity and monotonicity of and , the unit laws, the two exponent laws, and if and only if injects into
Cardinal (initial ordinal) and cardinality
The Axiom of Choice
The well-ordering theorem
Trichotomy and well-ordering of the ordinals