Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5) rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

FALSE: κμ=λμ\kappa \oplus \mu = \lambda \oplus \mu implies κ=λ\kappa = \lambda

Statement

FALSE. Cardinal addition is cancellative: for all cardinals κ,λ,μ\kappa, \lambda, \mu (Cardinal (initial ordinal) and cardinality, Cardinal sum κλ\kappa \oplus \lambda, product κλ\kappa \otimes \lambda and exponentiation κλ\kappa^{\lambda}, and why they are written apart from the ordinal operations),

κμ=λμκ=λ.\kappa \oplus \mu = \lambda \oplus \mu \quad \Longrightarrow \quad \kappa = \lambda .

The claim is plausible because it is true for finite cardinals, where \oplus is the ordinary addition of natural numbers (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 A\lvert A \rvert in the finite sense equal to A\lvert A \rvert 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 κ,λ\kappa, \lambda with κ\kappa infinite and λκ\lambda \le \kappa, κλ=κ\kappa \oplus \lambda = \kappa, and κλ=κ\kappa \otimes \lambda = \kappa when λ0\lambda \ne 0) makes \oplus throw away the smaller argument, and an operation that forgets one of its inputs cannot be cancelled.

Facts & Assumptions

[L5]

Ordinals satisfy trichotomy, αβ\alpha \subseteq \beta iff αβ\alpha \in \beta or α=β\alpha = \beta, and αα\alpha \notin \alpha (Trichotomy and well-ordering of the ordinals, Basic closure properties of ordinals).

Refutation

technique · contradiction
1.1

Suppose, for contradiction, that the displayed claim holds for all cardinals κ,λ,μ\kappa, \lambda, \mu.

assume-contra
1.2

By [L3] and [L4] the ordinals 11 and 0=ω\aleph_0 = \omega are cardinals, 0\aleph_0 is infinite, 101 \in \aleph_0 and hence 101 \le \aleph_0, and 101 \ne \aleph_0 by [L5].

L3L4L5
2.1

By [L1] with ν=0\nu = \aleph_0 and ρ=0\rho = \aleph_0, 00=0\aleph_0 \oplus \aleph_0 = \aleph_0; and by [L2] and [L1] with ρ=1\rho = 1, 10=01=01 \oplus \aleph_0 = \aleph_0 \oplus 1 = \aleph_0.

step 1.2L1L2
3.1

So the hypothesis of the assumed claim holds at κ=0\kappa = \aleph_0, λ=1\lambda = 1, μ=0\mu = \aleph_0, and the claim would give 0=1\aleph_0 = 1, which step 1.2 forbids; therefore cardinal addition is not cancellative.

step 1.1step 1.2step 2.1discharge-contradiction

Remarks

The finite case really is cancellative, and nothing above contradicts it. For m,n,kωm, n, k \in \omega read as cardinals, mk=nkm \oplus k = n \oplus k is m+Nk=n+Nkm +_{\mathbb{N}} k = n +_{\mathbb{N}} k by 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 A\lvert A \rvert in the finite sense equal to A\lvert A \rvert in the cardinal sense, and Peano addition is cancellative. The witness above is forced to use an infinite μ\mu, and once μ\mu is infinite every κμ\kappa \le \mu gives the same sum.

Multiplication fails in the same way, and for the same reason. Absorption: for cardinals κ,λ\kappa, \lambda with κ\kappa infinite and λκ\lambda \le \kappa, κλ=κ\kappa \oplus \lambda = \kappa, and κλ=κ\kappa \otimes \lambda = \kappa when λ0\lambda \ne 0 also gives 00=0=10\aleph_0 \otimes \aleph_0 = \aleph_0 = 1 \otimes \aleph_0 with 101 \ne \aleph_0, so \otimes is not cancellative either, even away from the trivial obstruction at μ=0\mu = 0.

What survives. Monotonicity survives: κλ\kappa \le \lambda still gives κμλμ\kappa \oplus \mu \le \lambda \oplus \mu (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). 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, 2κ=P(κ)2^{\kappa} = \lvert \mathcal{P}(\kappa) \rvert, and Cantor's theorem in cardinal form: κ<2κ\kappa < 2^{\kappa}.

Depends on

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