Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (openai/gpt-5.4)audited 2026-07-25
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.

Every rational has a positive-denominator representative

Statement

Every rational has a representative (a,b)(a,b) with b>0b > 0: for a class [(a,b)][(a,b)] (where b0b \ne 0), if b>0b > 0 take (a,b)(a,b) itself, and if b<0b < 0 then (a,b)(a,b)(a,b) \sim (-a,-b) with b>0-b > 0. Consequently the order on Q\mathbb{Q} (Order on the rationals), which is stated on positive-denominator representatives, is defined on all of Q\mathbb{Q}.

Facts & Assumptions

Given: A rational represented by (a,b)(a,b) with a,bZa, b \in \mathbb{Z}, b0b \ne 0, and the relation (x,y)(z,w)    xw=zy(x,y) \sim (z,w) \iff x w = z y (The rationals as equivalence classes of pairs of integers).

[L1]

Trichotomy in Z\mathbb{Z}: each nonzero integer is either >0> 0 or <0< 0, and b<0b < 0 iff b>0-b > 0 (The integers form a totally ordered ring).

[L2]

In the commutative ring Z\mathbb{Z}, a(b)=(ab)=(a)ba(-b) = -(ab) = (-a)b (both products are the additive inverse of abab, by distributivity) (The integers form a commutative ring).

Proof

technique · direct
1.1

Since b0b \ne 0, by trichotomy [L1] either b>0b > 0 or b<0b < 0.

givenL1
2.1

If b>0b > 0, the representative (a,b)(a,b) already has positive denominator.

step 1.1
2.2

If b<0b < 0, then b>0-b > 0 by [L1], and a(b)=(a)ba(-b) = (-a)b by [L2] is exactly the defining relation (a,b)(a,b)(a,b) \sim (-a,-b); so (a,b)(-a,-b) represents the same class and has positive denominator b-b.

step 1.1L1L2
3.1

In either case the class has a representative with positive denominator; hence the order Order on the rationals, stated on such representatives, is defined for every rational.

step 2.1step 2.2

Depends on

Used by

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

Dependency tree · next 3 levels

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