Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-08 (gpt-5.6-terra-codex-subscription)
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.

R((t1))\mathbb{R}((t^{-1})) is an ordered field, ordered by the sign of the leading coefficient

Statement

Let K=R((t1))K = \mathbb{R}((t^{-1})) and let P={fK:f0K and lc(f)>0}P = \{\, f \in K : f \ne 0_K \text{ and } \operatorname{lc}(f) > 0 \,\} (The formal Laurent series R((t1))\mathbb{R}((t^{-1})): support bounded below, valuation, leading coefficient). Then:

  1. PP is a positive cone on KK, so (K,P)(K, P) is an ordered field (Ordered field), and f<gf < g holds exactly when gf0Kg - f \ne 0_K and lc(gf)>0\operatorname{lc}(g - f) > 0.
  2. For f0Kf \ne 0_K the absolute value (Absolute value in an ordered field) satisfies f0K|f| \ne 0_K, v(f)=v(f)v(|f|) = v(f) and lc(f)=lc(f)>0\operatorname{lc}(|f|) = \lvert \operatorname{lc}(f) \rvert > 0.
  3. The map ι:RK\iota : \mathbb{R} \to K sending cc to the series with value cc at index 00 is an injective ring homomorphism with ι(c)P\iota(c) \in P exactly when c>0c > 0; and the canonical naturals of KK are n1K=ι(n1R)n \cdot 1_K = \iota(n \cdot 1_{\mathbb{R}}) for every nNn \in \mathbb{N}.

Facts & Assumptions

Given: KK with its valuation vv, leading coefficient lc\operatorname{lc}, constants ι(c)\iota(c) and the set PP above.

[L1]

For nonzero hKh \in K, h(k)=0h(k) = 0 for k<v(h)k < v(h) and h(v(h))=lc(h)0h(v(h)) = \operatorname{lc}(h) \ne 0; ι(c)\iota(c) is cc at index 00 and 00 elsewhere; 1K=ι(1)1_K = \iota(1) (The formal Laurent series R((t1))\mathbb{R}((t^{-1})): support bounded below, valuation, leading coefficient).

[L2]

KK is a commutative ring, (f+g)(k)=f(k)+g(k)(f+g)(k) = f(k)+g(k), and (ι(c)h)(k)=ch(k)(\iota(c)h)(k) = c\,h(k) (R((t1))\mathbb{R}((t^{-1})) is a commutative ring: the product is a finite sum and both operations preserve support bounded below).

[L3]

For nonzero f,gKf, g \in K: fg0Kfg \ne 0_K with lc(fg)=lc(f)lc(g)\operatorname{lc}(fg) = \operatorname{lc}(f)\operatorname{lc}(g); f0K-f \ne 0_K with v(f)=v(f)v(-f) = v(f) and lc(f)=lc(f)\operatorname{lc}(-f) = -\operatorname{lc}(f); if v(f)<v(g)v(f) < v(g) then f+g0Kf+g \ne 0_K with v(f+g)=v(f)v(f+g) = v(f) and lc(f+g)=lc(f)\operatorname{lc}(f+g) = \operatorname{lc}(f); and if v(f)=v(g)v(f) = v(g) with lc(f)+lc(g)0\operatorname{lc}(f) + \operatorname{lc}(g) \ne 0 then f+g0Kf+g \ne 0_K with lc(f+g)=lc(f)+lc(g)\operatorname{lc}(f+g) = \operatorname{lc}(f) + \operatorname{lc}(g) (Valuation and leading coefficient in R((t1))\mathbb{R}((t^{-1})): v(fg)=v(f)+v(g)v(fg) = v(f) + v(g), and the behaviour of vv under sums).

[L5]

An ordered field is a field with a subset PP satisfying (O1) trichotomy, for each xx exactly one of xPx \in P, x=0x = 0, xP-x \in P, and (O2) closure of PP under addition and multiplication; the order is then a<b:    baPa < b :\iff b - a \in P (Ordered field). For n1n \ge 1, n1Fn \cdot 1_F is the nn-fold sum of 1F1_F, and 01F=00 \cdot 1_F = 0 (Archimedean ordered field).

[L6]

R\mathbb{R} is an ordered field: exactly one of x>0x > 0, x=0x = 0, x<0x < 0 holds for each real xx, and sums and products of positive reals are positive (The reals form a totally ordered field, Ordered field).

[L7]

x=x|x| = x when x0x \ge 0 and x=x|x| = -x when x<0x < 0, in any ordered field and in R\mathbb{R} (Absolute value in an ordered field).

[L8]

Induction: a property holding at 00 and inherited from nn to n+1n+1 holds at every natural number (The principle of mathematical induction, The natural numbers N\mathbb{N} (von Neumann)).

[L9]

The order on Z\mathbb{Z} is total, so for p,qZp, q \in \mathbb{Z} exactly one of p<qp < q, p=qp = q, q<pq < p holds (The integers form a totally ordered ring).

Proof

technique · direct
1.1

Let fKf \in K. If f=0Kf = 0_K then neither ff nor f=0K-f = 0_K lies in PP, since membership in PP requires being nonzero. If f0Kf \ne 0_K then f0K-f \ne 0_K and lc(f)=lc(f)\operatorname{lc}(-f) = -\operatorname{lc}(f) by [L3], and by trichotomy in R\mathbb{R} ([L6]) exactly one of lc(f)>0\operatorname{lc}(f) > 0 and lc(f)>0-\operatorname{lc}(f) > 0 holds. So for every ff exactly one of fPf \in P, f=0Kf = 0_K, fP-f \in P holds, which is (O1).

L1L3L5L6
1.2

Let f,gPf, g \in P. By [L3] fg0Kfg \ne 0_K and lc(fg)=lc(f)lc(g)\operatorname{lc}(fg) = \operatorname{lc}(f)\operatorname{lc}(g), a product of two positive reals, hence positive by [L6]; so fgPfg \in P.

L3L6
1.3

ι(c)+ι(d)=ι(c+d)\iota(c) + \iota(d) = \iota(c+d) because addition is computed index by index, and ι(c)ι(d)=ι(cd)\iota(c)\iota(d) = \iota(cd) because (ι(c)ι(d))(k)=cι(d)(k)(\iota(c)\iota(d))(k) = c\,\iota(d)(k) by [L2], which is cdcd at k=0k = 0 and 00 elsewhere; also ι(1)=1K\iota(1) = 1_K, and ι\iota is injective since ι(c)(0)=c\iota(c)(0) = c.

L1L2
2.1

Let f,gPf, g \in P and compare v(f)v(f) with v(g)v(g), which by [L9] are related in exactly one of three ways. If v(f)<v(g)v(f) < v(g) then by [L3] f+g0Kf + g \ne 0_K and lc(f+g)=lc(f)>0\operatorname{lc}(f+g) = \operatorname{lc}(f) > 0; if v(g)<v(f)v(g) < v(f) the same argument with the roles exchanged applies; and if v(f)=v(g)v(f) = v(g) then lc(f)+lc(g)>0\operatorname{lc}(f) + \operatorname{lc}(g) > 0 by [L6], in particular nonzero, so by [L3] f+g0Kf+g \ne 0_K and lc(f+g)=lc(f)+lc(g)>0\operatorname{lc}(f+g) = \operatorname{lc}(f) + \operatorname{lc}(g) > 0. In every case f+gPf + g \in P, which with [step 1.2] is (O2).

step 1.2L3L6L9
2.2

For c0c \ne 0 the series ι(c)\iota(c) is nonzero with v(ι(c))=0v(\iota(c)) = 0 and lc(ι(c))=c\operatorname{lc}(\iota(c)) = c, so ι(c)P\iota(c) \in P exactly when c>0c > 0; and ι(0)=0KP\iota(0) = 0_K \notin P. With [step 1.3] this makes ι\iota an injective ring homomorphism carrying the positive reals onto the positive constants.

step 1.3L1
2.3

For every natural nn, n1K=ι(n1R)n \cdot 1_K = \iota(n \cdot 1_{\mathbb{R}}): at n=0n = 0 both sides are 0K0_K by [L5] and [L1], and if the identity holds at nn then (n+1)1K=n1K+1K=ι(n1R)+ι(1)=ι(n1R+1)=ι((n+1)1R)(n+1)\cdot 1_K = n \cdot 1_K + 1_K = \iota(n \cdot 1_{\mathbb{R}}) + \iota(1) = \iota(n \cdot 1_{\mathbb{R}} + 1) = \iota((n+1)\cdot 1_{\mathbb{R}}) by [step 1.3].

step 1.3L1L5L8
3.1

By [step 1.1] and [step 2.1] the set PP satisfies (O1) and (O2), and KK is a field by [L4]; hence (K,P)(K,P) is an ordered field, in which f<gf < g means gfPg - f \in P, that is, gf0Kg - f \ne 0_K and lc(gf)>0\operatorname{lc}(g-f) > 0.

step 1.1step 2.1L4L5
4.1

Let f0Kf \ne 0_K. If fPf \in P then f>0Kf > 0_K by [step 3.1], so f=f|f| = f by [L7], and lc(f)=lc(f)=lc(f)\operatorname{lc}(|f|) = \operatorname{lc}(f) = \lvert \operatorname{lc}(f)\rvert since lc(f)>0\operatorname{lc}(f) > 0. Otherwise fP-f \in P by [step 1.1], so f<0Kf < 0_K and f=f|f| = -f, whence f0K|f| \ne 0_K, v(f)=v(f)v(|f|) = v(f) and lc(f)=lc(f)=lc(f)\operatorname{lc}(|f|) = -\operatorname{lc}(f) = \lvert\operatorname{lc}(f)\rvert, again positive. In both cases v(f)=v(f)v(|f|) = v(f) and lc(f)=lc(f)>0\operatorname{lc}(|f|) = \lvert\operatorname{lc}(f)\rvert > 0.

step 1.1step 3.1L3L7
5.1

Clause 1 is [step 3.1], clause 2 is [step 4.1], and clause 3 is [step 2.2] with [step 2.3].

step 3.1step 2.2step 4.1step 2.3

Remarks

  • The order compares lowest terms, and only those. By clause 1, deciding f<gf < g means finding the least index at which ff and gg differ and comparing the two coefficients there. Every later coefficient is irrelevant, which is why ι(c)>t1\iota(c) > t^{-1} for every positive real cc, however small, and why the order is not the coefficientwise one.

  • R\mathbb{R} sits inside KK as an ordered subfield, and that is all clause 3 says. It does not say that R\mathbb{R} is cofinal in KK, and indeed it is not: the computation used for the canonical naturals in R((t1))\mathbb{R}((t^{-1})) is non-Archimedean, and the monomials tkt^{-k} are cofinal below its positive elements applies verbatim to every constant, since v(t)=1<0=v(ι(c))v(t) = -1 < 0 = v(\iota(c)) for every c0c \ne 0, so ι(c)<t\iota(c) < t for every real cc. The identification n1K=ι(n1R)n \cdot 1_K = \iota(n \cdot 1_{\mathbb{R}}) is recorded because the Archimedean property is a statement about the canonical naturals (Archimedean ordered field), and it is the bridge between those and the constant series.

Depends on

Used by

Cited to discharge well-definedness by The formal Laurent series ℝ((t⁻¹)): support bounded below, valuation, leading coefficient.

Dependency tree · next 3 levels

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