Laurent polynomial

In mathematics, a Laurent polynomial (named after Pierre Alphonse Laurent) in one variable over a field \mathbb{F} is a linear combination of positive and negative powers of the variable with coefficients in \mathbb{F}. Laurent polynomials in X form a ring denoted \mathbb{F}[X, X1].[1] They differ from ordinary polynomials in that they may have terms of negative degree. The construction of Laurent polynomials may be iterated, leading to the ring of Laurent polynomials in several variables.

Definition

A Laurent polynomial with coefficients in a field \mathbb{F} is an expression of the form

 p = \sum_k p_k X^k, \quad p_k\in \mathbb{F}

where X is a formal variable, the summation index k is an integer (not necessarily positive) and only finitely many coefficients pk are non-zero. Two Laurent polynomials are equal if their coefficients are equal. Such expressions can be added, multiplied, and brought back to the same form by reducing similar terms. Formulas for addition and multiplication are exactly the same as for the ordinary polynomials, with the only difference that both positive and negative powers of X can be present:

\left(\sum_i a_iX^i\right) + \left(\sum_i b_iX^i\right) = 
\sum_i (a_i+b_i)X^i

and

\left(\sum_i a_iX^i\right) \cdot \left(\sum_j b_jX^j\right) = 
\sum_k \left(\sum_{i,j: i + j = k} a_i b_j\right)X^k.

Since only finitely many coefficients ai and bj are non-zero, all sums in effect have only finitely many terms, and hence represent Laurent polynomials.

Properties

See also

References

  1. Weisstein, Eric W., "Laurent Polynomial", MathWorld.
This article is issued from Wikipedia - version of the Thursday, February 11, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.