Formal power series

Formal power series

In mathematics, formal power series are devices that make it possible to employ much of the analytical machinery of power series in settings that do not have natural notions of convergence. They are also useful, especially in combinatorics, for providing compact representations of sequences and multisets, and for finding closed formulas for recursively defined sequences; this is known as the method of generating functions.

Informal introduction

A formal power series can be loosely thought of as a "polynomial 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. For example, consider the series

: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. 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 just an object that records a sequence of coefficients.

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

:B = 2x + 4x^3 + 6x^5 + cdots,

then we add "A" and "B" term by term:

: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):

: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 "x"5 term is given by

:44x^5 = (1 imes 6x^5) + (5x^2 imes 4x^3) + (9x^4 imes 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 "B" "A" −1, provided that the inverse of "A" exists. For example, one can use the definition of multiplication above to verify the familiar formula

: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 for a formal power series in one variable extracts the coefficient of "x""n", and is written e.g. ["x""n"] "A", so that ["x"2] "A" = 5 and ["x"5] "A" = −11. Other examples include

: [x^3] B = 4, quad [x^2] ( x + 3 x^2 y^3 + 10 y^6) = 3 y^3, ext{ and } [x^2 y^3] ( x + 3 x^2 y^3 + 10 y^6) = 3

and

: [x^n] frac{1}{1+x} = (-1)^n ext{ and } [x^n] frac{x}{(1-x)^2} = n.

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

The set of all formal power series in "X" with coefficients in a commutative ring "R" form another ring that is written "R""X", and called the ring of formal power series over R in the variable X.

Definition of the formal power series ring

One can characterize "R""X" abstractly as the completion of the polynomial ring "R" ["X"] equipped with a particular metric . This automatically gives "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" more explicitly, and define the ring structure and topological structure separately, as follows.

Ring structure

As a set, "R""X" can be constructed as the set "R"N of all infinite sequences in "R". One defines addition of two such sequences by

:left( a_n ight) + left( b_n ight) = left( a_n + b_n ight)

and multiplication by

:left( a_n ight) imes left( b_n ight) =left( sum_{k=0}^n a_k b_{n-k} ight).

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 becomes a commutative ring with zero element (0, 0, 0, ...) and multiplicative identity (1, 0, 0,...).

If we identify the element "a" of "R" with the sequence ("a", 0, 0, ...) and define "X" := (0, 1, 0, 0, ...), then using the above definitions of addition and multiplication, we find that every sequence with only finitely many nonzero terms can be written as the "finite" sum

:(a_0, a_1, a_2, ldots, a_N, 0, 0, ldots) = a_0 + a_1 X + cdots + a_N X^N = sum_{n=0}^N a_n X^n.

Topological structure

We would like to extend the above formula to a similar one for arbitrary sequences in "R"N, that is, we would like:(a_0, a_1, a_2, a_3, ldots) = sum_{n=0}^infty a_n X^n qquad (1)to hold. However, for the infinite sum on the right to make sense, we need a notion of convergence in "R"N, which involves introducing a topology on "R"N. There are several equivalent ways to define the appropriate topology.

* We may give "R"N the product topology, where each copy of "R" is given the discrete topology.
* We may introduce a metric (or "distance function"). For sequences ("a""n") and ("b""n") in "R"N, let us define::d((a_n), (b_n)) = 2^{-k},,!:where "k" is the smallest natural number such that "a""k" ≠ "b""k"; if there is no such "k", then the two sequences are identical, so we set their distance to be zero.
* We may give "R"N the I-adic topology, where "I" = ("X") is the ideal generated by "X", which consists of all sequences whose first term "a"0 is zero.

All of these definitions of the topology amount to declaring that two sequences ("a""n") and ("b""n") are "close" if their first few terms agree; the more terms agree, the closer they are.

Now we can make sense of equation (1); the partial sums of the infinite sum certainly converge to the sequence on the left hand side. In fact, any rearrangement of the series converges to the same limit.

One must check that 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" and is denoted by "R""X".

Universal property

The ring "R""X" may be characterized by the following universal property. 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 "x" is an element of "I", then there is a "unique" Φ : "R""X" → "S" with the following properties:
* Φ is an "R"-algebra homomorphism
* Φ is continuous
* Φ("X") = "x".

Operations on formal power series

Inverting series

The series:sum_{n=0}^infty a_n X^n in "R""X" is invertible in "R""X" if and only if its constant coefficient "a"0 is invertible in "R".This is necessary, as the constant term of the product is a_0b_0,and sufficient, via the explicit formula::egin{align}b_0 &= frac{1}{a_0}\b_n &= -frac{1}{a_0} sum_{i=1}^n a_i b_{n-i}qquad ext{for } n ge 1end{align}

An important special case is that the geometric series formula is valid in "R""X":

:left( 1 - X ight)^{-1} = sum_{n ge 0} X^n.

If "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 it is not divisible by "X". This says that KX is a discrete valuation ring with uniformizing parameter "X".

Extracting coefficients

The coefficient extraction operator applied to a formal power series :f(X) = sum_{n=0}^infty a_n X^n in X, is written: left [ X^m ight] f(X) and extracts the coefficient of X^m,, so that: left [ X^m ight] f(X) = left [ X^m ight] sum_{n=0}^infty a_n X^n = a_m.

Composition of series

Given formal power series:f(X) = sum_{n=1}^infty a_n X^n = a_1 X + a_2 X^2 + cdotsand:g(X) = sum_{n=0}^infty b_n X^n = b_0 + b_1 X + b_2 X^2 + cdots,one may form the "composition":g(f(X)) = sum_{n=0}^infty b_n f(X)^n = sum_{n=0}^infty c_n X^n,where the coefficients "c""n" are determined by "expanding out" the powers of "f"("X"). A more explicit description of these coefficients is provided by Faà di Bruno's formula.

The critical point here is that this operation is only valid when "f"("X") has "no constant term", so that the series for "g"("f"("X")) converges in the topology of "R""X". In other words, each "c""n" depends on only a finite number of coefficients of "f"("X") and "g"("X").

Example

If we denote by exp("X") the formal power series:exp(X) = 1 + X + frac{X^2}{2!} + frac{X^3}{3!} + frac{X^4}{4!} + cdots,then the expression:exp(exp(X) - 1) = 1 + X + X^2 + frac{5X^3}6 + frac{5X^4}8 + cdotsmakes perfect sense as a formal power series. However, the statement:exp(exp(X)) = e exp(exp(X) - 1) = e + eX + eX^2 + frac{5eX^3}6 + cdotsis not a valid application of the composition operation for formal power series. Rather, it is confusing the notions of convergence in "R""X" and convergence in "R"; indeed, the ring "R" may not even contain any number "e" with the appropriate properties.

Formal differentiation of series

Given a formal power series:f = sum_{ngeq 0} a_n X^nin "R""X", we define its formal derivative, denoted "Df", by

:Df = sum_{n geq 1} a_n n X^{n-1}.

The symbol "D" is called the formal differentiation operator. The motivation behind this definition is that it simply mimics term-by-term differentiation of a polynomial.

This operation is "R"-linear:

:D(af + bg) = a Df + b Dg ,!

for any "a", "b" in "R" and any "f", "g" in "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(fg) = f(Dg) + (Df) g; ,!

and the chain rule works as well:

:D(f(u)) = (Df)(u) Du, ,!

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

In a sense, all formal power series are Taylor series. Indeed, for the "f" defined above, we find that:(D^k f)(0) = k! a_k, ,!where "D""k" denotes the "k"th formal derivative (that is, the result of formally differentiating "k" times).

Algebraic properties of the formal power series ring

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

The Jacobson radical of "R""X" is the ideal generated by "X" and the Jacobson radical of "R"; this is implied by the element invertibility criterion discussed above.

The maximal ideals of "R""X" all arise from those in "R" in the following manner: an ideal "M" of "R""X" is maximal if and only if "M" ∩ "R" is a maximal ideal of "R" and "M" is generated as an ideal by "X" and "M" ∩ "R".

Several algebraic properties of "R" are inherited by "R""X":
* if "R" is a local ring, then so is "R""X"
* if "R" is Noetherian, then so is "R""X"; this is a version of the Hilbert basis theorem
* if "R" is an integral domain, then so is "R""X"

If "R" = "K" is a field, then "K""X" has several additional properties.
* "K""X" is a discrete valuation ring.
* "K""X" is a unique factorization domain.

Topological properties of the formal power series ring

The metric space ("R""X", "d") is complete.

The ring "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" as a product topology.

Applications

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":

:sin(X) := sum_{n ge 0} frac{(-1)^n} {(2n+1)!} X^{2n+1}

:cos(X) := sum_{n ge 0} frac{(-1)^n} {(2n)!} X^{2n}

Then one can show that:sin^2(X) + cos^2(X) = 1

and

:frac{partial}{partial X} sin(X) = cos(X)

as well as

:sin (X+Y) = sin(X) cos(Y) + cos(X) sin(Y)

(the latter being valid in the ring Q"X","Y").

In algebra, the ring "K""X"1, ..., "X""r" (where "K" is a field) is often used as the "standard, most general" complete local ring over "K".

Interpreting formal power series as functions

In mathematical analysis, every convergent power series defines a function with values in the real or complex numbers. Formal power series can also be interpreted as functions, but one has to be careful with the domain and codomain. If "f"=∑"a""n" "X""n" is an elementof "R""X", "S" is a commutative associative algebra over "R", "I" is an ideal in "S" such that the I-adic topology on "S" is complete, and "x" is an element of "I", then we can define

:f(x) = sum_{nge 0} a_n x^n.

This latter series is guaranteed to converge in "S" given the above assumptions on "x". Furthermore, we have

:(f+g)(x) = f(x) + g(x)

and

:(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" is the ("X")-adic topology and "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")): "f"(0), "f"("X"2−"X") and "f"( (1 − "X")−1 − 1) are all well defined for any formal power series "f"∈"R""X".

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

:f^{-1} = sum_{n ge 0} a^{-n-1} (a-f)^n.

If the formal power series "g" with "g"(0) = 0 is given implicitly by the equation

:f(g) = X

where "f" is a known power series with "f"(0) = 0, then the coefficients of "g" can be explicitly computed using the Lagrange inversion theorem.

Generalizations

Formal Laurent series

A formal Laurent series over "R" is defined in a similar way to a formal power series, except that we also allow finitely many terms of negative degree, which is "different" from classical Laurent series, which can have infinitely many terms of negative degree.

That is, we consider series of the form:f = sum_{n ge -M} a_n X^nwhere "M" is an integer which depends on "f". We may add and multiply such series using the same formal rules as for formal power series; note that multiplication makes sense because we have only allowed finitely many negative index terms.

Under these operations, these elements form the ring of formal Laurent series over "R", denoted by "R"(("X")). It is a topological ring, and its relationship to formal power series is analogous to the relationship between power series and Laurent series.

If "R" = "K" is a field, then "K"(("X")) may also be obtained as the field of fractions of the integral domain "K""X".

One may define formal differentiation for formal Laurent series in a natural way (term-by-term). If "R" is a field, then in addition to the rules listed above under formal differentiation of series, the quotient rule will also be valid.

Power series in several variables

It is relatively straightforward to extend the above ideas to define a formal power series ring over "R" in "r" variables, denoted "R""X"1,...,"X""r". Elements of this ring may be expressed uniquely in the form:sum_{mathbf{n}inBbb{N}^r} a_mathbf{n} mathbf{X^n}where now n = ("n"1,...,"n""r") ∈ N"r", and Xn denotes the monomial "X"1"n"1..."X""r""n""r". This sum converges for any choice of the coefficients "a"n∈"R", and the order of summation is immaterial.

Definition

One possible definition of "R""X"1,...,"X""r" is to take the completion of the polynomial ring "R" ["X"1,...,"X""r"] in "r" variables with respect to the I-adic topology, where "I" is the ideal of "R" ["X"1,...,"X""r"] generated by "X"1,...,"X""r". That is, "I" is the ideal consisting of polynomials with zero constant term.

Alternatively, one may proceed in a similar way to the more explicit discussion given above for the single-variable case, giving the ring structure first in terms of "multi-dimensional" sequences, and then defining the topology.

The topology on "R""X"1,...,"X""r" is the J-adic topology, where "J" is the ideal of "R""X"1,...,"X""r" generated by "X"1,...,"X""r". That is, "J" is the ideal consisting of series with zero constant term. Therefore, two series are considered "close" if their first few terms agree, where "first few" means terms whose total degree "n"1 + ... + "n""r" is small.

Warning

Although "R""X"1, "X"2 and "R""X"1"X"2 are isomorphic as "rings", they do "not" carry the same topology. For example, the sequence of elements:f_n = X_1^n, quad n geq 1converges to zero in "R""X"1, "X"2 as "n" → ∞; however, in the ring "R""X"1"X"2, it does "not" converge, since the copy of "R""X"1 embedded in "R""X"1"X"2 has been given the discrete topology.

Operations

All of the operations defined for series in one variable may be extended to the several variables case.
* Addition is carried out term-by-term.
* Multiplication is carried out simply by "multiplying out" the series.
* 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 only if the constant term of "g" is zero.

In the case of the formal derivative, there are now "r" different partial derivative operators, which differentiate with respect to each of the "r" variables. They all commute with each other, as they do for continuously differentiable functions.

Universal property

In the several variables case, the universal property characterizing "R""X"1, ..., "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 "x"1, ..., "x""r" are elements of "I", then there is a "unique" Φ : "R""X"1, ..., "X""n" → "S" with the following properties:
* Φ is an "R"-algebra homomorphism
* Φ is continuous
* Φ("X""i") = "x""i" for "i" = 1, ..., "r".

Replacing the index set by an ordered abelian group

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

:sum_{i in I} a_i X^i

for all such I, with "a""i" in a commutative ring "R", where we assume that for any index set, if all of the "a""i" are zero then the sum is zero. Then "R"(("G")) is the ring of formal power series on "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.

Various properties of "R" transfer to "R"(("G")). If "R" is a field, then so is "R"(("G")). If "R" is an ordered field, we can order "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" is a divisible group and "R" is a real closed field, then "R"(("G")) is a real closed field, and if "R" is algebraically closed, then so is "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

* Bell series are used to study the properties of multiplicative arithmetic functions


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Power series — In mathematics, a power series (in one variable) is an infinite series of the form:f(x) = sum {n=0}^infty a n left( x c ight)^n = a 0 + a 1 (x c)^1 + a 2 (x c)^2 + a 3 (x c)^3 + cdotswhere an represents the coefficient of the n th term, c is a… …   Wikipedia

  • Formal group — In mathematics, a formal group law is (roughly speaking) a formal power series behaving as if it were the product of a Lie group. They were first defined in 1946 by S. Bochner. The term formal group sometimes means the same as formal group law,… …   Wikipedia

  • Series (mathematics) — A series is the sum of the terms of a sequence. Finite sequences and series have defined first and last terms, whereas infinite sequences and series continue indefinitely.[1] In mathematics, given an infinite sequence of numbers { an } …   Wikipedia

  • Formal calculation — In mathematical logic, a formal calculation is sometimes defined as a calculation which is systematic, but without a rigorous justification . This means that we are manipulating the symbols in an expression using a generic substitution, without… …   Wikipedia

  • Formal — The term formal has a number of uses, including:General*relating to formality *opposite of informalocial* Formal occasion ** Formal attire worn on such occasions ** Formals are particular meals at some British universities ** In Australian or… …   Wikipedia

  • Formal derivative — In mathematics, the formal derivative is an operation on elements of a polynomial ring which mimics the form of the derivative from calculus. Though they appear similar, the algebraic advantage of a formal derivative is that it does not rely on… …   Wikipedia

  • Formal moduli — In mathematics, formal moduli are an aspect of the theory of moduli spaces (of algebraic varieties or vector bundles, for example), closely linked to deformation theory and formal geometry. Roughly speaking, deformation theory can provide the… …   Wikipedia

  • Convolution power — In mathematics, the convolution power is the n fold iteration of the convolution with itself. Thus if x is a function on Euclidean space Rd and n is a natural number, then the convolution power is defined by where * denotes the convolution… …   Wikipedia

  • Hypergeometric series — In mathematics, a hypergeometric series is a power series in which the ratios of successive coefficients k is a rational function of k . The series, if convergent, will define a hypergeometric function which may then be defined over a wider… …   Wikipedia

  • Bell series — In mathematics, the Bell series is a formal power series used to study properties of arithmetical functions. Bell series were introduced and developed by Eric Temple Bell.Given an arithmetic function f and a prime p, define the formal power… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”