Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-26
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 formal Laurent series R((t1))\mathbb{R}((t^{-1})): support bounded below, valuation, leading coefficient

Definition

Throughout, R\mathbb{R} is the field of real numbers with its order (The real numbers, The reals form a totally ordered field) and Z\mathbb{Z} is the totally ordered commutative ring of integers (The integers as equivalence classes of pairs of naturals, Arithmetic on the integers, Order on the integers, The integers form a totally ordered ring).

For a function f:ZRf : \mathbb{Z} \to \mathbb{R} write

suppf  :=  {kZ:f(k)0},\operatorname{supp} f \;:=\; \{\, k \in \mathbb{Z} : f(k) \ne 0 \,\},

and say that suppf\operatorname{supp} f is bounded below when there is mZm \in \mathbb{Z} with f(k)=0f(k) = 0 for every k<mk < m. The set of formal Laurent series in t1t^{-1} over R\mathbb{R} is

K  =  R((t1))  :=  {f:ZR    suppf is bounded below},K \;=\; \mathbb{R}((t^{-1})) \;:=\; \{\, f : \mathbb{Z} \to \mathbb{R} \;\mid\; \operatorname{supp} f \text{ is bounded below} \,\},

equipped with

(f+g)(k):=f(k)+g(k),(fg)(k):=i+j=kf(i)g(j),(f + g)(k) := f(k) + g(k), \qquad (fg)(k) := \sum_{i + j = k} f(i)\,g(j),

where the product sum ranges over the pairs (i,j)Z×Z(i,j) \in \mathbb{Z} \times \mathbb{Z} with i+j=ki + j = k and f(i)g(j)0f(i)g(j) \ne 0. That set of pairs is finite for every kk, and f+gf + g and fgfg again lie in KK: this is R((t1))\mathbb{R}((t^{-1})) is a commutative ring: the product is a finite sum and both operations preserve support bounded below , which also proves that KK with these operations is a commutative ring whose zero 0K0_K is the constant function 00 and whose identity 1K1_K is the function taking the value 11 at 00 and 00 elsewhere.

Distinguished elements. For nZn \in \mathbb{Z} let tnKt^{-n} \in K be the function taking the value 11 at nn and 00 at every other index; so t0=1Kt^{0} = 1_K, and t:=t(1)t := t^{-(-1)} is the function taking the value 11 at 1-1. For cRc \in \mathbb{R} let ι(c)K\iota(c) \in K be the function taking the value cc at 00 and 00 elsewhere. The notation tnt^{-n} is defined here as a name; that it is consistent with the ring multiplication, tmtn=t(m+n)t^{-m} \, t^{-n} = t^{-(m+n)}, is proved in R((t1))\mathbb{R}((t^{-1})) is a commutative ring: the product is a finite sum and both operations preserve support bounded below .

Series notation. Because suppf\operatorname{supp} f is bounded below, say by mm, one writes

f  =  kmf(k)tk,f \;=\; \sum_{k \ge m} f(k)\, t^{-k},

a purely notational device: the object is the function ff, and no convergence of any kind is asserted or used.

Valuation and leading coefficient. Let fKf \in K with f0Kf \ne 0_K. Then suppf\operatorname{supp} f is nonempty and bounded below, so it has a least element (R((t1))\mathbb{R}((t^{-1})) is a commutative ring: the product is a finite sum and both operations preserve support bounded below ). Define

v(f)  :=  minsuppfZ,lc(f)  :=  f(v(f))R{0}.v(f) \;:=\; \min \operatorname{supp} f \in \mathbb{Z}, \qquad \operatorname{lc}(f) \;:=\; f(v(f)) \in \mathbb{R} \setminus \{0\}.

v(f)v(f) is the valuation and lc(f)\operatorname{lc}(f) the leading coefficient of ff. Neither is defined at f=0Kf = 0_K, whose support is empty; every statement about vv or lc\operatorname{lc} in this library carries the hypothesis f0Kf \ne 0_K explicitly.

Order. The positive cone of KK is

P  :=  {fK:f0K and lc(f)>0},P \;:=\; \{\, f \in K : f \ne 0_K \text{ and } \operatorname{lc}(f) > 0 \,\},

that is, a nonzero series is positive exactly when its lowest-index nonzero coefficient is a positive real. That (K,P)(K, P) is an ordered field (Ordered field, Field) is R((t1))\mathbb{R}((t^{-1})) is an ordered field, ordered by the sign of the leading coefficient , and that every nonzero element of KK is invertible is R((t1))\mathbb{R}((t^{-1})) is a field: every nonzero formal Laurent series is invertible . As in any ordered field, f<gf < g means gfPg - f \in P.

Remarks

  • Why the support must be bounded below. It is exactly what makes the product a finite sum. If arbitrary functions ZR\mathbb{Z} \to \mathbb{R} were admitted, the defining sum for (fg)(k)(fg)(k) would range over an infinite set of pairs and would denote nothing, since KK carries no notion of convergence. The condition is preserved by both operations, which is the content of R((t1))\mathbb{R}((t^{-1})) is a commutative ring: the product is a finite sum and both operations preserve support bounded below .

  • Indices run over all of Z\mathbb{Z}, and the edge cases are real. The zero series has empty support and no valuation. A nonzero constant series ι(c)\iota(c) has v(ι(c))=0v(\iota(c)) = 0 and lc(ι(c))=c\operatorname{lc}(\iota(c)) = c, so the index k=0k = 0 is an ordinary index and not a boundary. Negative indices are admitted, and they are what makes t=t(1)t = t^{-(-1)}, whose support is {1}\{-1\}, an element of KK; a series may have finitely many terms of negative index but never infinitely many.

  • The order is not the coefficientwise order. Two series are compared by their lowest differing coefficient, not by all of them at once, and this is what makes t1t^{-1} smaller than every positive real constant while tt is larger than every real constant. The consequences are drawn in R((t1))\mathbb{R}((t^{-1})) is non-Archimedean, and the monomials tkt^{-k} are cofinal below its positive elements.

  • Relation to the rational functions. The ordered field R(t)\mathbb{R}(t) of Not every ordered field is Archimedean, ordered so that f>0f > 0 exactly when f(x)>0f(x) > 0 for all sufficiently large real xx, is the standard first example of a non-Archimedean ordered field, and standard treatments identify it with a subfield of KK by expanding each rational function at infinity. This page neither constructs that identification nor uses it, and no item here may be cited for it: everything proved about KK below is proved from the definition above and nothing else. What the two objects share, and all that is used here, is the idea of ordering by behaviour at infinity.

Depends on

Used by

Dependency tree · next 3 levels

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