Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck 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 (The rationals form a field) a totally ordered field: the order is total, x≤y implies x+z≤y+z, and 0<x, 0<y imply 0<xy.

Facts & Assumptions

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

[L1]

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: for p>0, if u<v then 0<(v−u)p, so up<vp; conversely if up≤vp and v<u then vp<up, impossible; hence u≤v iff up≤vp.

L1algebra
1.2

Suppose (a,b)∼(a′,b′) and (c,d)∼(c′,d′) with b′,d′>0, i.e. ab′=a′b and cd′=c′d; suppose also ad≤cb.

given
1.3

Totality: ad≤cb or cb≤ad in Z, so x≤y or y≤x.

L1
1.4

Antisymmetry: ad≤cb and cb≤ad give ad=cb, i.e. x=y as classes.

L1
1.5

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

L1
1.6

For transitivity, let z=[(e,f)] with f>0 and suppose additionally y≤z, i.e. cf≤ed.

given
2.1

Scaling the hypothesis ad≤cb by b′d′>0: (ad)(b′d′)≤(cb)(b′d′).

step 1.1step 1.2L1
2.2

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

step 1.2L1
2.3

Transitivity: from ad≤cb and cf≤ed, scaling by f>0 and b>0 gives (af)d=(ad)f≤(cb)f=(cf)b≤(ed)b=(eb)d; cancelling d>0 via order-scaling, af≤eb, i.e. x≤z.

step 1.1step 1.2step 1.6L1
2.4

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

step 1.1L1
3.1

Combining: (a′d′)(bd)≤(c′b′)(bd) with bd>0, so a′d′≤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 is a totally ordered field.

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

Depends on

Used by

…and 7 more results.

Dependency tree · two levels

21 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