Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck 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 rationals form a field

Statement

(Q,+,⋅,0,1) with the operations of Arithmetic on the rationals is a field: a commutative ring with 1≠0 in which every nonzero element has a multiplicative inverse.

Facts & Assumptions

Given: Rationals with representatives (a,b),(c,d),(e,f), second components nonzero.

[L1]

The operations are independent of representatives (Rational arithmetic is well defined).

[L2]

Z is a commutative ring in which 1≠0 (The integers form a commutative ring; 1≠0 because 1≠0 in N).

[L3]

Z has no zero divisors and admits cancellation (The integers have no zero divisors; multiplicative cancellation).

Proof

technique · direct
1.1

By [L1], each axiom may be verified on fixed representatives.

L1suffices
1.2

Associativity of +: both ((a,b)+(c,d))+(e,f) and (a,b)+((c,d)+(e,f)) have representative (adf+cbf+ebd,  bdf).

L2
1.3

Commutativity of +: (ad+cb, bd) and (cb+ad, db) are equal pairs.

L2
1.4

Additive identity: (a,b)+(0,1)=(a⋅1+0⋅b,  b⋅1)=(a,b).

L2
1.5

Additive inverses: (a,b)+(−a,b)=(ab−ab,  b2)=(0,b2)∼(0,1).

L2
1.6

Associativity and commutativity of ⋅: ((ac)e, (bd)f)=(a(ce), b(df)) and (ac, bd)=(ca, db).

L2
1.7

Multiplicative identity: (a,b)(1,1)=(a,b); and 1≠0 since 1⋅1≠0⋅1.

L2
1.8

Distributivity: (a,b)((c,d)+(e,f)) has representative (a(cf+ed),  b(df)), while (a,b)(c,d)+(a,b)(e,f) has representative (acbf+aebd,  b2df)=(b(acf+aed),  b(bdf)); cancelling the common nonzero factor b these are equivalent.

L2L3
1.9

Inverses: [(a,b)]=0 iff a⋅1=0⋅b iff a=0; for a≠0, (a,b)(b,a)=(ab, ba)∼(1,1).

L2
2.1

All field axioms hold: Q is a field.

step 1.1step 1.2step 1.3step 1.4step 1.5step 1.6step 1.7step 1.8step 1.9∎

Depends on

Used by

…and 13 more results.

Dependency tree · two levels

17 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