Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-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.

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 ∣A∣ in the finite sense equal to ∣A∣ 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 λ≠0) makes ⊕ throw away the smaller argument, and an operation that forgets one of its inputs cannot be cancelled.

Facts & Assumptions

[L5]

Ordinals satisfy trichotomy, α⊆β iff α∈β or α=β, and α∉α (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 κ,λ,μ.

assume-contra
1.2

By [L3] and [L4] the ordinals 1 and ℵ0=ω are cardinals, ℵ0 is infinite, 1∈ℵ0 and hence 1≤ℵ0, and 1≠ℵ0 by [L5].

L3L4L5
2.1

By [L1] with ν=ℵ0 and ρ=ℵ0, ℵ0⊕ℵ0=ℵ0; and by [L2] and [L1] with ρ=1, 1⊕ℵ0=ℵ0⊕1=ℵ0.

step 1.2L1L2
3.1

So the hypothesis of the assumed claim holds at κ=ℵ0, λ=1, μ=ℵ0, and the claim would give ℵ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∈ω read as cardinals, m⊕k=n⊕k is m+Nk=n+Nk 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 ∣A∣ in the finite sense equal to ∣A∣ 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 λ≠0 also gives ℵ0⊗ℵ0=ℵ0=1⊗ℵ0 with 1≠ℵ0, so ⊗ is not cancellative either, even away from the trivial obstruction at μ=0.

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, 2κ=∣P(κ)∣, and Cantor's theorem in cardinal form: κ<2κ.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

53 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