Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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 and R are fields, hence commutative rings, integral domains and ordered rings, all of characteristic 0

Example

Facts & Assumptions

Given: F is Q or R, with its published operations and order.

[L2]

The published order on each makes it a totally ordered field: the order is total, x≤y implies x+z≤y+z, and 0<x and 0<y imply 0<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 P satisfying trichotomy (O1) and closure (O2), the order being a<b:  ⟺  b−a∈P; and every ordered field is an ordered ring whose positive cone is P (Ordered field, Every ordered field is an ordered ring, and its order is the one its positive cone induces).

[L7]

In an ordered field, n⋅1F>0 for every n≥1, the multiples being given by 1⋅1F=1F and (n+1)⋅1F=n⋅1F+1F (Canonical naturals are positive and strictly increasing).

[L8]

char⁡(R) is the least n≥1 with n⋅1R=0R, or 0 if there is none (The characteristic of a ring: the least n≥1 with n⋅1R=0 when one exists, and 0 otherwise).

Verification

technique · direct
1.1

Claim 1: F is a field by [L1], hence a commutative ring with 1≠0 and an integral domain by [L3].

L1L3
2.1

By [L2] the published order on F 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 F an ordered ring.

L1L2L3
3.1

By [L4] applied to that ordered ring, P={ x∈F:0<x } satisfies trichotomy and closure, and the relation a<b:  ⟺  b−a∈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) 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 F is available, so [L7] applies. Its multiples and the multiples of [L8] are the same elements: both agree with the canonical natural ι(n) of The canonical natural ι(n)=n⋅1F of a field by [L6], since ι(1)=ι(0)+1F=1F and both recursions add 1F at each successor. Hence n⋅1F>0 for every natural n≥1, and n⋅1F≠0F because 0F is not positive by trichotomy.

step 3.1L5L6L7
5.1

Claim 3: by step 4.1 there is no natural n≥1 with n⋅1F=0F, so 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 · two levels

56 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