Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge 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.

The closed long ray ω1×[0,1) under the lexicographic order, and the long line, with the order topology

Definition

Let ω1 be the first uncountable ordinal (The first uncountable ordinal ω1:=ℵ(ω), ω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), whose elements are the at most countable ordinals (Ordinal (von Neumann)) ordered by membership (Trichotomy and well-ordering of the ordinals, Basic closure properties of ordinals), and let

[0,1)  =  { t∈R:0≤t<1 }

be the half-open unit interval of the complete ordered field R (Intervals of R: the nine order-convex forms, nondegeneracy, and length, Order on the reals, Ordered field, Complete ordered field (least-upper-bound property)).

The closed long ray is the set

R  :=  ω1×[0,1)

with the lexicographic order

(α,s)  <  (β,t):⟺α<β,  or  (α=β and s<t),

and (α,s)≤(β,t) meaning (α,s)<(β,t) or (α,s)=(β,t); R carries the order topology of this order (The order topology of a linearly ordered set, with the open rays as a subbasis; order-convex sets, order-density, the least upper bound property, and linear continua, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

The lexicographic order is a linear order, and this is discharged here. Antisymmetry and irreflexivity of <: if (α,s)<(β,t) then either α<β, which by trichotomy of the ordinals (Trichotomy and well-ordering of the ordinals) forbids β≤α and hence forbids (β,t)<(α,s), or α=β and s<t, which by trichotomy in R (Ordered field) forbids t<s; in particular no element is < itself. Transitivity: if (α,s)<(β,t)<(γ,u) then α≤β≤γ, so α≤γ; if α<γ we are done, and if α=γ then α=β=γ and s<t<u gives s<u. Comparability: given two elements, compare the first coordinates by Trichotomy and well-ordering of the ordinals and, if they are equal, the second by trichotomy in R. So (R,≤) is a totally ordered set (Partial order and partially ordered set).

Least element, and the open long ray. R has the least element 0R:=(0,0), since 0=∅ is the least ordinal and 0 the least element of [0,1). The open long ray is R∖{0R} with the restricted order and its order topology. R has no greatest element: given (α,s), the element (α+,0) is strictly above it, and α+∈ω1 because α+ is again at most countable (Basic closure properties of ordinals, ω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).

The long line. Let R′:=R∖{0R} be the open long ray. The long line is the set

L  :=  ({0}×R′)  ∪  ({1}×R)

with the order

(0,x)<(0,y):⟺y<x,(0,x)<(1,y)  always,(1,x)<(1,y):⟺x<y,

that is: a reversed copy of the open long ray laid before a copy of the closed long ray, the two halves meeting at the single centre point (1,0R). This is again a total order, by the same three checks applied within each copy and by the third clause across them, and L carries its order topology. One copy is open and one is closed deliberately: were both copies open, each half would be a union of open rays of L, so the two halves would form a pair of disjoint nonempty open sets covering L — a separation — and the order would have a gap at the seam instead of the centre point (1,0R) that closes it.

Blocks. The set {0}×[0,1) is an initial segment of R order-isomorphic to [0,1), and for each α∈ω1 the block {α}×[0,1) is order-isomorphic to [0,1); the blocks are laid end to end in the order type of ω1. A block {α}×[0,1) has a least element (α,0) and no greatest element. No element of R has an immediate predecessor or an immediate successor. Within a block this is the corresponding fact for [0,1). At a block boundary (α,0) with α≠0: if α=β+ then the elements below it are the (β,s), s<1, among which there is no greatest, so it has no immediate predecessor; and if α is a limit ordinal (Successor and limit ordinals) the elements below it include (ξ,0) for every ξ<α, again with no greatest, since α is a limit. Immediate successors fail because no block has a greatest element.

Remarks

  • Why [0,1) and not [0,1]. With [0,1] the element (α,1) would be the greatest element of its block and (α+,0) would be its immediate successor, producing a jump; the order would then fail to be order-dense and the long ray would be disconnected. Half-open blocks glue without a seam, which is the whole point of the construction.

  • Why ω1 and not a larger ordinal. The construction makes sense for any ordinal, and for ω it produces an order isomorphic to [0,∞). What is special about ω1 is that it is uncountable while each of its elements is at most countable (ω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), which is what makes every proper initial segment of R look like an ordinary half-line while R itself does not.

  • Naming. The obligation that the long ray deserves to be called a continuum — that it is order-dense and has the least upper bound property — is discharged by The long ray is a linear continuum, hence connected; every one of its at most countable subsets is bounded above, assuming countable choice ↗, recorded in this item's justified_by, and is not assumed anywhere above.

  • What is not defined here. Nothing above asserts that R or L is path-connected, or metrizable, or that either is homeomorphic to any space built earlier. Those questions need machinery this page does not develop, and no statement on this page depends on their answers.

Depends on

Used by

Dependency tree · two levels

43 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