partial sum

In mathematics, a series is, roughly speaking, an addition of infinitely many terms, one after the other. The study of series is a major part of calculus and its generalization, mathematical analysis. Series are used in most areas of mathematics, even for studying finite structures in combinatorics through generating functions. The mathematical properties of infinite series make them widely applicable in other quantitative disciplines such as physics, computer science, statistics and finance.

Among the Ancient Greeks, the idea that a potentially infinite summation could produce a finite result was considered paradoxical, most famously in Zeno's paradoxes. Nonetheless, infinite series were applied practically by Ancient Greek mathematicians including Archimedes, for instance in the quadrature of the parabola. The mathematical side of Zeno's paradoxes was resolved using the concept of a limit during the 17th century, especially through the early calculus of Isaac Newton. The resolution was made more rigorous and further improved in the 19th century through the work of Carl Friedrich Gauss and Augustin-Louis Cauchy, among others, answering questions about which of these sums exist via the completeness of the real numbers and whether series terms can be rearranged or not without changing their sums using absolute convergence and conditional convergence of series.

In modern terminology, any ordered infinite sequence $(a_1,a_2,a_3,\ldots)$ of terms, whether those terms are numbers, functions, matrices, or anything else that can be added, defines a series, which is the addition of the one after the other. To emphasize that there are an infinite number of terms, series are often also called infinite series to contrast with finite series, a term sometimes used for finite sums. Series are represented by an expression like
$a_1+a_2+a_3+\cdots,$
or, using capital-sigma summation notation,
$\sum_^\infty a_i.$

The infinite sequence of additions expressed by a series cannot be explicitly performed in sequence in a finite amount of time. However, if the terms and their finite sums belong to a set that has limits, it may be possible to assign a value to a series, called the sum of the series. This value is the limit as tends to infinity of the finite sums of the first terms of the series if the limit exists. These finite sums are called the partial sums of the series. Using summation notation,
$\sum_^\infty a_i = \lim_\, \sum_^n a_i,$
if it exists. When the limit exists, the series is convergent or summable and also the sequence $(a_1,a_2,a_3,\ldots)$ is summable, and otherwise, when the limit does not exist, the series is divergent.

The expression $\sum_^\infty a_i$ denotes both the series—the implicit process of adding the terms one after the other indefinitely—and, if the series is convergent, the sum of the series—the explicit limit of the process. This is a generalization of the similar convention of denoting by $a+b$ both the addition—the process of adding—and its result—the ''sum'' of and .

Commonly, the terms of a series come from a ring, often the field $\mathbb R$ of the real numbers or the field $\mathbb C$ of the complex numbers. If so, the set of all series is also itself a ring, one in which the addition consists of adding series terms together term by term and the multiplication is the Cauchy product.

Definition

Series

A ''series'' or, redundantly, an ''infinite series'', is an infinite sum. It is often represented as
$a_0 + a_1 + a_2 + \cdots \quad \text \quad a_1 + a_2 + a_3 + \cdots,$
where the terms $a_k$ are the members of a sequence of numbers, functions, or anything else that can be added. A series may also be represented with capital-sigma notation:
$\sum_^ a_k \qquad \text \qquad \sum_^ a_k .$

It is also common to express series using a few first terms, an ellipsis, a general term, and then a final ellipsis, the general term being an expression of the th term as a function of :
$a_0 + a_1 + a_2 + \cdots + a_n +\cdots \quad \text \quad f(0) + f(1) + f(2) + \cdots + f(n) + \cdots.$
For example, Euler's number can be defined with the series
$\sum_^\infty \frac 1=1+1+\frac12 +\frac 16 +\cdots + \frac 1+\cdots,$
where $n!$ denotes the product of the $n$ first positive integers, and $0!$ is conventionally equal to $1.$

Partial sum of a series

Given a series $s=\sum_^\infty a_k$, its th ''partial sum'' is
$s_n = \sum_^ a_k = a_0 + a_1 + \cdots + a_n .$

Some authors directly identify a series with its sequence of partial sums. Either the sequence of partial sums or the sequence of terms completely characterizes the series, and the sequence of terms can be recovered from the sequence of partial sums by taking the differences between consecutive elements,
$a_n = s_ - s_.$

Partial summation of a sequence is an example of a linear sequence transformation, and it is also known as the prefix sum in computer science. The inverse transformation for recovering a sequence from its partial sums is the finite difference, another linear sequence transformation.

Partial sums of series sometimes have simpler closed form expressions, for instance an arithmetic series has partial sums
$s_n = \sum_^ \left(a + kd\right) = a + (a + d) + (a + 2d) + \cdots + (a + nd) = (n+1)\bigl(a + \tfrac12 n d\bigr),$
and a geometric series has partial sums
$s_n = \sum_^ ar^k = a + ar + ar^2 + \cdots + ar^n = a\frac$
if or simply if .

Sum of a series

Strictly speaking, a series is said to ''converge'', to be ''convergent'', or to be ''summable'' when the sequence of its partial sums has a limit. When the limit of the sequence of partial sums does not exist, the series ''diverges'' or is ''divergent''. When the limit of the partial sums exists, it is called the ''sum of the series'' or ''value of the series'':
$\sum_^\infty a_k = \lim_ \sum_^n a_k = \lim_ s_n.$
A series with only a finite number of nonzero terms is always convergent. Such series are useful for considering finite sums without taking care of the numbers of terms. When the sum exists, the difference between the sum of a series and its $n$th partial sum, $s - s_n = \sum_^\infty a_k,$ is known as the $n$th '' truncation error'' of the infinite series.

An example of a convergent series is the geometric series
$1 + \frac+ \frac+ \frac + \cdots + \frac + \cdots.$

It can be shown by algebraic computation that each partial sum $s_n$ is
$\sum_^n \frac 1 = 2-\frac 1.$ As one has
$\lim_ \left(2-\frac 1\right) =2,$
the series is convergent and converges to with truncation errors $1 / 2^n$.

By contrast, the geometric series
$\sum_^\infty 2^k$
is divergent in the real numbers. However, it is convergent in the extended real number line, with $+\infty$ as its limit and $+\infty$ as its truncation error at every step.

When a series's sequence of partial sums is not easily calculated and evaluated for convergence directly, convergence tests can be used to prove that the series converges or diverges.

Grouping and rearranging terms

Grouping

In ordinary finite summations, terms of the summation can be grouped and ungrouped freely without changing the result of the summation as a consequence of the associativity of addition. $a_0 + a_1 + a_2 =$$a_0 + (a_1 + a_2) =$$(a_0 + a_1) + a_2.$ Similarly, in a series, any finite groupings of terms of the series will not change the limit of the partial sums of the series and thus will not change the sum of the series. However, if an infinite number of groupings is performed in an infinite series, then the partial sums of the grouped series may have a different limit than the original series and different groupings may have different limits from one another; the sum of $a_0 + a_1 + a_2 + \cdots$ may not equal the sum of $a_0 + (a_1 + a_2) +$$(a_3 + a_4) + \cdots.$

For example, Grandi's series has a sequence of partial sums that alternates back and forth between and and does not converge. Grouping its elements in pairs creates the series $(1 - 1) + (1 - 1) + (1 - 1) + \cdots =$$0 + 0 + 0 + \cdots,$ which has partial sums equal to zero at every term and thus sums to zero. Grouping its elements in pairs starting after the first creates the series $1 + (- 1 + 1) +$$(- 1 + 1) + \cdots =$$1 + 0 + 0 + \cdots,$ which has partial sums equal to one for every term and thus sums to one, a different result.

In general, grouping the terms of a series creates a new series with a sequence of partial sums that is a subsequence of the partial sums of the original series. This means that if the original series converges, so does the new series after grouping: all infinite subsequences of a convergent sequence also converge to the same limit. However, if the original series diverges, then the grouped series do not necessarily diverge, as in this example of Grandi's series above. However, divergence of a grouped series does imply the original series must be divergent, since it proves there is a subsequence of the partial sums of the original series which is not convergent, which would be impossible if it were convergent. This reasoning was applied in Oresme's proof of the divergence of the harmonic series, and it is the basis for the general Cauchy condensation test.

Rearrangement

In ordinary finite summations, terms of the summation can be rearranged freely without changing the result of the summation as a consequence of the commutativity of addition. $a_0 + a_1 + a_2 =$$a_0 + a_2 + a_1 =$$a_2 + a_1 + a_0.$ Similarly, in a series, any finite rearrangements of terms of a series does not change the limit of the partial sums of the series and thus does not change the sum of the series: for any finite rearrangement, there will be some term after which the rearrangement did not affect any further terms: any effects of rearrangement can be isolated to the finite summation up to that term, and finite summations do not change under rearrangement.

However, as for grouping, an infinitary rearrangement of terms of a series can sometimes lead to a change in the limit of the partial sums of the series. Series with sequences of partial sums that converge to a value but whose terms could be rearranged to a form a series with partial sums that converge to some other value are called conditionally convergent series. Those that converge to the same value regardless of rearrangement are called unconditionally convergent series.

For series of real numbers and complex numbers, a series $a_0 + a_1 + a_2 + \cdots$ is unconditionally convergent if and only if the series summing the absolute values of its terms, $, a_0, + , a_1, + , a_2, + \cdots,$ is also convergent, a property called absolute convergence. Otherwise, any series of real numbers or complex numbers that converges but does not converge absolutely is conditionally convergent. Any conditionally convergent sum of real numbers can be rearranged to yield any other real number as a limit, or to diverge. These claims are the content of the Riemann series theorem.

A historically important example of conditional convergence is the alternating harmonic series,

$\sum\limits_^\infty = 1 - + - + - \cdots,$
which has a sum of the natural logarithm of 2, while the sum of the absolute values of the terms is the harmonic series,
$\sum\limits_^\infty = 1 + + + + + \cdots,$
which diverges per the divergence of the harmonic series, so the alternating harmonic series is conditionally convergent. For instance, rearranging the terms of the alternating harmonic series so that each positive term of the original series is followed by two negative terms of the original series rather than just one yields
\begin
&1 - \frac12 - \frac14 + \frac13 - \frac16 - \frac18
+ \frac15 - \frac1 - \frac1 + \cdots \\ mu&\quad = \left(1 - \frac12\right) - \frac14
+ \left(\frac13 - \frac16\right) - \frac18
+ \left(\frac15 - \frac1\right) - \frac1 + \cdots \\ mu&\quad = \frac12 - \frac14 + \frac16 - \frac18
+ \frac1 - \frac1 + \cdots \\ mu&\quad = \frac12 \left(1 - \frac12 + \frac13 - \frac14
+ \frac15 - \frac16 + \cdots \right) ,
\end
which is $\tfrac12$ times the original series, so it would have a sum of half of the natural logarithm of 2. By the Riemann series theorem, rearrangements of the alternating harmonic series to yield any other real number are also possible.

Operations

Series addition

The addition of two series $a_0 + a_1 + a_2 + \cdots$ and $b_0 + b_1 + b_2 + \cdots$ is given by the termwise sum $(a_0 + b_0) + (a_1 + b_1) + (a_2 + b_2) + \cdots \,$, or, in summation notation,
$\sum_^ a_k + \sum_^ b_k = \sum_^ a_k + b_k.$

Using the symbols $s_$ and $s_$ for the partial sums of the added series and $s_$ for the partial sums of the resulting series, this definition implies the partial sums of the resulting series follow $s_ = s_ + s_.$ Then the sum of the resulting series, i.e., the limit of the sequence of partial sums of the resulting series, satisfies
$\lim_ s_ = \lim_ (s_ + s_) = \lim_ s_ + \lim_ s_,$
when the limits exist. Therefore, first, the series resulting from addition is summable if the series added were summable, and, second, the sum of the resulting series is the addition of the sums of the added series. The addition of two divergent series may yield a convergent series: for instance, the addition of a divergent series with a series of its terms times $-1$ will yield a series of all zeros that converges to zero. However, for any two series where one converges and the other diverges, the result of their addition diverges.

For series of real numbers or complex numbers, series addition is associative, commutative, and invertible. Therefore series addition gives the sets of convergent series of real numbers or complex numbers the structure of an abelian group and also gives the sets of all series of real numbers or complex numbers (regardless of convergence properties) the structure of an abelian group.

Scalar multiplication

The product of a series $a_0 + a_1 + a_2 + \cdots$ with a constant number $c$, called a scalar in this context, is given by the termwise product $ca_0 + ca_1 + ca_2 + \cdots$, or, in summation notation,

$c\sum_^ a_k = \sum_^ ca_k.$

Using the symbols $s_$ for the partial sums of the original series and $s_$ for the partial sums of the series after multiplication by $c$, this definition implies that $s_ = c s_$ for all $n,$ and therefore also $\lim_ s_ = c \lim_ s_,$when the limits exist. Therefore if a series is summable, any nonzero scalar multiple of the series is also summable and vice versa: if a series is divergent, then any nonzero scalar multiple of it is also divergent.

Scalar multiplication of real numbers and complex numbers is associative, commutative, invertible, and it distributes over series addition.

In summary, series addition and scalar multiplication gives the set of convergent series and the set of series of real numbers the structure of a real vector space. Similarly, one gets complex vector spaces for series and convergent series of complex numbers. All these vector spaces are infinite dimensional.

Series multiplication

The multiplication of two series $a_0 + a_1 + a_2 + \cdots$ and $b_0 + b_1 + b_2 + \cdots$ to generate a third series $c_0 + c_1 + c_2 + \cdots$, called the Cauchy product, can be written in summation notation
$\biggl( \sum_^ a_k \biggr) \cdot \biggl( \sum_^ b_k \biggr) = \sum_^ c_k = \sum_^ \sum_^ a_ b_,$
with each $c_k = \sum_^ a_ b_ = \!$$\!a_0 b_k + a_1 b_ + \cdots + a_ b_1 + a_k b_0.$ Here, the convergence of the partial sums of the series $c_0 + c_1 + c_2 + \cdots$ is not as simple to establish as for addition. However, if both series $a_0 + a_1 + a_2 + \cdots$ and $b_0 + b_1 + b_2 + \cdots$ are absolutely convergent series, then the series resulting from multiplying them also converges absolutely with a sum equal to the product of the two sums of the multiplied series,
$\lim_ s_ = \left(\, \lim_ s_ \right) \cdot \left(\, \lim_ s_ \right).$

Series multiplication of absolutely convergent series of real numbers and complex numbers is associative, commutative, and distributes over series addition. Together with series addition, series multiplication gives the sets of absolutely convergent series of real numbers or complex numbers the structure of a commutative ring, and together with scalar multiplication as well, the structure of a commutative algebra; these operations also give the sets of all series of real numbers or complex numbers the structure of an associative algebra.

Examples of numerical series

* A ''geometric series'' is one where each successive term is produced by multiplying the previous term by a constant number (called the common ratio in this context). For example: $1 + + + + + \cdots=\sum_^\infty = 2.$ In general, a geometric series with initial term $a$ and common ratio $r$, $\sum_^\infty a r^n,$ converges if and only if $, r, < 1$, in which case it converges to $$.
* The '' harmonic series'' is the series $1 + + + + + \cdots = \sum_^\infty .$ The harmonic series is divergent.
* An ''alternating series'' is a series where terms alternate signs. Examples: $1 - + - + - \cdots = \sum_^\infty = \ln(2),$ the alternating harmonic series, and $-1+\frac - \frac + \frac - \frac + \cdots = \sum_^\infty \frac = -\frac,$ the Leibniz formula for $\pi.$
* A telescoping series $\sum_^\infty \left(b_n-b_\right)$ converges if the sequence converges to a limit as goes to infinity. The value of the series is then .
* An '' arithmetico-geometric series'' is a series that has terms which are each the product of an element of an arithmetic progression with the corresponding element of a geometric progression. Example: $3 + + + + + \cdots=\sum_^\infty.$
* The Dirichlet series $\sum_^\infty\frac$ converges for and diverges for , which can be shown with the integral test for convergence described below in convergence tests. As a function of , the sum of this series is Riemann's zeta function.
* Hypergeometric series:
_pF_q \left \begina_1, a_2, \dotsc, a_p \\ b_1, b_2, \dotsc, b_q \end; z \right:= \sum_^ \frac \frac
and their generalizations (such as basic hypergeometric series and elliptic hypergeometric series) frequently appear in integrable systems and mathematical physics.
* There are some elementary series whose convergence is not yet known/proven. For example, it is unknown whether the Flint Hills series, $\sum_^\infty \frac,$ converges or not. The convergence depends on how well $\pi$ can be approximated with rational numbers (which is unknown as of yet). More specifically, the values of with large numerical contributions to the sum are the numerators of the continued fraction convergents of $\pi$, a sequence beginning with 1, 3, 22, 333, 355, 103993, ... . These are integers that are close to $m\pi$ for some integer , so that $\sin n$ is close to $\sin m\pi = 0$ and its reciprocal is large.

Pi

$\sum_^ \frac = \frac + \frac + \frac + \frac + \cdots = \frac$

$\sum_^\infty \frac = \frac - \frac + \frac - \frac + \frac - \frac + \frac - \cdots = \pi$

Natural logarithm of 2

$\sum_^\infty \frac = \ln 2$

$\sum_^\infty \frac = \ln 2$

Natural logarithm base

$\sum_^\infty \frac = 1-\frac+\frac-\frac+\cdots = \frac$

$\sum_^\infty \frac = \frac + \frac + \frac + \frac + \frac + \cdots = e$

Convergence testing

One of the simplest tests for convergence of a series, applicable to all series, is the ''vanishing condition'' or '' th-term test'': If $\lim_ a_n \neq 0$, then the series diverges; if $\lim_ a_n = 0$, then the test is inconclusive.

Absolute convergence tests

When every term of a series is a non-negative real number, for instance when the terms are the absolute values of another series of real numbers or complex numbers, the sequence of partial sums is non-decreasing. Therefore a series with non-negative terms converges if and only if the sequence of partial sums is bounded, and so finding a bound for a series or for the absolute values of its terms is an effective way to prove convergence or absolute convergence of a series.

For example, the series $1 + \frac14 + \frac19 + \cdots + \frac1 + \cdots\,$is convergent and absolutely convergent because $\frac1 \le \frac1 - \frac1n$ for all $n \geq 2$ and a telescoping sum argument implies that the partial sums of the series of those non-negative bounding terms are themselves bounded above by 2. The exact value of this series is $\frac16\pi^2$; see Basel problem.

This type of bounding strategy is the basis for general series comparison tests. First is the general '' direct comparison test'': For any series $\sum a_n$, If $\sum b_n$ is an absolutely convergent series such that $\left\vert a_n \right\vert \leq C \left\vert b_n \right\vert$ for some positive real number $C$ and for sufficiently large $n$, then $\sum a_n$ converges absolutely as well. If $\sum \left\vert b_n \right\vert$ diverges, and $\left\vert a_n \right\vert \geq \left\vert b_n \right\vert$ for all sufficiently large $n$, then $\sum a_n$ also fails to converge absolutely, although it could still be conditionally convergent, for example, if the $a_n$ alternate in sign. Second is the general '' limit comparison test'': If $\sum b_n$ is an absolutely convergent series such that $\left\vert \tfrac \right\vert \leq \left\vert \tfrac \right\vert$ for sufficiently large $n$, then $\sum a_n$ converges absolutely as well. If $\sum \left, b_n \$ diverges, and $\left\vert \tfrac \right\vert \geq \left\vert \tfrac \right\vert$ for all sufficiently large $n$, then $\sum a_n$ also fails to converge absolutely, though it could still be conditionally convergent if the $a_n$ vary in sign.

Using comparisons to geometric series specifically, those two general comparison tests imply two further common and generally useful tests for convergence of series with non-negative terms or for absolute convergence of series with general terms. First is the ''ratio test'': if there exists a constant $C < 1$ such that $\left\vert \tfrac \right\vert < C$ for all sufficiently large $n$, then $\sum a_$ converges absolutely. When the ratio is less than $1$, but not less than a constant less than $1$, convergence is possible but this test does not establish it. Second is the ''root test'': if there exists a constant $C < 1$ such that $\textstyle \left\vert a_ \right\vert^ \leq C$ for all sufficiently large $n$, then $\sum a_$ converges absolutely.

Alternatively, using comparisons to series representations of integrals specifically, one derives the ''integral test'': if $f(x)$ is a positive monotone decreasing function defined on the interval ,\infty) then for a series with terms $a_n = f(n)$ for all $n$, $\sum a_$ converges if and only if the integral $\int_^ f(x) \, dx$ is finite. Using comparisons to flattened-out versions of a series leads to Cauchy's condensation test: if the sequence of terms $a_$ is non-negative and non-increasing, then the two series $\sum a_$ and $\sum 2^ a_$ are either both convergent or both divergent.

Conditional convergence tests

A series of real or complex numbers is said to be ''conditionally convergent'' (or ''semi-convergent'') if it is convergent but not absolutely convergent. Conditional convergence is tested for differently than absolute convergence.

One important example of a test for conditional convergence is the '' alternating series test'' or ''Leibniz test'': A series of the form $\sum (-1)^ a_$ with all $a_ > 0$ is called ''alternating''. Such a series converges if the non-negative sequence $a_$ is monotone decreasing and converges to $0$. The converse is in general not true. A famous example of an application of this test is the alternating harmonic series
$\sum\limits_^\infty = 1 - + - + - \cdots,$
which is convergent per the alternating series test (and its sum is equal to $\ln 2$), though the series formed by taking the absolute value of each term is the ordinary harmonic series, which is divergent.

The alternating series test can be viewed as a special case of the more general '' Dirichlet's test'': if $(a_)$ is a sequence of terms of decreasing nonnegative real numbers that converges to zero, and $(\lambda_n)$ is a sequence of terms with bounded partial sums, then the series $\sum \lambda_n a_n$ converges. Taking $\lambda_n = (-1)^n$ recovers the alternating series test.

'' Abel's test'' is another important technique for handling semi-convergent series. If a series has the form $\sum a_n = \sum \lambda_n b_n$ where the partial sums of the series with terms $b_n$, $s_ = b_ + \cdots + b_$ are bounded, $\lambda_$ has bounded variation, and $\lim \lambda_ b_$ exists: if $\sup_n , s_, < \infty,$ $\sum \left, \lambda_ - \lambda_n\ < \infty,$ and $\lambda_n s_$converges, then the series $\sum a_$ is convergent.

Other specialized convergence tests for specific types of series include the Dini test for Fourier series.

Evaluation of truncation errors

The evaluation of truncation errors of series is important in numerical analysis (especially validated numerics and computer-assisted proof). It can be used to prove convergence and to analyze rates of convergence.

Alternating series

When conditions of the alternating series test are satisfied by $S:=\sum_^\infty(-1)^m u_m$, there is an exact error evaluation. Set $s_n$ to be the partial sum $s_n:=\sum_^n(-1)^m u_m$ of the given alternating series $S$. Then the next inequality holds:
$, S-s_n, \leq u_.$

Hypergeometric series

By using the ratio, we can obtain the evaluation of the error term when the hypergeometric series is truncated.

Matrix exponential

For the matrix exponential:

$\exp(X) := \sum_^\infty\fracX^k,\quad X\in\mathbb^,$

the following error evaluation holds (scaling and squaring method):

$T_(X) := \biggl(\sum_^r\frac(X/s)^j\biggr)^s,\quad \bigl\, \exp(X)-T_(X)\bigr\, \leq\frac\exp(\, X\, ).$

Sums of divergent series

Under many circumstances, it is desirable to assign generalized sums to series which fail to converge in the strict sense that their sequences of partial sums do not converge. A '' summation method'' is any method for assigning sums to divergent series in a way that systematically extends the classical notion of the sum of a series. Summation methods include Cesàro summation, generalized Cesàro summation, Abel summation, and Borel summation, in order of applicability to increasingly divergent series. These methods are all based on sequence transformations of the original series of terms or of its sequence of partial sums. An alternative family of summation methods are based on analytic continuation rather than sequence transformation.

A variety of general results concerning possible summability methods are known. The Silverman–Toeplitz theorem characterizes ''matrix summation methods'', which are methods for summing a divergent series by applying an infinite matrix to the vector of coefficients. The most general methods for summing a divergent series are non-constructive and concern Banach limits.

Series of functions

A series of real- or complex-valued functions

$\sum_^\infty f_n(x)$

is pointwise convergent to a limit on a set if the series converges for each in as a series of real or complex numbers. Equivalently, the partial sums

$s_N(x) = \sum_^N f_n(x)$

converge to as goes to infinity for each in .

A stronger notion of convergence of a series of functions is uniform convergence. A series converges uniformly in a set $E$ if it converges pointwise to the function at every point of $E$ and the supremum of these pointwise errors in approximating the limit by the th partial sum,

$\sup_ \bigl, s_N(x) - f(x)\bigr,$

converges to zero with increasing , of .

Uniform convergence is desirable for a series because many properties of the terms of the series are then retained by the limit. For example, if a series of continuous functions converges uniformly, then the limit function is also continuous. Similarly, if the are integrable on a closed and bounded interval and converge uniformly, then the series is also integrable on and can be integrated term by term. Tests for uniform convergence include Weierstrass' M-test, Abel's uniform convergence test, Dini's test, and the Cauchy criterion.

More sophisticated types of convergence of a series of functions can also be defined. In measure theory, for instance, a series of functions converges almost everywhere if it converges pointwise except on a set of measure zero. Other modes of convergence depend on a different metric space structure on the space of functions under consideration. For instance, a series of functions converges in mean to a limit function on a set if

$\lim_ \int_E \bigl, s_N(x)-f(x)\bigr, ^2\,dx = 0.$

Power series

:

A power series is a series of the form

$\sum_^\infty a_n(x-c)^n.$

The Taylor series at a point of a function is a power series that, in many cases, converges to the function in a neighborhood of . For example, the series

$\sum_^ \frac$

is the Taylor series of $e^x$ at the origin and converges to it for every .

Unless it converges only at , such a series converges on a certain open disc of convergence centered at the point in the complex plane, and may also converge at some of the points of the boundary of the disc. The radius of this disc is known as the radius of convergence, and can in principle be determined from the asymptotics of the coefficients . The convergence is uniform on closed and bounded (that is, compact) subsets of the interior of the disc of convergence: to wit, it is uniformly convergent on compact sets.

Historically, mathematicians such as Leonhard Euler operated liberally with infinite series, even if they were not convergent. When calculus was put on a sound and correct foundation in the nineteenth century, rigorous proofs of the convergence of series were always required.

Formal power series

While many uses of power series refer to their sums, it is also possible to treat power series as ''formal sums'', meaning that no addition operations are actually performed, and the symbol "+" is an abstract symbol of conjunction which is not necessarily interpreted as corresponding to addition. In this setting, the sequence of coefficients itself is of interest, rather than the convergence of the series. Formal power series are used in combinatorics to describe and study sequences that are otherwise difficult to handle, for example, using the method of generating functions. The Hilbert–Poincaré series is a formal power series used to study graded algebras.

Even if the limit of the power series is not considered, if the terms support appropriate structure then it is possible to define operations such as addition, multiplication, derivative, antiderivative for power series "formally", treating the symbol "+" as if it corresponded to addition. In the most common setting, the terms come from a commutative ring, so that the formal power series can be added term-by-term and multiplied via the Cauchy product. In this case the algebra of formal power series is the total algebra of the monoid of natural numbers over the underlying term ring. If the underlying term ring is a differential algebra, then the algebra of formal power series is also a differential algebra, with differentiation performed term-by-term.

Laurent series

Laurent series generalize power series by admitting terms into the series with negative as well as positive exponents. A Laurent series is thus any series of the form

$\sum_^\infty a_n x^n.$

If such a series converges, then in general it does so in an annulus rather than a disc, and possibly some boundary points. The series converges uniformly on compact subsets of the interior of the annulus of convergence.

Dirichlet series

:

A Dirichlet series is one of the form

$\sum_^\infty ,$

where is a complex number. For example, if all are equal to , then the Dirichlet series is the Riemann zeta function

$\zeta(s) = \sum_^\infty \frac.$

Like the zeta function, Dirichlet series in general play an important role in analytic number theory. Generally a Dirichlet series converges if the real part of is greater than a number called the abscissa of convergence. In many cases, a Dirichlet series can be extended to an analytic function outside the domain of convergence by analytic continuation. For example, the Dirichlet series for the zeta function converges absolutely when , but the zeta function can be extended to a holomorphic function defined on $\Complex\setminus\$ with a simple pole at .

This series can be directly generalized to general Dirichlet series.

Trigonometric series

A series of functions in which the terms are trigonometric functions is called a trigonometric series:

$A_0 + \sum_^\infty \left(A_n\cos nx + B_n \sin nx\right).$

The most important example of a trigonometric series is the Fourier series of a function.

Asymptotic series

Asymptotic series, typically called asymptotic expansions, are infinite series whose terms are functions of a sequence of different asymptotic orders and whose partial sums are approximations of some other function in an asymptotic limit. In general they do not converge, but they are still useful as sequences of approximations, each of which provides a value close to the desired answer for a finite number of terms. They are crucial tools in perturbation theory and in the analysis of algorithms.

An asymptotic series cannot necessarily be made to produce an answer as exactly as desired away from the asymptotic limit, the way that an ordinary convergent series of functions can. In fact, a typical asymptotic series reaches its best practical approximation away from the asymptotic limit after a finite number of terms; if more terms are included, the series will produce less accurate approximations.

History of the theory of infinite series

Development of infinite series

Infinite series play an important role in modern analysis of Ancient Greek philosophy of motion, particularly in Zeno's paradoxes. The paradox of Achilles and the tortoise demonstrates that continuous motion would require an actual infinity of temporal instants, which was arguably an absurdity: Achilles runs after a tortoise, but when he reaches the position of the tortoise at the beginning of the race, the tortoise has reached a second position; when he reaches this second position, the tortoise is at a third position, and so on. Zeno is said to have argued that therefore Achilles could ''never'' reach the tortoise, and thus that continuous movement must be an illusion. Zeno divided the race into infinitely many sub-races, each requiring a finite amount of time, so that the total time for Achilles to catch the tortoise is given by a series. The resolution of the purely mathematical and imaginative side of the paradox is that, although the series has an infinite number of terms, it has a finite sum, which gives the time necessary for Achilles to catch up with the tortoise. However, in modern philosophy of motion the physical side of the problem remains open, with both philosophers and physicists doubting, like Zeno, that spatial motions are infinitely divisible: hypothetical reconciliations of quantum mechanics and general relativity in theories of quantum gravity often introduce quantizations of spacetime at the Planck scale.

Greek mathematician Archimedes produced the first known summation of an infinite series with a
method that is still used in the area of calculus today. He used the method of exhaustion to calculate the area under the arc of a parabola with the summation of an infinite series, and gave a remarkably accurate approximation of π.

Mathematicians from the Kerala school were studying infinite series .

In the 17th century, James Gregory worked in the new decimal system on infinite series and published several Maclaurin series. In 1715, a general method for constructing the Taylor series for all functions for which they exist was provided by Brook Taylor. Leonhard Euler in the 18th century, developed the theory of hypergeometric series and q-series.

Convergence criteria

The investigation of the validity of infinite series is considered to begin with Gauss in the 19th century. Euler had already considered the hypergeometric series

$1 + \fracx + \fracx^2 + \cdots$

on which Gauss published a memoir in 1812. It established simpler criteria of convergence, and the questions of remainders and the range of convergence.

Cauchy (1821) insisted on strict tests of convergence; he showed that if two series are convergent their product is not necessarily so, and with him begins the discovery of effective criteria. The terms ''convergence'' and ''divergence'' had been introduced long before by Gregory (1668). Leonhard Euler and Gauss had given various criteria, and Colin Maclaurin had anticipated some of Cauchy's discoveries. Cauchy advanced the theory of power series by his expansion of a complex function in such a form.

Abel (1826) in his memoir on the binomial series

$1 + \fracx + \fracx^2 + \cdots$

corrected certain of Cauchy's conclusions, and gave a completely scientific summation of the series for complex values of $m$ and $x$. He showed the necessity of considering the subject of continuity in questions of convergence.

Cauchy's methods led to special rather than general criteria, and
the same may be said of Raabe (1832), who made the first elaborate investigation of the subject, of De Morgan (from 1842), whose
logarithmic test DuBois-Reymond (1873) and Pringsheim (1889) have
shown to fail within a certain region; of Bertrand (1842), Bonnet
(1843), Malmsten (1846, 1847, the latter without integration); Stokes (1847), Paucker (1852), Chebyshev (1852), and Arndt
(1853).

General criteria began with Kummer (1835), and have been studied by Eisenstein (1847), Weierstrass in his various
contributions to the theory of functions, Dini (1867),
DuBois-Reymond (1873), and many others. Pringsheim's memoirs (1889) present the most complete general theory.

Uniform convergence

The theory of uniform convergence was treated by Cauchy (1821), his limitations being pointed out by Abel, but the first to attack it
successfully were Seidel and Stokes (1847–48). Cauchy took up the
problem again (1853), acknowledging Abel's criticism, and reaching
the same conclusions which Stokes had already found. Thomae used the
doctrine (1866), but there was great delay in recognizing the importance of distinguishing between uniform and non-uniform
convergence, in spite of the demands of the theory of functions.

Semi-convergence

A series is said to be semi-convergent (or conditionally convergent) if it is convergent but not absolutely convergent.

Semi-convergent series were studied by Poisson (1823), who also gave a general form for the remainder of the Maclaurin formula. The most important solution of the problem is due, however, to Jacobi (1834), who attacked the question of the remainder from a different standpoint and reached a different formula. This expression was also worked out, and another one given, by Malmsten (1847). Schlömilch (''Zeitschrift'', Vol.I, p. 192, 1856) also improved Jacobi's remainder, and showed the relation between the remainder and Bernoulli's function

$F(x) = 1^n + 2^n + \cdots + (x - 1)^n.$

Genocchi (1852) has further contributed to the theory.

Among the early writers was Wronski, whose "loi suprême" (1815) was hardly recognized until Cayley (1873) brought it into
prominence.

Fourier series

Fourier series were being investigated
as the result of physical considerations at the same time that
Gauss, Abel, and Cauchy were working out the theory of infinite
series. Series for the expansion of sines and cosines, of multiple
arcs in powers of the sine and cosine of the arc had been treated by
Jacob Bernoulli (1702) and his brother Johann Bernoulli (1701) and still
earlier by Vieta. Euler and Lagrange

HOME


Content is Copyleft
Website design, code, and AI is Copyrighted (c) 2014-2017 by Stephen Payne


Consider donating to Wikimedia



As an Amazon Associate I earn from qualifying purchases