False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck 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 addition is commutative

Statement

FALSE. Ordinal addition (Ordinal addition $α + β$ ) is commutative: $α + β = β + α$ for all ordinals $α$ and $β$ .

The claim is plausible because it is true on $N$ , where ordinal addition is the Peano addition (On $ω$ the ordinal $+$ and $\cdot$ are the Peano operations: $ω$ is closed under ordinal $+$ , $\cdot$ and exponentiation, and for naturals $m, n$ the ordinal $m + n$ and $m \cdot n$ are the natural-number sum and product), and that is the only case most readers have met. It fails at the very first infinite ordinal: $1 + ω = ω$ while $ω + 1$ is strictly larger.

Facts & Assumptions

Given: The ordinals with the operations of Ordinal addition $α + β$ , and $ω$ the least limit ordinal ( $ω$ is the least limit ordinal, Successor and limit ordinals).

[L1]

$α + 0 = α$ , $α + δ^{+} = (α + δ)^{+}$ , and $α + λ = ⋃ {α + ξ : ξ \in λ}$ for limit $λ$ (Ordinal addition $α + β$ ).

[L2]

$β \leq α + β$ (claim (c) of 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 + β = β$ and $1 \cdot β = β$ ); $β + 1 = β^{+}$ (claim (a) of the same).

[L3]

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

[L4]

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

Refutation

technique · direct

1.1

For every $n \in ω$ the ordinal $1 + n$ lies in $ω$ by [L3], hence $1 + n \subseteq ω$ by [L4]; and $n \leq 1 + n$ by [L2], hence $n \subseteq 1 + n$ .

L2L3L4

1.2

$ω + 1 = ω^{+} \neq ω$ , since $ω \in ω^{+}$ while $ω \notin ω$ by [L4].

L1L2L4

2.1

$1 + ω = ⋃ {1 + n : n \in ω}$ by [L1], and that union equals $ω$ : it is contained in $ω$ because each $1 + n \subseteq ω$ by step 1.1, and it contains $ω$ because $ω = ⋃ ω = ⋃ {n : n \in ω}$ by [L4] and each $n \subseteq 1 + n$ by step 1.1.

step 1.1L1L4

3.1

Therefore $1 + ω = ω$ while $ω + 1 \neq ω$ , so $1 + ω \neq ω + 1$ and ordinal addition is not commutative.

step 2.1step 1.2L4∎

Remarks

The picture. By $α + β$ is the order type of $α$ followed by $β$ , $1 + ω$ is one point followed by a copy of $ω$ , and relabelling that as $0, 1, 2, \dots$ shows it is again a copy of $ω$ : prepending a single point to $ω$ changes nothing. Whereas $ω + 1$ is a copy of $ω$ with one point placed above everything, which has a greatest element and so cannot be order isomorphic to $ω$ . This is the whole phenomenon: adding on the left is absorbed, adding on the right is not.

What survives. Addition is still associative (Ordinal addition is associative), still strictly increasing and cancellative in the right argument, and still weakly increasing in the left (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 + β = β$ and $1 \cdot β = β$ ). Addition is commutative on finite ordinals because it agrees there with Peano addition (On $ω$ the ordinal $+$ and $\cdot$ are the Peano operations: $ω$ is closed under ordinal $+$ , $\cdot$ and exponentiation, and for naturals $m, n$ the ordinal $m + n$ and $m \cdot n$ are the natural-number sum and product). The displayed witness shows that ordinal addition is not commutative in general.

A stronger failure lives next door. Not only does $α + β = β + α$ fail; strict monotonicity in the left argument fails too, and for the same reason, since $0 + ω = 1 + ω$ . That is FALSE: $β < γ$ implies $β + α < γ + α$ .

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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

Ordinal arithmetic (Wikipedia) (standard reference, not scraped)
T. Jech, Set Theory, 3rd millennium ed., Ch. 2 (Ordinal numbers) (standard reference, not scraped)
R. Moosa, Set Theory course notes (standard reference, not scraped)