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
<math display="block">\sum_{n=0}^\infty a_nx^n=a_0+a_1x+ a_2x^2+\cdots,</math>
where the <math>a_n,</math> called coefficients, are numbers or, more generally, elements of some ring, and the <math>x^n</math> are formal powers of the symbol <math>x</math> that is called an indeterminate or, commonly, a variable. Hence, formal 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 formal power series may not represent a function of its variables. 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 <math>R</math> is called a formal power series over <math>R.</math> The formal power series over a ring <math>R</math> form a ring, commonly denoted by <math>Rx.</math> (It can be seen as the -adic completion of the polynomial ring <math>R[x],</math> in the same way as the -adic integers are the -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
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
<math display=block>
A = 1 - 3X + 5X^2 - 7X^3 + 9X^4 - 11X^5 + \cdots.
</math>
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
:<math>B = 2X + 4X^3 + 6X^5 + \cdots,</math>
then we add A and B term by term:
:<math>A + B = 1 - X + 5X^2 - 3X^3 + 9X^4 - 5X^5 + \cdots.</math>
We can multiply formal power series, again just by treating them as polynomials (see in particular Cauchy product):
:<math>AB = 2X - 6X^2 + 14X^3 - 26X^4 + 44X^5 + \cdots.</math>
Notice that each coefficient in the product AB only depends on a finite number of coefficients of A and B. For example, the X<sup>5</sup> term is given by
:<math>44X^5 = (1\times 6X^5) + (5X^2 \times 4X^3) + (9X^4 \times 2X).</math>
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<sup>−1</sup>. Now we can define division of formal power series by defining B/A to be the product BA<sup>−1</sup>, provided that the inverse of A exists. For example, one can use the definition of multiplication above to verify the familiar formula
:<math>\frac{1}{1 + X} = 1 - X + X^2 - X^3 + X^4 - X^5 + \cdots.</math>
An important operation on formal power series is coefficient extraction. In its most basic form, the coefficient extraction operator <math>[X^n]</math> applied to a formal power series <math>A</math> in one variable extracts the coefficient of the <math>n</math>th power of the variable, so that <math>[X^2]A=5</math> and <math>[X^5]A=-11</math>. Other examples include
:<math>\begin{align}
\left[X^3\right] (B) &= 4, \\
\left[X^2 \right] (X + 3 X^2 Y^3 + 10 Y^6) &= 3Y^3, \\
\left[X^2Y^3 \right] ( X + 3 X^2 Y^3 + 10 Y^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{align}</math>
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
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 <math>RX,</math> and called the ring of formal power series in the variable X over R.
Definition of the formal power series ring
One can characterize <math>RX</math> abstractly as the completion of the polynomial ring <math>R[X]</math> equipped with a particular metric<!-- in which the powers of the ideal I of <math>R[X]</math> generated by <math>X</math> form a shrinking set of neighbourhoods of 0; a precise description would be too long to spell out here-->. This automatically gives <math>RX</math> 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 <math>RX</math> more explicitly, and define the ring structure and topological structure separately, as follows.
Ring structure
As a set, <math>RX</math> can be constructed as the set <math>R^\N</math> of all infinite sequences of elements of <math>R</math>, indexed by the natural numbers (taken to include 0). Designating a sequence whose term at index <math>n</math> is <math>a_n</math> by <math>(a_n)</math>, one defines addition of two such sequences by
:<math>(a_n)_{n\in\N} + (b_n)_{n\in\N} = \left( a_n + b_n \right)_{n\in\N}</math>
and multiplication by
:<math>(a_n)_{n\in\N} \times (b_n)_{n\in\N} = \left( \sum_{k=0}^n a_k b_{n-k} \right)_{\!n\in\N}.</math>
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, <math>R^\N</math> becomes a commutative ring with zero element <math>(0,0,0,\ldots)</math> and multiplicative identity <math>(1,0,0,\ldots)</math>.
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 <math>R</math> into <math>RX</math> by sending any (constant) <math>a \in R</math> to the sequence <math>(a,0,0,\ldots)</math> and designates the sequence <math>(0,1,0,0,\ldots)</math> by <math>X</math>; then using the above definitions every sequence with only finitely many nonzero terms can be expressed in terms of these special elements as
:<math>(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;</math>
these are precisely the polynomials in <math>X</math>. Given this, it is quite natural and convenient to designate a general sequence <math>(a_n)_{n\in\N}</math> by the formal expression <math>\textstyle\sum_{i\in\N}a_i X^i</math>, 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
:<math>\left(\sum_{i\in\N} a_i X^i\right)+\left(\sum_{i\in\N} b_i X^i\right) = \sum_{i\in\N}(a_i+b_i) X^i</math>
and
:<math>\left(\sum_{i\in\N} a_i X^i\right) \times \left(\sum_{i\in\N} b_i X^i\right) = \sum_{n\in\N} \left(\sum_{k=0}^n a_k b_{n-k}\right) X^n.</math>
which is quite convenient, but one must be aware of the distinction between formal summation (a mere convention) and actual addition.
Topological structure
Having stipulated conventionally that
one would like to interpret the right hand side as a well-defined infinite summation. To that end, a notion of convergence in <math>R^\N</math> is defined and a topology on <math>R^\N</math> is constructed. There are several equivalent ways to define the desired topology.
- We may give <math>R^\N</math> the product topology, where each copy of <math>R</math> is given the discrete topology.
- We may give <math>R^\N</math> the I-adic topology, where <math>I=(X)</math> is the ideal generated by <math>X</math>, which consists of all sequences whose first term <math>a_0</math> is zero.
- The desired topology could also be derived from the following metric. The distance between distinct sequences <math>(a_n), (b_n) \in R^{\N},</math> is defined to be <math display="block">d((a_n), (b_n)) = 2^{-k},</math> where <math>k</math> is the smallest natural number such that <math>a_k\neq b_k</math>; the distance between two equal sequences is of course zero.
Informally, two sequences <math>(a_n)</math> and <math>(b_n)</math> 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 <math>X</math> 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 (), regardless of the values <math>a_n</math>, since inclusion of the term for <math>i=n</math> gives the last (and in fact only) change to the coefficient of <math>X^n</math>. 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 <math>R</math> and is denoted by <math>RX</math>. 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 <math>X</math> 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
:<math>\left(\sum_{i\in\N} a_i X^i\right) \times \left(\sum_{i\in\N} b_i X^i\right) = \sum_{i,j\in\N} a_i b_j X^{i+j},</math>
since only finitely many terms on the right affect any fixed <math>X^n</math>. 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
The above topology is the finest topology for which
:<math>\sum_{i=0}^\infty a_i X^i</math>
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 <math>R</math> 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 <math>\ZXY</math>, the topology of above construction only relates to the indeterminate <math>Y</math>, since the topology that was put on <math>\ZX</math> has been replaced by the discrete topology when defining the topology of the whole ring. So
:<math>\sum_{i = 0}^\infty XY^i</math>
converges (and its sum can be written as <math>\tfrac{X}{1-Y}</math>); however
:<math>\sum_{i = 0}^\infty X^i Y</math>
would be considered to be divergent, since every term affects the coefficient of <math>Y</math>. This asymmetry disappears if the power series ring in <math>Y</math> is given the product topology where each copy of <math>\ZX</math> is given its topology as a ring of formal power series rather than the discrete topology. With this topology, a sequence of elements of <math>\ZXY</math> converges if the coefficient of each power of <math>Y</math> converges to a formal power series in <math>X</math>, a weaker condition than stabilizing entirely. For instance, with this topology, in the second example given above, the coefficient of <math>Y</math>converges to <math>\tfrac{1}{1-X}</math>, so the whole summation converges to <math>\tfrac{Y}{1-X}</math>.
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 <math>\ZX,Y</math> and here a sequence converges if and only if the coefficient of every monomial <math>X^iY^j</math> stabilizes. This topology, which is also the <math>I</math>-adic topology, where <math>I=(X,Y)</math> is the ideal generated by <math>X</math> and <math>Y</math>, 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 <math>\RX</math> the limit
:<math>\lim_{n\to\infty}\left(1+\frac{X}{n}\right)^{\!n}</math>
does not exist, so in particular it does not converge to
:<math>\exp(X) = \sum_{n\in\N}\frac{X^n}{n!}.</math>
This is because for <math>i\geq 2</math> the coefficient <math>\tbinom{n}{i}/n^i</math> of <math>X^i</math> does not stabilize as <math>n\to \infty</math>. It does however converge in the usual topology of <math>\R</math>, and in fact to the coefficient <math>\tfrac{1}{i!}</math> of <math>\exp(X)</math>. Therefore, if one would give <math>\RX</math> the product topology of <math>\R^\N</math> where the topology of <math>\R</math> is the usual topology rather than the discrete one, then the above limit would converge to <math>\exp(X)</math>. 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
The ring <math>RX</math> may be characterized by the following universal property. If <math>S</math> is a commutative associative algebra over <math>R</math>, if <math>I</math> is an ideal of <math>S</math> such that the <math>I</math>-adic topology on <math>S</math> is complete, and if <math>x</math> is an element of <math>I</math>, then there is a unique <math>\Phi: RX\to S</math> with the following properties:
- <math>\Phi</math> is an <math>R</math>-algebra homomorphism
- <math>\Phi</math> is continuous
- <math>\Phi(X)=x</math>.
Operations on formal power series
One can perform algebraic operations on power series to generate new power series.
Power series raised to powers
For any natural number , the th power of a formal power series is defined recursively by
<math display="block">\begin{align}S^1&=S\\
S^n&=S\cdot S^{n-1}\quad\text{for } n>1.\end{align}</math>
If is invertible in the ring of coefficients, one can prove that in the expansion
<math display="block"> \Big( \sum_{k=0}^\infty a_k X^k \Big)^{n} = \sum_{m=0}^\infty c_m X^m,</math>
the coefficients are given by <math>c_0 = a_0^n</math> and
<math display="block">
c_m = \frac{1}{m a_0} \sum_{k=1}^m (kn - m+k) a_{k} c_{m-k}
</math>
for <math>m \geq 1</math> if is invertible in the ring of coefficients. Noting <math>\operatorname{ord}(f) =1 </math>, we can apply the rules of calculus above, crucially Rule (iv) substituting <math>X \rightsquigarrow f(X)</math>, to get:
:<math>
\begin{align}
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{align}
</math>
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 <math>\Complex((X))</math>-modules <math>X^{\alpha}\Complex((X)),</math> where α is a complex exponent. As a consequence, if f and g are as above, with <math>f_1=g_1=1</math>, we can relate the complex powers of f / X and g / X: precisely, if α and β are non-zero complex numbers with negative integer sum, <math>m=-\alpha-\beta\in\N,</math> then
:<math>\frac{1}{\alpha}[X^m]\left( \frac{f}{X} \right)^\alpha=-\frac{1}{\beta}[X^m]\left( \frac{g}{X} \right)^\beta.</math>
For instance, this way one finds the power series for complex powers of the Lambert function.
Power series in several variables
Formal power series in any number of indeterminates (even infinitely many) can be defined. If I is an index set and X<sub>I</sub> is the set of indeterminates X<sub>i</sub> for i∈I, then a monomial X<sup>α</sup> is any finite product of elements of X<sub>I</sub> (repetitions allowed); a formal power series in X<sub>I</sub> with coefficients in a ring R is determined by any mapping from the set of monomials X<sup>α</sup> to a corresponding coefficient c<sub>α</sub>, and is denoted <math display="inline">\sum_\alpha c_\alpha X^\alpha</math>. The set of all such formal power series is denoted <math>RX_I,</math> and it is given a ring structure by defining
:<math>\left(\sum_\alpha c_\alpha X^\alpha\right)+\left(\sum_\alpha d_\alpha X^\alpha \right)= \sum_\alpha (c_\alpha+d_\alpha) X^\alpha</math>
and
:<math>\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}</math>
Topology
The topology on <math>RX_I</math> is such that a sequence of its elements converges only if for each monomial X<sup>α</sup> the corresponding coefficient stabilizes. If I is finite, then this the J-adic topology, where J is the ideal of <math>RX_I</math> generated by all the indeterminates in X<sub>I</sub>. This does not hold if I is infinite. For example, if <math>I=\N,</math> then the sequence <math>(f_n)_{n\in \N}</math> with <math>f_n = X_n + X_{n+1} + X_{n+2} + \cdots </math> 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 <math>RXY</math> is usually chosen in such a way that it becomes isomorphic as a topological ring to <math>RX,Y.</math>
Operations
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
In the several variables case, the universal property characterizing <math>RX_1, \ldots, X_r</math> 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<sub>1</sub>, ..., x<sub>r</sub> are elements of I, then there is a unique map <math>\Phi: RX_1, \ldots, X_r \to S</math> with the following properties:
- Φ is an R-algebra homomorphism
- Φ is continuous
- Φ(X<sub>i</sub>) = x<sub>i</sub> for i = 1, ..., r.
Non-commuting variables
The several variable case can be further generalised by taking non-commuting variables X<sub>i</sub> for i ∈ I, where I is an index set and then a monomial X<sup>α</sup> is any word in the X<sub>I</sub>; a formal power series in X<sub>I</sub> with coefficients in a ring R is determined by any mapping from the set of monomials X<sup>α</sup> to a corresponding coefficient c<sub>α</sub>, and is denoted <math>\textstyle\sum_\alpha c_\alpha X^\alpha </math>. The set of all such formal power series is denoted <math>R\langle\!\langle X_I\rangle\!\rangle</math>, and it is given a ring structure by defining addition pointwise
:<math>\left(\sum_\alpha c_\alpha X^\alpha\right)+\left(\sum_\alpha d_\alpha X^\alpha\right)=\sum_\alpha(c_\alpha+d_\alpha)X^\alpha</math>
and multiplication by
:<math>\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}</math>
where · denotes concatenation of words. These formal power series over R form the Magnus ring over R.
On a semiring
Given an alphabet <math>\Sigma</math> and a semiring <math>S</math>. The formal power series over <math>S</math> supported on the language <math>\Sigma^*</math> is denoted by <math>S\langle\langle \Sigma^*\rangle\rangle</math>. It consists of all mappings <math>r:\Sigma^*\to S</math>, where <math>\Sigma^*</math> is the free monoid generated by the non-empty set <math>\Sigma</math>.
The elements of <math>S\langle\langle \Sigma^*\rangle\rangle</math> can be written as formal sums
:<math>r = \sum_{w \in \Sigma^*} (r,w)w.</math>
where <math>(r,w)</math> denotes the value of <math>r</math> at the word <math>w\in\Sigma^*</math>. The elements <math>(r,w)\in S</math> are called the coefficients of <math>r</math>.
For <math>r\in S\langle\langle \Sigma^*\rangle\rangle</math> the support of <math>r</math> is the set
:<math>\operatorname{supp}(r)=\{w\in\Sigma^*|\ (r,w)\neq 0\}</math>
A series where every coefficient is either <math>0</math> or <math>1</math> is called the characteristic series of its support.
The subset of <math>S\langle\langle \Sigma^*\rangle\rangle</math> consisting of all series with a finite support is denoted by <math>S\langle \Sigma^*\rangle</math> and called polynomials.
For <math>r_1, r_2\in S\langle\langle \Sigma^*\rangle\rangle</math> and <math>s\in S</math>, the sum <math>r_1+r_2</math> is defined by
:<math>(r_1+r_2,w)=(r_1,w)+(r_2,w)</math>
The (Cauchy) product <math>r_1\cdot r_2</math> is defined by
:<math>(r_1\cdot r_2,w) = \sum_{w_1w_2=w}(r_1,w_1)(r_2,w_2)</math>
The Hadamard product <math>r_1\odot r_2</math> is defined by
:<math>(r_1\odot r_2,w)=(r_1,w)(r_2,w)</math>
And the products by a scalar <math>sr_1</math> and <math>r_1s</math> by
:<math>(sr_1,w)=s(r_1,w)</math> and <math>(r_1s,w)=(r_1,w)s</math>, respectively.
With these operations <math>(S\langle\langle \Sigma^*\rangle\rangle,+,\cdot,0,\varepsilon)</math> and <math>(S\langle \Sigma^*\rangle, +,\cdot,0,\varepsilon)</math> are semirings, where <math>\varepsilon</math> is the empty word in <math>\Sigma^*</math>.
These formal power series are used to model the behavior of weighted automata, in theoretical computer science, when the coefficients <math>(r,w)</math> of the series are taken to be the weight of a path with label <math>w</math> in the automata.<!-- the correct symbols for the double angled braces are ⟪ and ⟫; but they work poorly in many browsers. Wikipedia's TeX doesn't support \llangle and \rrangle. Also no support for Greek italics in wiki TeX it seems -->
Replacing the index set by an ordered abelian group
Suppose <math>G</math> is an ordered abelian group, meaning an abelian group with a total ordering <math><</math> respecting the group's addition, so that <math>a<b</math> if and only if <math>a+c<b+c</math> for all <math>c</math>. Let I be a well-ordered subset of <math>G</math>, meaning I contains no infinite descending chain. Consider the set consisting of
:<math>\sum_{i \in I} a_i X^i </math>
for all such I, with <math>a_i</math> in a commutative ring <math>R</math>, where we assume that for any index set, if all of the <math>a_i</math> are zero then the sum is zero. Then <math>R((G))</math> is the ring of formal power series on <math>G</math>; 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 <math>R^G</math> is used to denote <math>R((G))</math>.
Various properties of <math>R</math> transfer to <math>R((G))</math>. If <math>R</math> is a field, then so is <math>R((G))</math>. If <math>R</math> is an ordered field, we can order <math>R((G))</math> 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 <math>G</math> is a divisible group and <math>R</math> is a real closed field, then <math>R((G))</math> is a real closed field, and if <math>R</math> is algebraically closed, then so is <math>R((G))</math>.
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
- 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
- Ring of restricted power series
- International Conference on Formal Power Series and Algebraic Combinatorics
- Umbral calculus
- Jabotinsky matrix
- Power series solution of differential equations
Notes
References
- Nicolas Bourbaki: Algebra, IV, §4. Springer-Verlag 1988.
Further reading
- 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,
- Droste, M., & Kuich, W. (2009). Semirings and Formal Power Series. Handbook of Weighted Automata, 3–28.
