Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (openai/gpt-5.4)audited 2026-07-24
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 reals form a totally ordered field

Statement

The relation of Order on the reals is well defined and makes R\mathbb{R} (The reals form a field) a totally ordered field.

Facts & Assumptions

Given: Reals x,yx, y with representatives (an),(bn)(a_n), (b_n).

[L1]

A sequence (un)n1(u_n)_{n \ge 1} of rational numbers is null if, for every rational ε>0\varepsilon > 0, there is NNN \in \mathbb{N} such that un<ε|u_n| < \varepsilon for every nNn \ge N (Null sequence).

[L2]

Ordered-field arithmetic in Q\mathbb{Q}: δ/2>0\delta/2 > 0; sums and products of eventual lower bounds (The rationals form a totally ordered field).

[L3]

Dichotomy for non-null Cauchy sequences: eventually >δ> \delta or eventually <δ< -\delta (A non-null Cauchy sequence is eventually bounded away from zero, with constant sign).

[L4]

R\mathbb{R} is a field (The reals form a field).

[L5]

In R=C/N\mathbb{R} = \mathcal{C}/\mathcal{N}, x=0x = 0 iff a representative is null; so x0x \ne 0 iff every representative is non-null (The real numbers).

Proof

technique · direct
1.1

Positivity is independent of the representative: if an>δa_n > \delta for nNn \ge N and (anan)(a'_n - a_n) is null, then beyond some NNN' \ge N also anan<δ/2|a'_n - a_n| < \delta/2, so an>δ/2a'_n > \delta/2: the defining property holds for (an)(a'_n) with δ/2\delta/2.

L1L2
1.2

Trichotomy: if x0x \ne 0, any representative is non-null, so by the dichotomy either an>δa_n > \delta eventually (xx positive) or an<δa_n < -\delta eventually (x-x positive); the two exclude each other, and exactly one of xx positive, x=0x = 0, x-x positive holds.

L1L3L5
1.3

Positives are closed under ++ and \cdot: from an>δa_n > \delta and bn>δb_n > \delta' eventually, an+bn>δ+δa_n + b_n > \delta + \delta' and anbn>δδa_n b_n > \delta\delta' eventually, with δ+δ,δδ>0\delta + \delta', \delta\delta' > 0.

L2
2.1

Consequently \le is a total order (trichotomy plus transitivity from closure under sums), compatible with addition (translation preserves the difference) and with multiplication by positives: R\mathbb{R} is a totally ordered field.

step 1.1step 1.2step 1.3L4

Depends on

Used by

Cited to discharge well-definedness by Order on the reals.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 34 results over 17 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