# Series (mathematics)

(Redirected from Infinite series)

In mathematics, a series is, roughly speaking, a description of the operation of adding infinitely many quantities, one after the other, to a given starting quantity.[1] 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 (such as in combinatorics), through generating functions. In addition to their ubiquity in mathematics, infinite series are also widely used in other quantitative disciplines such as physics, computer science, statistics and finance.

For a long time, the idea that such a potentially infinite summation could produce a finite result was considered paradoxical. This paradox was resolved using the concept of a limit during the 19th century. Zeno's paradox of Achilles and the tortoise illustrates this counterintuitive property of infinite sums: 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 concluded that Achilles could never reach the tortoise, and thus that movement does not exist. 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 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.

In modern terminology, any (ordered) infinite sequence ${\displaystyle (a_{1},a_{2},a_{3},\ldots )}$ of terms (that is, numbers, functions, or anything that can be added) defines a series, which is the operation of adding the ${\displaystyle a_{i}}$ one after the other. To emphasize that there are an infinite number of terms, a series may be called an infinite series. Such a series is represented (or denoted) by an expression like

${\displaystyle a_{1}+a_{2}+a_{3}+\cdots ,}$

or, using the summation sign,

${\displaystyle \sum _{i=1}^{\infty }a_{i}.}$

The infinite sequence of additions implied by a series cannot be effectively carried on (at least in a finite amount of time). However, if the set to which the terms and their finite sums belong has a notion of limit, it is sometimes possible to assign a value to a series, called the sum of the series. This value is the limit as n tends to infinity (if the limit exists) of the finite sums of the n first terms of the series, which are called the nth partial sums of the series. That is,

${\displaystyle \sum _{i=1}^{\infty }a_{i}=\lim _{n\to \infty }\sum _{i=1}^{n}a_{i}.}$

When this limit exists, one says that the series is convergent or summable, or that the sequence ${\displaystyle (a_{1},a_{2},a_{3},\ldots )}$ is summable. In this case, the limit is called the sum of the series. Otherwise, the series is said to be divergent.

Generally, the terms of a series come from a ring, often the field ${\displaystyle \mathbb {R} }$ of the real numbers or the field ${\displaystyle \mathbb {C} }$ of the complex numbers. In this case, the set of all series is itself a ring (and even an associative algebra), in which the addition consists of adding the series term by term, and the multiplication is the Cauchy product.

## Basic properties

An infinite series or simply a series is an infinite sum, represented by an infinite expression of the form[2]

${\displaystyle a_{0}+a_{1}+a_{2}+\cdots ,}$

where ${\displaystyle (a_{n})}$  is any ordered sequence of terms, such as numbers, functions, or anything else that can be added (an abelian group). This is an expression that is obtained from the list of terms ${\displaystyle a_{0},a_{1},\dots }$  by laying them side by side, and conjoining them with the symbol "+". A series may also be represented by using summation notation, such as

${\displaystyle \sum _{n=0}^{\infty }a_{n}}$  .

If an abelian group A of terms has a concept of limit (for example, if it is a metric space), then some series, the convergent series, can be interpreted as having a value in A, called the sum of the series. This includes the common cases from calculus in which the group is the field of real numbers or the field of complex numbers. Given a series ${\displaystyle s=\sum _{n=0}^{\infty }a_{n},}$  its kth partial sum is

${\displaystyle s_{k}=\sum _{n=0}^{k}a_{n}=a_{0}+a_{1}+\cdots +a_{k}.}$

By definition, the series ${\displaystyle \sum _{n=0}^{\infty }a_{n}}$  converges to the limit L (or simply sums to L), if the sequence of its partial sums has a limit L.[2] In this case, one usually writes

${\displaystyle L=\sum _{n=0}^{\infty }a_{n}.}$

A series is said to be convergent if it converges to some limit or divergent when it does not. The value of this limit, if it exists, is then the value of the series.

### Convergent series

Illustration of 3 geometric series with partial sums from 1 to 6 terms. The dashed line represents the limit.

A series an is said to converge or to be convergent when the sequence (sk) of partial sums has a finite limit. If the limit of sk is infinite or does not exist, the series is said to diverge.[3] When the limit of partial sums exists, it is called the value (or sum) of the series

${\displaystyle \sum _{n=0}^{\infty }a_{n}=\lim _{k\to \infty }s_{k}=\lim _{k\to \infty }\sum _{n=0}^{k}a_{n}.}$

An easy way that an infinite series can converge is if all the an are zero for n sufficiently large. Such a series can be identified with a finite sum, so it is only infinite in a trivial sense.

Working out the properties of the series that converge even if infinitely many terms are non-zero is the essence of the study of series. Consider the example

${\displaystyle 1+{\frac {1}{2}}+{\frac {1}{4}}+{\frac {1}{8}}+\cdots +{\frac {1}{2^{n}}}+\cdots .}$

It is possible to "visualize" its convergence on the real number line: we can imagine a line of length 2, with successive segments marked off of lengths 1, ½, ¼, etc. There is always room to mark the next segment, because the amount of line remaining is always the same as the last segment marked: when we have marked off ½, we still have a piece of length ½ unmarked, so we can certainly mark the next ¼. This argument does not prove that the sum is equal to 2 (although it is), but it does prove that it is at most 2. In other words, the series has an upper bound. Given that the series converges, proving that it is equal to 2 requires only elementary algebra. If the series is denoted S, it can be seen that

${\displaystyle S/2={\frac {1+{\frac {1}{2}}+{\frac {1}{4}}+{\frac {1}{8}}+\cdots }{2}}={\frac {1}{2}}+{\frac {1}{4}}+{\frac {1}{8}}+{\frac {1}{16}}+\cdots .}$

Therefore,

${\displaystyle S-S/2=1\Rightarrow S=2.}$

The idiom can be extended to other, equivalent notions of series. For instance, a recurring decimal, as in

${\displaystyle x=0.111\dots }$ ,

encodes the series

${\displaystyle \sum _{n=1}^{\infty }{\frac {1}{10^{n}}}.}$

Since these series always converge to real numbers (because of what is called the completeness property of the real numbers), to talk about the series in this way is the same as to talk about the numbers for which they stand. In particular, the decimal expansion 0.111... can be identified with 1/9. This leads to an argument that 9 × 0.111... = 0.999... = 1, which only relies on the fact that the limit laws for series preserve the arithmetic operations; this argument is presented in the article 0.999....

## 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). Example:
${\displaystyle 1+{1 \over 2}+{1 \over 4}+{1 \over 8}+{1 \over 16}+\cdots =\sum _{n=0}^{\infty }{1 \over 2^{n}}.}$
In general, the geometric series
${\displaystyle \sum _{n=0}^{\infty }z^{n}}$
converges if and only if ${\textstyle |z|<1}$ .
${\displaystyle _{r}F_{s}\left[{\begin{matrix}a_{1},a_{2},\dotsc ,a_{r}\\b_{1},b_{2},\dotsc ,b_{s}\end{matrix}};z\right]:=\sum _{n=0}^{\infty }{\frac {(a_{1})_{n}(a_{2})_{n}\dotsb (a_{r})_{n}}{(b_{1})_{n}(b_{2})_{n}\dotsb (b_{s})_{n}\;n!}}z^{n}}$

and their generalizations (such as basic hypergeometric series and elliptic hypergeometric series) frequently appear in integrable systems and mathematical physics[4].

${\displaystyle 3+{5 \over 2}+{7 \over 4}+{9 \over 8}+{11 \over 16}+\cdots =\sum _{n=0}^{\infty }{(3+2n) \over 2^{n}}.}$
${\displaystyle 1+{1 \over 2}+{1 \over 3}+{1 \over 4}+{1 \over 5}+\cdots =\sum _{n=1}^{\infty }{1 \over n}.}$
The harmonic series is divergent.
${\displaystyle 1-{1 \over 2}+{1 \over 3}-{1 \over 4}+{1 \over 5}-\cdots =\sum _{n=1}^{\infty }{\left(-1\right)^{n-1} \over n}=\ln(2)\quad }$  (alternating harmonic series)

and

${\displaystyle -1+{\frac {1}{3}}-{\frac {1}{5}}+{\frac {1}{7}}-{\frac {1}{9}}+\cdots =\sum _{n=1}^{\infty }{\frac {\left(-1\right)^{n}}{2n-1}}=-{\frac {\pi }{4}}}$
${\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n^{p}}}}$
converges if p > 1 and diverges for p ≤ 1, which can be shown with the integral criterion described below in convergence tests. As a function of p, the sum of this series is Riemann's zeta function.
${\displaystyle \sum _{n=1}^{\infty }(b_{n}-b_{n+1})}$
converges if the sequence bn converges to a limit L as n goes to infinity. The value of the series is then b1L.
• There are some elementary series whose convergence is not yet known/proven. For example, it is unknown whether the Flint Hills series
${\displaystyle \sum _{n=1}^{\infty }{\frac {\csc ^{2}n}{n^{3}}}}$
converges or not. The convergence depends on how well ${\displaystyle \pi }$  can be approximated with rational numbers (which is unknown as of yet). More specifically, the values of n with large numerical contributions to the sum are the numerators of the continued fraction convergents of ${\displaystyle \pi }$ , a sequence beginning with 1, 3, 22, 333, 355, 103993, ... (sequence A046947 in the OEIS). These are integers that are close to ${\displaystyle n\pi }$  for some integer n, so that ${\displaystyle \sin n\pi }$  is close to 0 and its reciprocal is large. Alekseyev (2011) proved that if the series converges, then the irrationality measure of ${\displaystyle \pi }$  is smaller than 2.5, which is much smaller than the current known bound of 7.6063....[5][6]

### π

${\displaystyle \sum _{i=1}^{\infty }{\frac {1}{i^{2}}}={\frac {1}{1^{2}}}+{\frac {1}{2^{2}}}+{\frac {1}{3^{2}}}+{\frac {1}{4^{2}}}+\cdots ={\frac {\pi ^{2}}{6}}}$
${\displaystyle \sum _{i=1}^{\infty }{\frac {(-1)^{i+1}(4)}{2i-1}}={\frac {4}{1}}-{\frac {4}{3}}+{\frac {4}{5}}-{\frac {4}{7}}+{\frac {4}{9}}-{\frac {4}{11}}+{\frac {4}{13}}-\cdots =\pi }$

### Natural logarithm of 2

${\displaystyle \sum _{i=1}^{\infty }{\frac {(-1)^{i+1}}{i}}=\ln 2}$
${\displaystyle \sum _{i=0}^{\infty }{\frac {1}{(2i+1)(2i+2)}}=\ln 2}$
${\displaystyle \sum _{i=0}^{\infty }{\frac {(-1)^{i}}{(i+1)(i+2)}}=2\ln(2)-1}$
${\displaystyle \sum _{i=1}^{\infty }{\frac {1}{i(4i^{2}-1)}}=2\ln(2)-1}$
${\displaystyle \sum _{i=1}^{\infty }{\frac {1}{2^{i}i}}=\ln 2}$
${\displaystyle \sum _{i=1}^{\infty }\left({\frac {1}{3^{i}}}+{\frac {1}{4^{i}}}\right){\frac {1}{i}}=\ln 2}$
${\displaystyle \sum _{i=1}^{\infty }{\frac {1}{2i(2i-1)}}=\ln 2}$

### Natural logarithm base e

${\displaystyle \sum _{i=0}^{\infty }{\frac {(-1)^{i}}{i!}}=1-{\frac {1}{1!}}+{\frac {1}{2!}}-{\frac {1}{3!}}+\cdots ={\frac {1}{e}}}$
${\displaystyle \sum _{i=0}^{\infty }{\frac {1}{i!}}={\frac {1}{0!}}+{\frac {1}{1!}}+{\frac {1}{2!}}+{\frac {1}{3!}}+{\frac {1}{4!}}+\cdots =e}$

## Calculus and partial summation as an operation on sequences

Partial summation takes as input a sequence, { an }, and gives as output another sequence, { SN }. It is thus a unary operation on sequences. Further, this function is linear, and thus is a linear operator on the vector space of sequences, denoted Σ. The inverse operator is the finite difference operator, Δ. These behave as discrete analogs of integration and differentiation, only for series (functions of a natural number) instead of functions of a real variable. For example, the sequence {1, 1, 1, ...} has series {1, 2, 3, 4, ...} as its partial summation, which is analogous to the fact that ${\displaystyle \int _{0}^{x}1\,dt=x.}$

In computer science it is known as prefix sum.

## Properties of series

Series are classified not only by whether they converge or diverge, but also by the properties of the terms an (absolute or conditional convergence); type of convergence of the series (pointwise, uniform); the class of the term an (whether it is a real number, arithmetic progression, trigonometric function); etc.

### Non-negative terms

When an is a non-negative real number for every n, the sequence SN of partial sums is non-decreasing. It follows that a series ∑an with non-negative terms converges if and only if the sequence SN of partial sums is bounded.

For example, the series

${\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n^{2}}}}$

is convergent, because the inequality

${\displaystyle {\frac {1}{n^{2}}}\leq {\frac {1}{n-1}}-{\frac {1}{n}},\quad n\geq 2,}$

and a telescopic sum argument implies that the partial sums are bounded by 2. The exact value of the original series is the Basel problem.

### Absolute convergence

A series

${\displaystyle \sum _{n=0}^{\infty }a_{n}}$

is said to converge absolutely if the series of absolute values

${\displaystyle \sum _{n=0}^{\infty }\left|a_{n}\right|}$

converges. This is sufficient to guarantee not only that the original series converges to a limit, but also that any reordering of it converges to the same limit.

### Conditional convergence

A series of real or complex numbers is said to be conditionally convergent (or semi-convergent) if it is convergent but not absolutely convergent. A famous example is the alternating series

${\displaystyle \sum \limits _{n=1}^{\infty }{(-1)^{n+1} \over n}=1-{1 \over 2}+{1 \over 3}-{1 \over 4}+{1 \over 5}-\cdots ,}$

which is convergent (and its sum is equal to ln 2), but the series formed by taking the absolute value of each term is the divergent harmonic series. The Riemann series theorem says that any conditionally convergent series can be reordered to make a divergent series, and moreover, if the an are real and S is any real number, that one can find a reordering so that the reordered series converges with sum equal to S.

Abel's test is an important tool for handling semi-convergent series. If a series has the form

${\displaystyle \sum a_{n}=\sum \lambda _{n}b_{n}}$

where the partial sums BN = b0 + ··· + bn are bounded, λn has bounded variation, and lim λnBn exists:

${\displaystyle \sup _{N}{\Bigl |}\sum _{n=0}^{N}b_{n}{\Bigr |}<\infty ,\ \ \sum |\lambda _{n+1}-\lambda _{n}|<\infty \ {\text{and}}\ \lambda _{n}B_{n}\ {\text{converges,}}}$

then the series ∑ an is convergent. This applies to the pointwise convergence of many trigonometric series, as in

${\displaystyle \sum _{n=2}^{\infty }{\frac {\sin(nx)}{\ln n}}}$

with 0 < x < 2π. Abel's method consists in writing bn+1 = Bn+1 − Bn, and in performing a transformation similar to integration by parts (called summation by parts), that relates the given series ∑ an to the absolutely convergent series

${\displaystyle \sum (\lambda _{n}-\lambda _{n+1})\,B_{n}.}$

### Evaluation of truncation errors

The evaluation of truncation errors is an important procedure in numerical analysis (especially validated numerics and computer-assisted proof).

#### Alternating series

When conditions of the alternating series test is satisfied by ${\displaystyle S:=\sum _{m=0}^{\infty }(-1)^{m}u_{m}}$ , there is an exact error evaluation[7]. Set ${\displaystyle s_{n}}$  as the partial sum of the given alternating series ${\displaystyle S:=\sum _{m=0}^{\infty }(-1)^{m}u_{m}}$ . Then the next inequality holds:

${\displaystyle |S-s_{n}|\leq u_{n+1}.}$

#### Taylor series

Taylor's theorem is a statement that includes the evaluation of the error term when the Taylor series is truncated.

#### Hypergeometric series

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

#### Matrix exponential

For the matrix exponential:

${\displaystyle \exp(X):=\sum _{k=0}^{\infty }{\frac {1}{k!}}X^{k},\quad X\in \mathbb {C} ^{n\times n},}$

the following error evaluation holds (scaling and squaring method):[9][10][11]

${\displaystyle T_{r,s}(X):=\left[\sum _{j=0}^{r}{\frac {1}{j!}}(X/s)^{j}\right]^{s},\quad ||\exp(X)-T_{r,s}(X)||\leq {\frac {||X||^{r+1}}{s^{r}(r+1)!}}\exp(||X||).}$

## Convergence tests

There exist many tests that can be used to determine whether particular series converge or diverge.

• n-th term test: If limn→∞ an ≠ 0, then the series diverges; if limn→∞ an = 0, then the test is inconclusive.
• Comparison test 1 (see Direct comparison test): If ∑bn  is an absolutely convergent series such that |an | ≤ C |bn | for some number C  and for sufficiently large n , then ∑an  converges absolutely as well. If ∑|bn | diverges, and |an | ≥ |bn | for all sufficiently large n , then ∑an  also fails to converge absolutely (though it could still be conditionally convergent, for example, if the an  alternate in sign).
• Comparison test 2 (see Limit comparison test): If ∑bn  is an absolutely convergent series such that |an+1 /an | ≤ |bn+1 /bn | for sufficiently large n , then ∑an  converges absolutely as well. If ∑|bn | diverges, and |an+1 /an | ≥ |bn+1 /bn | for all sufficiently large n , then ∑an  also fails to converge absolutely (though it could still be conditionally convergent, for example, if the an  alternate in sign).
• Ratio test: If there exists a constant C < 1 such that |an+1/an|<C for all sufficiently large n, then ∑an 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.
• Root test: If there exists a constant C < 1 such that |an|1/n ≤ C for all sufficiently large n, then ∑an converges absolutely.
• Integral test: if ƒ(x) is a positive monotone decreasing function defined on the interval [1, ∞) with ƒ(n) = an for all n, then ∑an converges if and only if the integral  ∫1 ƒ(x) dx is finite.
• Cauchy's condensation test: If an is non-negative and non-increasing, then the two series  ∑an  and  ∑2ka(2k) are of the same nature: both convergent, or both divergent.
• Alternating series test: A series of the form ∑(−1)n an (with an > 0) is called alternating. Such a series converges if the sequence an is monotone decreasing and converges to 0. The converse is in general not true.
• For some specific types of series there are more specialized convergence tests, for instance for Fourier series there is the Dini test.

## Series of functions

A series of real- or complex-valued functions

${\displaystyle \sum _{n=0}^{\infty }f_{n}(x)}$

converges pointwise on a set E, if the series converges for each x in E as an ordinary series of real or complex numbers. Equivalently, the partial sums

${\displaystyle s_{N}(x)=\sum _{n=0}^{N}f_{n}(x)}$

converge to ƒ(x) as N → ∞ for each x ∈ E.

A stronger notion of convergence of a series of functions is called uniform convergence. The series converges uniformly if it converges pointwise to the function ƒ(x), and the error in approximating the limit by the Nth partial sum,

${\displaystyle |s_{N}(x)-f(x)|}$

can be made minimal independently of x by choosing a sufficiently large N.

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 ƒn are integrable on a closed and bounded interval I and converge uniformly, then the series is also integrable on I and can be integrated term-by-term. Tests for uniform convergence include the 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 certain 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 on a set E to a limit function ƒ provided

${\displaystyle \int _{E}\left|s_{N}(x)-f(x)\right|^{2}\,dx\to 0}$

as N → ∞.

### Power series

A power series is a series of the form

${\displaystyle \sum _{n=0}^{\infty }a_{n}(x-c)^{n}.}$

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

${\displaystyle \sum _{n=0}^{\infty }{\frac {x^{n}}{n!}}}$

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

Unless it converges only at x=c, such a series converges on a certain open disc of convergence centered at the point c 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 an. 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.[12] 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

${\displaystyle \sum _{n=-\infty }^{\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

${\displaystyle \sum _{n=1}^{\infty }{a_{n} \over n^{s}},}$

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

${\displaystyle \zeta (s)=\sum _{n=1}^{\infty }{\frac {1}{n^{s}}}.}$

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 s 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 Re s > 1, but the zeta function can be extended to a holomorphic function defined on ${\displaystyle \mathbf {C} \setminus \{1\}}$   with a simple pole at 1.

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:

${\displaystyle {\tfrac {1}{2}}A_{0}+\sum _{n=1}^{\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.

## History of the theory of infinite series

### Development of infinite series

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 π.[13][14]

Mathematicians from Kerala, India studied infinite series around 1350 CE.[15]

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

${\displaystyle 1+{\frac {\alpha \beta }{1\cdot \gamma }}x+{\frac {\alpha (\alpha +1)\beta (\beta +1)}{1\cdot 2\cdot \gamma (\gamma +1)}}x^{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

${\displaystyle 1+{\frac {m}{1!}}x+{\frac {m(m-1)}{2!}}x^{2}+\cdots }$

corrected certain of Cauchy's conclusions, and gave a completely scientific summation of the series for complex values of ${\displaystyle m}$  and ${\displaystyle 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

${\displaystyle 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 simplified the subject, as did Poinsot, Schröter, Glaisher, and Kummer.

Fourier (1807) set for himself a different problem, to expand a given function of x in terms of the sines or cosines of multiples of x, a problem which he embodied in his Théorie analytique de la chaleur (1822). Euler had already given the formulas for determining the coefficients in the series; Fourier was the first to assert and attempt to prove the general theorem. Poisson (1820–23) also attacked the problem from a different standpoint. Fourier did not, however, settle the question of convergence of his series, a matter left for Cauchy (1826) to attempt and for Dirichlet (1829) to handle in a thoroughly scientific manner (see convergence of Fourier series). Dirichlet's treatment (Crelle, 1829), of trigonometric series was the subject of criticism and improvement by Riemann (1854), Heine, Lipschitz, Schläfli, and du Bois-Reymond. Among other prominent contributors to the theory of trigonometric and Fourier series were Dini, Hermite, Halphen, Krause, Byerly and Appell.

## Generalizations

### Asymptotic series

Asymptotic series, otherwise asymptotic expansions, are infinite series whose partial sums become good approximations in the limit of some point of the domain. In general they do not converge, but they are useful as sequences of approximations, each of which provides a value close to the desired answer for a finite number of terms. The difference is that an asymptotic series cannot be made to produce an answer as exact as desired, the way that convergent series can. In fact, after a certain number of terms, a typical asymptotic series reaches its best approximation; if more terms are included, most such series will produce worse answers.

### Divergent series

Under many circumstances, it is desirable to assign a limit to a series which fails to converge in the usual sense. A summability method is such an assignment of a limit to a subset of the set of divergent series which properly extends the classical notion of convergence. Summability methods include Cesàro summation, (C,k) summation, Abel summation, and Borel summation, in increasing order of generality (and hence applicable to increasingly divergent series).

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

### Series in Banach spaces

The notion of series can be easily extended to the case of a Banach space. If xn is a sequence of elements of a Banach space X, then the series Σxn converges to x ∈ X if the sequence of partial sums of the series tends to x; to wit,

${\displaystyle {\biggl \|}x-\sum _{n=0}^{N}x_{n}{\biggr \|}\to 0}$

as N → ∞.

More generally, convergence of series can be defined in any abelian Hausdorff topological group. Specifically, in this case, Σxn converges to x if the sequence of partial sums converges to x.

### Summations over arbitrary index sets

Definitions may be given for sums over an arbitrary index set I.[16] There are two main differences with the usual notion of series: first, there is no specific order given on the set I; second, this set I may be uncountable. The notion of convergence needs to be strengthened, because the concept of conditional convergence depends on the ordering of the index set.

If ${\displaystyle a:I\mapsto G}$  is a function from an index set I to a set G, then the "series" associated to ${\displaystyle a}$  is the formal sum of the elements ${\displaystyle a(x)\in G}$  over the index elements ${\displaystyle x\in I}$  denoted by the

${\displaystyle \sum _{x\in I}a(x).}$

When the index set is the natural numbers ${\displaystyle I=\mathbb {N} }$ , the function ${\displaystyle a:\mathbb {N} \mapsto G}$  is a sequence denoted by ${\displaystyle a(n)=a_{n}}$ . A series indexed on the natural numbers is an ordered formal sum and so we rewrite ${\displaystyle \sum _{n\in \mathbb {N} }}$  as ${\displaystyle \sum _{n=0}^{\infty }}$  in order to emphasize the ordering induced by the natural numbers. Thus, we obtain the common notation for a series indexed by the natural numbers

${\displaystyle \sum _{n=0}^{\infty }a_{n}=a_{0}+a_{1}+a_{2}+\cdots .}$

#### Families of non-negative numbers

When summing a family {ai}, i ∈ I, of non-negative numbers, one may define

${\displaystyle \sum _{i\in I}a_{i}=\sup {\Bigl \{}\sum _{i\in A}a_{i}\,{\big |}A{\text{ finite, }}A\subset I{\Bigr \}}\in [0,+\infty ].}$

When the supremum is finite, the set of i ∈ I such that ai > 0 is countable. Indeed, for every n ≥ 1, the set ${\displaystyle A_{n}=\{i\in I\,:\,a_{i}>1/n\}}$  is finite, because

${\displaystyle {\frac {1}{n}}\,{\textrm {card}}(A_{n})\leq \sum _{i\in A_{n}}a_{i}\leq \sum _{i\in I}a_{i}<\infty .}$

If I  is countably infinite and enumerated as I = {i0, i1,...} then the above defined sum satisfies

${\displaystyle \sum _{i\in I}a_{i}=\sum _{k=0}^{+\infty }a_{i_{k}},}$

provided the value ∞ is allowed for the sum of the series.

Any sum over non-negative reals can be understood as the integral of a non-negative function with respect to the counting measure, which accounts for the many similarities between the two constructions.

#### Abelian topological groups

Let a : IX, where I  is any set and X  is an abelian Hausdorff topological group. Let F  be the collection of all finite subsets of I, with F viewed as a directed set, ordered under inclusion with union as join. Define the sum S  of the family a as the limit

${\displaystyle S=\sum _{i\in I}a_{i}=\lim {\Bigl \{}\sum _{i\in A}a_{i}\,{\big |}A\in F{\Bigr \}}}$

if it exists and say that the family a is unconditionally summable. Saying that the sum S  is the limit of finite partial sums means that for every neighborhood V  of 0 in X, there is a finite subset A0 of I  such that

${\displaystyle S-\sum _{i\in A}a_{i}\in V,\quad A\supset A_{0}.}$

Because F  is not totally ordered, this is not a limit of a sequence of partial sums, but rather of a net.[17][18]

For every W, neighborhood of 0 in X, there is a smaller neighborhood V  such that V − V ⊂ W. It follows that the finite partial sums of an unconditionally summable family ai, i ∈ I, form a Cauchy net, that is, for every W, neighborhood of 0 in X, there is a finite subset A0 of I  such that

${\displaystyle \sum _{i\in A_{1}}a_{i}-\sum _{i\in A_{2}}a_{i}\in W,\quad A_{1},A_{2}\supset A_{0}.}$

When X  is complete, a family a is unconditionally summable in X  if and only if the finite sums satisfy the latter Cauchy net condition. When X  is complete and ai, i ∈ I, is unconditionally summable in X, then for every subset J ⊂ I, the corresponding subfamily aj, j ∈ J, is also unconditionally summable in X.

When the sum of a family of non-negative numbers, in the extended sense defined before, is finite, then it coincides with the sum in the topological group X = R.

If a family a in X  is unconditionally summable, then for every W, neighborhood of 0 in X, there is a finite subset A0 of I  such that ai ∈ W  for every i not in A0. If X  is first-countable, it follows that the set of i ∈ I  such that ai ≠ 0 is countable. This need not be true in a general abelian topological group (see examples below).

#### Unconditionally convergent series

Suppose that I = N. If a family an, n ∈ N, is unconditionally summable in an abelian Hausdorff topological group X, then the series in the usual sense converges and has the same sum,

${\displaystyle \sum _{n=0}^{\infty }a_{n}=\sum _{n\in \mathbf {N} }a_{n}.}$

By nature, the definition of unconditional summability is insensitive to the order of the summation. When ∑an is unconditionally summable, then the series remains convergent after any permutation σ of the set N of indices, with the same sum,

${\displaystyle \sum _{n=0}^{\infty }a_{\sigma (n)}=\sum _{n=0}^{\infty }a_{n}.}$

Conversely, if every permutation of a series ∑an converges, then the series is unconditionally convergent. When X  is complete, then unconditional convergence is also equivalent to the fact that all subseries are convergent; if X  is a Banach space, this is equivalent to say that for every sequence of signs εn = ±1, the series

${\displaystyle \sum _{n=0}^{\infty }\varepsilon _{n}a_{n}}$

converges in X. If X  is a Banach space, then one may define the notion of absolute convergence. A series ∑an of vectors in X  converges absolutely if

${\displaystyle \sum _{n\in \mathbf {N} }\|a_{n}\|<+\infty .}$

If a series of vectors in a Banach space converges absolutely then it converges unconditionally, but the converse only holds in finite-dimensional Banach spaces (theorem of Dvoretzky & Rogers (1950)).

#### Well-ordered sums

Conditionally convergent series can be considered if I is a well-ordered set, for example, an ordinal number α0. One may define by transfinite recursion:

${\displaystyle \sum _{\beta <\alpha +1}a_{\beta }=a_{\alpha }+\sum _{\beta <\alpha }a_{\beta }}$

and for a limit ordinal α,

${\displaystyle \sum _{\beta <\alpha }a_{\beta }=\lim _{\gamma \to \alpha }\sum _{\beta <\gamma }a_{\beta }}$

if this limit exists. If all limits exist up to α0, then the series converges.

#### Examples

1. Given a function f : XY, with Y an abelian topological group, define for every a ∈ X
${\displaystyle f_{a}(x)={\begin{cases}0&x\neq a,\\f(a)&x=a,\\\end{cases}}}$

a function whose support is a singleton {a}. Then

${\displaystyle f=\sum _{a\in X}f_{a}}$
in the topology of pointwise convergence (that is, the sum is taken in the infinite product group YX ).
2. In the definition of partitions of unity, one constructs sums of functions over arbitrary index set I,
${\displaystyle \sum _{i\in I}\varphi _{i}(x)=1.}$
While, formally, this requires a notion of sums of uncountable series, by construction there are, for every given x, only finitely many nonzero terms in the sum, so issues regarding convergence of such sums do not arise. Actually, one usually assumes more: the family of functions is locally finite, that is, for every x there is a neighborhood of x in which all but a finite number of functions vanish. Any regularity property of the φi,  such as continuity, differentiability, that is preserved under finite sums will be preserved for the sum of any subcollection of this family of functions.
3. On the first uncountable ordinal ω1 viewed as a topological space in the order topology, the constant function f: [0,ω1) → [0,ω1] given by f(α) = 1 satisfies
${\displaystyle \sum _{\alpha \in [0,\omega _{1})}f(\alpha )=\omega _{1}}$
(in other words, ω1 copies of 1 is ω1) only if one takes a limit over all countable partial sums, rather than finite partial sums. This space is not separable.

## Notes

1. ^ Thompson, Silvanus; Gardner, Martin (1998). Calculus Made Easy. ISBN 978-0-312-18548-0.
2. ^ a b Swokowski 1983, p. 501
3. ^ Michael Spivak, Calculus
4. ^ Gasper, G., Rahman, M. (2004). Basic hypergeometric series. Cambridge university press.
5. ^ Max A. Alekseyev, On convergence of the Flint Hills series, arXiv:1104.5100, 2011.
6. ^
7. ^ Positive and Negative Terms: Alternating Series
8. ^ Johansson, F. (2016). Computing hypergeometric functions rigorously. arXiv preprint arXiv:1606.06977.
9. ^ Higham, N. J. (2008). Functions of matrices: theory and computation. Society for industrial and applied mathematics.
10. ^ Higham, N. J. (2009). The scaling and squaring method for the matrix exponential revisited. SIAM review, 51(4), 747-764.
11. ^ How and How Not to Compute the Exponential of a Matrix
12. ^ Nicolas Bourbaki (1989), Algebra, Springer: §III.2.11.
13. ^ O'Connor, J.J. & Robertson, E.F. (February 1996). "A history of calculus". University of St Andrews. Retrieved 2007-08-07.
14. ^ K., Bidwell, James (30 November 1993). "Archimedes and Pi-Revisited". School Science and Mathematics. 94 (3).
15. ^ "Indians predated Newton 'discovery' by 250 years". manchester.ac.uk.
16. ^ Jean Dieudonné, Foundations of mathematical analysis, Academic Press
17. ^ Bourbaki, Nicolas (1998). General Topology: Chapters 1–4. Springer. pp. 261–270. ISBN 978-3-540-64241-1.
18. ^ Choquet, Gustave (1966). Topology. Academic Press. pp. 216–231. ISBN 978-0-12-173450-3.