Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Formal power series

From Wikipedia, the free encyclopedia
(Redirected fromPower series ring)
Infinite sum that is considered independently from any notion of convergence
This articleneeds additional citations forverification. Please helpimprove this article byadding 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)

Inmathematics, aformal series is an infinite sum that is considered independently from any notion ofconvergence, and can be manipulated with the usual algebraic operations onseries (addition, subtraction, multiplication, division,partial sums, etc.).

Aformal power series is a special kind of formal series, of the formn=0anxn=a0+a1x+a2x2+,{\displaystyle \sum _{n=0}^{\infty }a_{n}x^{n}=a_{0}+a_{1}x+a_{2}x^{2}+\cdots ,}where thean,{\displaystyle a_{n},} calledcoefficients, are numbers or, more generally, elements of somering, and thexn{\displaystyle x^{n}} are formal powers of the symbolx{\displaystyle x} that is called anindeterminate or, commonly, avariable. Hence, power series can be viewed as a generalization ofpolynomials where the number of terms is allowed to be infinite, and differ from usualpower 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 inone to one correspondence with theirsequences 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 ringR{\displaystyle R} is called a formal power series overR.{\displaystyle R.} The formal power series over a ringR{\displaystyle R} form a ring, commonly denoted byR[[x]].{\displaystyle R[[x]].} (It can be seen as the(x)-adic completion of thepolynomial ringR[x],{\displaystyle R[x],} in the same way as thep-adic integers are thep-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 bymonomials in several indeterminates.

Formal power series are widely used incombinatorics for representing sequences of integers asgenerating functions. In this context, arecurrence relation between the elements of a sequence may often be interpreted as adifferential equation that the generating function satisfies. This allows using methods ofcomplex analysis for combinatorial problems (seeanalytic combinatorics).

Introduction

[edit]

A formal power series can be loosely thought of as an object that is like apolynomial, but with infinitely many terms. Alternatively, for those familiar withpower series (orTaylor series), one may think of a formal power series as a power series in which we ignore questions ofconvergence by not assuming that the variableX denotes any numerical value (not even an unknown value). For example, consider the seriesA=13X+5X27X3+9X411X5+.{\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 itsradius of convergence is 1 by theCauchy–Hadamard theorem. However, as a formal power series, we may ignore this completely; all that is relevant is the sequence ofcoefficients [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 thefactorials [1, 1, 2, 6, 24, 120, 720, 5040, ... ] as coefficients, even though the corresponding power series diverges for any nonzero value ofX.

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

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

then we addA andB term by term:

A+B=1X+5X23X3+9X45X5+.{\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 particularCauchy product):

AB=2X6X2+14X326X4+44X5+.{\displaystyle AB=2X-6X^{2}+14X^{3}-26X^{4}+44X^{5}+\cdots .}

Notice that each coefficient in the productAB only depends on afinite number of coefficients ofA andB. For example, theX5 term is given by

44X5=(1×6X5)+(5X2×4X3)+(9X4×2X).{\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 ofabsolute,conditional anduniform convergence which arise in dealing with power series in the setting ofanalysis.

Once we have defined multiplication for formal power series, we can define multiplicative inverses as follows. The multiplicative inverse of a formal power seriesA is a formal power seriesC such thatAC = 1, provided that such a formal power series exists. It turns out that ifA has a multiplicative inverse, it is unique, and we denote it byA−1. Now we can define division of formal power series by definingB/A to be the productBA−1, provided that the inverse ofA exists. For example, one can use the definition of multiplication above to verify the familiar formula

11+X=1X+X2X3+X4X5+.{\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[Xn]{\displaystyle [X^{n}]} applied to a formal power seriesA{\displaystyle A} in one variable extracts the coefficient of then{\displaystyle n}th power of the variable, so that[X2]A=5{\displaystyle [X^{2}]A=5} and[X5]A=11{\displaystyle [X^{5}]A=-11}. Other examples include

[X3](B)=4,[X2](X+3X2Y3+10Y6)=3Y3,[X2Y3](X+3X2Y3+10Y6)=3,[Xn](11+X)=(1)n,[Xn](X(1X)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

If one considers the set of all formal power series inX with coefficients in acommutative ringR, the elements of this set collectively constitute another ring which is writtenR[[X]],{\displaystyle R[[X]],} and called thering of formal power series in the variable X overR.

Definition of the formal power series ring

[edit]

One can characterizeR[[X]]{\displaystyle R[[X]]} abstractly as thecompletion of thepolynomial ringR[X]{\displaystyle R[X]} equipped with a particularmetric. This automatically givesR[[X]]{\displaystyle R[[X]]} the structure of atopological 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 describeR[[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 setRN{\displaystyle R^{\mathbb {N} }} of all infinite sequences of elements ofR{\displaystyle R}, indexed by thenatural numbers (taken to include 0). Designating a sequence whose term at indexn{\displaystyle n} isan{\displaystyle a_{n}} by(an){\displaystyle (a_{n})}, one defines addition of two such sequences by

(an)nN+(bn)nN=(an+bn)nN{\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

(an)nN×(bn)nN=(k=0nakbnk)nN.{\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 theCauchy product of the two sequences of coefficients, and is a sort of discreteconvolution. With these operations,RN{\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 embedsR{\displaystyle R} intoR[[X]]{\displaystyle R[[X]]} by sending any (constant)aR{\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 )} byX{\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

(a0,a1,a2,,an,0,0,)=a0+a1X++anXn=i=0naiXi;{\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 inX{\displaystyle X}. Given this, it is quite natural and convenient to designate a general sequence(an)nN{\displaystyle (a_{n})_{n\in \mathbb {N} }} by the formal expressioniNaiXi{\displaystyle \textstyle \sum _{i\in \mathbb {N} }a_{i}X^{i}}, even though the latteris 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

(iNaiXi)+(iNbiXi)=iN(ai+bi)Xi{\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

(iNaiXi)×(iNbiXi)=nN(k=0nakbnk)Xn.{\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

(a0,a1,a2,a3,)=i=0aiXi,{\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 inRN{\displaystyle R^{\mathbb {N} }} is defined and atopology onRN{\displaystyle R^{\mathbb {N} }} is constructed. There are several equivalent ways to define the desired topology.

Informally, two sequences(an){\displaystyle (a_{n})} and(bn){\displaystyle (b_{n})} become closer and closer if and only if more and more of their terms agree exactly. Formally, the sequence ofpartial sums of some infinite summation converges if for every fixed power ofX{\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 valuesan{\displaystyle a_{n}}, since inclusion of the term fori=n{\displaystyle i=n} gives the last (and in fact only) change to the coefficient ofXn{\displaystyle X^{n}}. It is also obvious that thelimit 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 thering of formal power series overR{\displaystyle R} and is denoted byR[[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 ofX{\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

(iNaiXi)×(iNbiXi)=i,jNaibjXi+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 fixedXn{\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 thefinest topology for which

i=0aiXi{\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 ringR{\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 seriesZ[[X]][[Y]]{\displaystyle \mathbb {Z} [[X]][[Y]]}, the topology of above construction only relates to the indeterminateY{\displaystyle Y}, since the topology that was put onZ[[X]]{\displaystyle \mathbb {Z} [[X]]} has been replaced by the discrete topology when defining the topology of the whole ring. So

i=0XYi{\displaystyle \sum _{i=0}^{\infty }XY^{i}}

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

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

would be considered to be divergent, since every term affects the coefficient ofY{\displaystyle Y}. This asymmetry disappears if the power series ring inY{\displaystyle Y} is given the product topology where each copy ofZ[[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 ofZ[[X]][[Y]]{\displaystyle \mathbb {Z} [[X]][[Y]]} converges if the coefficient of each power ofY{\displaystyle Y} converges to a formal power series inX{\displaystyle X}, a weaker condition than stabilizing entirely. For instance, with this topology, in the second example given above, the coefficient ofY{\displaystyle Y}converges to11X{\displaystyle {\tfrac {1}{1-X}}}, so the whole summation converges toY1X{\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 constructingZ[[X,Y]]{\displaystyle \mathbb {Z} [[X,Y]]} and here a sequence converges if and only if the coefficient of every monomialXiYj{\displaystyle X^{i}Y^{j}} stabilizes. This topology, which is also theI{\displaystyle I}-adic topology, whereI=(X,Y){\displaystyle I=(X,Y)} is the ideal generated byX{\displaystyle X} andY{\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 inR[[X]]{\displaystyle \mathbb {R} [[X]]} the limit

limn(1+Xn)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)=nNXnn!.{\displaystyle \exp(X)=\sum _{n\in \mathbb {N} }{\frac {X^{n}}{n!}}.}

This is because fori2{\displaystyle i\geq 2} the coefficient(ni)/ni{\displaystyle {\tbinom {n}{i}}/n^{i}} ofXi{\displaystyle X^{i}} does not stabilize asn{\displaystyle n\to \infty }. It does however converge in the usual topology ofR{\displaystyle \mathbb {R} }, and in fact to the coefficient1i!{\displaystyle {\tfrac {1}{i!}}} ofexp(X){\displaystyle \exp(X)}. Therefore, if one would giveR[[X]]{\displaystyle \mathbb {R} [[X]]} the product topology ofRN{\displaystyle \mathbb {R} ^{\mathbb {N} }} where the topology ofR{\displaystyle \mathbb {R} } is the usual topology rather than the discrete one, then the above limit would converge toexp(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 inanalysis, 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 wouldnot be the case that a summation converges if and only if its terms tend to 0.

Universal property

[edit]

The ringR[[X]]{\displaystyle R[[X]]} may be characterized by the followinguniversal property. IfS{\displaystyle S} is a commutative associative algebra overR{\displaystyle R}, ifI{\displaystyle I} is an ideal ofS{\displaystyle S} such that theI{\displaystyle I}-adic topology onS{\displaystyle S} is complete, and ifx{\displaystyle x} is an element ofI{\displaystyle I}, then there is auniqueΦ:R[[X]]S{\displaystyle \Phi :R[[X]]\to S} with the following properties:

Operations on formal power series

[edit]

One can perform algebraic operations on power series to generate new power series.[1][2]

Power series raised to powers

[edit]

For anynatural numbern, thenth power of a formal power seriesS is defined recursively byS1=SSn=SSn1for n>1.{\displaystyle {\begin{aligned}S^{1}&=S\\S^{n}&=S\cdot S^{n-1}\quad {\text{for }}n>1.\end{aligned}}}Ifa0 is invertible in the ring of coefficients, one can prove that in the expansion(k=0akXk)n=m=0cmXm,{\displaystyle {\Big (}\sum _{k=0}^{\infty }a_{k}X^{k}{\Big )}^{n}=\sum _{m=0}^{\infty }c_{m}X^{m},}the coefficients are given byc0=a0n{\displaystyle c_{0}=a_{0}^{n}} andcm=1ma0k=1m(knm+k)akcmk{\displaystyle c_{m}={\frac {1}{ma_{0}}}\sum _{k=1}^{m}(kn-m+k)a_{k}c_{m-k}}form1{\displaystyle m\geq 1} ifm is invertible in the ring of coefficients.[3][4][5][a]In the case of formal power series with complex coefficients, its complex powers are well defined for seriesf with constant term equal to1. In this case,fα{\displaystyle f^{\alpha }} can be defined either by composition with thebinomial 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 term1; the three definitions are equivalent. Theexponent rules(fα)β=fαβ{\displaystyle (f^{\alpha })^{\beta }=f^{\alpha \beta }} andfαgα=(fg)α{\displaystyle f^{\alpha }g^{\alpha }=(fg)^{\alpha }} easily follow for formal power seriesf,g.

Multiplicative inverse

[edit]

The series

A=n=0anXnR[[X]]{\displaystyle A=\sum _{n=0}^{\infty }a_{n}X^{n}\in R[[X]]}

is invertible inR[[X]]{\displaystyle R[[X]]} if and only if its constant coefficienta0{\displaystyle a_{0}} is invertible inR{\displaystyle R}. This condition is necessary, for the following reason: if we suppose thatA{\displaystyle A} has an inverseB=b0+b1x+{\displaystyle B=b_{0}+b_{1}x+\cdots } then theconstant terma0b0{\displaystyle a_{0}b_{0}} ofAB{\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 seriesB{\displaystyle B} via the explicit recursive formula

b0=1a0,bn=1a0i=1naibni,   n1.{\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 thegeometric series formula is valid inR[[X]]{\displaystyle R[[X]]}:

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

IfR=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 byX{\displaystyle X}. This means thatK[[X]]{\displaystyle K[[X]]} is adiscrete valuation ring with uniformizing parameterX{\displaystyle X}.

Division

[edit]

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

n=0bnXnn=0anXn=n=0cnXn,{\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,a0{\displaystyle a_{0}} is invertible in the ring of scalars), can be performed as a productf{\displaystyle f} and the inverse ofg{\displaystyle g}, or directly equating the coefficients inf=gh{\displaystyle f=gh}:

cn=1a0(bnk=1nakcnk).{\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=0anXn{\displaystyle f(X)=\sum _{n=0}^{\infty }a_{n}X^{n}}

inX is written

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

and extracts the coefficient ofXm, so that

[Xm]f(X)=[Xm]n=0anXn=am.{\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=1anXn=a1X+a2X2+{\displaystyle f(X)=\sum _{n=1}^{\infty }a_{n}X^{n}=a_{1}X+a_{2}X^{2}+\cdots }
g(X)=n=0bnXn=b0+b1X+b2X2+{\displaystyle g(X)=\sum _{n=0}^{\infty }b_{n}X^{n}=b_{0}+b_{1}X+b_{2}X^{2}+\cdots }

such thata0=0,{\displaystyle a_{0}=0,}one may form thecomposition

g(f(X))=n=0bn(f(X))n=n=0cnXn,{\displaystyle g(f(X))=\sum _{n=0}^{\infty }b_{n}(f(X))^{n}=\sum _{n=0}^{\infty }c_{n}X^{n},}

where the coefficientscn are determined by "expanding out" the powers off(X):

cn:=kN,|j|=nbkaj1aj2ajk.{\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) withkN{\displaystyle k\in \mathbb {N} } andjN+k{\displaystyle j\in \mathbb {N} _{+}^{k}} with|j|:=j1++jk=n.{\displaystyle |j|:=j_{1}+\cdots +j_{k}=n.}

Sincea0=0,{\displaystyle a_{0}=0,} one must havekn{\displaystyle k\leq n} andjin{\displaystyle j_{i}\leq n} for everyi.{\displaystyle i.} This implies that the above sum is finite and that the coefficientcn{\displaystyle c_{n}} is the coefficient ofXn{\displaystyle X^{n}} in the polynomialgn(fn(X)){\displaystyle g_{n}(f_{n}(X))}, wherefn{\displaystyle f_{n}} andgn{\displaystyle g_{n}} are the polynomials obtained by truncating the series atxn,{\displaystyle x^{n},} that is, by removing all terms involving a power ofX{\displaystyle X} higher thann.{\displaystyle n.}

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

Composition is only valid whenf(X){\displaystyle f(X)} hasno constant term, so that eachcn{\displaystyle c_{n}} depends on only a finite number of coefficients off(X){\displaystyle f(X)} andg(X){\displaystyle g(X)}. In other words, the series forg(f(X)){\displaystyle g(f(X))} converges in thetopology ofR[[X]]{\displaystyle R[[X]]}.

Example

[edit]

Assume that the ringR{\displaystyle R} has characteristic 0 and the nonzero integers are invertible inR{\displaystyle R}. If one denotes byexp(X){\displaystyle \exp(X)} the formal power series

exp(X)=1+X+X22!+X33!+X44!+,{\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+X2+5X36+5X48+{\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 ofexp(X)1{\displaystyle \exp(X)-1} is zero.

Composition inverse

[edit]

Whenever a formal series

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

hasf0 = 0 andf1 being an invertible element ofR, there exists a series

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

that is thecomposition inverse off{\displaystyle f}, meaning that composingf{\displaystyle f} withg{\displaystyle g} gives the series representing theidentity functionx=0+1x+0x2+0x3+{\displaystyle x=0+1x+0x^{2}+0x^{3}+\cdots }. The coefficients ofg{\displaystyle g} may be found recursively by using the above formula for the coefficients of a composition, equating them with those of the composition identityX (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, theLagrange inversion formula (discussed below) provides a powerful tool to compute the coefficients ofg, as well as the coefficients of the (multiplicative) powers ofg.

Formal differentiation

[edit]

Given a formal power series

f=n0anXnR[[X]],{\displaystyle f=\sum _{n\geq 0}a_{n}X^{n}\in R[[X]],}

we define itsformal derivative, denotedDf orf ′, by

Df=f=n1annXn1.{\displaystyle Df=f'=\sum _{n\geq 1}a_{n}nX^{n-1}.}

The symbolD is called theformal differentiation operator. This definition simply mimics term-by-term differentiation of a polynomial.

This operation isR-linear:

D(af+bg)=aDf+bDg{\displaystyle D(af+bg)=a\cdot Df+b\cdot Dg}

for anya,b inR and anyf,g inR[[X]].{\displaystyle R[[X]].} Additionally, the formal derivative has many of the properties of the usualderivative of calculus. For example, theproduct rule is valid:

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

and thechain rule works as well:

D(fg)=(Dfg)Dg,{\displaystyle D(f\circ g)=(Df\circ g)\cdot Dg,}

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

Thus, in these respects formal power series behave likeTaylor series. Indeed, for thef defined above, we find that

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

whereDk denotes thekth formal derivative (that is, the result of formally differentiatingk times).

Formal antidifferentiation

[edit]

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

f=n0anXnR[[X]],{\displaystyle f=\sum _{n\geq 0}a_{n}X^{n}\in R[[X]],}

we define itsformal antiderivative orformal indefinite integral by

D1f=f dX=C+n0anXn+1n+1.{\displaystyle D^{-1}f=\int f\ dX=C+\sum _{n\geq 0}a_{n}{\frac {X^{n+1}}{n+1}}.}

for any constantCR{\displaystyle C\in R}.

This operation isR-linear:

D1(af+bg)=aD1f+bD1g{\displaystyle D^{-1}(af+bg)=a\cdot D^{-1}f+b\cdot D^{-1}g}

for anya,b inR and anyf,g inR[[X]].{\displaystyle R[[X]].} Additionally, the formal antiderivative has many of the properties of the usualantiderivative of calculus. For example, the formal antiderivative is theright inverse of the formal derivative:

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

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

Properties

[edit]

Algebraic properties of the formal power series ring

[edit]

R[[X]]{\displaystyle R[[X]]} is anassociative algebra overR{\displaystyle R} which contains the ringR[X]{\displaystyle R[X]} of polynomials overR{\displaystyle R}; the polynomials correspond to the sequences which end in zeros.

TheJacobson radical ofR[[X]]{\displaystyle R[[X]]} is theideal generated byX{\displaystyle X} and the Jacobson radical ofR{\displaystyle R}; this is implied by the element invertibility criterion discussed above.

Themaximal ideals ofR[[X]]{\displaystyle R[[X]]} all arise from those inR{\displaystyle R} in the following manner: an idealM{\displaystyle M} ofR[[X]]{\displaystyle R[[X]]} is maximal if and only ifMR{\displaystyle M\cap R} is a maximal ideal ofR{\displaystyle R} andM{\displaystyle M} is generated as an ideal byX{\displaystyle X} andMR{\displaystyle M\cap R}.

Several algebraic properties ofR{\displaystyle R} are inherited byR[[X]]{\displaystyle R[[X]]}:

Topological properties of the formal power series ring

[edit]

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

The ringR[[X]]{\displaystyle R[[X]]} iscompact if and only ifR isfinite. This follows fromTychonoff's theorem and the characterisation of the topology onR[[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 acomplete local ring satisfies theWeierstrass 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 theFibonacci numbers, see the article onExamples 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 ofQ[[X]]{\displaystyle \mathbb {Q} [[X]]}:

sin(X):=n0(1)n(2n+1)!X2n+1{\displaystyle \sin(X):=\sum _{n\geq 0}{\frac {(-1)^{n}}{(2n+1)!}}X^{2n+1}}
cos(X):=n0(1)n(2n)!X2n{\displaystyle \cos(X):=\sum _{n\geq 0}{\frac {(-1)^{n}}{(2n)!}}X^{2n}}

Then one can show that

sin2(X)+cos2(X)=1,{\displaystyle \sin ^{2}(X)+\cos ^{2}(X)=1,}
Xsin(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 ringQ[[X,Y]].{\displaystyle \mathbb {Q} [[X,Y]].}

ForK a field, the ringK[[X1,,Xr]]{\displaystyle K[[X_{1},\ldots ,X_{r}]]} is often used as the "standard, most general" complete local ring overK in algebra.

Interpreting formal power series as functions

[edit]
Mathematical analysisComplex analysis
Complex analysis
Complex numbers
Basic theory
Complex functions
Theorems
Geometric function theory
People

Inmathematical analysis, every convergentpower series defines afunction with values in thereal orcomplex numbers. Formal power series over certain special rings can also be interpreted as functions, but one has to be careful with thedomain andcodomain. Let

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

and supposeS{\displaystyle S} is a commutative associative algebra overR{\displaystyle R},I{\displaystyle I} is an ideal inS{\displaystyle S} such that theI-adic topology onS{\displaystyle S} is complete, andx{\displaystyle x} is an element ofI{\displaystyle I}. Define:

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

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

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

and

(fg)(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 onR[[X]]{\displaystyle R[[X]]} is the(X){\displaystyle (X)}-adic topology andR[[X]]{\displaystyle R[[X]]} is complete, we can in particular apply power series to other power series, provided that the arguments don't haveconstant coefficients (so that they belong to the ideal(X){\displaystyle (X)}):f(0){\displaystyle f(0)},f(X2X){\displaystyle f(X^{2}-X)} andf((1X)11){\displaystyle f((1-X)^{-1}-1)} are all well defined for any formal power seriesfR[[X]].{\displaystyle f\in R[[X]].}

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

f1=n0an1(af)n.{\displaystyle f^{-1}=\sum _{n\geq 0}a^{-n-1}(a-f)^{n}.}

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

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

wheref{\displaystyle f} is a known power series withf(0)=0{\displaystyle f(0)=0}, then the coefficients ofg{\displaystyle g} can be explicitly computed using theLagrange inversion formula.

Generalizations

[edit]

Formal Laurent series

[edit]

Theformal Laurent series over a ringR{\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=NanXn{\displaystyle f=\sum _{n=N}^{\infty }a_{n}X^{n}}

for some integerN{\displaystyle N}, so that there are only finitely many negativen{\displaystyle n} withan0{\displaystyle a_{n}\neq 0}. (This is different from the classicalLaurent series ofcomplex analysis.) For a non-zero formal Laurent series, the minimal integern{\displaystyle n} such thatan0{\displaystyle a_{n}\neq 0} is called theorder off{\displaystyle f} and is denotedord(f).{\displaystyle \operatorname {ord} (f).} (The order ord(0) of the zero series is+{\displaystyle +\infty }.)

For instance,X3+12X2+13X1+14+15X+16X2+17X3+18X4+{\displaystyle X^{-3}+{\frac {1}{2}}X^{-2}+{\frac {1}{3}}X^{-1}+{\frac {1}{4}}+{\frac {1}{5}}X+{\frac {1}{6}}X^{2}+{\frac {1}{7}}X^{3}+{\frac {1}{8}}X^{4}+\dots } is a formal Laurent series of order –3.

Multiplication of such series can be defined. Indeed, similarly to the definition for formal power series, the coefficient ofXk{\displaystyle X^{k}} of two series with respective sequences of coefficients{an}{\displaystyle \{a_{n}\}} and{bn}{\displaystyle \{b_{n}\}} isiZaibki.{\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 thering of formal Laurent series overR{\displaystyle R}, denoted byR((X)){\displaystyle R((X))}.[b] It is equal to thelocalization of the ringR[[X]]{\displaystyle R[[X]]} of formal power series with respect to the set of positive powers ofX{\displaystyle X}. IfR=K{\displaystyle R=K} is afield, thenK((X)){\displaystyle K((X))} is in fact a field, which may alternatively be obtained as thefield of fractions of theintegral domainK[[X]]{\displaystyle K[[X]]}.

As withR[[X]]{\displaystyle R[[X]]}, the ringR((X)){\displaystyle R((X))} of formal Laurent series may be endowed with the structure of a topological ring by introducing the metricd(f,g)=2ord(fg).{\displaystyle d(f,g)=2^{-\operatorname {ord} (f-g)}.}(In particular,ord(0)=+{\displaystyle \operatorname {ord} (0)=+\infty } implies thatd(f,f)=2ord(0)=0{\displaystyle d(f,f)=2^{-\operatorname {ord} (0)}=0}.)

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

Formal residue

[edit]

Assume thatK{\displaystyle K} is a field ofcharacteristic 0. Then the map

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

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

kerD=K{\displaystyle \ker D=K}
imD={fK((X)):[X1]f=0}.{\displaystyle \operatorname {im} D=\left\{f\in K((X)):[X^{-1}]f=0\right\}.}

The latter shows that the coefficient ofX1{\displaystyle X^{-1}} inf{\displaystyle f} is of particular interest; it is calledformal residue off{\displaystyle f} and denotedRes(f){\displaystyle \operatorname {Res} (f)}. The map

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

isK{\displaystyle K}-linear, and by the above observation one has anexact sequence

0KK((X))DK((X))ResK0.{\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 anyf,gK((X)){\displaystyle f,g\in K((X))}

  1. Res(f)=0;{\displaystyle \operatorname {Res} (f')=0;}
  2. Res(fg)=Res(fg);{\displaystyle \operatorname {Res} (fg')=-\operatorname {Res} (f'g);}
  3. Res(f/f)=ord(f),f0;{\displaystyle \operatorname {Res} (f'/f)=\operatorname {ord} (f),\qquad \forall f\neq 0;}
  4. Res((gf)f)=ord(f)Res(g),{\displaystyle \operatorname {Res} \left((g\circ f)f'\right)=\operatorname {ord} (f)\operatorname {Res} (g),} iford(f)>0;{\displaystyle \operatorname {ord} (f)>0;}
  5. [Xn]f(X)=Res(Xn1f(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(fg)=fg+fg{\displaystyle (fg)'=f'g+fg'}. Property (iii): anyf{\displaystyle f} can be written in the formf=Xmg{\displaystyle f=X^{m}g}, withm=ord(f){\displaystyle m=\operatorname {ord} (f)} andord(g)=0{\displaystyle \operatorname {ord} (g)=0}: thenf/f=mX1+g/g.{\displaystyle f'/f=mX^{-1}+g'/g.}ord(g)=0{\displaystyle \operatorname {ord} (g)=0} impliesg{\displaystyle g} is invertible inK[[X]]im(D)=ker(Res),{\displaystyle K[[X]]\subset \operatorname {im} (D)=\ker(\operatorname {Res} ),} whenceRes(f/f)=m.{\displaystyle \operatorname {Res} (f'/f)=m.} Property (iv): Sinceim(D)=ker(Res),{\displaystyle \operatorname {im} (D)=\ker(\operatorname {Res} ),} we can writeg=g1X1+G,{\displaystyle g=g_{-1}X^{-1}+G',} withGK((X)){\displaystyle G\in K((X))}. Consequently,(gf)f=g1f1f+(Gf)f=g1f/f+(Gf){\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 seriesfK[[X]]{\displaystyle f\in K[[X]]} withf0 = 0 andf1 ≠ 0 has a composition inversegK[[X]].{\displaystyle g\in K[[X]].} The following relation between the coefficients ofgn andfk holds ("Lagrange inversion formula"):

k[Xk]gn=n[Xn]fk.{\displaystyle k[X^{k}]g^{n}=n[X^{-n}]f^{-k}.}

In particular, forn = 1 and allk ≥ 1,

[Xk]g=1kRes(fk).{\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 proof here.[c] Notingord(f)=1{\displaystyle \operatorname {ord} (f)=1}, we can apply the rules of calculus above, crucially Rule (iv) substitutingXf(X){\displaystyle X\rightsquigarrow f(X)}, to get:

k[Xk]gn =(v) kRes(gnXk1) =(iv) kRes(Xnfk1f) =chain Res(Xn(fk)) =(ii) Res((Xn)fk) =chain nRes(Xn1fk) =(v) n[Xn]fk.{\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 thanK((X)): a generalization of the Lagrange inversion formula is already available working in theC((X)){\displaystyle \mathbb {C} ((X))}-modulesXαC((X)),{\displaystyle X^{\alpha }\mathbb {C} ((X)),} where α is a complex exponent. As a consequence, iff andg are as above, withf1=g1=1{\displaystyle f_{1}=g_{1}=1}, we can relate the complex powers off /X andg /X: precisely, if α and β are non-zero complex numbers with negative integer sum,m=αβN,{\displaystyle m=-\alpha -\beta \in \mathbb {N} ,} then

1α[Xm](fX)α=1β[Xm](gX)β.{\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 forcomplex 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. IfI is an index set andXI is the set of indeterminatesXi foriI, then amonomialXα is any finite product of elements ofXI (repetitions allowed); a formal power series inXI with coefficients in a ringR is determined by any mapping from the set of monomialsXα to a corresponding coefficientcα, and is denotedαcαXα{\textstyle \sum _{\alpha }c_{\alpha }X^{\alpha }}. The set of all such formal power series is denotedR[[XI]],{\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 onR[[XI]]{\displaystyle R[[X_{I}]]} is such that a sequence of its elements converges only if for each monomialXα the corresponding coefficient stabilizes. IfI is finite, then this theJ-adic topology, whereJ is the ideal ofR[[XI]]{\displaystyle R[[X_{I}]]} generated by all the indeterminates inXI. This does not hold ifI is infinite. For example, ifI=N,{\displaystyle I=\mathbb {N} ,} then the sequence(fn)nN{\displaystyle (f_{n})_{n\in \mathbb {N} }} withfn=Xn+Xn+1+Xn+2+{\displaystyle f_{n}=X_{n}+X_{n+1}+X_{n+2}+\cdots } does not converge with respect to anyJ-adic topology onR, but clearly for each monomial the corresponding coefficient stabilizes.

As remarked above, the topology on a repeated formal power series ring likeR[[X]][[Y]]{\displaystyle R[[X]][[Y]]} is usually chosen in such a way that it becomes isomorphic as atopological ring toR[[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 inR.
  • The compositionf(g(X)) of two seriesf andg is defined iff is a series in a single indeterminate, and the constant term ofg is zero. For a seriesf in several indeterminates a form of "composition" can similarly be defined, with as many separate series in the place ofg as there are indeterminates.

In the case of the formal derivative, there are now separatepartial 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 characterizingR[[X1,,Xr]]{\displaystyle R[[X_{1},\ldots ,X_{r}]]} becomes the following. IfS is a commutative associative algebra overR, ifI is an ideal ofS such that theI-adic topology onS is complete, and ifx1, ...,xr are elements ofI, then there is aunique mapΦ:R[[X1,,Xr]]S{\displaystyle \Phi :R[[X_{1},\ldots ,X_{r}]]\to S} with the following properties:

  • Φ is anR-algebra homomorphism
  • Φ is continuous
  • Φ(Xi) =xi fori = 1, ...,r.

Non-commuting variables

[edit]

The several variable case can be further generalised by takingnon-commuting variablesXi foriI, whereI is an index set and then amonomialXα is anyword in theXI; a formal power series inXI with coefficients in a ringR is determined by any mapping from the set of monomialsXα to a corresponding coefficientcα, and is denotedαcαXα{\displaystyle \textstyle \sum _{\alpha }c_{\alpha }X^{\alpha }}. The set of all such formal power series is denotedR«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 overR form theMagnus ring overR.[9][10]

On a semiring

[edit]
[icon]
This sectionneeds expansion with: sum, product, examples. You can help byadding to it.(August 2014)

Given analphabetΣ{\displaystyle \Sigma } and asemiringS{\displaystyle S}. The formal power series overS{\displaystyle S} supported on the languageΣ{\displaystyle \Sigma ^{*}} is denoted bySΣ{\displaystyle S\langle \langle \Sigma ^{*}\rangle \rangle }. It consists of all mappingsr:ΣS{\displaystyle r:\Sigma ^{*}\to S}, whereΣ{\displaystyle \Sigma ^{*}} is thefree monoid generated by the non-empty setΣ{\displaystyle \Sigma }.

The elements ofSΣ{\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 ofr{\displaystyle r} at the wordwΣ{\displaystyle w\in \Sigma ^{*}}. The elements(r,w)S{\displaystyle (r,w)\in S} are called the coefficients ofr{\displaystyle r}.

ForrSΣ{\displaystyle r\in S\langle \langle \Sigma ^{*}\rangle \rangle } the support ofr{\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 either0{\displaystyle 0} or1{\displaystyle 1} is called the characteristic series of its support.

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

Forr1,r2SΣ{\displaystyle r_{1},r_{2}\in S\langle \langle \Sigma ^{*}\rangle \rangle } andsS{\displaystyle s\in S}, the sumr1+r2{\displaystyle r_{1}+r_{2}} is defined by

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

The (Cauchy) productr1r2{\displaystyle r_{1}\cdot r_{2}} is defined by

(r1r2,w)=w1w2=w(r1,w1)(r2,w2){\displaystyle (r_{1}\cdot r_{2},w)=\sum _{w_{1}w_{2}=w}(r_{1},w_{1})(r_{2},w_{2})}

The Hadamard productr1r2{\displaystyle r_{1}\odot r_{2}} is defined by

(r1r2,w)=(r1,w)(r2,w){\displaystyle (r_{1}\odot r_{2},w)=(r_{1},w)(r_{2},w)}

And the products by a scalarsr1{\displaystyle sr_{1}} andr1s{\displaystyle r_{1}s} by

(sr1,w)=s(r1,w){\displaystyle (sr_{1},w)=s(r_{1},w)} and(r1s,w)=(r1,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 ofweighted automata, intheoretical computer science, when the coefficients(r,w){\displaystyle (r,w)} of the series are taken to be the weight of a path with labelw{\displaystyle w} in the automata.[11]

Replacing the index set by an ordered abelian group

[edit]
Main article:Hahn series

SupposeG{\displaystyle G} is an orderedabelian group, meaning an abelian group with a total ordering<{\displaystyle <} respecting the group's addition, so thata<b{\displaystyle a<b} if and only ifa+c<b+c{\displaystyle a+c<b+c} for allc{\displaystyle c}. LetI be awell-ordered subset ofG{\displaystyle G}, meaningI contains no infinite descending chain. Consider the set consisting of

iIaiXi{\displaystyle \sum _{i\in I}a_{i}X^{i}}

for all suchI, withai{\displaystyle a_{i}} in a commutative ringR{\displaystyle R}, where we assume that for any index set, if all of theai{\displaystyle a_{i}} are zero then the sum is zero. ThenR((G)){\displaystyle R((G))} is the ring of formal power series onG{\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[[RG]]{\displaystyle [[R^{G}]]} is used to denoteR((G)){\displaystyle R((G))}.[12]

Various properties ofR{\displaystyle R} transfer toR((G)){\displaystyle R((G))}. IfR{\displaystyle R} is a field, then so isR((G)){\displaystyle R((G))}. IfR{\displaystyle R} is anordered field, we can orderR((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 setI associated to a non-zero coefficient. Finally ifG{\displaystyle G} is adivisible group andR{\displaystyle R} is areal closed field, thenR((G)){\displaystyle R((G))} is a real closed field, and ifR{\displaystyle R} isalgebraically closed, then so isR((G)){\displaystyle R((G))}.

This theory is due toHans 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]

See also

[edit]

Notes

[edit]
  1. ^The formula is often attributed toJ.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 ringR((X)){\displaystyle R((X))} contains series of all orders.
  3. ^A number of different proofs exist, using techniques including Cauchy's coefficient formula for holomorphic functions, tree-counting arguments, or induction.[6][pages needed][7][8]

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. ^abGould, 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. ^Stanley, Richard (2012).Enumerative combinatorics. Volume 1. Cambridge Stud. Adv. Math. Vol. 49. Cambridge:Cambridge University Press.ISBN 978-1-107-60262-5.MR 2868112.
  7. ^Gessel, Ira (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.

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". InJan van Leeuwen (ed.).Formal Models and Semantics. Handbook of Theoretical Computer Science. Vol. B. Elsevier. pp. 103–132.ISBN 0-444-88074-7.


Integer sequences
Basic
Advanced(list)
Fibonacci spiral with square sizes up to 34.
Properties of sequences
Properties of series
Series
Convergence
Explicit series
Convergent
Divergent
Kinds of series
Hypergeometric series
Retrieved from "https://en.wikipedia.org/w/index.php?title=Formal_power_series&oldid=1296412974#The_ring_of_formal_power_series"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp