Formal power series

Infinite sum that is considered independently from any notion of convergence

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Formal power series" – news · newspapers · books · scholar · JSTOR (December 2009) (Learn how and when to remove this message)

|

In mathematics, a formal series is an infinite sum that is considered independently from any notion of convergence, and can be manipulated with the usual algebraic operations on series (addition, subtraction, multiplication, division, partial sums, etc.).

A formal power series is a special kind of formal series, of the form

∑ n = 0 ∞ a n x n = a 0 + a 1 x + a 2 x 2 + ⋯ , {\displaystyle \sum _{n=0}^{\infty }a_{n}x^{n}=a_{0}+a_{1}x+a_{2}x^{2}+\cdots ,}

where the  a n , {\displaystyle a_{n},} called coefficients, are numbers or, more generally, elements of some ring, and the  x n {\displaystyle x^{n}} are formal powers of the symbol  x {\displaystyle x} that is called an indeterminate or, commonly, a variable. Hence, power series can be viewed as a generalization of polynomials where the number of terms is allowed to be infinite, and differ from usual power series by the absence of convergence requirements, which implies that a power series may not represent a function of its variable. Formal power series are in one to one correspondence with their sequences of coefficients, but the two concepts must not be confused, since the operations that can be applied are different.

A formal power series with coefficients in a ring  R {\displaystyle R} is called a formal power series over  R . {\displaystyle R.} The formal power series over a ring  R {\displaystyle R} form a ring, commonly denoted by  R [ [ x ] ] . {\displaystyle R[[x]].} (It can be seen as the (x)-adic completion of the polynomial ring R [ x ] , {\displaystyle R[x],} in the same way as the p-adic integers are the p-adic completion of the ring of the integers.)

Formal powers series in several indeterminates are defined similarly by replacing the powers of a single indeterminate by monomials in several indeterminates.

Formal power series are widely used in combinatorics for representing sequences of integers as generating functions. In this context, a recurrence relation between the elements of a sequence may often be interpreted as a differential equation that the generating function satisfies. This allows using methods of complex analysis for combinatorial problems (see analytic combinatorics).

## Introduction

[edit]

A formal power series can be loosely thought of as an object that is like a polynomial, but with infinitely many terms. Alternatively, for those familiar with power series (or Taylor series), one may think of a formal power series as a power series in which we ignore questions of convergence by not assuming that the variable X denotes any numerical value (not even an unknown value). For example, consider the series

A = 1 − 3 X + 5 X 2 − 7 X 3 + 9 X 4 − 11 X 5 + ⋯ . {\displaystyle A=1-3X+5X^{2}-7X^{3}+9X^{4}-11X^{5}+\cdots .}

If we studied this as a power series, its properties would include, for example, that its radius of convergence is 1 by the Cauchy–Hadamard theorem. However, as a formal power series, we may ignore this completely; all that is relevant is the sequence of coefficients [1, −3, 5, −7, 9, −11, ...]. In other words, a formal power series is an object that just records a sequence of coefficients. It is perfectly acceptable to consider a formal power series with the factorials [1, 1, 2, 6, 24, 120, 720, 5040, ... ] as coefficients, even though the corresponding power series diverges for any nonzero value of X.

Algebra on formal power series is carried out by simply pretending that the series are polynomials. For example, if

B = 2 X + 4 X 3 + 6 X 5 + ⋯ , {\displaystyle B=2X+4X^{3}+6X^{5}+\cdots ,}

then we add A and B term by term:

A + B = 1 − X + 5 X 2 − 3 X 3 + 9 X 4 − 5 X 5 + ⋯ . {\displaystyle A+B=1-X+5X^{2}-3X^{3}+9X^{4}-5X^{5}+\cdots .}

We can multiply formal power series, again just by treating them as polynomials (see in particular Cauchy product):

A B = 2 X − 6 X 2 + 14 X 3 − 26 X 4 + 44 X 5 + ⋯ . {\displaystyle AB=2X-6X^{2}+14X^{3}-26X^{4}+44X^{5}+\cdots .}

Notice that each coefficient in the product AB only depends on a finite number of coefficients of A and B. For example, the X5 term is given by

44 X 5 = ( 1 × 6 X 5 ) + ( 5 X 2 × 4 X 3 ) + ( 9 X 4 × 2 X ) . {\displaystyle 44X^{5}=(1\times 6X^{5})+(5X^{2}\times 4X^{3})+(9X^{4}\times 2X).}

For this reason, one may multiply formal power series without worrying about the usual questions of absolute, conditional and uniform convergence which arise in dealing with power series in the setting of analysis.

Once we have defined multiplication for formal power series, we can define multiplicative inverses as follows. The multiplicative inverse of a formal power series A is a formal power series C such that AC = 1, provided that such a formal power series exists. It turns out that if A has a multiplicative inverse, it is unique, and we denote it by A−1. Now we can define division of formal power series by defining B/A to be the product BA−1, provided that the inverse of A exists. For example, one can use the definition of multiplication above to verify the familiar formula

1 1 + X = 1 − X + X 2 − X 3 + X 4 − X 5 + ⋯ . {\displaystyle {\frac {1}{1+X}}=1-X+X^{2}-X^{3}+X^{4}-X^{5}+\cdots .}

An important operation on formal power series is coefficient extraction. In its most basic form, the coefficient extraction operator  [ X n ] {\displaystyle [X^{n}]} applied to a formal power series  A {\displaystyle A} in one variable extracts the coefficient of the  n {\displaystyle n} th power of the variable, so that  [ X 2 ] A = 5 {\displaystyle [X^{2}]A=5} and  [ X 5 ] A = − 11 {\displaystyle [X^{5}]A=-11} . Other examples include

[ X 3 ] ( B ) = 4 , [ X 2 ] ( X + 3 X 2 Y 3 + 10 Y 6 ) = 3 Y 3 , [ X 2 Y 3 ] ( X + 3 X 2 Y 3 + 10 Y 6 ) = 3 , [ X n ] ( 1 1 + X ) = ( − 1 ) n , [ X n ] ( X ( 1 − X ) 2 ) = n . {\displaystyle {\begin{aligned}\left[X^{3}\right](B)&=4,\\\\\left[X^{2}\right](X+3X^{2}Y^{3}+10Y^{6})&=3Y^{3},\\\\\left[X^{2}Y^{3}\right](X+3X^{2}Y^{3}+10Y^{6})&=3,\\\\\left[X^{n}\right]\left({\frac {1}{1+X}}\right)&=(-1)^{n},\\\\\left[X^{n}\right]\left({\frac {X}{(1-X)^{2}}}\right)&=n.\end{aligned}}}

Similarly, many other operations that are carried out on polynomials can be extended to the formal power series setting, as explained below.

## The ring of formal power series

[edit]

Algebraic structure → Ring theory
Ring theory

Basic concepts

Rings

• Subrings
• Ideal
• Quotient ring

• Fractional ideal
• Total ring of fractions
• Product of rings
• Free product of associative algebras
• Tensor product of algebras

Ring homomorphisms

• Kernel
• Inner automorphism
• Frobenius endomorphism

Algebraic structures

• Module
• Associative algebra
• Graded ring
• Involutive ring
• Category of rings

• Initial ring Z {\displaystyle \mathbb {Z} }
• Terminal ring 0 = Z / 1 Z {\displaystyle 0=\mathbb {Z} /1\mathbb {Z} }

Related structures

• Field

• Finite field
• Non-associative ring

• Lie ring
• Jordan ring
• Semiring

• Semifield

Commutative algebra

Commutative rings

• Integral domain

• Integrally closed domain
• GCD domain
• Unique factorization domain
• Principal ideal domain
• Euclidean domain
• Field

• Finite field
• Polynomial ring
• Formal power series ring

Algebraic number theory

• Algebraic number field
• Integers modulo n
• Ring of integers
• p-adic integers Z p {\displaystyle \mathbb {Z} _{p}}
• p-adic numbers Q p {\displaystyle \mathbb {Q} _{p}}
• Prüfer p-ring Z ( p ∞ ) {\displaystyle \mathbb {Z} (p^{\infty })}

Noncommutative algebra

Noncommutative rings

• Division ring
• Semiprimitive ring
• Simple ring
• Commutator

Noncommutative algebraic geometry

Free algebra

Clifford algebra

• Geometric algebra
Operator algebra

* v
* t
* e

If one considers the set of all formal power series in X with coefficients in a commutative ring R, the elements of this set collectively constitute another ring which is written  R [ [ X ] ] , {\displaystyle R[[X]],} and called the ring of formal power series in the variable X over R.

### Definition of the formal power series ring

[edit]

One can characterize  R [ [ X ] ] {\displaystyle R[[X]]} abstractly as the completion of the polynomial ring  R [ X ] {\displaystyle R[X]} equipped with a particular metric. This automatically gives  R [ [ X ] ] {\displaystyle R[[X]]} the structure of a topological ring (and even of a complete metric space). But the general construction of a completion of a metric space is more involved than what is needed here, and would make formal power series seem more complicated than they are. It is possible to describe  R [ [ X ] ] {\displaystyle R[[X]]} more explicitly, and define the ring structure and topological structure separately, as follows.

#### Ring structure

[edit]

As a set,  R [ [ X ] ] {\displaystyle R[[X]]} can be constructed as the set  R N {\displaystyle R^{\mathbb {N} }} of all infinite sequences of elements of  R {\displaystyle R} , indexed by the natural numbers (taken to include 0). Designating a sequence whose term at index  n {\displaystyle n} is  a n {\displaystyle a_{n}} by  ( a n ) {\displaystyle (a_{n})} , one defines addition of two such sequences by

( a n ) n ∈ N + ( b n ) n ∈ N = ( a n + b n ) n ∈ N {\displaystyle (a_{n})_{n\in \mathbb {N} }+(b_{n})_{n\in \mathbb {N} }=\left(a_{n}+b_{n}\right)_{n\in \mathbb {N} }}

and multiplication by

( a n ) n ∈ N × ( b n ) n ∈ N = ( ∑ k = 0 n a k b n − k ) n ∈ N . {\displaystyle (a_{n})_{n\in \mathbb {N} }\times (b_{n})_{n\in \mathbb {N} }=\left(\sum _{k=0}^{n}a_{k}b_{n-k}\right)_{\\!n\in \mathbb {N} }.}

This type of product is called the Cauchy product of the two sequences of coefficients, and is a sort of discrete convolution. With these operations,  R N {\displaystyle R^{\mathbb {N} }} becomes a commutative ring with zero element  ( 0 , 0 , 0 , … ) {\displaystyle (0,0,0,\ldots )} and multiplicative identity  ( 1 , 0 , 0 , … ) {\displaystyle (1,0,0,\ldots )} .

The product is in fact the same one used to define the product of polynomials in one indeterminate, which suggests using a similar notation. One embeds  R {\displaystyle R} into  R [ [ X ] ] {\displaystyle R[[X]]} by sending any (constant)  a ∈ R {\displaystyle a\in R} to the sequence  ( a , 0 , 0 , … ) {\displaystyle (a,0,0,\ldots )} and designates the sequence  ( 0 , 1 , 0 , 0 , … ) {\displaystyle (0,1,0,0,\ldots )} by  X {\displaystyle X} ; then using the above definitions every sequence with only finitely many nonzero terms can be expressed in terms of these special elements as

( a 0 , a 1 , a 2 , … , a n , 0 , 0 , … ) = a 0 + a 1 X + ⋯ + a n X n = ∑ i = 0 n a i X i ; {\displaystyle (a_{0},a_{1},a_{2},\ldots ,a_{n},0,0,\ldots )=a_{0}+a_{1}X+\cdots +a_{n}X^{n}=\sum _{i=0}^{n}a_{i}X^{i};}

these are precisely the polynomials in  X {\displaystyle X} . Given this, it is quite natural and convenient to designate a general sequence  ( a n ) n ∈ N {\displaystyle (a_{n})_{n\in \mathbb {N} }} by the formal expression  ∑ i ∈ N a i X i {\displaystyle \textstyle \sum _{i\in \mathbb {N} }a_{i}X^{i}} , even though the latter is not an expression formed by the operations of addition and multiplication defined above (from which only finite sums can be constructed). This notational convention allows reformulation of the above definitions as

( ∑ i ∈ N a i X i ) + ( ∑ i ∈ N b i X i ) = ∑ i ∈ N ( a i + b i ) X i {\displaystyle \left(\sum _{i\in \mathbb {N} }a_{i}X^{i}\right)+\left(\sum _{i\in \mathbb {N} }b_{i}X^{i}\right)=\sum _{i\in \mathbb {N} }(a_{i}+b_{i})X^{i}}

and

( ∑ i ∈ N a i X i ) × ( ∑ i ∈ N b i X i ) = ∑ n ∈ N ( ∑ k = 0 n a k b n − k ) X n . {\displaystyle \left(\sum _{i\in \mathbb {N} }a_{i}X^{i}\right)\times \left(\sum _{i\in \mathbb {N} }b_{i}X^{i}\right)=\sum _{n\in \mathbb {N} }\left(\sum _{k=0}^{n}a_{k}b_{n-k}\right)X^{n}.}

which is quite convenient, but one must be aware of the distinction between formal summation (a mere convention) and actual addition.

#### Topological structure

[edit]

Having stipulated conventionally that

( a 0 , a 1 , a 2 , a 3 , … ) = ∑ i = 0 ∞ a i X i , {\displaystyle (a_{0},a_{1},a_{2},a_{3},\ldots )=\sum _{i=0}^{\infty }a_{i}X^{i},} |  | (1)

|
|

one would like to interpret the right hand side as a well-defined infinite summation. To that end, a notion of convergence in  R N {\displaystyle R^{\mathbb {N} }} is defined and a topology on  R N {\displaystyle R^{\mathbb {N} }} is constructed. There are several equivalent ways to define the desired topology.

* We may give  R N {\displaystyle R^{\mathbb {N} }} the product topology, where each copy of  R {\displaystyle R} is given the discrete topology.
* We may give  R N {\displaystyle R^{\mathbb {N} }} the I-adic topology, where  I = ( X ) {\displaystyle I=(X)} is the ideal generated by  X {\displaystyle X} , which consists of all sequences whose first term  a 0 {\displaystyle a_{0}} is zero.
* The desired topology could also be derived from the following metric. The distance between distinct sequences  ( a n ) , ( b n ) ∈ R N , {\displaystyle (a_{n}),(b_{n})\in R^{\mathbb {N} },} is defined to be  d ( ( a n ) , ( b n ) ) = 2 − k , {\displaystyle d((a_{n}),(b_{n}))=2^{-k},} where  k {\displaystyle k} is the smallest natural number such that  a k ≠ b k {\displaystyle a_{k}\neq b_{k}} ; the distance between two equal sequences is of course zero.

Informally, two sequences  ( a n ) {\displaystyle (a_{n})} and  ( b n ) {\displaystyle (b_{n})} become closer and closer if and only if more and more of their terms agree exactly. Formally, the sequence of partial sums of some infinite summation converges if for every fixed power of  X {\displaystyle X} the coefficient stabilizes: there is a point beyond which all further partial sums have the same coefficient. This is clearly the case for the right hand side of (1), regardless of the values  a n {\displaystyle a_{n}} , since inclusion of the term for  i = n {\displaystyle i=n} gives the last (and in fact only) change to the coefficient of  X n {\displaystyle X^{n}} . It is also obvious that the limit of the sequence of partial sums is equal to the left hand side.

This topological structure, together with the ring operations described above, form a topological ring. This is called the ring of formal power series over  R {\displaystyle R} and is denoted by  R [ [ X ] ] {\displaystyle R[[X]]} . The topology has the useful property that an infinite summation converges if and only if the sequence of its terms converges to 0, which just means that any fixed power of  X {\displaystyle X} occurs in only finitely many terms.

The topological structure allows much more flexible usage of infinite summations. For instance the rule for multiplication can be restated simply as

( ∑ i ∈ N a i X i ) × ( ∑ i ∈ N b i X i ) = ∑ i , j ∈ N a i b j X i + j , {\displaystyle \left(\sum _{i\in \mathbb {N} }a_{i}X^{i}\right)\times \left(\sum _{i\in \mathbb {N} }b_{i}X^{i}\right)=\sum _{i,j\in \mathbb {N} }a_{i}b_{j}X^{i+j},}

since only finitely many terms on the right affect any fixed  X n {\displaystyle X^{n}} . Infinite products are also defined by the topological structure; it can be seen that an infinite product converges if and only if the sequence of its factors converges to 1 (in which case the product is nonzero) or infinitely many factors have no constant term (in which case the product is zero).

#### Alternative topologies

[edit]

The above topology is the finest topology for which

∑ i = 0 ∞ a i X i {\displaystyle \sum _{i=0}^{\infty }a_{i}X^{i}}

always converges as a summation to the formal power series designated by the same expression, and it often suffices to give a meaning to infinite sums and products, or other kinds of limits that one wishes to use to designate particular formal power series. It can however happen occasionally that one wishes to use a coarser topology, so that certain expressions become convergent that would otherwise diverge. This applies in particular when the base ring  R {\displaystyle R} already comes with a topology other than the discrete one, for instance if it is also a ring of formal power series.

In the ring of formal power series  Z [ [ X ] ] [ [ Y ] ] {\displaystyle \mathbb {Z} [[X]][[Y]]} , the topology of above construction only relates to the indeterminate  Y {\displaystyle Y} , since the topology that was put on  Z [ [ X ] ] {\displaystyle \mathbb {Z} [[X]]} has been replaced by the discrete topology when defining the topology of the whole ring. So

∑ i = 0 ∞ X Y i {\displaystyle \sum _{i=0}^{\infty }XY^{i}}

converges (and its sum can be written as  X 1 − Y {\displaystyle {\tfrac {X}{1-Y}}} ); however

∑ i = 0 ∞ X i Y {\displaystyle \sum _{i=0}^{\infty }X^{i}Y}

would be considered to be divergent, since every term affects the coefficient of  Y {\displaystyle Y} . This asymmetry disappears if the power series ring in  Y {\displaystyle Y} is given the product topology where each copy of  Z [ [ X ] ] {\displaystyle \mathbb {Z} [[X]]} is given its topology as a ring of formal power series rather than the discrete topology. With this topology, a sequence of elements of  Z [ [ X ] ] [ [ Y ] ] {\displaystyle \mathbb {Z} [[X]][[Y]]} converges if the coefficient of each power of  Y {\displaystyle Y} converges to a formal power series in  X {\displaystyle X} , a weaker condition than stabilizing entirely. For instance, with this topology, in the second example given above, the coefficient of  Y {\displaystyle Y} converges to  1 1 − X {\displaystyle {\tfrac {1}{1-X}}} , so the whole summation converges to  Y 1 − X {\displaystyle {\tfrac {Y}{1-X}}} .

This way of defining the topology is in fact the standard one for repeated constructions of rings of formal power series, and gives the same topology as one would get by taking formal power series in all indeterminates at once. In the above example that would mean constructing  Z [ [ X , Y ] ] {\displaystyle \mathbb {Z} [[X,Y]]} and here a sequence converges if and only if the coefficient of every monomial  X i Y j {\displaystyle X^{i}Y^{j}} stabilizes. This topology, which is also the  I {\displaystyle I} -adic topology, where  I = ( X , Y ) {\displaystyle I=(X,Y)} is the ideal generated by  X {\displaystyle X} and  Y {\displaystyle Y} , still enjoys the property that a summation converges if and only if its terms tend to 0.

The same principle could be used to make other divergent limits converge. For instance in  R [ [ X ] ] {\displaystyle \mathbb {R} [[X]]} the limit

lim n -> ∞ ( 1 + X n ) n {\displaystyle \lim _{n\to \infty }\left(1+{\frac {X}{n}}\right)^{\\!n}}

does not exist, so in particular it does not converge to

exp ⁡ ( X ) = ∑ n ∈ N X n n ! . {\displaystyle \exp(X)=\sum _{n\in \mathbb {N} }{\frac {X^{n}}{n!}}.}

This is because for  i ≥ 2 {\displaystyle i\geq 2} the coefficient  ( n i ) / n i {\displaystyle {\tbinom {n}{i}}/n^{i}} of  X i {\displaystyle X^{i}} does not stabilize as  n -> ∞ {\displaystyle n\to \infty } . It does however converge in the usual topology of  R {\displaystyle \mathbb {R} } , and in fact to the coefficient  1 i ! {\displaystyle {\tfrac {1}{i!}}} of  exp ⁡ ( X ) {\displaystyle \exp(X)} . Therefore, if one would give  R [ [ X ] ] {\displaystyle \mathbb {R} [[X]]} the product topology of  R N {\displaystyle \mathbb {R} ^{\mathbb {N} }} where the topology of  R {\displaystyle \mathbb {R} } is the usual topology rather than the discrete one, then the above limit would converge to  exp ⁡ ( X ) {\displaystyle \exp(X)} . This more permissive approach is not however the standard when considering formal power series, as it would lead to convergence considerations that are as subtle as they are in analysis, while the philosophy of formal power series is on the contrary to make convergence questions as trivial as they can possibly be. With this topology it would not be the case that a summation converges if and only if its terms tend to 0.

### Universal property

[edit]

The ring  R [ [ X ] ] {\displaystyle R[[X]]} may be characterized by the following universal property. If  S {\displaystyle S} is a commutative associative algebra over  R {\displaystyle R} , if  I {\displaystyle I} is an ideal of  S {\displaystyle S} such that the  I {\displaystyle I} -adic topology on  S {\displaystyle S} is complete, and if  x {\displaystyle x} is an element of  I {\displaystyle I} , then there is a unique Φ : R [ [ X ] ] -> S {\displaystyle \Phi :R[[X]]\to S} with the following properties:

* Φ {\displaystyle \Phi } is an  R {\displaystyle R} -algebra homomorphism
* Φ {\displaystyle \Phi } is continuous
* Φ ( X ) = x {\displaystyle \Phi (X)=x} .

## Operations on formal power series

[edit]

One can perform algebraic operations on power series to generate new power series.[1][2] Besides the ring structure operations defined above, we have the following.

### Power series raised to powers

[edit]

For any natural number n, the nth power of a formal power series S is defined recursively by  S 1 = S S n = S ⋅ S n − 1 for n > 1. {\displaystyle {\begin{aligned}S^{1}&=S\\\S^{n}&=S\cdot S^{n-1}\quad {\text{for }}n>1.\end{aligned}}}

If m and a0 are invertible in the ring of coefficients, one can prove[3][4][5][a] ( ∑ k = 0 ∞ a k X k ) n = ∑ m = 0 ∞ c m X m , {\displaystyle \left(\sum _{k=0}^{\infty }a_{k}X^{k}\right)^{\\!n}=\,\sum _{m=0}^{\infty }c_{m}X^{m},} where  c 0 = a 0 n , c m = 1 m a 0 ∑ k = 1 m ( k n − m + k ) a k c m − k , m ≥ 1. {\displaystyle {\begin{aligned}c_{0}&=a_{0}^{n},\\\c_{m}&={\frac {1}{ma_{0}}}\sum _{k=1}^{m}(kn-m+k)a_{k}c_{m-k},\ \ \ m\geq 1.\end{aligned}}} In the case of formal power series with complex coefficients, the complex powers are well defined for series f with constant term equal to 1. In this case,  f α {\displaystyle f^{\alpha }} can be defined either by composition with the binomial series (1+x)α, or by composition with the exponential and the logarithmic series,  f α = exp ⁡ ( α log ⁡ ( f ) ) , {\displaystyle f^{\alpha }=\exp(\alpha \log(f)),} or as the solution of the differential equation (in terms of series)  f ( f α ) ′ = α f α f ′ {\displaystyle f(f^{\alpha })'=\alpha f^{\alpha }f'} with constant term 1; the three definitions are equivalent. The rules of calculus  ( f α ) β = f α β {\displaystyle (f^{\alpha })^{\beta }=f^{\alpha \beta }} and  f α g α = ( f g ) α {\displaystyle f^{\alpha }g^{\alpha }=(fg)^{\alpha }} easily follow.

### Multiplicative inverse

[edit]

The series

A = ∑ n = 0 ∞ a n X n ∈ R [ [ X ] ] {\displaystyle A=\sum _{n=0}^{\infty }a_{n}X^{n}\in R[[X]]}

is invertible in  R [ [ X ] ] {\displaystyle R[[X]]} if and only if its constant coefficient  a 0 {\displaystyle a_{0}} is invertible in  R {\displaystyle R} . This condition is necessary, for the following reason: if we suppose that  A {\displaystyle A} has an inverse  B = b 0 + b 1 x + ⋯ {\displaystyle B=b_{0}+b_{1}x+\cdots } then the constant term a 0 b 0 {\displaystyle a_{0}b_{0}} of  A ⋅ B {\displaystyle A\cdot B} is the constant term of the identity series, i.e. it is 1. This condition is also sufficient; we may compute the coefficients of the inverse series  B {\displaystyle B} via the explicit recursive formula

b 0 = 1 a 0 , b n = − 1 a 0 ∑ i = 1 n a i b n − i , n ≥ 1. {\displaystyle {\begin{aligned}b_{0}&={\frac {1}{a_{0}}},\\\b_{n}&=-{\frac {1}{a_{0}}}\sum _{i=1}^{n}a_{i}b_{n-i},\ \ \ n\geq 1.\end{aligned}}}

An important special case is that the geometric series formula is valid in  R [ [ X ] ] {\displaystyle R[[X]]} :

( 1 − X ) − 1 = ∑ n = 0 ∞ X n . {\displaystyle (1-X)^{-1}=\sum _{n=0}^{\infty }X^{n}.}

If  R = K {\displaystyle R=K} is a field, then a series is invertible if and only if the constant term is non-zero, i.e. if and only if the series is not divisible by  X {\displaystyle X} . This means that  K [ [ X ] ] {\displaystyle K[[X]]} is a discrete valuation ring with uniformizing parameter  X {\displaystyle X} .

### Division

[edit]

The computation of a quotient  f / g = h {\displaystyle f/g=h}

∑ n = 0 ∞ b n X n ∑ n = 0 ∞ a n X n = ∑ n = 0 ∞ c n X n , {\displaystyle {\frac {\sum _{n=0}^{\infty }b_{n}X^{n}}{\sum _{n=0}^{\infty }a_{n}X^{n}}}=\sum _{n=0}^{\infty }c_{n}X^{n},}

assuming the denominator is invertible (that is,  a 0 {\displaystyle a_{0}} is invertible in the ring of scalars), can be performed as a product  f {\displaystyle f} and the inverse of  g {\displaystyle g} , or directly equating the coefficients in  f = g h {\displaystyle f=gh} :

c n = 1 a 0 ( b n − ∑ k = 1 n a k c n − k ) . {\displaystyle c_{n}={\frac {1}{a_{0}}}\left(b_{n}-\sum _{k=1}^{n}a_{k}c_{n-k}\right).}

### Extracting coefficients

[edit]

The coefficient extraction operator applied to a formal power series

f ( X ) = ∑ n = 0 ∞ a n X n {\displaystyle f(X)=\sum _{n=0}^{\infty }a_{n}X^{n}}

in X is written

[ X m ] f ( X ) {\displaystyle \left[X^{m}\right]f(X)}

and extracts the coefficient of Xm, so that

[ X m ] f ( X ) = [ X m ] ∑ n = 0 ∞ a n X n = a m . {\displaystyle \left[X^{m}\right]f(X)=\left[X^{m}\right]\sum _{n=0}^{\infty }a_{n}X^{n}=a_{m}.}

### Composition

[edit]

Given two formal power series

f ( X ) = ∑ n = 1 ∞ a n X n = a 1 X + a 2 X 2 + ⋯ {\displaystyle f(X)=\sum _{n=1}^{\infty }a_{n}X^{n}=a_{1}X+a_{2}X^{2}+\cdots }
g ( X ) = ∑ n = 0 ∞ b n X n = b 0 + b 1 X + b 2 X 2 + ⋯ {\displaystyle g(X)=\sum _{n=0}^{\infty }b_{n}X^{n}=b_{0}+b_{1}X+b_{2}X^{2}+\cdots }

such that  a 0 = 0 , {\displaystyle a_{0}=0,} one may form the composition

g ( f ( X ) ) = ∑ n = 0 ∞ b n ( f ( X ) ) n = ∑ n = 0 ∞ c n X n , {\displaystyle g(f(X))=\sum _{n=0}^{\infty }b_{n}(f(X))^{n}=\sum _{n=0}^{\infty }c_{n}X^{n},}

where the coefficients cn are determined by "expanding out" the powers of f(X):

c n := ∑ k ∈ N , | j | = n b k a j 1 a j 2 ⋯ a j k . {\displaystyle c_{n}:=\sum _{k\in \mathbb {N} ,|j|=n}b_{k}a_{j_{1}}a_{j_{2}}\cdots a_{j_{k}}.}

Here the sum is extended over all (k, j) with  k ∈ N {\displaystyle k\in \mathbb {N} } and  j ∈ N + k {\displaystyle j\in \mathbb {N} _{+}^{k}} with  | j | := j 1 + ⋯ + j k = n . {\displaystyle |j|:=j_{1}+\cdots +j_{k}=n.}

Since  a 0 = 0 , {\displaystyle a_{0}=0,} one must have  k ≤ n {\displaystyle k\leq n} and  j i ≤ n {\displaystyle j_{i}\leq n} for every  i . {\displaystyle i.} This implies that the above sum is finite and that the coefficient  c n {\displaystyle c_{n}} is the coefficient of  X n {\displaystyle X^{n}} in the polynomial  g n ( f n ( X ) ) {\displaystyle g_{n}(f_{n}(X))} , where  f n {\displaystyle f_{n}} and  g n {\displaystyle g_{n}} are the polynomials obtained by truncating the series at  x n , {\displaystyle x^{n},} that is, by removing all terms involving a power of  X {\displaystyle X} higher than  n . {\displaystyle n.}

A more explicit description of these coefficients is provided by Faà di Bruno's formula, at least in the case where the coefficient ring is a field of characteristic 0.

Composition is only valid when  f ( X ) {\displaystyle f(X)} has no constant term, so that each  c n {\displaystyle c_{n}} depends on only a finite number of coefficients of  f ( X ) {\displaystyle f(X)} and  g ( X ) {\displaystyle g(X)} . In other words, the series for  g ( f ( X ) ) {\displaystyle g(f(X))} converges in the topology of  R [ [ X ] ] {\displaystyle R[[X]]} .

#### Example

[edit]

Assume that the ring  R {\displaystyle R} has characteristic 0 and the nonzero integers are invertible in  R {\displaystyle R} . If one denotes by  exp ⁡ ( X ) {\displaystyle \exp(X)} the formal power series

exp ⁡ ( X ) = 1 + X + X 2 2 ! + X 3 3 ! + X 4 4 ! + ⋯ , {\displaystyle \exp(X)=1+X+{\frac {X^{2}}{2!}}+{\frac {X^{3}}{3!}}+{\frac {X^{4}}{4!}}+\cdots ,}

then the equality

exp ⁡ ( exp ⁡ ( X ) − 1 ) = 1 + X + X 2 + 5 X 3 6 + 5 X 4 8 + ⋯ {\displaystyle \exp(\exp(X)-1)=1+X+X^{2}+{\frac {5X^{3}}{6}}+{\frac {5X^{4}}{8}}+\cdots }

makes perfect sense as a formal power series, since the constant coefficient of  exp ⁡ ( X ) − 1 {\displaystyle \exp(X)-1} is zero.

### Composition inverse

[edit]

Whenever a formal series

f ( X ) = ∑ k f k X k ∈ R [ [ X ] ] {\displaystyle f(X)=\sum _{k}f_{k}X^{k}\in R[[X]]}

has f0 = 0 and f1 being an invertible element of R, there exists a series

g ( X ) = ∑ k g k X k {\displaystyle g(X)=\sum _{k}g_{k}X^{k}}

that is the composition inverse of  f {\displaystyle f} , meaning that composing  f {\displaystyle f} with  g {\displaystyle g} gives the series representing the identity function x = 0 + 1 x + 0 x 2 + 0 x 3 + ⋯ {\displaystyle x=0+1x+0x^{2}+0x^{3}+\cdots } . The coefficients of  g {\displaystyle g} may be found recursively by using the above formula for the coefficients of a composition, equating them with those of the composition identity X (that is 1 at degree 1 and 0 at every degree greater than 1). In the case when the coefficient ring is a field of characteristic 0, the Lagrange inversion formula (discussed below) provides a powerful tool to compute the coefficients of g, as well as the coefficients of the (multiplicative) powers of g.

### Formal differentiation

[edit]

Given a formal power series

f = ∑ n ≥ 0 a n X n ∈ R [ [ X ] ] , {\displaystyle f=\sum _{n\geq 0}a_{n}X^{n}\in R[[X]],}

we define its formal derivative, denoted Df or f ′, by

D f = f ′ = ∑ n ≥ 1 a n n X n − 1 . {\displaystyle Df=f'=\sum _{n\geq 1}a_{n}nX^{n-1}.}

The symbol D is called the formal differentiation operator. This definition simply mimics term-by-term differentiation of a polynomial.

This operation is R-linear:

D ( a f + b g ) = a ⋅ D f + b ⋅ D g {\displaystyle D(af+bg)=a\cdot Df+b\cdot Dg}

for any a, b in R and any f, g in  R [ [ X ] ] . {\displaystyle R[[X]].} Additionally, the formal derivative has many of the properties of the usual derivative of calculus. For example, the product rule is valid:

D ( f g ) = f ⋅ ( D g ) + ( D f ) ⋅ g , {\displaystyle D(fg)\ =\ f\cdot (Dg)+(Df)\cdot g,}

and the chain rule works as well:

D ( f ∘ g ) = ( D f ∘ g ) ⋅ D g , {\displaystyle D(f\circ g)=(Df\circ g)\cdot Dg,}

whenever the appropriate compositions of series are defined (see above under composition of series).

Thus, in these respects formal power series behave like Taylor series. Indeed, for the f defined above, we find that

( D k f ) ( 0 ) = k ! a k , {\displaystyle (D^{k}f)(0)=k!a_{k},}

where Dk denotes the kth formal derivative (that is, the result of formally differentiating k times).

### Formal antidifferentiation

[edit]

If  R {\displaystyle R} is a ring with characteristic zero and the nonzero integers are invertible in  R {\displaystyle R} , then given a formal power series

f = ∑ n ≥ 0 a n X n ∈ R [ [ X ] ] , {\displaystyle f=\sum _{n\geq 0}a_{n}X^{n}\in R[[X]],}

we define its formal antiderivative or formal indefinite integral by

D − 1 f = ∫ f d X = C + ∑ n ≥ 0 a n X n + 1 n + 1 . {\displaystyle D^{-1}f=\int f\ dX=C+\sum _{n\geq 0}a_{n}{\frac {X^{n+1}}{n+1}}.}

for any constant  C ∈ R {\displaystyle C\in R} .

This operation is R-linear:

D − 1 ( a f + b g ) = a ⋅ D − 1 f + b ⋅ D − 1 g {\displaystyle D^{-1}(af+bg)=a\cdot D^{-1}f+b\cdot D^{-1}g}

for any a, b in R and any f, g in  R [ [ X ] ] . {\displaystyle R[[X]].} Additionally, the formal antiderivative has many of the properties of the usual antiderivative of calculus. For example, the formal antiderivative is the right inverse of the formal derivative:

D ( D − 1 ( f ) ) = f {\displaystyle D(D^{-1}(f))=f}

for any  f ∈ R [ [ X ] ] {\displaystyle f\in R[[X]]} .

## Properties

[edit]

### Algebraic properties of the formal power series ring

[edit]

R [ [ X ] ] {\displaystyle R[[X]]} is an associative algebra over  R {\displaystyle R} which contains the ring  R [ X ] {\displaystyle R[X]} of polynomials over  R {\displaystyle R} ; the polynomials correspond to the sequences which end in zeros.

The Jacobson radical of  R [ [ X ] ] {\displaystyle R[[X]]} is the ideal generated by  X {\displaystyle X} and the Jacobson radical of  R {\displaystyle R} ; this is implied by the element invertibility criterion discussed above.

The maximal ideals of  R [ [ X ] ] {\displaystyle R[[X]]} all arise from those in  R {\displaystyle R} in the following manner: an ideal  M {\displaystyle M} of  R [ [ X ] ] {\displaystyle R[[X]]} is maximal if and only if  M ∩ R {\displaystyle M\cap R} is a maximal ideal of  R {\displaystyle R} and  M {\displaystyle M} is generated as an ideal by  X {\displaystyle X} and  M ∩ R {\displaystyle M\cap R} .

Several algebraic properties of  R {\displaystyle R} are inherited by  R [ [ X ] ] {\displaystyle R[[X]]} :

* if  R {\displaystyle R} is a local ring, then so is  R [ [ X ] ] {\displaystyle R[[X]]} (with the set of non units the unique maximal ideal),
* if  R {\displaystyle R} is Noetherian, then so is  R [ [ X ] ] {\displaystyle R[[X]]} (a version of the Hilbert basis theorem),
* if  R {\displaystyle R} is an integral domain, then so is  R [ [ X ] ] {\displaystyle R[[X]]} , and
* if  K {\displaystyle K} is a field, then  K [ [ X ] ] {\displaystyle K[[X]]} is a discrete valuation ring.

### Topological properties of the formal power series ring

[edit]

The metric space  ( R [ [ X ] ] , d ) {\displaystyle (R[[X]],d)} is complete.

The ring  R [ [ X ] ] {\displaystyle R[[X]]} is compact if and only if R is finite. This follows from Tychonoff's theorem and the characterisation of the topology on  R [ [ X ] ] {\displaystyle R[[X]]} as a product topology.

### Weierstrass preparation

[edit]

Main article: Weierstrass preparation theorem § Formal power series in complete local rings

The ring of formal power series with coefficients in a complete local ring satisfies the Weierstrass preparation theorem.

## Applications

[edit]

Formal power series can be used to solve recurrences occurring in number theory and combinatorics. For an example involving finding a closed form expression for the Fibonacci numbers, see the article on Examples of generating functions.

One can use formal power series to prove several relations familiar from analysis in a purely algebraic setting. Consider for instance the following elements of  Q [ [ X ] ] {\displaystyle \mathbb {Q} [[X]]} :

sin ⁡ ( X ) := ∑ n ≥ 0 ( − 1 ) n ( 2 n + 1 ) ! X 2 n + 1 {\displaystyle \sin(X):=\sum _{n\geq 0}{\frac {(-1)^{n}}{(2n+1)!}}X^{2n+1}}
cos ⁡ ( X ) := ∑ n ≥ 0 ( − 1 ) n ( 2 n ) ! X 2 n {\displaystyle \cos(X):=\sum _{n\geq 0}{\frac {(-1)^{n}}{(2n)!}}X^{2n}}

Then one can show that

sin 2 ⁡ ( X ) + cos 2 ⁡ ( X ) = 1 , {\displaystyle \sin ^{2}(X)+\cos ^{2}(X)=1,}
∂ ∂ X sin ⁡ ( X ) = cos ⁡ ( X ) , {\displaystyle {\frac {\partial }{\partial X}}\sin(X)=\cos(X),}
sin ⁡ ( X + Y ) = sin ⁡ ( X ) cos ⁡ ( Y ) + cos ⁡ ( X ) sin ⁡ ( Y ) . {\displaystyle \sin(X+Y)=\sin(X)\cos(Y)+\cos(X)\sin(Y).}

The last one being valid in the ring  Q [ [ X , Y ] ] . {\displaystyle \mathbb {Q} [[X,Y]].}

For K a field, the ring  K [ [ X 1 , … , X r ] ] {\displaystyle K[[X_{1},\ldots ,X_{r}]]} is often used as the "standard, most general" complete local ring over K in algebra.

## Interpreting formal power series as functions

[edit]

Mathematical analysis → Complex analysis

Complex analysis
Complex numbers

* Real number
* Imaginary number
* Complex plane
* Complex conjugate
* Unit complex number

Complex functions

* Complex-valued function
* Analytic function
* Holomorphic function
* Cauchy–Riemann equations
* Formal power series

Basic theory

* Zeros and poles
* Cauchy's integral theorem
* Local primitive
* Cauchy's integral formula
* Winding number
* Laurent series
* Isolated singularity
* Residue theorem
* Argument principle
* Conformal map
* Schwarz lemma
* Harmonic function
* Laplace's equation

Geometric function theory
People

* Augustin-Louis Cauchy
* Leonhard Euler
* Carl Friedrich Gauss
* Jacques Hadamard
* Kiyoshi Oka
* Bernhard Riemann
* Karl Weierstrass

* Mathematics portal

* v
* t
* e

In mathematical analysis, every convergent power series defines a function with values in the real or complex numbers. Formal power series over certain special rings can also be interpreted as functions, but one has to be careful with the domain and codomain. Let

f = ∑ a n X n ∈ R [ [ X ] ] , {\displaystyle f=\sum a_{n}X^{n}\in R[[X]],}

and suppose  S {\displaystyle S} is a commutative associative algebra over  R {\displaystyle R} ,  I {\displaystyle I} is an ideal in  S {\displaystyle S} such that the I-adic topology on  S {\displaystyle S} is complete, and  x {\displaystyle x} is an element of  I {\displaystyle I} . Define:

f ( x ) = ∑ n ≥ 0 a n x n . {\displaystyle f(x)=\sum _{n\geq 0}a_{n}x^{n}.}

This series is guaranteed to converge in  S {\displaystyle S} given the above assumptions on  x {\displaystyle x} . Furthermore, we have

( f + g ) ( x ) = f ( x ) + g ( x ) {\displaystyle (f+g)(x)=f(x)+g(x)}

and

( f g ) ( x ) = f ( x ) g ( x ) . {\displaystyle (fg)(x)=f(x)g(x).}

Unlike in the case of bona fide functions, these formulas are not definitions but have to be proved.

Since the topology on  R [ [ X ] ] {\displaystyle R[[X]]} is the  ( X ) {\displaystyle (X)} -adic topology and  R [ [ X ] ] {\displaystyle R[[X]]} is complete, we can in particular apply power series to other power series, provided that the arguments don't have constant coefficients (so that they belong to the ideal  ( X ) {\displaystyle (X)} ):  f ( 0 ) {\displaystyle f(0)} ,  f ( X 2 − X ) {\displaystyle f(X^{2}-X)} and  f ( ( 1 − X ) − 1 − 1 ) {\displaystyle f((1-X)^{-1}-1)} are all well defined for any formal power series  f ∈ R [ [ X ] ] . {\displaystyle f\in R[[X]].}

With this formalism, we can give an explicit formula for the multiplicative inverse of a power series  f {\displaystyle f} whose constant coefficient  a = f ( 0 ) {\displaystyle a=f(0)} is invertible in  R {\displaystyle R} :

f − 1 = ∑ n ≥ 0 a − n − 1 ( a − f ) n . {\displaystyle f^{-1}=\sum _{n\geq 0}a^{-n-1}(a-f)^{n}.}

If the formal power series  g {\displaystyle g} with  g ( 0 ) = 0 {\displaystyle g(0)=0} is given implicitly by the equation

f ( g ) = X {\displaystyle f(g)=X}

where  f {\displaystyle f} is a known power series with  f ( 0 ) = 0 {\displaystyle f(0)=0} , then the coefficients of  g {\displaystyle g} can be explicitly computed using the Lagrange inversion formula.

## Generalizations

[edit]

### Formal Laurent series

[edit]

The formal Laurent series over a ring  R {\displaystyle R} are defined in a similar way to a formal power series, except that we also allow finitely many terms of negative degree. That is, they are the series that can be written as

f = ∑ n = N ∞ a n X n {\displaystyle f=\sum _{n=N}^{\infty }a_{n}X^{n}}

for some integer  N {\displaystyle N} , so that there are only finitely many negative  n {\displaystyle n} with  a n ≠ 0 {\displaystyle a_{n}\neq 0} . (This is different from the classical Laurent series of complex analysis.) For a non-zero formal Laurent series, the minimal integer  n {\displaystyle n} such that  a n ≠ 0 {\displaystyle a_{n}\neq 0} is called the order of  f {\displaystyle f} and is denoted  ord ⁡ ( f ) . {\displaystyle \operatorname {ord} (f).} (The order of the zero series is  + ∞ {\displaystyle +\infty } .)

Multiplication of such series can be defined. Indeed, similarly to the definition for formal power series, the coefficient of  X k {\displaystyle X^{k}} of two series with respective sequences of coefficients  { a n } {\displaystyle \\{a_{n}\\}} and  { b n } {\displaystyle \\{b_{n}\\}} is  ∑ i ∈ Z a i b k − i . {\displaystyle \sum _{i\in \mathbb {Z} }a_{i}b_{k-i}.} This sum has only finitely many nonzero terms because of the assumed vanishing of coefficients at sufficiently negative indices.

The formal Laurent series form the ring of formal Laurent series over  R {\displaystyle R} , denoted by  R ( ( X ) ) {\displaystyle R((X))} .[b] It is equal to the localization of the ring  R [ [ X ] ] {\displaystyle R[[X]]} of formal power series with respect to the set of positive powers of  X {\displaystyle X} . If  R = K {\displaystyle R=K} is a field, then  K ( ( X ) ) {\displaystyle K((X))} is in fact a field, which may alternatively be obtained as the field of fractions of the integral domain K [ [ X ] ] {\displaystyle K[[X]]} .

As with  R [ [ X ] ] {\displaystyle R[[X]]} , the ring  R ( ( X ) ) {\displaystyle R((X))} of formal Laurent series may be endowed with the structure of a topological ring by introducing the metric  d ( f , g ) = 2 − ord ⁡ ( f − g ) . {\displaystyle d(f,g)=2^{-\operatorname {ord} (f-g)}.}

One may define formal differentiation for formal Laurent series in the natural (term-by-term) way. Precisely, the formal derivative of the formal Laurent series  f {\displaystyle f} above is  f ′ = D f = ∑ n ∈ Z n a n X n − 1 , {\displaystyle f'=Df=\sum _{n\in \mathbb {Z} }na_{n}X^{n-1},} which is again a formal Laurent series. If  f {\displaystyle f} is a non-constant formal Laurent series and with coefficients in a field of characteristic 0, then one has  ord ⁡ ( f ′ ) = ord ⁡ ( f ) − 1. {\displaystyle \operatorname {ord} (f')=\operatorname {ord} (f)-1.} However, in general this is not the case since the factor  n {\displaystyle n} for the lowest order term could be equal to 0 in  R {\displaystyle R} .

#### Formal residue

[edit]

Assume that  K {\displaystyle K} is a field of characteristic 0\. Then the map

D : K ( ( X ) ) -> K ( ( X ) ) {\displaystyle D\colon K((X))\to K((X))}

defined above is a  K {\displaystyle K} -derivation that satisfies

ker ⁡ D = K {\displaystyle \ker D=K}
im ⁡ D = { f ∈ K ( ( X ) ) : [ X − 1 ] f = 0 } . {\displaystyle \operatorname {im} D=\left\\{f\in K((X)):[X^{-1}]f=0\right\\}.}

The latter shows that the coefficient of  X − 1 {\displaystyle X^{-1}} in  f {\displaystyle f} is of particular interest; it is called formal residue of  f {\displaystyle f} and denoted  Res ⁡ ( f ) {\displaystyle \operatorname {Res} (f)} . The map

Res : K ( ( X ) ) -> K {\displaystyle \operatorname {Res} :K((X))\to K}

is  K {\displaystyle K} -linear, and by the above observation one has an exact sequence

0 -> K -> K ( ( X ) ) ⟶ D K ( ( X ) ) ⟶ Res K -> 0. {\displaystyle 0\to K\to K((X)){\overset {D}{\longrightarrow }}K((X))\;{\overset {\operatorname {Res} }{\longrightarrow }}\;K\to 0.}

Some rules of calculus. As a quite direct consequence of the above definition, and of the rules of formal derivation, one has, for any  f , g ∈ K ( ( X ) ) {\displaystyle f,g\in K((X))}

1. Res ⁡ ( f ′ ) = 0 ; {\displaystyle \operatorname {Res} (f')=0;}
2. Res ⁡ ( f g ′ ) = − Res ⁡ ( f ′ g ) ; {\displaystyle \operatorname {Res} (fg')=-\operatorname {Res} (f'g);}
3. Res ⁡ ( f ′ / f ) = ord ⁡ ( f ) , ∀ f ≠ 0 ; {\displaystyle \operatorname {Res} (f'/f)=\operatorname {ord} (f),\qquad \forall f\neq 0;}
4. Res ⁡ ( ( g ∘ f ) f ′ ) = ord ⁡ ( f ) Res ⁡ ( g ) , {\displaystyle \operatorname {Res} \left((g\circ f)f'\right)=\operatorname {ord} (f)\operatorname {Res} (g),} if  ord ⁡ ( f ) > 0 ; {\displaystyle \operatorname {ord} (f)>0;}
5. [ X n ] f ( X ) = Res ⁡ ( X − n − 1 f ( X ) ) . {\displaystyle [X^{n}]f(X)=\operatorname {Res} \left(X^{-n-1}f(X)\right).}

Property (i) is part of the exact sequence above. Property (ii) follows from (i) as applied to  ( f g ) ′ = f ′ g + f g ′ {\displaystyle (fg)'=f'g+fg'} . Property (iii): any  f {\displaystyle f} can be written in the form  f = X m g {\displaystyle f=X^{m}g} , with  m = ord ⁡ ( f ) {\displaystyle m=\operatorname {ord} (f)} and  ord ⁡ ( g ) = 0 {\displaystyle \operatorname {ord} (g)=0} : then  f ′ / f = m X − 1 + g ′ / g . {\displaystyle f'/f=mX^{-1}+g'/g.} ord ⁡ ( g ) = 0 {\displaystyle \operatorname {ord} (g)=0} implies  g {\displaystyle g} is invertible in  K [ [ X ] ] ⊂ im ⁡ ( D ) = ker ⁡ ( Res ) , {\displaystyle K[[X]]\subset \operatorname {im} (D)=\ker(\operatorname {Res} ),} whence  Res ⁡ ( f ′ / f ) = m . {\displaystyle \operatorname {Res} (f'/f)=m.} Property (iv): Since  im ⁡ ( D ) = ker ⁡ ( Res ) , {\displaystyle \operatorname {im} (D)=\ker(\operatorname {Res} ),} we can write  g = g − 1 X − 1 + G ′ , {\displaystyle g=g_{-1}X^{-1}+G',} with  G ∈ K ( ( X ) ) {\displaystyle G\in K((X))} . Consequently,  ( g ∘ f ) f ′ = g − 1 f − 1 f ′ + ( G ′ ∘ f ) f ′ = g − 1 f ′ / f + ( G ∘ f ) ′ {\displaystyle (g\circ f)f'=g_{-1}f^{-1}f'+(G'\circ f)f'=g_{-1}f'/f+(G\circ f)'} and (iv) follows from (i) and (iii). Property (v) is clear from the definition.

### The Lagrange inversion formula

[edit]

Main article: Lagrange inversion theorem

As mentioned above, any formal series  f ∈ K [ [ X ] ] {\displaystyle f\in K[[X]]} with f0 = 0 and f1 ≠ 0 has a composition inverse  g ∈ K [ [ X ] ] . {\displaystyle g\in K[[X]].} The following relation between the coefficients of gn and f−k holds ("Lagrange inversion formula"):

k [ X k ] g n = n [ X − n ] f − k . {\displaystyle k[X^{k}]g^{n}=n[X^{-n}]f^{-k}.}

In particular, for n = 1 and all k ≥ 1,

[ X k ] g = 1 k Res ⁡ ( f − k ) . {\displaystyle [X^{k}]g={\frac {1}{k}}\operatorname {Res} \left(f^{-k}\right).}

Since the proof of the Lagrange inversion formula is a very short computation, it is worth reporting one residue based proof here (a number of different proofs exist[6][7][8], using, e.g., Cauchy’s coefficient formula for holomorphic functions, tree-counting arguments, or induction). Noting  ord ⁡ ( f ) = 1 {\displaystyle \operatorname {ord} (f)=1} , we can apply the rules of calculus above, crucially Rule (iv) substituting  X ⇝ f ( X ) {\displaystyle X\rightsquigarrow f(X)} , to get:

k [ X k ] g n = ( v ) k Res ⁡ ( g n X − k − 1 ) = ( i v ) k Res ⁡ ( X n f − k − 1 f ′ ) = c h a i n − Res ⁡ ( X n ( f − k ) ′ ) = ( i i ) Res ⁡ ( ( X n ) ′ f − k ) = c h a i n n Res ⁡ ( X n − 1 f − k ) = ( v ) n [ X − n ] f − k . {\displaystyle {\begin{aligned}k[X^{k}]g^{n}&\ {\stackrel {\mathrm {(v)} }{=}}\ k\operatorname {Res} \left(g^{n}X^{-k-1}\right)\ {\stackrel {\mathrm {(iv)} }{=}}\ k\operatorname {Res} \left(X^{n}f^{-k-1}f'\right)\ {\stackrel {\mathrm {chain} }{=}}\ -\operatorname {Res} \left(X^{n}(f^{-k})'\right)\\\&\ {\stackrel {\mathrm {(ii)} }{=}}\ \operatorname {Res} \left(\left(X^{n}\right)'f^{-k}\right)\ {\stackrel {\mathrm {chain} }{=}}\ n\operatorname {Res} \left(X^{n-1}f^{-k}\right)\ {\stackrel {\mathrm {(v)} }{=}}\ n[X^{-n}]f^{-k}.\end{aligned}}}

Generalizations. One may observe that the above computation can be repeated plainly in more general settings than K((X)): a generalization of the Lagrange inversion formula is already available working in the  C ( ( X ) ) {\displaystyle \mathbb {C} ((X))} -modules  X α C ( ( X ) ) , {\displaystyle X^{\alpha }\mathbb {C} ((X)),} where α is a complex exponent. As a consequence, if f and g are as above, with  f 1 = g 1 = 1 {\displaystyle f_{1}=g_{1}=1} , we can relate the complex powers of f / X and g / X: precisely, if α and β are non-zero complex numbers with negative integer sum,  m = − α − β ∈ N , {\displaystyle m=-\alpha -\beta \in \mathbb {N} ,} then

1 α [ X m ] ( f X ) α = − 1 β [ X m ] ( g X ) β . {\displaystyle {\frac {1}{\alpha }}[X^{m}]\left({\frac {f}{X}}\right)^{\alpha }=-{\frac {1}{\beta }}[X^{m}]\left({\frac {g}{X}}\right)^{\beta }.}

For instance, this way one finds the power series for complex powers of the Lambert function.

### Power series in several variables

[edit]

Formal power series in any number of indeterminates (even infinitely many) can be defined. If I is an index set and XI is the set of indeterminates Xi for i∈I, then a monomial Xα is any finite product of elements of XI (repetitions allowed); a formal power series in XI with coefficients in a ring R is determined by any mapping from the set of monomials Xα to a corresponding coefficient cα, and is denoted  ∑ α c α X α {\textstyle \sum _{\alpha }c_{\alpha }X^{\alpha }} . The set of all such formal power series is denoted  R [ [ X I ] ] , {\displaystyle R[[X_{I}]],} and it is given a ring structure by defining

( ∑ α c α X α ) + ( ∑ α d α X α ) = ∑ α ( c α + d α ) X α {\displaystyle \left(\sum _{\alpha }c_{\alpha }X^{\alpha }\right)+\left(\sum _{\alpha }d_{\alpha }X^{\alpha }\right)=\sum _{\alpha }(c_{\alpha }+d_{\alpha })X^{\alpha }}

and

( ∑ α c α X α ) × ( ∑ β d β X β ) = ∑ α , β c α d β X α + β {\displaystyle \left(\sum _{\alpha }c_{\alpha }X^{\alpha }\right)\times \left(\sum _{\beta }d_{\beta }X^{\beta }\right)=\sum _{\alpha ,\beta }c_{\alpha }d_{\beta }X^{\alpha +\beta }}

#### Topology

[edit]

The topology on  R [ [ X I ] ] {\displaystyle R[[X_{I}]]} is such that a sequence of its elements converges only if for each monomial Xα the corresponding coefficient stabilizes. If I is finite, then this the J-adic topology, where J is the ideal of  R [ [ X I ] ] {\displaystyle R[[X_{I}]]} generated by all the indeterminates in XI. This does not hold if I is infinite. For example, if  I = N , {\displaystyle I=\mathbb {N} ,} then the sequence  ( f n ) n ∈ N {\displaystyle (f_{n})_{n\in \mathbb {N} }} with  f n = X n + X n + 1 + X n + 2 + ⋯ {\displaystyle f_{n}=X_{n}+X_{n+1}+X_{n+2}+\cdots } does not converge with respect to any J-adic topology on R, but clearly for each monomial the corresponding coefficient stabilizes.

As remarked above, the topology on a repeated formal power series ring like  R [ [ X ] ] [ [ Y ] ] {\displaystyle R[[X]][[Y]]} is usually chosen in such a way that it becomes isomorphic as a topological ring to  R [ [ X , Y ] ] . {\displaystyle R[[X,Y]].}

#### Operations

[edit]

All of the operations defined for series in one variable may be extended to the several variables case.

* A series is invertible if and only if its constant term is invertible in R.
* The composition f(g(X)) of two series f and g is defined if f is a series in a single indeterminate, and the constant term of g is zero. For a series f in several indeterminates a form of "composition" can similarly be defined, with as many separate series in the place of g as there are indeterminates.

In the case of the formal derivative, there are now separate partial derivative operators, which differentiate with respect to each of the indeterminates. They all commute with each other.

#### Universal property

[edit]

In the several variables case, the universal property characterizing  R [ [ X 1 , … , X r ] ] {\displaystyle R[[X_{1},\ldots ,X_{r}]]} becomes the following. If S is a commutative associative algebra over R, if I is an ideal of S such that the I-adic topology on S is complete, and if x1, …, xr are elements of I, then there is a unique map  Φ : R [ [ X 1 , … , X r ] ] -> S {\displaystyle \Phi :R[[X_{1},\ldots ,X_{r}]]\to S} with the following properties:

* Φ is an R-algebra homomorphism
* Φ is continuous
* Φ(Xi) = xi for i = 1, …, r.

### Non-commuting variables

[edit]

The several variable case can be further generalised by taking non-commuting variables Xi for i ∈ I, where I is an index set and then a monomial Xα is any word in the XI; a formal power series in XI with coefficients in a ring R is determined by any mapping from the set of monomials Xα to a corresponding coefficient cα, and is denoted  ∑ α c α X α {\displaystyle \textstyle \sum _{\alpha }c_{\alpha }X^{\alpha }} . The set of all such formal power series is denoted R«XI», and it is given a ring structure by defining addition pointwise

( ∑ α c α X α ) + ( ∑ α d α X α ) = ∑ α ( c α + d α ) X α {\displaystyle \left(\sum _{\alpha }c_{\alpha }X^{\alpha }\right)+\left(\sum _{\alpha }d_{\alpha }X^{\alpha }\right)=\sum _{\alpha }(c_{\alpha }+d_{\alpha })X^{\alpha }}

and multiplication by

( ∑ α c α X α ) × ( ∑ α d α X α ) = ∑ α , β c α d β X α ⋅ X β {\displaystyle \left(\sum _{\alpha }c_{\alpha }X^{\alpha }\right)\times \left(\sum _{\alpha }d_{\alpha }X^{\alpha }\right)=\sum _{\alpha ,\beta }c_{\alpha }d_{\beta }X^{\alpha }\cdot X^{\beta }}

where · denotes concatenation of words. These formal power series over R form the Magnus ring over R.[9][10]

### On a semiring

[edit]

This section needs expansion with: sum, product, examples. You can help by adding to it. (August 2014)

|

Given an alphabet Σ {\displaystyle \Sigma } and a semiring S {\displaystyle S} . The formal power series over  S {\displaystyle S} supported on the language  Σ ∗ {\displaystyle \Sigma ^{*}} is denoted by  S ⟨ ⟨ Σ ∗ ⟩ ⟩ {\displaystyle S\langle \langle \Sigma ^{*}\rangle \rangle } . It consists of all mappings  r : Σ ∗ -> S {\displaystyle r:\Sigma ^{*}\to S} , where  Σ ∗ {\displaystyle \Sigma ^{*}} is the free monoid generated by the non-empty set  Σ {\displaystyle \Sigma } .

The elements of  S ⟨ ⟨ Σ ∗ ⟩ ⟩ {\displaystyle S\langle \langle \Sigma ^{*}\rangle \rangle } can be written as formal sums

r = ∑ w ∈ Σ ∗ ( r , w ) w . {\displaystyle r=\sum _{w\in \Sigma ^{*}}(r,w)w.}

where  ( r , w ) {\displaystyle (r,w)} denotes the value of  r {\displaystyle r} at the word  w ∈ Σ ∗ {\displaystyle w\in \Sigma ^{*}} . The elements  ( r , w ) ∈ S {\displaystyle (r,w)\in S} are called the coefficients of  r {\displaystyle r} .

For  r ∈ S ⟨ ⟨ Σ ∗ ⟩ ⟩ {\displaystyle r\in S\langle \langle \Sigma ^{*}\rangle \rangle } the support of  r {\displaystyle r} is the set

supp ⁡ ( r ) = { w ∈ Σ ∗ | ( r , w ) ≠ 0 } {\displaystyle \operatorname {supp} (r)=\\{w\in \Sigma ^{*}|\ (r,w)\neq 0\\}}

A series where every coefficient is either  0 {\displaystyle 0} or  1 {\displaystyle 1} is called the characteristic series of its support.

The subset of  S ⟨ ⟨ Σ ∗ ⟩ ⟩ {\displaystyle S\langle \langle \Sigma ^{*}\rangle \rangle } consisting of all series with a finite support is denoted by  S ⟨ Σ ∗ ⟩ {\displaystyle S\langle \Sigma ^{*}\rangle } and called polynomials.

For  r 1 , r 2 ∈ S ⟨ ⟨ Σ ∗ ⟩ ⟩ {\displaystyle r_{1},r_{2}\in S\langle \langle \Sigma ^{*}\rangle \rangle } and  s ∈ S {\displaystyle s\in S} , the sum  r 1 + r 2 {\displaystyle r_{1}+r_{2}} is defined by

( r 1 + r 2 , w ) = ( r 1 , w ) + ( r 2 , w ) {\displaystyle (r_{1}+r_{2},w)=(r_{1},w)+(r_{2},w)}

The (Cauchy) product  r 1 ⋅ r 2 {\displaystyle r_{1}\cdot r_{2}} is defined by

( r 1 ⋅ r 2 , w ) = ∑ w 1 w 2 = w ( r 1 , w 1 ) ( r 2 , w 2 ) {\displaystyle (r_{1}\cdot r_{2},w)=\sum _{w_{1}w_{2}=w}(r_{1},w_{1})(r_{2},w_{2})}

The Hadamard product  r 1 ⊙ r 2 {\displaystyle r_{1}\odot r_{2}} is defined by

( r 1 ⊙ r 2 , w ) = ( r 1 , w ) ( r 2 , w ) {\displaystyle (r_{1}\odot r_{2},w)=(r_{1},w)(r_{2},w)}

And the products by a scalar  s r 1 {\displaystyle sr_{1}} and  r 1 s {\displaystyle r_{1}s} by

( s r 1 , w ) = s ( r 1 , w ) {\displaystyle (sr_{1},w)=s(r_{1},w)} and  ( r 1 s , w ) = ( r 1 , w ) s {\displaystyle (r_{1}s,w)=(r_{1},w)s} , respectively.

With these operations  ( S ⟨ ⟨ Σ ∗ ⟩ ⟩ , + , ⋅ , 0 , ε ) {\displaystyle (S\langle \langle \Sigma ^{*}\rangle \rangle ,+,\cdot ,0,\varepsilon )} and  ( S ⟨ Σ ∗ ⟩ , + , ⋅ , 0 , ε ) {\displaystyle (S\langle \Sigma ^{*}\rangle ,+,\cdot ,0,\varepsilon )} are semirings, where  ε {\displaystyle \varepsilon } is the empty word in  Σ ∗ {\displaystyle \Sigma ^{*}} .

These formal power series are used to model the behavior of weighted automata, in theoretical computer science, when the coefficients  ( r , w ) {\displaystyle (r,w)} of the series are taken to be the weight of a path with label  w {\displaystyle w} in the automata.[11]

### Replacing the index set by an ordered abelian group

[edit]

Main article: Hahn series

Suppose  G {\displaystyle G} is an ordered abelian group, meaning an abelian group with a total ordering  < {\displaystyle <} respecting the group's addition, so that  a < b {\displaystyle a<b} if and only if  a + c < b + c {\displaystyle a+c<b+c} for all  c {\displaystyle c} . Let I be a well-ordered subset of  G {\displaystyle G} , meaning I contains no infinite descending chain. Consider the set consisting of

∑ i ∈ I a i X i {\displaystyle \sum _{i\in I}a_{i}X^{i}}

for all such I, with  a i {\displaystyle a_{i}} in a commutative ring  R {\displaystyle R} , where we assume that for any index set, if all of the  a i {\displaystyle a_{i}} are zero then the sum is zero. Then  R ( ( G ) ) {\displaystyle R((G))} is the ring of formal power series on  G {\displaystyle G} ; because of the condition that the indexing set be well-ordered the product is well-defined, and we of course assume that two elements which differ by zero are the same. Sometimes the notation  [ [ R G ] ] {\displaystyle [[R^{G}]]} is used to denote  R ( ( G ) ) {\displaystyle R((G))} .[12]

Various properties of  R {\displaystyle R} transfer to  R ( ( G ) ) {\displaystyle R((G))} . If  R {\displaystyle R} is a field, then so is  R ( ( G ) ) {\displaystyle R((G))} . If  R {\displaystyle R} is an ordered field, we can order  R ( ( G ) ) {\displaystyle R((G))} by setting any element to have the same sign as its leading coefficient, defined as the least element of the index set I associated to a non-zero coefficient. Finally if  G {\displaystyle G} is a divisible group and  R {\displaystyle R} is a real closed field, then  R ( ( G ) ) {\displaystyle R((G))} is a real closed field, and if  R {\displaystyle R} is algebraically closed, then so is  R ( ( G ) ) {\displaystyle R((G))} .

This theory is due to Hans Hahn, who also showed that one obtains subfields when the number of (non-zero) terms is bounded by some fixed infinite cardinality.

## Examples and related topics

[edit]

* Bell series are used to study the properties of multiplicative arithmetic functions
* Formal groups are used to define an abstract group law using formal power series
* Puiseux series are an extension of formal Laurent series, allowing fractional exponents
* Rational series

## See also

[edit]

* Ring of restricted power series

## Notes

[edit]

1. ^ The formula is often attributed to J.C.P. Miller, but it has a long history of rediscovery, dating back to least Euler's discovery in 1748.[4]
2. ^ For each nonzero formal Laurent series, the order is an integer (that is, the degrees of the terms are bounded below). But the ring  R ( ( X ) ) {\displaystyle R((X))} contains series of all orders.

## References

[edit]

1. ^ Gradshteyn, Izrail Solomonovich; Ryzhik, Iosif Moiseevich; Geronimus, Yuri Veniaminovich; Tseytlin, Michail Yulyevich; Jeffrey, Alan (2015) [October 2014]. "0.313". In Zwillinger, Daniel; Moll, Victor Hugo (eds.). Table of Integrals, Series, and Products. Translated by Scripta Technica, Inc. (8 ed.). Academic Press, Inc. p. 18\. ISBN 978-0-12-384933-5. LCCN 2014010276. (Several previous editions as well.)
2. ^ Niven, Ivan (October 1969). "Formal Power Series". American Mathematical Monthly. 76 (8): 871–889. doi:10.1080/00029890.1969.12000359.
3. ^ Finkel, Hal (2010-07-13). "The differential transformation method and Miller's recurrence". arXiv:1007.2178 [math.CA].
4. ^ a b Gould, H. W. (1974). "Coefficient Identities for Powers of Taylor and Dirichlet Series". The American Mathematical Monthly. 81 (1): 3–14. doi:10.2307/2318904. ISSN 0002-9890. JSTOR 2318904.
5. ^ Zeilberger, Doron (1995). "The J.C.P. miller recurrence for exponentiating a polynomial, and its q-analog". Journal of Difference Equations and Applications. 1 (1): 57–60. doi:10.1080/10236199508808006 - via Taylor & Francis Online.
6. ^ Richard, Stanley (2012). Enumerative combinatorics. Volume 1. Cambridge Stud. Adv. Math. Vol. 49\. Cambridge: Cambridge University Press. ISBN 978-1-107-60262-5. MR 2868112.
7. ^ Ira, Gessel (2016), "Lagrange inversion", Journal of Combinatorial Theory, Series A, 144: 212–249, arXiv:1609.05988, doi:10.1016/j.jcta.2016.06.018, MR 3534068
8. ^ Surya, Erlang; Warnke, Lutz (2023), "Lagrange Inversion Formula by Induction", The American Mathematical Monthly, 130 (10): 944–948, arXiv:2305.17576, doi:10.1080/00029890.2023.2251344, MR 4669236
9. ^ Koch, Helmut (1997). Algebraic Number Theory. Encycl. Math. Sci. Vol. 62 (2nd printing of 1st ed.). Springer-Verlag. p. 167\. ISBN 978-3-540-63003-6. Zbl 0819.11044.
10. ^ Moran, Siegfried (1983). The Mathematical Theory of Knots and Braids: An Introduction. North-Holland Mathematics Studies. Vol. 82\. Elsevier. p. 211\. ISBN 978-0-444-86714-8. Zbl 0528.57001.
11. ^ Droste, M., & Kuich, W. (2009). Semirings and Formal Power Series. Handbook of Weighted Automata, 3–28. doi:10.1007/978-3-642-01492-5_1, p. 12
12. ^ Shamseddine, Khodr; Berz, Martin (2010). "Analysis on the Levi-Civita Field: A Brief Overview" (PDF). Contemporary Mathematics. 508: 215–237. doi:10.1090/conm/508/10002. ISBN 9780821847404.

* Berstel, Jean; Reutenauer, Christophe (2011). Noncommutative rational series with applications. Encyclopedia of Mathematics and Its Applications. Vol. 137\. Cambridge: Cambridge University Press. ISBN 978-0-521-19022-0. Zbl 1250.68007.
* Nicolas Bourbaki: Algebra, IV, §4. Springer-Verlag 1988.

## Further reading

[edit]

* W. Kuich. Semirings and formal power series: Their relevance to formal languages and automata theory. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, Chapter 9, pages 609–677. Springer, Berlin, 1997, ISBN 3-540-60420-0
* Droste, M., & Kuich, W. (2009). Semirings and Formal Power Series. Handbook of Weighted Automata, 3–28. doi:10.1007/978-3-642-01492-5_1
* Arto Salomaa (1990). "Formal Languages and Power Series". In Jan van Leeuwen (ed.). Formal Models and Semantics. Handbook of Theoretical Computer Science. Vol. B. Elsevier. pp. 103–132. ISBN 0-444-88074-7.

* v
* t
* e

Sequences and series

Integer sequences|

| Basic|

* Arithmetic progression
* Geometric progression
* Harmonic progression
* Square number
* Cubic number
* Factorial
* Powers of two
* Powers of three
* Powers of 10

|

Advanced (list)|

* Complete sequence
* Fibonacci sequence
* Figurate number
* Heptagonal number
* Hexagonal number
* Lucas number
* Pell number
* Pentagonal number
* Polygonal number
* Triangular number
* array

Properties of sequences|

* Cauchy sequence
* Monotonic function
* Periodic sequence

Properties of series|

| Series|

* Alternating
* Convergent
* Divergent
* Telescoping

|

Convergence|

* Absolute
* Conditional
* Uniform

Explicit series|

| Convergent|

* 1/2 − 1/4 + 1/8 − 1/16 + ⋯
* 1/2 + 1/4 + 1/8 + 1/16 + ⋯
* 1/4 + 1/16 + 1/64 + 1/256 + ⋯
* 1 + 1/2s \+ 1/3s \+ ... (Riemann zeta function)

|

Divergent|

* 1 + 1 + 1 + 1 + ⋯
* 1 − 1 + 1 − 1 + ⋯ (Grandi's series)
* 1 + 2 + 3 + 4 + ⋯
* 1 − 2 + 3 − 4 + ⋯
* 1 + 2 + 4 + 8 + ⋯
* 1 − 2 + 4 − 8 + ⋯
* Infinite arithmetic series
* 1 − 1 + 2 − 6 + 24 − 120 + ⋯ (alternating factorials)
* 1 + 1/2 + 1/3 + 1/4 + ⋯ (harmonic series)
* 1/2 + 1/3 + 1/5 + 1/7 + 1/11 + ⋯ (inverses of primes)

Kinds of series|

* Taylor series
* Power series
* Formal power series
* Laurent series
* Puiseux series
* Dirichlet series
* Trigonometric series
* Fourier series
* Generating series

Hypergeometric series|

* Generalized hypergeometric series
* Hypergeometric function of a matrix argument
* Lauricella hypergeometric series
* Modular hypergeometric series
* Riemann's differential equation
* Theta hypergeometric series

* Category

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template