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.
is a field: every nonzero formal Laurent series is invertible
Statement
(The formal Laurent series : support bounded below, valuation, leading coefficient) is a field (Field): it is a commutative ring with , and every with has a multiplicative inverse in .
Explicitly, if and , then for the element given by for and for , and , where vanishes at every index and is given at by .
Scratch work
The identity behind the construction is the geometric series . It cannot be used as written, because has no notion of an infinite sum. What replaces it is the observation that vanishes at every index below , so at any single index only the terms can contribute; the displayed formula for is that finite truncation, and the support of the result is bounded below because every vanishes below .
Facts & Assumptions
Given: A nonzero ; write and , so that for every and .
is the set of functions whose support is bounded below; is at index and elsewhere; is at index and elsewhere; for nonzero one has for and (The formal Laurent series : support bounded below, valuation, leading coefficient).
is a commutative ring with identity ; is a finite sum; if vanishes at every index and at every index then vanishes at every index ; and hence ; and ( is a commutative ring: the product is a finite sum and both operations preserve support bounded below).
A product of two nonzero elements of is nonzero (Valuation and leading coefficient in : , and the behaviour of under sums).
is a field: every nonzero has an inverse with , and a finite sum of reals may be reordered and regrouped freely (Field, The reals form a totally ordered field).
Recursion on : for a set , an element and a function there is a unique with and (The recursion theorem, The natural numbers (von Neumann)).
Induction: a property holding at and inherited from to holds at every natural number (The principle of mathematical induction).
A field is a commutative ring with 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
Define by for and for . Then vanishes at every index , so its support is bounded below and .
By [L5] with , and there is a family in with and .
For every , by [L2]; this is when because vanishes at every negative index, it is when , and it is when . Comparing with for and , we get .
For every , vanishes at every index : at this says vanishes at every negative index, which holds by [L1]; and if vanishes at every index then, since vanishes at every index by [step 1.1], the product vanishes at every index by [L2].
Define by for and for ; each value is a finite sum of reals, and vanishes at every index , so .
Fix . In a term can be nonzero only when and , hence only for and ; so .
For one has , since vanishes at every index and at every index , so every pair with has .
In the inner sum of [step 4.1] the terms with vanish by [step 2.2], so the inner sum may be extended to without changing its value; interchanging the two finite sums gives .
For each , , because a term of the full convolution can be nonzero only for and ; hence for every .
For , ; for , and , so the value is ; and for both and are , as is . Hence .
Using [step 2.1], [L2] and , one computes , so is a multiplicative inverse of .
is a commutative ring with by [L2], its nonzero elements are closed under multiplication by [L3], and by [step 8.1] every nonzero element has an inverse; so satisfies the field axioms of [L7] and the construction is complete.
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 be spoken of at all; and it is what has to be re-established for the constructed inverse, which is why was defined to vanish at every negative index rather than found to. The verification that this definition is consistent with 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 with and vanishing at every index . Evaluating as in [step 2.1] gives , which is for and equals at ; so and , and then for . 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
- The formal Laurent series $\mathbb{R}((t^{-1}))$: support bounded below, valuation, leading coefficient
- $\mathbb{R}((t^{-1}))$ is a commutative ring: the product is a finite sum and both operations preserve support bounded below
- Valuation and leading coefficient in $\mathbb{R}((t^{-1}))$: $v(fg) = v(f) + v(g)$, and the behaviour of $v$ under sums
- Field
- The reals form a totally ordered field
- The recursion theorem
- The principle of mathematical induction
- The natural numbers $\mathbb{N}$ (von Neumann)
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
- Formal power series (Wikipedia) (standard reference, not scraped)
- Hahn series (Wikipedia) (standard reference, not scraped)
- B. Sambale, An invitation to formal power series (standard reference, not scraped)
- Laurent series (Encyclopedia of Mathematics) (standard reference, not scraped)