Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-02 (claude-opus-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 rationals form a totally ordered field

Statement

The relation of Order on the rationals is well defined and makes the field Q\mathbb{Q} (The rationals form a field) a totally ordered field: the order is total, xyx \le y implies x+zy+zx + z \le y + z, and 0<x0 < x, 0<y0 < y imply 0<xy0 < xy.

Facts & Assumptions

Given: Rationals x=[(a,b)]x = [(a,b)], y=[(c,d)]y = [(c,d)], z=[(e,f)]z = [(e,f)] with b,d,f>0b, d, f > 0.

[L1]

Z\mathbb{Z} is a totally ordered commutative ring; positives are closed under products (The integers form a totally ordered ring).

Proof

technique · direct
1.1

Order-scaling in Z\mathbb{Z}: for p>0p > 0, if u<vu < v then 0<(vu)p0 < (v-u)p, so up<vpup < vp; conversely if upvpup \le vp and v<uv < u then vp<upvp < up, impossible; hence uvu \le v iff upvpup \le vp.

L1algebra
1.2

Suppose (a,b)(a,b)(a,b) \sim (a',b') and (c,d)(c,d)(c,d) \sim (c',d') with b,d>0b', d' > 0, i.e. ab=abab' = a'b and cd=cdcd' = c'd; suppose also adcbad \le cb.

given
1.3

Totality: adcbad \le cb or cbadcb \le ad in Z\mathbb{Z}, so xyx \le y or yxy \le x.

L1
1.4

Antisymmetry: adcbad \le cb and cbadcb \le ad give ad=cbad = cb, i.e. x=yx = y as classes.

L1
1.5

Positive products: if 0<x0 < x and 0<y0 < y then 0<a0 < a and 0<c0 < c, so xy=[(ac,bd)]xy = [(ac,\, bd)] has ac>0ac > 0 and bd>0bd > 0, hence 0<xy0 < xy.

L1
1.6

For transitivity, let z=[(e,f)]z = [(e,f)] with f>0f > 0 and suppose additionally yzy \le z, i.e. cfedcf \le ed.

given
2.1

Scaling the hypothesis adcbad \le cb by bd>0b'd' > 0: (ad)(bd)(cb)(bd)(ad)(b'd') \le (cb)(b'd').

step 1.1step 1.2L1
2.2

Rearranging both sides with ab=abab' = a'b and cd=cdcd' = c'd: (ad)(bd)=(ab)(dd)=(ab)(dd)=(ad)(bd)(ad)(b'd') = (ab')(dd') = (a'b)(dd') = (a'd')(bd) and (cb)(bd)=(cd)(bb)=(cd)(bb)=(cb)(bd)(cb)(b'd') = (cd')(bb') = (c'd)(bb') = (c'b')(bd).

step 1.2L1
2.3

Transitivity: from adcbad \le cb and cfedcf \le ed, scaling by f>0f > 0 and b>0b > 0 gives (af)d=(ad)f(cb)f=(cf)b(ed)b=(eb)d(af)d = (ad)f \le (cb)f = (cf)b \le (ed)b = (eb)d; cancelling d>0d > 0 via order-scaling, afebaf \le eb, i.e. xzx \le z.

step 1.1step 1.2step 1.6L1
2.4

Compatibility with addition: x+zy+zx + z \le y + z reads (af+eb)(df)(cf+ed)(bf)(af+eb)(df) \le (cf+ed)(bf), which expands to (ad)f2+(eb)(df)(cb)f2+(ed)(bf)(ad)f^2 + (eb)(df) \le (cb)f^2 + (ed)(bf); the second terms are equal, so this is (ad)f2(cb)f2(ad)f^2 \le (cb)f^2, equivalent by order-scaling with f2>0f^2 > 0 to adcbad \le cb, i.e. xyx \le y.

step 1.1L1
3.1

Combining: (ad)(bd)(cb)(bd)(a'd')(bd) \le (c'b')(bd) with bd>0bd > 0, so adcba'd' \le c'b' by order-scaling: the order is independent of representatives.

step 2.1step 2.2step 1.1L1
4.1

The order is well defined, total, compatible with addition, and positives are closed under multiplication: Q\mathbb{Q} is a totally ordered field.

step 3.1step 1.3step 1.4step 2.3step 2.4step 1.5

Depends on

Used by

Dependency tree · next 3 levels

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