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

R((t−1)) is a commutative ring: the product is a finite sum and both operations preserve support bounded below

Statement

Let K=R((t−1)) be as in The formal Laurent series R((t−1)): support bounded below, valuation, leading coefficient, and let f,g∈K, with m,n∈Z chosen so that f(i)=0 for all i<m and g(j)=0 for all j<n. Then:

  1. (Finiteness.) For every k∈Z the set Sk:={ (i,j)∈Z×Z:i+j=k,  f(i)g(j)≠0 } is finite, so (fg)(k)=∑i+j=kf(i)g(j) is a finite sum of reals; and Sk=∅ whenever k<m+n.
  2. (Closure.) f+g, −f and fg lie in K, with (f+g)(k)=0 for k<min⁡(m,n) and (fg)(k)=0 for k<m+n.
  3. (Ring.) (K,+,⋅ ,0K,1K) is a commutative ring with identity, and 1K≠0K.
  4. (Monomials and constants.) (t−ah)(k)=h(k−a) for every h∈K and all a,k∈Z; consequently t−a t−b=t−(a+b) for all a,b∈Z. Moreover (ι(c)f)(k)=c f(k) for all c∈R and k∈Z.
  5. (Least element.) Every nonempty S⊆Z that is bounded below has a least element. In particular supp⁡f has a least element whenever f≠0K, so the valuation v(f) and the leading coefficient lc⁡(f) of The formal Laurent series R((t−1)): support bounded below, valuation, leading coefficient are defined.

Facts & Assumptions

Given: K, its operations, 0K, 1K, the monomials t−n and the constants ι(c) as in The formal Laurent series R((t−1)): support bounded below, valuation, leading coefficient; elements f,g∈K and bounds m,n∈Z with f(i)=0 for i<m and g(j)=0 for j<n.

[L1]

K consists of the functions Z→R whose support is bounded below; (f+g)(k)=f(k)+g(k) and (fg)(k)=∑i+j=kf(i)g(j); 0K is the zero function, 1K is 1 at index 0 and 0 elsewhere, t−a is 1 at index a and 0 elsewhere, and ι(c) is c at index 0 and 0 elsewhere (The formal Laurent series R((t−1)): support bounded below, valuation, leading coefficient).

[L2]

Z is a totally ordered commutative ring: its order is total, and x≤y implies x+z≤y+z (The integers form a totally ordered ring, Order on the integers, Arithmetic on the integers).

[L3]

Every nonempty subset of N has a least element (The well-ordering principle).

[L4]

The map ε(a)=[(a,0)] is injective from N onto the set of nonnegative integers and preserves addition and order, so every integer x≥0 is ε(a) for a unique natural a (The naturals embed in the integers).

[L5]

R is a field: addition and multiplication are associative and commutative, multiplication distributes over addition, 0≠1, and a finite sum of reals is independent of the order and bracketing of its terms (Field, The reals form a totally ordered field).

Proof

technique · direct
1.1

Let S⊆Z be nonempty with s≥b for all s∈S. Every element of T:={ s−b:s∈S } is a nonnegative integer, so by [L4] T={ ε(a):a∈A } for a nonempty A⊆N; by [L3] A has a least element a0, and since ε preserves order and x↦x+b preserves order, ε(a0)+b is an element of S that is ≤ every element of S.

L2L3L4
1.2

Fix k∈Z and let (i,j)∈Sk. Then f(i)≠0 and g(j)≠0, so i≥m and j≥n; from i+j=k and j≥n we get i=k−j≤k−n. Hence m≤i≤k−n, and j=k−i is determined by i.

givenL1L2
2.1

The integers i with m≤i≤k−n are in order-preserving bijection with the naturals a satisfying ε(a)≤k−n−m by [L4], and there are finitely many of these, none at all when k−n−m<0; so Sk is a finite set by [step 1.2], it is empty whenever k<m+n, and therefore (fg)(k) is a finite sum of reals which is 0 whenever k<m+n.

step 1.2L2L4L5
3.1

(f+g)(k)=f(k)+g(k)=0 for every k<min⁡(m,n) and (−f)(k)=−f(k)=0 for every k<m, so f+g and −f have support bounded below; and (fg)(k)=0 for every k<m+n by [step 2.1], so fg does too. All three therefore lie in K.

step 2.1givenL1L5
3.2

(fg)(k)=∑i+j=kf(i)g(j)=∑j+i=kg(j)f(i)=(gf)(k), since the two sums have the same finite index set and their terms agree by commutativity of multiplication in R; so multiplication on K is commutative.

step 2.1L5
3.3

For f,g,h∈K and k∈Z, expanding both ((fg)h)(k) and (f(gh))(k) by [L1] and [L5] gives the sum of f(i)g(j)h(l) over the triples (i,j,l) with i+j+l=k and f(i)g(j)h(l)≠0; that set is finite because the argument of [step 1.2] bounds i, j and l from below and hence, as in [step 2.1], from above as well. So multiplication on K is associative.

step 1.2step 2.1L5
3.4

(f(g+h))(k)=∑i+j=kf(i)(g(j)+h(j))=∑i+j=kf(i)g(j)+∑i+j=kf(i)h(j)=(fg)(k)+(fh)(k), all three sums being finite; so multiplication distributes over addition.

step 2.1L5
3.5

For h∈K, (t−ah)(k)=∑i+j=kt−a(i)h(j) has at most one nonzero term, the one with i=a and j=k−a, so (t−ah)(k)=h(k−a); taking h=t−b gives (t−at−b)(k)=t−b(k−a), which is 1 when k=a+b and 0 otherwise, that is, t−at−b=t−(a+b).

step 2.1L1
3.6

(ι(c)f)(k)=∑i+j=kι(c)(i)f(j) has at most one nonzero term, the one with i=0 and j=k, so (ι(c)f)(k)=c f(k).

step 2.1L1
3.7

(f⋅1K)(k)=∑i+j=kf(i)1K(j) has at most one nonzero term, the one with j=0 and i=k, so (f⋅1K)(k)=f(k) and f⋅1K=f; moreover 1K(0)=1≠0=0K(0), so 1K≠0K.

step 2.1L1L5
4.1

Addition on K is defined index by index, and K is closed under it and under negation by [step 3.1]; so associativity, commutativity, the law f+0K=f and the law f+(−f)=0K each hold at every index by the corresponding law in R, and (K,+,0K) is an abelian group.

step 3.1L1L5
5.1

By [step 4.1] addition makes K an abelian group, by [step 3.2], [step 3.3] and [step 3.7] multiplication is commutative and associative with identity 1K≠0K, and by [step 3.4] it distributes over addition; hence K is a commutative ring with identity.

step 3.2step 3.3step 3.4step 3.7step 4.1
6.1

Clause 1 is [step 2.1], clause 2 is [step 3.1] with [step 2.1], clause 3 is [step 5.1], clause 4 is [step 3.5] and [step 3.6], and clause 5 is [step 1.1] applied to S=supp⁡f, which is nonempty when f≠0K and bounded below because f∈K.

step 1.1step 2.1step 3.1step 3.5step 3.6step 5.1∎

Depends on

Used by

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

Dependency tree · two levels

36 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