Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)
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: ordinal multiplication is commutative

Statement

FALSE. Ordinal multiplication (Ordinal multiplication α⋅β\alpha \cdot \beta) is commutative: α⋅β=β⋅α\alpha \cdot \beta = \beta \cdot \alpha for all ordinals α\alpha and β\beta.

It fails at the smallest possible place: 2⋅ω=ω2 \cdot \omega = \omega, while ω⋅2=ω+ω\omega \cdot 2 = \omega + \omega, which is strictly larger.

Facts & Assumptions

Given: The ordinals with the operations of Ordinal addition α+β\alpha + \beta and Ordinal multiplication α⋅β\alpha \cdot \beta, and ω\omega the least limit ordinal (ω\omega is the least limit ordinal, Successor and limit ordinals).

[L1]

α⋅0=0\alpha \cdot 0 = 0, α⋅δ+=α⋅δ+α\alpha \cdot \delta^{+} = \alpha \cdot \delta + \alpha, and α⋅λ=⋃{α⋅ξ:ξ∈λ}\alpha \cdot \lambda = \bigcup\{\alpha \cdot \xi : \xi \in \lambda\} for limit λ\lambda (Ordinal multiplication α⋅β\alpha \cdot \beta); α+0=α\alpha + 0 = \alpha (Ordinal addition α+β\alpha + \beta).

[L2]

From Monotonicity of ordinal ++ and ⋅\cdot: strictly increasing and continuous in the right argument, weakly increasing in the left, with left cancellation, and the identities 0+β=β0 + \beta = \beta and 1⋅β=β1 \cdot \beta = \beta: 1⋅μ=μ⋅1=μ1 \cdot \mu = \mu \cdot 1 = \mu (claim (a)); ν<θ\nu < \theta implies α+ν<α+θ\alpha + \nu < \alpha + \theta (claim (b)); μ≤ν\mu \le \nu implies μγ≤νγ\mu \gamma \le \nu \gamma (claim (e)).

[L3]

For m,n∈ωm, n \in \omega the ordinal m⋅nm \cdot n lies in ω\omega (claim (a) of On ω\omega the ordinal ++ and ⋅\cdot are the Peano operations: ω\omega is closed under ordinal ++, ⋅\cdot and exponentiation, and for naturals m,nm, n the ordinal m+nm + n and m⋅nm \cdot n are the natural-number sum and product).

[L4]

ω\omega is a limit ordinal, so ⋃ω=ω\bigcup \omega = \omega and 0∈ω0 \in \omega (ω\omega is the least limit ordinal, Successor and limit ordinals); every ordinal is transitive, μ⊆ν\mu \subseteq \nu iff μ∈ν\mu \in \nu or μ=ν\mu = \nu, and μ∉μ\mu \notin \mu (Ordinal (von Neumann), Basic closure properties of ordinals, Trichotomy and well-ordering of the ordinals).

Refutation

technique · direct
1.1

For every n∈ωn \in \omega the ordinal 2⋅n2 \cdot n lies in ω\omega by [L3], hence 2⋅n⊆ω2 \cdot n \subseteq \omega by [L4]; and n=1⋅n≤2⋅nn = 1 \cdot n \le 2 \cdot n by [L2], since 1≤21 \le 2, hence n⊆2⋅nn \subseteq 2 \cdot n.

L2L3L4
1.2

ω⋅2=ω⋅1+=ω⋅1+ω=ω+ω\omega \cdot 2 = \omega \cdot 1^{+} = \omega \cdot 1 + \omega = \omega + \omega by [L1] and [L2].

L1L2
2.1

2⋅ω=⋃{2⋅n:n∈ω}2 \cdot \omega = \bigcup\{2 \cdot n : n \in \omega\} by [L1], and that union equals ω\omega: it is contained in ω\omega because each 2⋅n⊆ω2 \cdot n \subseteq \omega by step 1.1, and it contains ω\omega because ω=⋃ω=⋃{n:n∈ω}\omega = \bigcup \omega = \bigcup\{n : n \in \omega\} by [L4] and each n⊆2⋅nn \subseteq 2 \cdot n by step 1.1.

step 1.1L1L4
2.2

ω+ω≠ω\omega + \omega \ne \omega: since 0∈ω0 \in \omega, claim (b) of [L2] gives ω=ω+0<ω+ω\omega = \omega + 0 < \omega + \omega, and μ∉μ\mu \notin \mu by [L4].

step 1.2L1L2L4
3.1

Therefore 2⋅ω=ω2 \cdot \omega = \omega while ω⋅2=ω+ω≠ω\omega \cdot 2 = \omega + \omega \ne \omega, so 2⋅ω≠ω⋅22 \cdot \omega \ne \omega \cdot 2 and ordinal multiplication is not commutative.

step 2.1step 2.2step 1.2∎

Remarks

The picture. By α⋅β\alpha \cdot \beta is the order type of α×β\alpha \times \beta ordered by last differences, that is β\beta copies of α\alpha, 2⋅ω2 \cdot \omega is ω\omega copies of a two element set, laid end to end: that is a copy of ω\omega, since relabelling gives 0,1,2,…0, 1, 2, \dots again. And ω⋅2\omega \cdot 2 is two copies of ω\omega, one entirely above the other, which is ω+ω\omega + \omega and has no greatest element but does have an element with infinitely many predecessors. The convention that fixes which is which is stated in Ordinal multiplication α⋅β\alpha \cdot \beta: the successor clause appends a copy of α\alpha on the right, so α⋅β\alpha \cdot \beta is β\beta copies of α\alpha.

What survives. Multiplication is still associative and still distributes over addition on the left (Ordinal multiplication is associative, and α⋅(β+γ)=α⋅β+α⋅γ\alpha \cdot (\beta + \gamma) = \alpha\cdot\beta + \alpha\cdot\gamma), and it is still strictly increasing and cancellative in the right argument when the left factor is nonzero (Monotonicity of ordinal ++ and ⋅\cdot: strictly increasing and continuous in the right argument, weakly increasing in the left, with left cancellation, and the identities 0+β=β0 + \beta = \beta and 1⋅β=β1 \cdot \beta = \beta). Right distributivity is a separate casualty, refuted in FALSE: (β+γ)⋅α=β⋅α+γ⋅α(\beta + \gamma)\cdot\alpha = \beta\cdot\alpha + \gamma\cdot\alpha for all ordinals.

Finite ordinals are not a counterexample to anything. On ω\omega the ordinal product is the Peano product (On ω\omega the ordinal ++ and ⋅\cdot are the Peano operations: ω\omega is closed under ordinal ++, ⋅\cdot and exponentiation, and for naturals m,nm, n the ordinal m+nm + n and m⋅nm \cdot n are the natural-number sum and product), which is commutative. The failure is purely infinitary, and 22 and ω\omega are the smallest pair that exhibits it.

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: 55 results over 25 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