Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-07-28
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.

Q\mathbb{Q} and R\mathbb{R} are fields, hence commutative rings, integral domains and ordered rings, all of characteristic 00

Example

Let FF be either Q\mathbb{Q} (The rationals form a field) or R\mathbb{R} (The reals form a field), with its published order (The rationals form a totally ordered field, The reals form a totally ordered field). Then:

  1. FF is a commutative ring with 101 \ne 0 and an integral domain (Every field is a commutative ring with 101 \ne 0; it is an integral domain, and it is a commutative division ring, Zero divisor, and integral domain: a commutative ring with 101 \ne 0 and no zero divisors);
  2. FF with its order is an ordered ring (Ordered ring: a ring with a total order compatible with addition and with positives closed under multiplication), and the set P={xF:0<x}P = \{\, x \in F : 0 < x \,\} is a positive cone making FF an ordered field in the sense of Ordered field, whose induced order is the published one;
  3. char(F)=0\operatorname{char}(F) = 0 (The characteristic of a ring: the least n1n \ge 1 with n1R=0n \cdot 1_R = 0 when one exists, and 00 otherwise).

Facts & Assumptions

Given: FF is Q\mathbb{Q} or R\mathbb{R}, with its published operations and order.

[L1]

Q\mathbb{Q} and R\mathbb{R} are fields (The rationals form a field, The reals form a field, Field).

[L2]

The published order on each makes it a totally ordered field: the order is total, xyx \le y implies x+zy+zx + z \le y + z, and 0<x0 < x and 0<y0 < y imply 0<xy0 < xy (The rationals form a totally ordered field, The reals form a totally ordered field).

[L5]

An ordered field is a field with a subset PP satisfying trichotomy (O1) and closure (O2), the order being a<b:    baPa < b :\iff b - a \in P; and every ordered field is an ordered ring whose positive cone is PP (Ordered field, Every ordered field is an ordered ring, and its order is the one its positive cone induces).

[L7]

In an ordered field, n1F>0n \cdot 1_F > 0 for every n1n \ge 1, the multiples being given by 11F=1F1 \cdot 1_F = 1_F and (n+1)1F=n1F+1F(n+1)\cdot 1_F = n \cdot 1_F + 1_F (Canonical naturals are positive and strictly increasing).

[L8]

char(R)\operatorname{char}(R) is the least n1n \ge 1 with n1R=0Rn \cdot 1_R = 0_R, or 00 if there is none (The characteristic of a ring: the least n1n \ge 1 with n1R=0n \cdot 1_R = 0 when one exists, and 00 otherwise).

Verification

technique · direct
1.1

Claim 1: FF is a field by [L1], hence a commutative ring with 101 \ne 0 and an integral domain by [L3].

L1L3
2.1

By [L2] the published order on FF is a total order satisfying (OR1) and (OR2) of Ordered ring: a ring with a total order compatible with addition and with positives closed under multiplication verbatim; with step 1.1 this makes FF an ordered ring.

L1L2L3
3.1

By [L4] applied to that ordered ring, P={xF:0<x}P = \{\, x \in F : 0 < x \,\} satisfies trichotomy and closure, and the relation a<b:    baPa < b :\iff b - a \in P is the published order. Together with the field structure from step 1.1, trichotomy and closure are exactly axioms (O1) and (O2) of Ordered field, so (F,P)(F,P) is an ordered field whose order is the published one. This is claim 2.

step 1.1step 2.1L4L5
4.1

By step 3.1 the ordered-field structure of FF is available, so [L7] applies. Its multiples and the multiples of [L8] are the same elements: both agree with the canonical natural ι(n)\iota(n) of The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field by [L6], since ι(1)=ι(0)+1F=1F\iota(1) = \iota(0) + 1_F = 1_F and both recursions add 1F1_F at each successor. Hence n1F>0n \cdot 1_F > 0 for every natural n1n \ge 1, and n1F0Fn \cdot 1_F \ne 0_F because 0F0_F is not positive by trichotomy.

step 3.1L5L6L7
5.1

Claim 3: by step 4.1 there is no natural n1n \ge 1 with n1F=0Fn \cdot 1_F = 0_F, so char(F)=0\operatorname{char}(F) = 0 by [L8].

step 4.1L8
6.1

Claims 1, 2 and 3 are established in steps 1.1, 3.1 and 5.1.

step 1.1step 3.1step 5.1

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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