Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck 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.

Canonical naturals are positive and strictly increasing

Statement

Let F be an ordered field, with field structure as in Field, and for n≥1 let n⋅1F denote the canonical natural number 1F+⋯+1F⏟n, defined recursively by 1⋅1F=1F and (n+1)⋅1F=n⋅1F+1F. Then for every n≥1:

  • n⋅1F>0 and (n+1)⋅1F>n⋅1F;
  • the map n↦n⋅1F is strictly increasing, hence injective, on {1,2,3,… };
  • (m+n)⋅1F=m⋅1F+n⋅1F and (mn)⋅1F=(m⋅1F)(n⋅1F) for all m,n≥1.

Facts & Assumptions

Given: An ordered field F whose canonical naturals are defined recursively by 1⋅1F=1F and (n+1)⋅1F=n⋅1F+1F, with 0⋅1F=0.

[L1]

0<1F in every ordered field (The multiplicative identity is positive).

[L2]

The order is compatible with addition and positives are closed under addition: a<b implies a+c<b+c, and a>0, b>0 imply a+b>0 (Order is preserved by adding a constant and by adding inequalities).

Proof

technique · induction
1.1

Base case n=1: by definition 1⋅1F=1F, and 1F>0.

L1base
1.2

Inductive hypothesis: assume n⋅1F>0 for some fixed n≥1.

ih
1.3

By the recursion, (n+1)⋅1F−n⋅1F=1F>0, so (n+1)⋅1F>n⋅1F.

givenL1
1.4

Additive identity: fix m and induct on n; at n=1, (m+1)⋅1F=m⋅1F+1F by the recursion, and if (m+n)⋅1F=m⋅1F+n⋅1F then (m+n+1)⋅1F=(m+n)⋅1F+1F=m⋅1F+n⋅1F+1F=m⋅1F+(n+1)⋅1F.

givenalgebra
2.1

Inductive step: (n+1)⋅1F=n⋅1F+1F is a sum of two positives, by the hypothesis and 1F>0, hence (n+1)⋅1F>0.

step 1.2L1L2
2.2

Iterating 1.3, for m<n one has m⋅1F<n⋅1F, so n↦n⋅1F is strictly increasing and therefore injective on {1,2,3,… }.

step 1.3L2
2.3

Multiplicative identity: fix m and induct on n; at n=1, (m⋅1)⋅1F=m⋅1F=(m⋅1F)(1⋅1F), and the step (m(n+1))⋅1F=(mn+m)⋅1F=(mn)⋅1F+m⋅1F=(m⋅1F)(n⋅1F)+(m⋅1F)(1F)=(m⋅1F)((n+1)⋅1F) uses 1.4 and distributivity.

step 1.4algebra
3.1

By induction on 1.1, 1.2, 2.1, n⋅1F>0 for every n≥1; with the strict increase 2.2 and the identities 1.4, 2.3, every claim holds.

step 2.1step 2.2step 1.4step 2.3discharge-induction∎

Depends on

Used by

…and 191 more results.

Dependency tree · two levels

5 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