In mathematics, a power series (in one variable) is an infinite series of the form
[math]\displaystyle{ \sum_{n=0}^\infty a_n \left(x - c\right)^n = a_0 + a_1 (x - c) + a_2 (x - c)^2 + \dots }[/math]
where an represents the coefficient of the nth term and c is a constant. Power series are useful in mathematical analysis, where they arise as Taylor series of infinitely differentiable functions. In fact, Borel's theorem implies that every power series is the Taylor series of some smooth function.
In many situations, c (the center of the series) is equal to zero, for instance when considering a Maclaurin series. In such cases, the power series takes the simpler form [math]\displaystyle{ \sum_{n=0}^\infty a_n x^n = a_0 + a_1 x + a_2 x^2 + \dots. }[/math]
Beyond their role in mathematical analysis, power series also occur in combinatorics as generating functions (a kind of formal power series) and in electronic engineering (under the name of the Z-transform). The familiar decimal notation for real numbers can also be viewed as an example of a power series, with integer coefficients, but with the argument x fixed at 1⁄10. In number theory, the concept of p-adic numbers is also closely related to that of a power series.
Any polynomial can be easily expressed as a power series around any center c, although all but finitely many of the coefficients will be zero since a power series has infinitely many terms by definition. For instance, the polynomial [math]\displaystyle{ f(x) = x^2 + 2x + 3 }[/math] can be written as a power series around the center [math]\displaystyle{ c = 0 }[/math] as [math]\displaystyle{ f(x) = 3 + 2 x + 1 x^2 + 0 x^3 + 0 x^4 + \cdots }[/math] or around the center [math]\displaystyle{ c = 1 }[/math] as [math]\displaystyle{ f(x) = 6 + 4(x - 1) + 1(x - 1)^2 + 0(x - 1)^3 + 0(x - 1)^4 + \cdots }[/math]
This is because of the Taylor series expansion of f(x) around [math]\displaystyle{ x = 1 }[/math] is
[math]\displaystyle{ f(x) = f(1)+\frac {f'(1)}{1!} (x-1)+ \frac{f''(1)}{2!} (x-1)^2+\frac{f'''(1)}{3!}(x-1)^3+ \cdots, }[/math]
as [math]\displaystyle{ f(x=1) = 1 + 2 +3 = 6 }[/math] and the non-zero derivatives are [math]\displaystyle{ f'(x) = 2x + 2 }[/math], so [math]\displaystyle{ f'(1) = 4 }[/math] and [math]\displaystyle{ f''(x) = 2 }[/math], a constant.
Or indeed the expansion is possible around any other center c.[1] One can view power series as being like "polynomials of infinite degree," although power series are not polynomials.
The geometric series formula [math]\displaystyle{ \frac{1}{1 - x} = \sum_{n=0}^\infty x^n = 1 + x + x^2 + x^3 + \cdots, }[/math] which is valid for [math]\displaystyle{ |x| \lt 1 }[/math], is one of the most important examples of a power series, as are the exponential function formula [math]\displaystyle{ e^x = \sum_{n=0}^\infty \frac{x^n}{n!} = 1 + x + \frac{x^2}{2!} + \frac{x^3}{3!} + \cdots, }[/math] and the sine formula [math]\displaystyle{ \sin(x) = \sum_{n=0}^\infty \frac{(-1)^n x^{2n+1}}{(2n + 1)!} = x - \frac{x^3}{3!} + \frac{x^5}{5!} - \frac{x^7}{7!} + \cdots, }[/math]
valid for all real x.
These power series are also examples of Taylor series.
Negative powers are not permitted in a power series; for instance, [math]\displaystyle{ 1 + x^{-1} + x^{-2} + \cdots }[/math] is not considered a power series (although it is a Laurent series). Similarly, fractional powers such as [math]\displaystyle{ x^\frac{1}{2} }[/math] are not permitted (but see Puiseux series). The coefficients [math]\displaystyle{ a_n }[/math] are not allowed to depend on [math]\displaystyle{ x }[/math], thus for instance: [math]\displaystyle{ \sin(x) x + \sin(2x) x^2 + \sin(3x) x^3 + \cdots }[/math] is not a power series.
A power series [math]\displaystyle{ \sum_{n=0}^\infty a_n(x-c)^n }[/math] is convergent for some values of the variable x, which will always include x = c (as usual, [math]\displaystyle{ (x-c)^0 }[/math] evaluates as 1 and the sum of the series is thus [math]\displaystyle{ a_0 }[/math] for x = c). The series may diverge for other values of x. If c is not the only point of convergence, then there is always a number r with 0 < r ≤ ∞ such that the series converges whenever |x – c| < r and diverges whenever |x – c| > r. The number r is called the radius of convergence of the power series; in general it is given as [math]\displaystyle{ r = \liminf_{n\to\infty} \left|a_n\right|^{-\frac{1}{n}} }[/math] or, equivalently, [math]\displaystyle{ r^{-1} = \limsup_{n\to\infty} \left|a_n\right|^\frac{1}{n} }[/math] (this is the Cauchy–Hadamard theorem; see limit superior and limit inferior for an explanation of the notation). The relation [math]\displaystyle{ r^{-1} = \lim_{n\to\infty}\left|{a_{n+1}\over a_n}\right| }[/math] is also satisfied, if this limit exists.
The set of the complex numbers such that |x – c| < r is called the disc of convergence of the series. The series converges absolutely inside its disc of convergence, and converges uniformly on every compact subset of the disc of convergence.
For |x – c| = r, there is no general statement on the convergence of the series. However, Abel's theorem states that if the series is convergent for some value z such that |z – c| = r, then the sum of the series for x = z is the limit of the sum of the series for x = c + t (z – c) where t is a real variable less than 1 that tends to 1.
When two functions f and g are decomposed into power series around the same center c, the power series of the sum or difference of the functions can be obtained by termwise addition and subtraction. That is, if [math]\displaystyle{ f(x) = \sum_{n=0}^\infty a_n (x - c)^n }[/math] and [math]\displaystyle{ g(x) = \sum_{n=0}^\infty b_n (x - c)^n }[/math] then [math]\displaystyle{ f(x) \pm g(x) = \sum_{n=0}^\infty (a_n \pm b_n) (x - c)^n. }[/math]
It is not true that if two power series [math]\displaystyle{ \sum_{n=0}^\infty a_n x^n }[/math] and [math]\displaystyle{ \sum_{n=0}^\infty b_n x^n }[/math] have the same radius of convergence, then [math]\displaystyle{ \sum_{n=0}^\infty \left(a_n + b_n\right) x^n }[/math] also has this radius of convergence. If [math]\displaystyle{ a_n = (-1)^n }[/math] and [math]\displaystyle{ b_n = (-1)^{n+1} \left(1 - \frac{1}{3^n}\right) }[/math], then both series have the same radius of convergence of 1, but the series [math]\displaystyle{ \sum_{n=0}^\infty \left(a_n + b_n\right) x^n = \sum_{n=0}^\infty \frac{(-1)^n}{3^n} x^n }[/math] has a radius of convergence of 3.
The sum of two power series will have, at minimum, a radius of convergence of the smaller of the two radii of convergence of the two series (and it may be higher than either, as seen in the example above).[2]
With the same definitions for [math]\displaystyle{ f(x) }[/math] and [math]\displaystyle{ g(x) }[/math], the power series of the product and quotient of the functions can be obtained as follows: [math]\displaystyle{ \begin{align} f(x)g(x) &= \left(\sum_{n=0}^\infty a_n (x-c)^n\right)\left(\sum_{n=0}^\infty b_n (x - c)^n\right) \\ &= \sum_{i=0}^\infty \sum_{j=0}^\infty a_i b_j (x - c)^{i+j} \\ &= \sum_{n=0}^\infty \left(\sum_{i=0}^n a_i b_{n-i}\right) (x - c)^n. \end{align} }[/math]
The sequence [math]\displaystyle{ m_n = \sum_{i=0}^n a_i b_{n-i} }[/math] is known as the convolution of the sequences [math]\displaystyle{ a_n }[/math] and [math]\displaystyle{ b_n }[/math].
For division, if one defines the sequence [math]\displaystyle{ d_n }[/math] by [math]\displaystyle{ \frac{f(x)}{g(x)} = \frac{\sum_{n=0}^\infty a_n (x - c)^n}{\sum_{n=0}^\infty b_n (x - c)^n} = \sum_{n=0}^\infty d_n (x - c)^n }[/math] then [math]\displaystyle{ f(x) = \left(\sum_{n=0}^\infty b_n (x - c)^n\right)\left(\sum_{n=0}^\infty d_n (x - c)^n\right) }[/math] and one can solve recursively for the terms [math]\displaystyle{ d_n }[/math] by comparing coefficients.
Solving the corresponding equations yields the formulae based on determinants of certain matrices of the coefficients of [math]\displaystyle{ f(x) }[/math] and [math]\displaystyle{ g(x) }[/math] [math]\displaystyle{ d_0=\frac{a_0}{b_0} }[/math] [math]\displaystyle{ d_n=\frac{1}{b_0^{n+1}} \begin{vmatrix} a_n &b_1 &b_2 &\cdots&b_n \\ a_{n-1}&b_0 &b_1 &\cdots&b_{n-1}\\ a_{n-2}&0 &b_0 &\cdots&b_{n-2}\\ \vdots &\vdots&\vdots&\ddots&\vdots \\ a_0 &0 &0 &\cdots&b_0\end{vmatrix} }[/math]
Once a function [math]\displaystyle{ f(x) }[/math] is given as a power series as above, it is differentiable on the interior of the domain of convergence. It can be differentiated and integrated quite easily, by treating every term separately: [math]\displaystyle{ \begin{align} f'(x) &= \sum_{n=1}^\infty a_n n (x - c)^{n-1} = \sum_{n=0}^\infty a_{n+1} (n + 1) (x - c)^n, \\ \int f(x)\,dx &= \sum_{n=0}^\infty \frac{a_n (x - c)^{n+1}}{n + 1} + k = \sum_{n=1}^\infty \frac{a_{n-1} (x - c)^n}{n} + k. \end{align} }[/math]
Both of these series have the same radius of convergence as the original one.
A function f defined on some open subset U of R or C is called analytic if it is locally given by a convergent power series. This means that every a ∈ U has an open neighborhood V ⊆ U, such that there exists a power series with center a that converges to f(x) for every x ∈ V.
Every power series with a positive radius of convergence is analytic on the interior of its region of convergence. All holomorphic functions are complex-analytic. Sums and products of analytic functions are analytic, as are quotients as long as the denominator is non-zero.
If a function is analytic, then it is infinitely differentiable, but in the real case the converse is not generally true. For an analytic function, the coefficients an can be computed as [math]\displaystyle{ a_n = \frac{f^{\left( n \right)} \left( c \right)}{n!} }[/math]
where [math]\displaystyle{ f^{(n)}(c) }[/math] denotes the nth derivative of f at c, and [math]\displaystyle{ f^{(0)}(c) = f(c) }[/math]. This means that every analytic function is locally represented by its Taylor series.
The global form of an analytic function is completely determined by its local behavior in the following sense: if f and g are two analytic functions defined on the same connected open set U, and if there exists an element c ∈ U such that f(n)(c) = g(n)(c) for all n ≥ 0, then f(x) = g(x) for all x ∈ U.
If a power series with radius of convergence r is given, one can consider analytic continuations of the series, i.e. analytic functions f which are defined on larger sets than { x | |x − c| < r} and agree with the given power series on this set. The number r is maximal in the following sense: there always exists a complex number x with |x − c| = r such that no analytic continuation of the series can be defined at x.
The power series expansion of the inverse function of an analytic function can be determined using the Lagrange inversion theorem.
The sum of a power series with a positive radius of convergence is an analytic function at every point in the interior of the disc of convergence. However, different behavior can occur at points on the boundary of that disc. For example:
In abstract algebra, one attempts to capture the essence of power series without being restricted to the fields of real and complex numbers, and without the need to talk about convergence. This leads to the concept of formal power series, a concept of great utility in algebraic combinatorics.
An extension of the theory is necessary for the purposes of multivariable calculus. A power series is here defined to be an infinite series of the form [math]\displaystyle{ f(x_1, \dots, x_n) = \sum_{j_1, \dots, j_n = 0}^\infty a_{j_1, \dots, j_n} \prod_{k=1}^n (x_k - c_k)^{j_k}, }[/math] where j = (j1, …, jn) is a vector of natural numbers, the coefficients a(j1, …, jn) are usually real or complex numbers, and the center c = (c1, …, cn) and argument x = (x1, …, xn) are usually real or complex vectors. The symbol [math]\displaystyle{ \Pi }[/math] is the product symbol, denoting multiplication. In the more convenient multi-index notation this can be written [math]\displaystyle{ f(x) = \sum_{\alpha \in \N^n} a_\alpha (x - c)^\alpha. }[/math] where [math]\displaystyle{ \N }[/math] is the set of natural numbers, and so [math]\displaystyle{ \N^n }[/math] is the set of ordered n-tuples of natural numbers.
The theory of such series is trickier than for single-variable series, with more complicated regions of convergence. For instance, the power series [math]\displaystyle{ \sum_{n=0}^\infty x_1^n x_2^n }[/math] is absolutely convergent in the set [math]\displaystyle{ \{ (x_1, x_2): |x_1 x_2| \lt 1\} }[/math] between two hyperbolas. (This is an example of a log-convex set, in the sense that the set of points [math]\displaystyle{ (\log |x_1|, \log |x_2|) }[/math], where [math]\displaystyle{ (x_1, x_2) }[/math] lies in the above region, is a convex set. More generally, one can show that when c=0, the interior of the region of absolute convergence is always a log-convex set in this sense.) On the other hand, in the interior of this region of convergence one may differentiate and integrate under the series sign, just as one may with ordinary power series.[4]
Let α be a multi-index for a power series f(x1, x2, …, xn). The order of the power series f is defined to be the least value [math]\displaystyle{ r }[/math] such that there is aα ≠ 0 with [math]\displaystyle{ r = |\alpha| = \alpha_1 + \alpha_2 + \cdots + \alpha_n }[/math], or [math]\displaystyle{ \infty }[/math] if f ≡ 0. In particular, for a power series f(x) in a single variable x, the order of f is the smallest power of x with a nonzero coefficient. This definition readily extends to Laurent series.
Original source: https://en.wikipedia.org/wiki/Power series.
Read more |