Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29
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.

ω+ω\omega + \omega is at most countable although it is not order isomorphic to ω\omega: order type and cardinality are different invariants

Example

The ordinal ω+ω\omega + \omega is at most countable as a set (Finite, countably infinite, countable, uncountable), and it is not order isomorphic to ω\omega (Order embedding and order isomorphism).

There is no tension. Countability is a statement about bijections and ignores order; order type is a statement about order isomorphisms and is finer. Two well-orders on the same countably infinite set can have different order types: ω\omega and ω+1\omega + 1 already show it, as the first example of this page records, and ω\omega and ω+ω\omega + \omega show it with the two copies visible.

ω+ω  =  ot(0,1,2,first copy  0,1,2,second copy).\omega + \omega \;=\; \mathrm{ot}\big(\underbrace{0, 1, 2, \dots}_{\text{first copy}} \ \ \underbrace{0', 1', 2', \dots}_{\text{second copy}}\big).

Facts & Assumptions

Given: The ordinals with the addition of Ordinal addition α+β\alpha + \beta, and ω=N\omega = \mathbb{N} the least limit ordinal (ω\omega is the least limit ordinal, The natural numbers N\mathbb{N} (von Neumann)).

[L1]

ω+ω=ot(ωω)\omega + \omega = \mathrm{ot}(\omega \oplus \omega), where ωω\omega \oplus \omega is the set ({0}×ω)({1}×ω)(\{0\} \times \omega) \cup (\{1\} \times \omega) with the lexicographic order that puts the second copy above the first (α+β\alpha + \beta is the order type of α\alpha followed by β\beta).

[L2]

Every well-order is order isomorphic to exactly one ordinal, its order type, and order isomorphic well-orders have the same order type; in particular an order isomorphism is a bijection (Every well-order has a unique order type, Order embedding and order isomorphism).

[L3]

If AA and BB are at most countable then so is A×BA \times B (A product of two at most countable sets is at most countable); a set equinumerous with an at most countable set is at most countable, and \approx is symmetric and transitive (Finite, countably infinite, countable, uncountable, Equinumerous sets, ABA \approx B and ABA \preceq B).

[L4]

ω\omega is at most countable, being equinumerous with N\mathbb{N} by the identity, and every natural number is at most countable (Finite, countably infinite, countable, uncountable, The natural numbers N\mathbb{N} (von Neumann)).

[L6]

0ω0 \in \omega; every ordinal is transitive and μμ\mu \notin \mu (Ordinal (von Neumann), Basic closure properties of ordinals, Trichotomy and well-ordering of the ordinals, Successor and limit ordinals).

Verification

technique · direct
1.1

As a set, ωω=({0}×ω)({1}×ω)=2×ω\omega \oplus \omega = (\{0\} \times \omega) \cup (\{1\} \times \omega) = 2 \times \omega, since 2={0,1}2 = \{0, 1\}; and 2×ω2 \times \omega is at most countable by [L3] and [L4], both factors being at most countable.

L1L3L4
1.2

ω+ωω\omega + \omega \ne \omega: since 0ω0 \in \omega, [L5] gives ω=ω+0<ω+ω\omega = \omega + 0 < \omega + \omega, and μμ\mu \notin \mu by [L6].

L5L6
2.1

The order isomorphism of [L1] and [L2] from ωω\omega \oplus \omega onto the ordinal ω+ω\omega + \omega is in particular a bijection, so ω+ω\omega + \omega is equinumerous with 2×ω2 \times \omega and hence at most countable by step 1.1 and [L3].

step 1.1L1L2L3
2.2

ω+ω\omega + \omega is not order isomorphic to ω\omega: order isomorphic well-orders have the same order type by [L2], and ω\omega and ω+ω\omega + \omega are distinct ordinals by step 1.2, each being its own order type.

step 1.2L2
3.1

So ω+ω\omega + \omega is an at most countable set carrying a well-order that is not a copy of the well-order ω\omega: cardinality and order type are different invariants.

step 2.1step 2.2

Remarks

How far this goes. Every ordinal strictly below ω1\omega_1 is at most countable (ω1\omega_1 is uncountable, every ordinal below it is at most countable, it is a cardinal and a limit ordinal, and its existence is a theorem of ZF), and there are a great many of them: ω+ω\omega + \omega and ωω=ω2\omega \cdot \omega = \omega^{2} are at most countable by the argument above, and no two distinct ordinals are isomorphic as orders. So a single countably infinite set carries uncountably many mutually non-isomorphic well-orders, one for each infinite ordinal below ω1\omega_1. Nothing here says the same of ωω\omega^{\omega} or of ε0\varepsilon_0 (ω2\omega^{2}, ωω\omega^{\omega}, and ε0=sup{ω,ωω,ωωω,}\varepsilon_0 = \sup\{\omega, \omega^{\omega}, \omega^{\omega^{\omega}}, \dots\} satisfying ωε0=ε0\omega^{\varepsilon_0} = \varepsilon_0): those are ordinals of larger order type, and their cardinality is a question no item on these pages settles, as that item's last remark records.

Why the argument does not need a choice principle. The bijection used at step 2.1 is the collapsing isomorphism of Every well-order has a unique order type, which is unique and therefore never chosen, and A product of two at most countable sets is at most countable is choice free too. Countability of a countable union of countable sets is a different matter and does cost ACω\mathrm{AC}_\omega; that is Countable unions of at most countable sets, assuming ACω\mathrm{AC}_\omega and it is not used here.

The confusion this item exists to prevent. "ω+ω\omega + \omega is bigger than ω\omega" is true as a statement about ordinals, where bigger means further along the ordinal order, and false as a statement about size. The two readings of "bigger" are exactly order type and cardinality.

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: 72 results over 24 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