Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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((t1))\mathbb{R}((t^{-1})) is a field: every nonzero formal Laurent series is invertible

Statement

K=R((t1))K = \mathbb{R}((t^{-1})) (The formal Laurent series R((t1))\mathbb{R}((t^{-1})): support bounded below, valuation, leading coefficient) is a field (Field): it is a commutative ring with 1K0K1_K \ne 0_K, and every fKf \in K with f0Kf \ne 0_K has a multiplicative inverse in KK.

Explicitly, if p=v(f)p = v(f) and c=lc(f)c = \operatorname{lc}(f), then f=ι(c)tp(1Ku)f = \iota(c)\, t^{-p}\,(1_K - u) for the element uKu \in K given by u(j)=c1f(p+j)u(j) = -c^{-1}f(p+j) for j1j \ge 1 and u(j)=0u(j) = 0 for j0j \le 0, and f1=ι(c1)tpgf^{-1} = \iota(c^{-1})\, t^{p}\, g, where gKg \in K vanishes at every index <0< 0 and is given at k0k \ge 0 by g(k)=n=0k(un)(k)g(k) = \sum_{n=0}^{k} (u^{n})(k).

Scratch work

The identity behind the construction is the geometric series (1u)1=1+u+u2+(1-u)^{-1} = 1 + u + u^{2} + \cdots. It cannot be used as written, because KK has no notion of an infinite sum. What replaces it is the observation that unu^{n} vanishes at every index below nn, so at any single index kk only the terms nkn \le k can contribute; the displayed formula for g(k)g(k) is that finite truncation, and the support of the result is bounded below because every unu^{n} vanishes below 00.

Facts & Assumptions

Given: A nonzero fKf \in K; write p:=v(f)Zp := v(f) \in \mathbb{Z} and c:=lc(f)R{0}c := \operatorname{lc}(f) \in \mathbb{R} \setminus \{0\}, so that f(k)=0f(k) = 0 for every k<pk < p and f(p)=cf(p) = c.

[L1]

KK is the set of functions ZR\mathbb{Z} \to \mathbb{R} whose support is bounded below; tat^{-a} is 11 at index aa and 00 elsewhere; ι(c)\iota(c) is cc at index 00 and 00 elsewhere; for nonzero hKh \in K one has 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 (The formal Laurent series R((t1))\mathbb{R}((t^{-1})): support bounded below, valuation, leading coefficient).

[L2]

KK is a commutative ring with identity 1K0K1_K \ne 0_K; (h1h2)(k)=i+j=kh1(i)h2(j)(h_1h_2)(k) = \sum_{i+j=k} h_1(i)h_2(j) is a finite sum; if h1h_1 vanishes at every index <a< a and h2h_2 at every index <b< b then h1h2h_1h_2 vanishes at every index <a+b< a + b; (tah)(k)=h(ka)(t^{-a}h)(k) = h(k-a) and hence tatb=t(a+b)t^{-a}t^{-b} = t^{-(a+b)}; 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).

[L4]

R\mathbb{R} is a field: every nonzero cc has an inverse c1c^{-1} with cc1=1cc^{-1} = 1, and a finite sum of reals may be reordered and regrouped freely (Field, The reals form a totally ordered field).

[L5]

Recursion on N\mathbb{N}: for a set AA, an element aAa \in A and a function F:AAF : A \to A there is a unique Γ:NA\Gamma : \mathbb{N} \to A with Γ(0)=a\Gamma(0) = a and Γ(σ(n))=F(Γ(n))\Gamma(\sigma(n)) = F(\Gamma(n)) (The recursion theorem, The natural numbers N\mathbb{N} (von Neumann)).

[L6]

Induction: a property holding at 00 and inherited from nn to σ(n)\sigma(n) holds at every natural number (The principle of mathematical induction).

[L7]

A field is a commutative ring with 010 \ne 1 in which multiplication restricted to the nonzero elements is an abelian group, that is, in which the nonzero elements are closed under multiplication and each has an inverse (Field).

Proof

technique · constructive
1.1

Define u:ZRu : \mathbb{Z} \to \mathbb{R} by u(j):=c1f(p+j)u(j) := -c^{-1} f(p + j) for j1j \ge 1 and u(j):=0u(j) := 0 for j0j \le 0. Then uu vanishes at every index <1< 1, so its support is bounded below and uKu \in K.

givenL1L4construct
1.2

By [L5] with A=KA = K, a=1Ka = 1_K and F(h)=huF(h) = hu there is a family (un)nN(u^{n})_{n \in \mathbb{N}} in KK with u0=1Ku^{0} = 1_K and uσ(n)=unuu^{\sigma(n)} = u^{n} u.

L2L5construct
2.1

For every kZk \in \mathbb{Z}, (ι(c)tp(1Ku))(k)=c(1Ku)(kp)\bigl(\iota(c)\,t^{-p}\,(1_K - u)\bigr)(k) = c\,(1_K - u)(k - p) by [L2]; this is 00 when k<pk < p because 1Ku1_K - u vanishes at every negative index, it is cc when k=pk = p, and it is c(u(kp))=cc1f(k)=f(k)c \cdot \bigl(-u(k-p)\bigr) = c c^{-1} f(k) = f(k) when k>pk > p. Comparing with f(k)=0f(k) = 0 for k<pk < p and f(p)=cf(p) = c, we get f=ι(c)tp(1Ku)f = \iota(c)\, t^{-p}\,(1_K - u).

step 1.1givenL1L2L4
2.2

For every nNn \in \mathbb{N}, unu^{n} vanishes at every index <n< n: at n=0n = 0 this says 1K1_K vanishes at every negative index, which holds by [L1]; and if unu^{n} vanishes at every index <n< n then, since uu vanishes at every index <1< 1 by [step 1.1], the product uσ(n)=unuu^{\sigma(n)} = u^{n}u vanishes at every index <n+1< n + 1 by [L2].

step 1.1step 1.2L1L2L6
3.1

Define g:ZRg : \mathbb{Z} \to \mathbb{R} by g(k):=n=0k(un)(k)g(k) := \sum_{n=0}^{k} (u^{n})(k) for k0k \ge 0 and g(k):=0g(k) := 0 for k<0k < 0; each value is a finite sum of reals, and gg vanishes at every index <0< 0, so gKg \in K.

step 2.2L1L4construct
4.1

Fix k1k \ge 1. In (ug)(k)=i+j=ku(i)g(j)(ug)(k) = \sum_{i+j=k} u(i)g(j) a term can be nonzero only when i1i \ge 1 and j0j \ge 0, hence only for 1ik1 \le i \le k and j=kij = k - i; so (ug)(k)=i=1ku(i)g(ki)=i=1ku(i)n=0ki(un)(ki)(ug)(k) = \sum_{i=1}^{k} u(i)\, g(k-i) = \sum_{i=1}^{k} u(i) \sum_{n=0}^{k-i} (u^{n})(k-i).

step 1.1step 3.1L1L2
4.2

For k0k \le 0 one has (ug)(k)=0(ug)(k) = 0, since uu vanishes at every index <1< 1 and gg at every index <0< 0, so every pair (i,j)(i,j) with i+j=ki + j = k has u(i)g(j)=0u(i)g(j) = 0.

step 1.1step 3.1L1L2
5.1

In the inner sum of [step 4.1] the terms with ki<nk1k - i < n \le k-1 vanish by [step 2.2], so the inner sum may be extended to n=0,,k1n = 0, \dots, k-1 without changing its value; interchanging the two finite sums gives (ug)(k)=n=0k1i=1ku(i)(un)(ki)(ug)(k) = \sum_{n=0}^{k-1} \sum_{i=1}^{k} u(i)\,(u^{n})(k-i).

step 2.2step 4.1L4
6.1

For each nn, i=1ku(i)(un)(ki)=i+j=ku(i)(un)(j)=(uun)(k)=(uσ(n))(k)\sum_{i=1}^{k} u(i)(u^{n})(k-i) = \sum_{i+j=k} u(i)(u^{n})(j) = (u\,u^{n})(k) = (u^{\sigma(n)})(k), because a term of the full convolution can be nonzero only for i1i \ge 1 and j0j \ge 0; hence (ug)(k)=n=0k1(uσ(n))(k)=n=1k(un)(k)(ug)(k) = \sum_{n=0}^{k-1} (u^{\sigma(n)})(k) = \sum_{n=1}^{k} (u^{n})(k) for every k1k \ge 1.

step 1.2step 2.2step 5.1L2
7.1

For k1k \ge 1, ((1Ku)g)(k)=g(k)(ug)(k)=n=0k(un)(k)n=1k(un)(k)=(u0)(k)=1K(k)\bigl((1_K - u)g\bigr)(k) = g(k) - (ug)(k) = \sum_{n=0}^{k}(u^{n})(k) - \sum_{n=1}^{k}(u^{n})(k) = (u^{0})(k) = 1_K(k); for k=0k = 0, g(0)=(u0)(0)=1g(0) = (u^{0})(0) = 1 and (ug)(0)=0(ug)(0) = 0, so the value is 1=1K(0)1 = 1_K(0); and for k<0k < 0 both g(k)g(k) and (ug)(k)(ug)(k) are 00, as is 1K(k)1_K(k). Hence (1Ku)g=1K(1_K - u)g = 1_K.

step 3.1step 4.2step 6.1L1L2
8.1

Using [step 2.1], [L2] and cc1=1cc^{-1} = 1, one computes f(ι(c1)tpg)=ι(c)ι(c1)tpt(p)(1Ku)g=1K1K1K=1Kf \cdot \bigl(\iota(c^{-1})\,t^{p}\,g\bigr) = \iota(c)\iota(c^{-1})\, t^{-p}t^{-(-p)}\,(1_K - u)g = 1_K \cdot 1_K \cdot 1_K = 1_K, so ι(c1)tpgK\iota(c^{-1}) t^{p} g \in K is a multiplicative inverse of ff.

step 2.1step 7.1L2L4
9.1

KK is a commutative ring with 1K0K1_K \ne 0_K by [L2], its nonzero elements are closed under multiplication by [L3], and by [step 8.1] every nonzero element has an inverse; so KK satisfies the field axioms of [L7] and the construction is complete.

step 8.1L2L3L7discharge-construct

Remarks

  • Where support-boundedness is really used. Twice, and in different ways. It makes each coefficient of a product a finite sum, which is what lets (un)(k)(u^{n})(k) be spoken of at all; and it is what has to be re-established for the constructed inverse, which is why gg was defined to vanish at every negative index rather than found to. The verification that this definition is consistent with (1Ku)g=1K(1_K - u)g = 1_K is [step 7.1], and it is exactly the point at which an infinite geometric series would have had to be summed.

  • The normalisation is forced, and that is why the recipe is explicit. Suppose f=ι(c)tp(1Kw)f = \iota(c')t^{-p'}(1_K - w) with c0c' \ne 0 and ww vanishing at every index 0\le 0. Evaluating as in [step 2.1] gives f(k)=c(1Kw)(kp)f(k) = c'(1_K - w)(k - p'), which is 00 for k<pk < p' and equals cc' at k=pk = p'; so p=v(f)p' = v(f) and c=lc(f)c' = \operatorname{lc}(f), and then w(j)=c1f(p+j)w(j) = -c'^{-1}f(p'+j) for j1j \ge 1. The factorisation used in the proof is therefore the only one of its shape, and the formula for the inverse is a recipe rather than a choice.

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: 60 results over 28 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