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.
FALSE: implies
Statement
FALSE. Cardinal addition is cancellative: for all cardinals (Cardinal (initial ordinal) and cardinality, Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations),
The claim is plausible because it is true for finite cardinals, where is the ordinary addition of natural numbers (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) and cancellation is a Peano fact. It fails at the first infinite cardinal, and it fails for the same reason that infinite arithmetic is easy: absorption (Absorption: for cardinals with infinite and , , and when ) makes throw away the smaller argument, and an operation that forgets one of its inputs cannot be cancelled.
Facts & Assumptions
Given: The cardinal operations of Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations and the cardinals and .
For an infinite cardinal and a cardinal : (Absorption: for cardinals with infinite and , , and when ).
Every natural number is a cardinal, is a cardinal, 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, Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations).
(The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and ); is the least limit ordinal and ( is the least limit ordinal).
Ordinals satisfy trichotomy, iff or , and (Trichotomy and well-ordering of the ordinals, Basic closure properties of ordinals).
Refutation
Suppose, for contradiction, that the displayed claim holds for all cardinals .
By [L3] and [L4] the ordinals and are cardinals, is infinite, and hence , and by [L5].
By [L1] with and , ; and by [L2] and [L1] with , .
So the hypothesis of the assumed claim holds at , , , and the claim would give , which step 1.2 forbids; therefore cardinal addition is not cancellative.
Remarks
The finite case really is cancellative, and nothing above contradicts it. For read as cardinals, is by 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, and Peano addition is cancellative. The witness above is forced to use an infinite , and once is infinite every gives the same sum.
Multiplication fails in the same way, and for the same reason. Absorption: for cardinals with infinite and , , and when also gives with , so is not cancellative either, even away from the trivial obstruction at .
What survives. Monotonicity survives: still gives (Commutativity, associativity, distributivity and monotonicity of and , the unit laws, the two exponent laws, and if and only if injects into ). It is the strict form that fails, and cancellation is exactly the strict form in disguise. Exponentiation is the one place on this page where a strict increase survives at every cardinal, and that is Assuming the Axiom of Choice, , and Cantor's theorem in cardinal form: .
Depends on
- Cardinal sum $\kappa \oplus \lambda$, product $\kappa \otimes \lambda$ and exponentiation $\kappa^{\lambda}$, and why they are written apart from the ordinal operations
- Absorption: for cardinals $\kappa, \lambda$ with $\kappa$ infinite and $\lambda \le \kappa$, $\kappa \oplus \lambda = \kappa$, and $\kappa \otimes \lambda = \kappa$ when $\lambda \ne 0$
- Commutativity, associativity, distributivity and monotonicity of $\oplus$ and $\otimes$, the unit laws, the two exponent laws, and $\kappa \le \lambda$ if and only if $\kappa$ injects into $\lambda$
- 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$
- 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
- Cardinal (initial ordinal) and cardinality
- $\omega$ is the least limit ordinal
- Basic closure properties of ordinals
- Trichotomy and well-ordering of the ordinals
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: 103 results over 29 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
- K. Kearnes, Cardinal Arithmetic (Fall 2025 course handout) (standard reference, not scraped)
- Cardinal number — cardinal arithmetic (Wikipedia) (standard reference, not scraped)