Engineering / Mathematics — Fields, Series and Factorisation
Formal Laurent Series
Formal Laurent series, the field of fractions of the power series ring, and the valuation structure.
Executive summary
Allowing finitely many negative-exponent terms turns the power series ring into a field, the field of formal Laurent series.
It is the field of fractions of the power series ring, and it carries a valuation making it the function-field analogue of the p-adic numbers.
Learning objectives
- Define formal Laurent series and verify the field property.
- Identify the valuation and its properties.
- Relate the construction to p-adic numbers.
01Definition and the field property
Formal Laurent series
An element of F((X)) is a series Σ_{i ≥ k} aᵢX^i with k ∈ Z — finitely many negative terms permitted, infinitely many positive ones.
F((X)) is a field
Every non-zero formal Laurent series is invertible, and F((X)) is the field of fractions of F[[X]].
The argument is short. Any non-zero series factors as X^k u with u a unit of the power series ring, since u has non-zero constant term. Its inverse is X^{−k}u^{−1}, which is a Laurent series.
02The valuation
Order valuation
v(f) is the least index with non-zero coefficient, and v(0) = ∞.
Valuation properties
v(fg) = v(f) + v(g) and v(f + g) ≥ min(v(f), v(g)), with equality when v(f) ≠ v(g).
The second property is stronger than the triangle inequality and makes the induced absolute value non-archimedean. Geometrically this produces the ultrametric behaviour familiar from p-adic analysis: every triangle is isosceles, and every point of a disc is its centre.
| Function field side | Number field side |
|---|---|
| F[X] | Z |
| F[[X]] | p-adic integers Z_p |
| F((X)) | p-adic numbers Q_p |
| Order of vanishing at 0 | Power of p dividing |
| Irreducible polynomial | Prime number |
03Computational role
Laurent series are the natural setting for rational function reconstruction, which is the polynomial analogue of recovering a rational from a residue.
Rational function reconstruction
A rational function is recovered from finitely many series coefficients, exactly as a rational number is recovered from a residue.
Linearly generated sequences
A sequence satisfies a linear recurrence exactly when its generating function is rational, which is a statement about Laurent series.
Reed-Solomon decoding
The key equation of algebraic decoding is a rational reconstruction problem in this ring.
The practical form used is the reversed Laurent series, which reverses the roles of large and small exponents so that polynomial degree behaves like an absolute value. That variant is treated separately because it is the one the reconstruction algorithms actually operate on.
04Frequently asked questions
Why only finitely many negative terms?
Because allowing infinitely many in both directions breaks multiplication — the coefficient of a product would be an infinite sum with no meaning in a general ring. A one-sided bound keeps every coefficient a finite sum.
Is F((X)) algebraically closed?
No. Its algebraic closure requires fractional exponents, giving the Puiseux series field, which is algebraically closed when the base field is and has characteristic zero.
How deep is the p-adic analogy?
Very. Many theorems have parallel statements in both settings, and results are often proved first in the function field case where the geometry is more tractable. The analogy has driven substantial research in number theory.
Sources and method
Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 380-382.
This page carries the durable method layer only: definitions, constructions, algorithms, complexity results and selection criteria, authored originally for KEVOS. No text is transcribed or paraphrased from the source, and no numeric tables or benchmark data are reproduced — these are routed to live authoritative sources instead.
Author: Kevin Jogin. Last reviewed 2026-08-07.