Series (mathematics)

Infinite sum

This article is about infinite sums. For finite sums, see Summation.

Part of a series of articles about

Calculus
∫ a b f ′ ( t ) d t = f ( b ) − f ( a ) {\displaystyle \int _{a}^{b}f'(t)\,dt=f(b)-f(a)}

* Fundamental theorem

* Limits
* Continuity

* Rolle's theorem
* Mean value theorem
* Inverse function theorem

Differential

|  Definitions

* Derivative (generalizations)
* Differential
* infinitesimal
* of a function
* total

Concepts

* Differentiation notation
* Second derivative
* Implicit differentiation
* Logarithmic differentiation
* Related rates
* Taylor's theorem

Rules and identities

* Sum
* Product
* Chain
* Power
* Quotient
* L'Hôpital's rule
* Inverse
* General Leibniz
* Faà di Bruno's formula
* Reynolds

Integral

* Lists of integrals
* Integral transform
* Leibniz integral rule

Definitions

* Antiderivative
* Integral (improper)
* Riemann integral
* Lebesgue integration
* Contour integration
* Integral of inverse functions

Integration by

* Parts
* Discs
* Cylindrical shells
* Substitution (trigonometric, tangent half-angle, Euler)
* Euler's formula
* Partial fractions (Heaviside's method)
* Changing order
* Reduction formulae
* Differentiating under the integral sign
* Risch algorithm

Series

* Geometric (arithmetico-geometric)
* Harmonic
* Alternating
* Power
* Binomial
* Taylor

Convergence tests

* Summand limit (term test)
* Ratio
* Root
* Integral
* Direct comparison

Limit comparison
* Alternating series
* Cauchy condensation
* Dirichlet
* Abel

Vector

* Gradient
* Divergence
* Curl
* Laplacian
* Directional derivative
* Identities

Theorems

* Gradient
* Green's
* Stokes'
* Divergence
* Generalized Stokes
* Helmholtz decomposition

Multivariable

|  Formalisms

* Matrix
* Tensor
* Exterior
* Geometric

Definitions

* Partial derivative
* Multiple integral
* Line integral
* Surface integral
* Volume integral
* Jacobian
* Hessian

Advanced

* Calculus on Euclidean space
* Generalized functions
* Limit of distributions

Specialized

* Fractional
* Malliavin
* Stochastic
* Variations

Miscellanea

* Precalculus
* History
* Glossary
* List of topics
* Integration Bee
* Mathematical analysis
* Nonstandard analysis

* v
* t
* e

In mathematics, a series is, roughly speaking, an addition of infinitely many terms, one after the other.[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 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.[2][3] Nonetheless, infinite series were applied practically by Ancient Greek mathematicians including Archimedes, for instance in the quadrature of the parabola.[4][5] 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.[6] The resolution was made more rigorous and further improved in the 19th century through the work of Carl Friedrich Gauss and Augustin-Louis Cauchy,[7] 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 , … ) {\displaystyle (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 ⁠ a i {\displaystyle a_{i}} ⁠ 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 + ⋯ , {\displaystyle a_{1}+a_{2}+a_{3}+\cdots ,} or, using capital-sigma summation notation,[8] ∑ i = 1 ∞ a i . {\displaystyle \sum _{i=1}^{\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 ⁠ n {\displaystyle n} ⁠ tends to infinity of the finite sums of the ⁠ n {\displaystyle n} ⁠ first terms of the series if the limit exists.[9][10][11] These finite sums are called the partial sums of the series. Using summation notation,  ∑ i = 1 ∞ a i = lim n -> ∞ ∑ i = 1 n a i , {\displaystyle \sum _{i=1}^{\infty }a_{i}=\lim _{n\to \infty }\,\sum _{i=1}^{n}a_{i},} if it exists.[9][10][11] When the limit exists, the series is convergent or summable and also the sequence  ( a 1 , a 2 , a 3 , … ) {\displaystyle (a_{1},a_{2},a_{3},\ldots )} is summable, and otherwise, when the limit does not exist, the series is divergent.[9][10][11]

The expression  ∑ i = 1 ∞ a i {\textstyle \sum _{i=1}^{\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 {\displaystyle a+b} both the addition—the process of adding—and its result—the sum of ⁠ a {\displaystyle a} ⁠ and ⁠ b {\displaystyle b} ⁠.

Commonly, the terms of a series come from a ring, often the field R {\displaystyle \mathbb {R} } of the real numbers or the field  C {\displaystyle \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.[12][13][14]

## Definition

[edit]

### Series

[edit]

A series or, redundantly, an infinite series, is an infinite sum. It is often represented as[8][15][16] a 0 + a 1 + a 2 + ⋯ or a 1 + a 2 + a 3 + ⋯ , {\displaystyle a_{0}+a_{1}+a_{2}+\cdots \quad {\text{or}}\quad a_{1}+a_{2}+a_{3}+\cdots ,} where the terms a k {\displaystyle 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:[8][16] ∑ k = 0 ∞ a k or ∑ k = 1 ∞ a k . {\displaystyle \sum _{k=0}^{\infty }a_{k}\qquad {\text{or}}\qquad \sum _{k=1}^{\infty }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 ⁠ n {\displaystyle n} ⁠th term as a function of ⁠ n {\displaystyle n} ⁠:  a 0 + a 1 + a 2 + ⋯ + a n + ⋯ or f ( 0 ) + f ( 1 ) + f ( 2 ) + ⋯ + f ( n ) + ⋯ . {\displaystyle a_{0}+a_{1}+a_{2}+\cdots +a_{n}+\cdots \quad {\text{ or }}\quad f(0)+f(1)+f(2)+\cdots +f(n)+\cdots .} For example, Euler's number can be defined with the series  ∑ n = 0 ∞ 1 n ! = 1 + 1 + 1 2 + 1 6 + ⋯ + 1 n ! + ⋯ , {\displaystyle \sum _{n=0}^{\infty }{\frac {1}{n!}}=1+1+{\frac {1}{2}}+{\frac {1}{6}}+\cdots +{\frac {1}{n!}}+\cdots ,} where  n ! {\displaystyle n!} denotes the product of the  n {\displaystyle n} first positive integers, and  0 ! {\displaystyle 0!} is conventionally equal to  1. {\displaystyle 1.} [17][18][19]

### Partial sum of a series

[edit]

Given a series  s = ∑ k = 0 ∞ a k {\textstyle s=\sum _{k=0}^{\infty }a_{k}} , its ⁠ n {\displaystyle n} ⁠th partial sum is[9][10][11][16] s n = ∑ k = 0 n a k = a 0 + a 1 + ⋯ + a n . {\displaystyle s_{n}=\sum _{k=0}^{n}a_{k}=a_{0}+a_{1}+\cdots +a_{n}.}

Some authors directly identify a series with its sequence of partial sums.[9][11] 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 n − s n − 1 . {\displaystyle a_{n}=s_{n}-s_{n-1}.}

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 = ∑ k = 0 n ( a + k d ) = a + ( a + d ) + ( a + 2 d ) + ⋯ + ( a + n d ) = ( n + 1 ) ( a + 1 2 n d ) , {\displaystyle s_{n}=\sum _{k=0}^{n}\left(a+kd\right)=a+(a+d)+(a+2d)+\cdots +(a+nd)=(n+1){\bigl (}a+{\tfrac {1}{2}}nd{\bigr )},} and a geometric series has partial sums[20][21][22] s n = ∑ k = 0 n a r k = a + a r + a r 2 + ⋯ + a r n = a 1 − r n + 1 1 − r {\displaystyle s_{n}=\sum _{k=0}^{n}ar^{k}=a+ar+ar^{2}+\cdots +ar^{n}=a{\frac {1-r^{n+1}}{1-r}}} if ⁠ r ≠ 1 {\displaystyle r\neq 1} ⁠ or simply ⁠ s n = a ( n + 1 ) {\displaystyle s_{n}=a(n+1)} ⁠ if ⁠ r = 1 {\displaystyle r=1} ⁠.

### Sum of a series

[edit]

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

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.[23] When the limit of the partial sums exists, it is called the sum of the series or value of the series:[9][10][11][16] ∑ k = 0 ∞ a k = lim n -> ∞ ∑ k = 0 n a k = lim n -> ∞ s n . {\displaystyle \sum _{k=0}^{\infty }a_{k}=\lim _{n\to \infty }\sum _{k=0}^{n}a_{k}=\lim _{n\to \infty }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.[24] When the sum exists, the difference between the sum of a series and its  n {\displaystyle n} th partial sum,  s − s n = ∑ k = n + 1 ∞ a k , {\textstyle s-s_{n}=\sum _{k=n+1}^{\infty }a_{k},} is known as the  n {\displaystyle n} th truncation error of the infinite series.[25][26]

An example of a convergent series is the geometric series  1 + 1 2 + 1 4 + 1 8 + ⋯ + 1 2 k + ⋯ . {\displaystyle 1+{\frac {1}{2}}+{\frac {1}{4}}+{\frac {1}{8}}+\cdots +{\frac {1}{2^{k}}}+\cdots .}

It can be shown by algebraic computation that each partial sum  s n {\displaystyle s_{n}} is  ∑ k = 0 n 1 2 k = 2 − 1 2 n . {\displaystyle \sum _{k=0}^{n}{\frac {1}{2^{k}}}=2-{\frac {1}{2^{n}}}.} As one has  lim n -> ∞ ( 2 − 1 2 n ) = 2 , {\displaystyle \lim _{n\to \infty }\left(2-{\frac {1}{2^{n}}}\right)=2,} the series is convergent and converges to ⁠ 2 {\displaystyle 2} ⁠ with truncation errors  1 / 2 n {\textstyle 1/2^{n}} .[20][21][22]

By contrast, the geometric series  ∑ k = 0 ∞ 2 k {\displaystyle \sum _{k=0}^{\infty }2^{k}} is divergent in the real numbers.[20][21][22] However, it is convergent in the extended real number line, with  + ∞ {\displaystyle +\infty } as its limit and  + ∞ {\displaystyle +\infty } as its truncation error at every step.[27]

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

[edit]

### Grouping

[edit]

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 = {\displaystyle a_{0}+a_{1}+a_{2}={}} a 0 + ( a 1 + a 2 ) = {\displaystyle a_{0}+(a_{1}+a_{2})={}} ( a 0 + a 1 ) + a 2 . {\displaystyle (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 + ⋯ {\displaystyle a_{0}+a_{1}+a_{2}+\cdots } may not equal the sum of  a 0 + ( a 1 + a 2 ) + {\displaystyle a_{0}+(a_{1}+a_{2})+{}} ( a 3 + a 4 ) + ⋯ . {\displaystyle (a_{3}+a_{4})+\cdots .}

For example, Grandi's series ⁠ 1 − 1 + 1 − 1 + ⋯ {\displaystyle 1-1+1-1+\cdots } ⁠ has a sequence of partial sums that alternates back and forth between ⁠ 1 {\displaystyle 1} ⁠ and ⁠ 0 {\displaystyle 0} ⁠ and does not converge. Grouping its elements in pairs creates the series  ( 1 − 1 ) + ( 1 − 1 ) + ( 1 − 1 ) + ⋯ = {\displaystyle (1-1)+(1-1)+(1-1)+\cdots ={}} 0 + 0 + 0 + ⋯ , {\displaystyle 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 ) + {\displaystyle 1+(-1+1)+{}} ( − 1 + 1 ) + ⋯ = {\displaystyle (-1+1)+\cdots ={}} 1 + 0 + 0 + ⋯ , {\displaystyle 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,[28] and it is the basis for the general Cauchy condensation test.[29][30]

### Rearrangement

[edit]

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 = {\displaystyle a_{0}+a_{1}+a_{2}={}} a 0 + a 2 + a 1 = {\displaystyle a_{0}+a_{2}+a_{1}={}} a 2 + a 1 + a 0 . {\displaystyle 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 + ⋯ {\displaystyle 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 | + ⋯ , {\displaystyle |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.[31][32][33]

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

∑ n = 1 ∞ ( − 1 ) n + 1 n = 1 − 1 2 + 1 3 − 1 4 + 1 5 − ⋯ , {\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 has a sum of the natural logarithm of 2, while the sum of the absolute values of the terms is the harmonic series,  ∑ n = 1 ∞ 1 n = 1 + 1 2 + 1 3 + 1 4 + 1 5 + ⋯ , {\displaystyle \sum \limits _{n=1}^{\infty }{1 \over n}=1+{1 \over 2}+{1 \over 3}+{1 \over 4}+{1 \over 5}+\cdots ,} which diverges per the divergence of the harmonic series,[28] 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[34] 1 − 1 2 − 1 4 + 1 3 − 1 6 − 1 8 + 1 5 − 1 10 − 1 12 + ⋯ = ( 1 − 1 2 ) − 1 4 + ( 1 3 − 1 6 ) − 1 8 + ( 1 5 − 1 10 ) − 1 12 + ⋯ = 1 2 − 1 4 + 1 6 − 1 8 + 1 10 − 1 12 + ⋯ = 1 2 ( 1 − 1 2 + 1 3 − 1 4 + 1 5 − 1 6 + ⋯ ) , {\displaystyle {\begin{aligned}&1-{\frac {1}{2}}-{\frac {1}{4}}+{\frac {1}{3}}-{\frac {1}{6}}-{\frac {1}{8}}+{\frac {1}{5}}-{\frac {1}{10}}-{\frac {1}{12}}+\cdots \\\\[3mu]&\quad =\left(1-{\frac {1}{2}}\right)-{\frac {1}{4}}+\left({\frac {1}{3}}-{\frac {1}{6}}\right)-{\frac {1}{8}}+\left({\frac {1}{5}}-{\frac {1}{10}}\right)-{\frac {1}{12}}+\cdots \\\\[3mu]&\quad ={\frac {1}{2}}-{\frac {1}{4}}+{\frac {1}{6}}-{\frac {1}{8}}+{\frac {1}{10}}-{\frac {1}{12}}+\cdots \\\\[3mu]&\quad ={\frac {1}{2}}\left(1-{\frac {1}{2}}+{\frac {1}{3}}-{\frac {1}{4}}+{\frac {1}{5}}-{\frac {1}{6}}+\cdots \right),\end{aligned}}} which is  1 2 {\displaystyle {\tfrac {1}{2}}} 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

[edit]

### Series addition

[edit]

The addition of two series  a 0 + a 1 + a 2 + ⋯ {\textstyle a_{0}+a_{1}+a_{2}+\cdots } and  b 0 + b 1 + b 2 + ⋯ {\textstyle b_{0}+b_{1}+b_{2}+\cdots } is given by the termwise sum[13][35][36][37] ( a 0 + b 0 ) + ( a 1 + b 1 ) + ( a 2 + b 2 ) + ⋯ {\textstyle (a_{0}+b_{0})+(a_{1}+b_{1})+(a_{2}+b_{2})+\cdots \,} , or, in summation notation,  ∑ k = 0 ∞ a k + ∑ k = 0 ∞ b k = ∑ k = 0 ∞ a k + b k . {\displaystyle \sum _{k=0}^{\infty }a_{k}+\sum _{k=0}^{\infty }b_{k}=\sum _{k=0}^{\infty }a_{k}+b_{k}.}

Using the symbols  s a , n {\displaystyle s_{a,n}} and  s b , n {\displaystyle s_{b,n}} for the partial sums of the added series and  s a + b , n {\displaystyle s_{a+b,n}} for the partial sums of the resulting series, this definition implies the partial sums of the resulting series follow  s a + b , n = s a , n + s b , n . {\displaystyle s_{a+b,n}=s_{a,n}+s_{b,n}.} Then the sum of the resulting series, i.e., the limit of the sequence of partial sums of the resulting series, satisfies  lim n -> ∞ s a + b , n = lim n -> ∞ ( s a , n + s b , n ) = lim n -> ∞ s a , n + lim n -> ∞ s b , n , {\displaystyle \lim _{n\rightarrow \infty }s_{a+b,n}=\lim _{n\rightarrow \infty }(s_{a,n}+s_{b,n})=\lim _{n\rightarrow \infty }s_{a,n}+\lim _{n\rightarrow \infty }s_{b,n},} 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 {\displaystyle -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.[35]

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

[edit]

The product of a series  a 0 + a 1 + a 2 + ⋯ {\textstyle a_{0}+a_{1}+a_{2}+\cdots } with a constant number  c {\displaystyle c} , called a scalar in this context, is given by the termwise product[35] c a 0 + c a 1 + c a 2 + ⋯ {\textstyle ca_{0}+ca_{1}+ca_{2}+\cdots } , or, in summation notation,

c ∑ k = 0 ∞ a k = ∑ k = 0 ∞ c a k . {\displaystyle c\sum _{k=0}^{\infty }a_{k}=\sum _{k=0}^{\infty }ca_{k}.}

Using the symbols  s a , n {\displaystyle s_{a,n}} for the partial sums of the original series and  s c a , n {\displaystyle s_{ca,n}} for the partial sums of the series after multiplication by  c {\displaystyle c} , this definition implies that  s c a , n = c s a , n {\displaystyle s_{ca,n}=cs_{a,n}} for all  n , {\displaystyle n,} and therefore also  lim n -> ∞ s c a , n = c lim n -> ∞ s a , n , {\textstyle \lim _{n\rightarrow \infty }s_{ca,n}=c\lim _{n\rightarrow \infty }s_{a,n},} 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

[edit]

The multiplication of two series  a 0 + a 1 + a 2 + ⋯ {\displaystyle a_{0}+a_{1}+a_{2}+\cdots } and  b 0 + b 1 + b 2 + ⋯ {\displaystyle b_{0}+b_{1}+b_{2}+\cdots } to generate a third series  c 0 + c 1 + c 2 + ⋯ {\displaystyle c_{0}+c_{1}+c_{2}+\cdots } , called the Cauchy product,[12][13][14][36][38] can be written in summation notation  ( ∑ k = 0 ∞ a k ) ⋅ ( ∑ k = 0 ∞ b k ) = ∑ k = 0 ∞ c k = ∑ k = 0 ∞ ∑ j = 0 k a j b k − j , {\displaystyle {\biggl (}\sum _{k=0}^{\infty }a_{k}{\biggr )}\cdot {\biggl (}\sum _{k=0}^{\infty }b_{k}{\biggr )}=\sum _{k=0}^{\infty }c_{k}=\sum _{k=0}^{\infty }\sum _{j=0}^{k}a_{j}b_{k-j},} with each  c k = ∑ j = 0 k a j b k − j = {\textstyle c_{k}=\sum _{j=0}^{k}a_{j}b_{k-j}={}\\!} a 0 b k + a 1 b k − 1 + ⋯ + a k − 1 b 1 + a k b 0 . {\displaystyle \\!a_{0}b_{k}+a_{1}b_{k-1}+\cdots +a_{k-1}b_{1}+a_{k}b_{0}.} Here, the convergence of the partial sums of the series  c 0 + c 1 + c 2 + ⋯ {\displaystyle 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 + ⋯ {\displaystyle a_{0}+a_{1}+a_{2}+\cdots } and  b 0 + b 1 + b 2 + ⋯ {\displaystyle 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,[13][36][39] lim n -> ∞ s c , n = ( lim n -> ∞ s a , n ) ⋅ ( lim n -> ∞ s b , n ) . {\displaystyle \lim _{n\rightarrow \infty }s_{c,n}=\left(\,\lim _{n\rightarrow \infty }s_{a,n}\right)\cdot \left(\,\lim _{n\rightarrow \infty }s_{b,n}\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

[edit]

For other examples, see List of mathematical series and Sums of reciprocals § Infinitely many terms.

* A geometric series[20][21] 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 + 1 2 + 1 4 + 1 8 + 1 16 + ⋯ = ∑ n = 0 ∞ 1 2 n = 2. {\displaystyle 1+{1 \over 2}+{1 \over 4}+{1 \over 8}+{1 \over 16}+\cdots =\sum _{n=0}^{\infty }{1 \over 2^{n}}=2.} In general, a geometric series with initial term  a {\displaystyle a} and common ratio  r {\displaystyle r} ,  ∑ n = 0 ∞ a r n , {\textstyle \sum _{n=0}^{\infty }ar^{n},} converges if and only if  | r | < 1 {\textstyle |r|<1} , in which case it converges to  a 1 − r {\textstyle {a \over 1-r}} .
* The harmonic series is the series[40] 1 + 1 2 + 1 3 + 1 4 + 1 5 + ⋯ = ∑ n = 1 ∞ 1 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.
* An alternating series is a series where terms alternate signs.[41] Examples:  1 − 1 2 + 1 3 − 1 4 + 1 5 − ⋯ = ∑ n = 1 ∞ ( − 1 ) n − 1 n = ln ⁡ ( 2 ) , {\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),} the alternating harmonic series, and  − 1 + 1 3 − 1 5 + 1 7 − 1 9 + ⋯ = ∑ n = 1 ∞ ( − 1 ) n 2 n − 1 = − π 4 , {\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}},} the Leibniz formula for  π . {\displaystyle \pi .}
* A telescoping series[42] ∑ n = 1 ∞ ( b n − b n + 1 ) {\displaystyle \sum _{n=1}^{\infty }\left(b_{n}-b_{n+1}\right)} converges if the sequence ⁠ b n {\displaystyle b_{n}} ⁠ converges to a limit ⁠ L {\displaystyle L} ⁠ as ⁠ n {\displaystyle n} ⁠ goes to infinity. The value of the series is then ⁠ b 1 − L {\displaystyle b_{1}-L} ⁠.[43]
* 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 + 5 2 + 7 4 + 9 8 + 11 16 + ⋯ = ∑ n = 0 ∞ ( 3 + 2 n ) 2 n . {\displaystyle 3+{5 \over 2}+{7 \over 4}+{9 \over 8}+{11 \over 16}+\cdots =\sum _{n=0}^{\infty }{(3+2n) \over 2^{n}}.}
* The Dirichlet series ∑ n = 1 ∞ 1 n p {\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n^{p}}}} converges for ⁠ p > 1 {\displaystyle p>1} ⁠ and diverges for ⁠ p ≤ 1 {\displaystyle p\leq 1} ⁠, which can be shown with the integral test for convergence described below in convergence tests. As a function of ⁠ p {\displaystyle p} ⁠, the sum of this series is Riemann's zeta function.[44]
* Hypergeometric series:  p F q [ a 1 , a 2 , … , a p b 1 , b 2 , … , b q ; z ] := ∑ n = 0 ∞ ∏ r = 1 p ( a r ) n ∏ s = 1 q ( b s ) n z n n ! {\displaystyle _{p}F_{q}\left[{\begin{matrix}a_{1},a_{2},\dotsc ,a_{p}\\\b_{1},b_{2},\dotsc ,b_{q}\end{matrix}};z\right]:=\sum _{n=0}^{\infty }{\frac {\prod _{r=1}^{p}(a_{r})_{n}}{\prod _{s=1}^{q}(b_{s})_{n}}}{\frac {z^{n}}{n!}}} and their generalizations (such as basic hypergeometric series and elliptic hypergeometric series) frequently appear in integrable systems and mathematical physics.[45]
* There are some elementary series whose convergence is not yet known/proven. For example, it is unknown whether the Flint Hills series,  ∑ n = 1 ∞ 1 n 3 sin 2 ⁡ n , {\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n^{3}\sin ^{2}n}},} 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 {\displaystyle 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 ⁠ n {\displaystyle n} ⁠ that are close to  m π {\displaystyle m\pi } for some integer ⁠ m {\displaystyle m} ⁠, so that  sin ⁡ n {\displaystyle \sin n} is close to  sin ⁡ m π = 0 {\displaystyle \sin m\pi =0} and its reciprocal is large.

### Pi

[edit]

Main articles: Basel problem and Leibniz formula for π

∑ n = 1 ∞ 1 n 2 = 1 1 2 + 1 2 2 + 1 3 2 + 1 4 2 + ⋯ = π 2 6 {\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n^{2}}}={\frac {1}{1^{2}}}+{\frac {1}{2^{2}}}+{\frac {1}{3^{2}}}+{\frac {1}{4^{2}}}+\cdots ={\frac {\pi ^{2}}{6}}}

∑ n = 1 ∞ ( − 1 ) n + 1 ( 4 ) 2 n − 1 = 4 1 − 4 3 + 4 5 − 4 7 + 4 9 − 4 11 + 4 13 − ⋯ = π {\displaystyle \sum _{n=1}^{\infty }{\frac {(-1)^{n+1}(4)}{2n-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

[edit]

Main article: Natural logarithm of 2 § Series representations

∑ n = 1 ∞ ( − 1 ) n + 1 n = ln ⁡ 2 {\displaystyle \sum _{n=1}^{\infty }{\frac {(-1)^{n+1}}{n}}=\ln 2}

∑ n = 1 ∞ 1 2 n n = ln ⁡ 2 {\displaystyle \sum _{n=1}^{\infty }{\frac {1}{2^{n}n}}=\ln 2}

### Natural logarithm base e

[edit]

Main article: e (mathematical constant)

∑ n = 0 ∞ ( − 1 ) n n ! = 1 − 1 1 ! + 1 2 ! − 1 3 ! + ⋯ = 1 e {\displaystyle \sum _{n=0}^{\infty }{\frac {(-1)^{n}}{n!}}=1-{\frac {1}{1!}}+{\frac {1}{2!}}-{\frac {1}{3!}}+\cdots ={\frac {1}{e}}}

∑ n = 0 ∞ 1 n ! = 1 0 ! + 1 1 ! + 1 2 ! + 1 3 ! + 1 4 ! + ⋯ = e {\displaystyle \sum _{n=0}^{\infty }{\frac {1}{n!}}={\frac {1}{0!}}+{\frac {1}{1!}}+{\frac {1}{2!}}+{\frac {1}{3!}}+{\frac {1}{4!}}+\cdots =e}

## Convergence testing

[edit]

Main article: Convergence tests

One of the simplest tests for convergence of a series, applicable to all series, is the vanishing condition or ⁠ n {\displaystyle n} ⁠th-term test: If  lim n -> ∞ a n ≠ 0 {\textstyle \lim _{n\to \infty }a_{n}\neq 0} , then the series diverges; if  lim n -> ∞ a n = 0 {\textstyle \lim _{n\to \infty }a_{n}=0} , then the test is inconclusive.[46][47]

### Absolute convergence tests

[edit]

Main article: Absolute convergence

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.[48][49][47][50]

For example, the series  1 + 1 4 + 1 9 + ⋯ + 1 n 2 + ⋯ {\textstyle 1+{\frac {1}{4}}+{\frac {1}{9}}+\cdots +{\frac {1}{n^{2}}}+\cdots \,} is convergent and absolutely convergent because  1 n 2 ≤ 1 n − 1 − 1 n {\textstyle {\frac {1}{n^{2}}}\leq {\frac {1}{n-1}}-{\frac {1}{n}}} for all  n ≥ 2 {\displaystyle 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.[43] The exact value of this series is  1 6 π 2 {\textstyle {\frac {1}{6}}\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:[51][52][47] For any series  ∑ a n {\textstyle \sum a_{n}} , If  ∑ b n {\textstyle \sum b_{n}} is an absolutely convergent series such that  | a n | ≤ C | b n | {\displaystyle \left\vert a_{n}\right\vert \leq C\left\vert b_{n}\right\vert } for some positive real number  C {\displaystyle C} and for sufficiently large  n {\displaystyle n} , then  ∑ a n {\textstyle \sum a_{n}} converges absolutely as well. If  ∑ | b n | {\textstyle \sum \left\vert b_{n}\right\vert } diverges, and  | a n | ≥ | b n | {\displaystyle \left\vert a_{n}\right\vert \geq \left\vert b_{n}\right\vert } for all sufficiently large  n {\displaystyle n} , then  ∑ a n {\textstyle \sum a_{n}} also fails to converge absolutely, although it could still be conditionally convergent, for example, if the  a n {\displaystyle a_{n}} alternate in sign. Second is the general limit comparison test:[53][54] If  ∑ b n {\textstyle \sum b_{n}} is an absolutely convergent series such that  | a n + 1 a n | ≤ | b n + 1 b n | {\displaystyle \left\vert {\tfrac {a_{n+1}}{a_{n}}}\right\vert \leq \left\vert {\tfrac {b_{n+1}}{b_{n}}}\right\vert } for sufficiently large  n {\displaystyle n} , then  ∑ a n {\textstyle \sum a_{n}} converges absolutely as well. If  ∑ | b n | {\textstyle \sum \left|b_{n}\right|} diverges, and  | a n + 1 a n | ≥ | b n + 1 b n | {\displaystyle \left\vert {\tfrac {a_{n+1}}{a_{n}}}\right\vert \geq \left\vert {\tfrac {b_{n+1}}{b_{n}}}\right\vert } for all sufficiently large  n {\displaystyle n} , then  ∑ a n {\textstyle \sum a_{n}} also fails to converge absolutely, though it could still be conditionally convergent if the  a n {\displaystyle a_{n}} vary in sign.

Using comparisons to geometric series specifically,[20][21] 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:[55][56][57] if there exists a constant  C < 1 {\displaystyle C<1} such that  | a n + 1 a n | < C {\displaystyle \left\vert {\tfrac {a_{n+1}}{a_{n}}}\right\vert <C} for all sufficiently large n {\displaystyle n} , then  ∑ a n {\textstyle \sum a_{n}} converges absolutely. When the ratio is less than  1 {\displaystyle 1} , but not less than a constant less than  1 {\displaystyle 1} , convergence is possible but this test does not establish it. Second is the root test:[55][58][59] if there exists a constant  C < 1 {\displaystyle C<1} such that  | a n | 1 / n ≤ C {\displaystyle \textstyle \left\vert a_{n}\right\vert ^{1/n}\leq C} for all sufficiently large n {\displaystyle n} , then  ∑ a n {\textstyle \sum a_{n}} converges absolutely.

Alternatively, using comparisons to series representations of integrals specifically, one derives the integral test:[60][61] if  f ( x ) {\displaystyle f(x)} is a positive monotone decreasing function defined on the interval [ 1 , ∞ ) {\displaystyle [1,\infty )} then for a series with terms  a n = f ( n ) {\displaystyle a_{n}=f(n)} for all n {\displaystyle n} ,  ∑ a n {\textstyle \sum a_{n}} converges if and only if the integral ∫ 1 ∞ f ( x ) d x {\textstyle \int _{1}^{\infty }f(x)\,dx} is finite. Using comparisons to flattened-out versions of a series leads to Cauchy's condensation test:[29][30] if the sequence of terms  a n {\displaystyle a_{n}} is non-negative and non-increasing, then the two series  ∑ a n {\textstyle \sum a_{n}} and  ∑ 2 k a ( 2 k ) {\textstyle \sum 2^{k}a_{(2^{k})}} are either both convergent or both divergent.

### Conditional convergence tests

[edit]

Main article: 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. 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:[62][63][64] A series of the form  ∑ ( − 1 ) n a n {\textstyle \sum (-1)^{n}a_{n}} with all  a n > 0 {\displaystyle a_{n}>0} is called alternating. Such a series converges if the non-negative sequence a n {\displaystyle a_{n}} is monotone decreasing and converges to 0 {\displaystyle 0} . The converse is in general not true. A famous example of an application of this test is the alternating harmonic series ∑ n = 1 ∞ ( − 1 ) n + 1 n = 1 − 1 2 + 1 3 − 1 4 + 1 5 − ⋯ , {\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 per the alternating series test (and its sum is equal to ln ⁡ 2 {\displaystyle \ln 2} ), though the series formed by taking the absolute value of each term is the ordinary harmonic series, which is divergent.[65][66]

The alternating series test can be viewed as a special case of the more general Dirichlet's test:[67][68][69] if  ( a n ) {\displaystyle (a_{n})} is a sequence of terms of decreasing nonnegative real numbers that converges to zero, and  ( λ n ) {\displaystyle (\lambda _{n})} is a sequence of terms with bounded partial sums, then the series  ∑ λ n a n {\textstyle \sum \lambda _{n}a_{n}} converges. Taking  λ n = ( − 1 ) n {\displaystyle \lambda _{n}=(-1)^{n}} recovers the alternating series test.

Abel's test is another important technique for handling semi-convergent series.[67][29] If a series has the form  ∑ a n = ∑ λ n b n {\textstyle \sum a_{n}=\sum \lambda _{n}b_{n}} where the partial sums of the series with terms  b n {\displaystyle b_{n}} ,  s b , n = b 0 + ⋯ + b n {\displaystyle s_{b,n}=b_{0}+\cdots +b_{n}} are bounded,  λ n {\displaystyle \lambda _{n}} has bounded variation, and  lim λ n b n {\displaystyle \lim \lambda _{n}b_{n}} exists: if  sup n | s b , n | < ∞ , {\textstyle \sup _{n}|s_{b,n}|<\infty ,} ∑ | λ n + 1 − λ n | < ∞ , {\textstyle \sum \left|\lambda _{n+1}-\lambda _{n}\right|<\infty ,} and  λ n s b , n {\displaystyle \lambda _{n}s_{b,n}} converges, then the series  ∑ a n {\textstyle \sum a_{n}} is convergent.

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

### Evaluation of truncation errors

[edit]

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

[edit]

Main article: Alternating series

When conditions of the alternating series test are satisfied by  S := ∑ m = 0 ∞ ( − 1 ) m u m {\textstyle S:=\sum _{m=0}^{\infty }(-1)^{m}u_{m}} , there is an exact error evaluation.[71] Set  s n {\displaystyle s_{n}} to be the partial sum  s n := ∑ m = 0 n ( − 1 ) m u m {\textstyle s_{n}:=\sum _{m=0}^{n}(-1)^{m}u_{m}} of the given alternating series  S {\displaystyle S} . Then the next inequality holds:  | S − s n | ≤ u n + 1 . {\displaystyle |S-s_{n}|\leq u_{n+1}.}

#### Hypergeometric series

[edit]

Main article: Hypergeometric series

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

#### Matrix exponential

[edit]

Main article: Matrix exponential

For the matrix exponential:

exp ⁡ ( X ) := ∑ k = 0 ∞ 1 k ! X k , X ∈ C n × n , {\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):[73][74][75]

T r , s ( X ) := ( ∑ j = 0 r 1 j ! ( X / s ) j ) s , ‖ exp ⁡ ( X ) − T r , s ( X ) ‖ ≤ ‖ X ‖ r + 1 s r ( r + 1 ) ! exp ⁡ ( ‖ X ‖ ) . {\displaystyle T_{r,s}(X):={\biggl (}\sum _{j=0}^{r}{\frac {1}{j!}}(X/s)^{j}{\biggr )}^{s},\quad {\bigl \|}\exp(X)-T_{r,s}(X){\bigr \|}\leq {\frac {\|X\|^{r+1}}{s^{r}(r+1)!}}\exp(\|X\|).}

## Sums of divergent series

[edit]

Main article: 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 ⁠ ( C , α ) {\displaystyle (C,\alpha )} ⁠ 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

[edit]

Main article: Function series

A series of real- or complex-valued functions

∑ n = 0 ∞ f n ( x ) {\displaystyle \sum _{n=0}^{\infty }f_{n}(x)}

is pointwise convergent to a limit ⁠ f ( x ) {\displaystyle f(x)} ⁠ on a set ⁠ E {\displaystyle E} ⁠ if the series converges for each ⁠ x {\displaystyle x} ⁠ in ⁠ E {\displaystyle E} ⁠ as a series of real or complex numbers. Equivalently, the partial sums

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

converge to ⁠ f ( x ) {\displaystyle f(x)} ⁠ as ⁠ N {\displaystyle N} ⁠ goes to infinity for each ⁠ x {\displaystyle x} ⁠ in ⁠ E {\displaystyle E} ⁠.

A stronger notion of convergence of a series of functions is uniform convergence. A series converges uniformly in a set  E {\displaystyle E} if it converges pointwise to the function ⁠ f ( x ) {\displaystyle f(x)} ⁠ at every point of  E {\displaystyle E} and the supremum of these pointwise errors in approximating the limit by the ⁠ N {\displaystyle N} ⁠th partial sum,

sup x ∈ E | s N ( x ) − f ( x ) | {\displaystyle \sup _{x\in E}{\bigl |}s_{N}(x)-f(x){\bigr |}}

converges to zero with increasing ⁠ N {\displaystyle N} ⁠, independently of ⁠ x {\displaystyle x} ⁠.

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 ⁠ f n {\displaystyle f_{n}} ⁠ are integrable on a closed and bounded interval ⁠ I {\displaystyle I} ⁠ and converge uniformly, then the series is also integrable on ⁠ I {\displaystyle I} ⁠ 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 ⁠ f {\displaystyle f} ⁠ on a set ⁠ E {\displaystyle E} ⁠ if

lim N -> ∞ ∫ E | s N ( x ) − f ( x ) | 2 d x = 0. {\displaystyle \lim _{N\rightarrow \infty }\int _{E}{\bigl |}s_{N}(x)-f(x){\bigr |}^{2}\,dx=0.}

### Power series

[edit]

Main article: Power series

A power series is a series of the form

∑ n = 0 ∞ a n ( x − c ) n . {\displaystyle \sum _{n=0}^{\infty }a_{n}(x-c)^{n}.}

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

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

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

Unless it converges only at ⁠ x = c {\displaystyle x=c} ⁠, such a series converges on a certain open disc of convergence centered at the point ⁠ c {\displaystyle 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 ⁠ a n {\displaystyle a_{n}} ⁠. 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

[edit]

Main article: 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.[76] 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

[edit]

Main article: 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

∑ n = − ∞ ∞ a n x n . {\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

[edit]

Main article: Dirichlet series

A Dirichlet series is one of the form

∑ n = 1 ∞ a n n s , {\displaystyle \sum _{n=1}^{\infty }{a_{n} \over n^{s}},}

where ⁠ s {\displaystyle s} ⁠ is a complex number. For example, if all ⁠ a n {\displaystyle a_{n}} ⁠ are equal to ⁠ 1 {\displaystyle 1} ⁠, then the Dirichlet series is the Riemann zeta function

ζ ( s ) = ∑ n = 1 ∞ 1 n s . {\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 {\displaystyle 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 {\displaystyle \operatorname {Re} (s)>1} ⁠, but the zeta function can be extended to a holomorphic function defined on  C ∖ { 1 } {\displaystyle \mathbb {C} \setminus \\{1\\}} with a simple pole at ⁠ 1 {\displaystyle 1} ⁠.

This series can be directly generalized to general Dirichlet series.

### Trigonometric series

[edit]

Main article: Trigonometric series

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

A 0 + ∑ n = 1 ∞ ( A n cos ⁡ n x + B n sin ⁡ n x ) . {\displaystyle 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.

### Asymptotic series

[edit]

Main article: Asymptotic expansion

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

[edit]

### Development of infinite series

[edit]

Infinite series play an important role in modern analysis of Ancient Greek philosophy of motion, particularly in Zeno's paradoxes.[77] 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.[78][79]

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,[5] and gave a remarkably accurate approximation of π.[80][81]

Mathematicians from the Kerala school were studying infinite series c. 1350 CE.[82]

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

[edit]

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 + α β 1 ⋅ γ x + α ( α + 1 ) β ( β + 1 ) 1 ⋅ 2 ⋅ γ ( γ + 1 ) x 2 + ⋯ {\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

1 + m 1 ! x + m ( m − 1 ) 2 ! x 2 + ⋯ {\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  m {\displaystyle m} and  x {\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

[edit]

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

[edit]

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 + ⋯ + ( x − 1 ) n . {\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

[edit]

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 {\displaystyle x} ⁠ in terms of the sines or cosines of multiples of ⁠ x {\displaystyle 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.

## Summations over general index sets

[edit]

Definitions may be given for infinitary sums over an arbitrary index set  I . {\displaystyle I.} [83] This generalization introduces two main differences from the usual notion of series: first, there may be no specific order given on the set  I {\displaystyle I} ; second, the set  I {\displaystyle I} may be uncountable. The notions of convergence need to be reconsidered for these, then, because for instance the concept of conditional convergence depends on the ordering of the index set.

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

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

When the index set is the natural numbers  I = N , {\displaystyle I=\mathbb {N} ,} the function  a : N ↦ G {\displaystyle a:\mathbb {N} \mapsto G} is a sequence denoted by  a ( n ) = a n . {\displaystyle a(n)=a_{n}.} A series indexed on the natural numbers is an ordered formal sum and so we rewrite  ∑ n ∈ N {\textstyle \sum _{n\in \mathbb {N} }} as  ∑ n = 0 ∞ {\textstyle \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

∑ n = 0 ∞ a n = a 0 + a 1 + a 2 + ⋯ . {\displaystyle \sum _{n=0}^{\infty }a_{n}=a_{0}+a_{1}+a_{2}+\cdots .}

### Families of non-negative numbers

[edit]

When summing a family  { a i : i ∈ I } {\displaystyle \left\\{a_{i}:i\in I\right\\}} of non-negative real numbers over the index set  I {\displaystyle I} , define

∑ i ∈ I a i = sup { ∑ i ∈ A a i : A ⊆ I , A finite } ∈ [ 0 , + ∞ ] . {\displaystyle \sum _{i\in I}a_{i}=\sup {\biggl \\{}\sum _{i\in A}a_{i}\,:A\subseteq I,A{\text{ finite}}{\biggr \\}}\in [0,+\infty ].}

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.

When the supremum is finite then the set of  i ∈ I {\displaystyle i\in I} such that  a i > 0 {\displaystyle a_{i}>0} is countable. Indeed, for every  n ≥ 1 , {\displaystyle n\geq 1,} the cardinality | A n | {\displaystyle \left|A_{n}\right|} of the set  A n = { i ∈ I : a i > 1 / n } {\displaystyle A_{n}=\left\\{i\in I:a_{i}>1/n\right\\}} is finite because

1 n | A n | = ∑ i ∈ A n 1 n ≤ ∑ i ∈ A n a i ≤ ∑ i ∈ I a i < ∞ . {\displaystyle {\frac {1}{n}}\,\left|A_{n}\right|=\sum _{i\in A_{n}}{\frac {1}{n}}\leq \sum _{i\in A_{n}}a_{i}\leq \sum _{i\in I}a_{i}<\infty .}

Hence the set  A = { i ∈ I : a i > 0 } = ⋃ n = 1 ∞ A n {\displaystyle A=\left\\{i\in I:a_{i}>0\right\\}=\bigcup _{n=1}^{\infty }A_{n}} is countable.

If  I {\displaystyle I} is countably infinite and enumerated as  I = { i 0 , i 1 , … } {\displaystyle I=\left\\{i_{0},i_{1},\ldots \right\\}} then the above defined sum satisfies

∑ i ∈ I a i = ∑ k = 0 ∞ a i k , {\displaystyle \sum _{i\in I}a_{i}=\sum _{k=0}^{\infty }a_{i_{k}},} provided the value  ∞ {\displaystyle \infty } is allowed for the sum of the series.

### Abelian topological groups

[edit]

Let  a : I -> X {\displaystyle a:I\to X} be a map, also denoted by  ( a i ) i ∈ I , {\displaystyle \left(a_{i}\right)_{i\in I},} from some non-empty set  I {\displaystyle I} into a Hausdorff abelian topological group X . {\displaystyle X.} Let  Finite ⁡ ( I ) {\displaystyle \operatorname {Finite} (I)} be the collection of all finite subsets of  I , {\displaystyle I,} with  Finite ⁡ ( I ) {\displaystyle \operatorname {Finite} (I)} viewed as a directed set, ordered under inclusion ⊆ {\displaystyle \,\subseteq \,} with union as join. The family  ( a i ) i ∈ I , {\displaystyle \left(a_{i}\right)_{i\in I},} is said to be unconditionally summable if the following limit, which is denoted by  ∑ i ∈ I a i {\displaystyle \textstyle \sum _{i\in I}a_{i}} and is called the sum of  ( a i ) i ∈ I , {\displaystyle \left(a_{i}\right)_{i\in I},} exists in  X : {\displaystyle X:}

∑ i ∈ I a i := lim A ∈ Finite ⁡ ( I ) ∑ i ∈ A a i = lim { ∑ i ∈ A a i : A ⊆ I , A finite } {\displaystyle \sum _{i\in I}a_{i}:=\lim _{A\in \operatorname {Finite} (I)}\ \sum _{i\in A}a_{i}=\lim {\biggl \\{}\sum _{i\in A}a_{i}\,:A\subseteq I,A{\text{ finite }}{\biggr \\}}} Saying that the sum  S := ∑ i ∈ I a i {\displaystyle \textstyle S:=\sum _{i\in I}a_{i}} is the limit of finite partial sums means that for every neighborhood  V {\displaystyle V} of the origin in  X , {\displaystyle X,} there exists a finite subset  A 0 {\displaystyle A_{0}} of  I {\displaystyle I} such that

S − ∑ i ∈ A a i ∈ V for every finite superset A ⊇ A 0 . {\displaystyle S-\sum _{i\in A}a_{i}\in V\qquad {\text{ for every finite superset}}\;A\supseteq A_{0}.}

Because  Finite ⁡ ( I ) {\displaystyle \operatorname {Finite} (I)} is not totally ordered, this is not a limit of a sequence of partial sums, but rather of a net.[84][85]

For every neighborhood  W {\displaystyle W} of the origin in  X , {\displaystyle X,} there is a smaller neighborhood  V {\displaystyle V} such that  V − V ⊆ W . {\displaystyle V-V\subseteq W.} It follows that the finite partial sums of an unconditionally summable family  ( a i ) i ∈ I , {\displaystyle \left(a_{i}\right)_{i\in I},} form a Cauchy net, that is, for every neighborhood  W {\displaystyle W} of the origin in  X , {\displaystyle X,} there exists a finite subset  A 0 {\displaystyle A_{0}} of  I {\displaystyle I} such that

∑ i ∈ A 1 a i − ∑ i ∈ A 2 a i ∈ W for all finite supersets A 1 , A 2 ⊇ A 0 , {\displaystyle \sum _{i\in A_{1}}a_{i}-\sum _{i\in A_{2}}a_{i}\in W\qquad {\text{ for all finite supersets }}\;A_{1},A_{2}\supseteq A_{0},} which implies that  a i ∈ W {\displaystyle a_{i}\in W} for every  i ∈ I ∖ A 0 {\displaystyle i\in I\setminus A_{0}} (by taking  A 1 := A 0 ∪ { i } {\displaystyle A_{1}:=A_{0}\cup \\{i\\}} and  A 2 := A 0 {\displaystyle A_{2}:=A_{0}} ).

When  X {\displaystyle X} is complete, a family  ( a i ) i ∈ I {\displaystyle \left(a_{i}\right)_{i\in I}} is unconditionally summable in  X {\displaystyle X} if and only if the finite sums satisfy the latter Cauchy net condition. When  X {\displaystyle X} is complete and  ( a i ) i ∈ I , {\displaystyle \left(a_{i}\right)_{i\in I},} is unconditionally summable in  X , {\displaystyle X,} then for every subset  J ⊆ I , {\displaystyle J\subseteq I,} the corresponding subfamily  ( a j ) j ∈ J , {\displaystyle \left(a_{j}\right)_{j\in J},} is also unconditionally summable in  X . {\displaystyle 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 . {\displaystyle X=\mathbb {R} .}

If a family  ( a i ) i ∈ I {\displaystyle \left(a_{i}\right)_{i\in I}} in  X {\displaystyle X} is unconditionally summable then for every neighborhood  W {\displaystyle W} of the origin in  X , {\displaystyle X,} there is a finite subset  A 0 ⊆ I {\displaystyle A_{0}\subseteq I} such that  a i ∈ W {\displaystyle a_{i}\in W} for every index  i {\displaystyle i} not in  A 0 . {\displaystyle A_{0}.} If  X {\displaystyle X} is a first-countable space then it follows that the set of  i ∈ I {\displaystyle i\in I} such that  a i ≠ 0 {\displaystyle a_{i}\neq 0} is countable. This need not be true in a general abelian topological group (see examples below).

### Unconditionally convergent series

[edit]

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

∑ n = 0 ∞ a n = ∑ n ∈ N a n . {\displaystyle \sum _{n=0}^{\infty }a_{n}=\sum _{n\in \mathbb {N} }a_{n}.}

By nature, the definition of unconditional summability is insensitive to the order of the summation. When  ∑ a n {\displaystyle \textstyle \sum a_{n}} is unconditionally summable, then the series remains convergent after any permutation σ : N -> N {\displaystyle \sigma :\mathbb {N} \to \mathbb {N} } of the set  N {\displaystyle \mathbb {N} } of indices, with the same sum,

∑ n = 0 ∞ a σ ( n ) = ∑ n = 0 ∞ a n . {\displaystyle \sum _{n=0}^{\infty }a_{\sigma (n)}=\sum _{n=0}^{\infty }a_{n}.}

Conversely, if every permutation of a series  ∑ a n {\displaystyle \textstyle \sum a_{n}} converges, then the series is unconditionally convergent. When  X {\displaystyle X} is complete then unconditional convergence is also equivalent to the fact that all subseries are convergent; if  X {\displaystyle X} is a Banach space, this is equivalent to say that for every sequence of signs  ε n = ± 1 {\displaystyle \varepsilon _{n}=\pm 1} , the series

∑ n = 0 ∞ ε n a n {\displaystyle \sum _{n=0}^{\infty }\varepsilon _{n}a_{n}}

converges in  X . {\displaystyle X.}

### Series in topological vector spaces

[edit]

If  X {\displaystyle X} is a topological vector space (TVS) and  ( x i ) i ∈ I {\displaystyle \left(x_{i}\right)_{i\in I}} is a (possibly uncountable) family in  X {\displaystyle X} then this family is summable[86] if the limit  lim A ∈ Finite ⁡ ( I ) x A {\displaystyle \textstyle \lim _{A\in \operatorname {Finite} (I)}x_{A}} of the net ( x A ) A ∈ Finite ⁡ ( I ) {\displaystyle \left(x_{A}\right)_{A\in \operatorname {Finite} (I)}} exists in  X , {\displaystyle X,} where  Finite ⁡ ( I ) {\displaystyle \operatorname {Finite} (I)} is the directed set of all finite subsets of  I {\displaystyle I} directed by inclusion  ⊆ {\displaystyle \,\subseteq \,} and  x A := ∑ i ∈ A x i . {\textstyle x_{A}:=\sum _{i\in A}x_{i}.}

It is called absolutely summable if in addition, for every continuous seminorm  p {\displaystyle p} on  X , {\displaystyle X,} the family  ( p ( x i ) ) i ∈ I {\displaystyle \left(p\left(x_{i}\right)\right)_{i\in I}} is summable. If  X {\displaystyle X} is a normable space and if  ( x i ) i ∈ I {\displaystyle \left(x_{i}\right)_{i\in I}} is an absolutely summable family in  X , {\displaystyle X,} then necessarily all but a countable collection of  x i {\displaystyle x_{i}} ’s are zero. Hence, in normed spaces, it is usually only ever necessary to consider series with countably many terms.

Summable families play an important role in the theory of nuclear spaces.

### Series in Banach and seminormed spaces

[edit]

The notion of series can be easily extended to the case of a seminormed space. If  x n {\displaystyle x_{n}} is a sequence of elements of a normed space  X {\displaystyle X} and if  x ∈ X {\displaystyle x\in X} then the series  ∑ x n {\displaystyle \textstyle \sum x_{n}} converges to  x {\displaystyle x} in  X {\displaystyle X} if the sequence of partial sums of the series  ( ∑ n = 0 N x n ) N = 1 ∞ {\textstyle {\bigl (}\\!\\!~\sum _{n=0}^{N}x_{n}{\bigr )}_{N=1}^{\infty }} converges to  x {\displaystyle x} in  X {\displaystyle X} ; to wit,

‖ x − ∑ n = 0 N x n ‖ -> 0 as N -> ∞ . {\displaystyle {\Biggl \|}x-\sum _{n=0}^{N}x_{n}{\Biggr \|}\to 0\quad {\text{ as }}N\to \infty .}

More generally, convergence of series can be defined in any abelian Hausdorff topological group. Specifically, in this case,  ∑ x n {\displaystyle \textstyle \sum x_{n}} converges to  x {\displaystyle x} if the sequence of partial sums converges to  x . {\displaystyle x.}

If  ( X , | ⋅ | ) {\displaystyle (X,|\cdot |)} is a seminormed space, then the notion of absolute convergence becomes: A series  ∑ i ∈ I x i {\textstyle \sum _{i\in I}x_{i}} of vectors in  X {\displaystyle X} converges absolutely if

∑ i ∈ I | x i | < + ∞ {\displaystyle \sum _{i\in I}\left|x_{i}\right|<+\infty }

in which case all but at most countably many of the values  | x i | {\displaystyle \left|x_{i}\right|} are necessarily zero.

If a countable 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

[edit]

Conditionally convergent series can be considered if  I {\displaystyle I} is a well-ordered set, for example, an ordinal number α 0 . {\displaystyle \alpha _{0}.} In this case, define by transfinite recursion:

∑ β < α + 1 a β = a α + ∑ β < α a β {\displaystyle \sum _{\beta <\alpha +1}\\!a_{\beta }=a_{\alpha }+\sum _{\beta <\alpha }a_{\beta }}

and for a limit ordinal  α , {\displaystyle \alpha ,}

∑ β < α a β = lim γ -> α ∑ β < γ a β {\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 , {\displaystyle \alpha _{0},} then the series converges.

### Examples

[edit]

* Given a function  f : X -> Y {\displaystyle f:X\to Y} into an abelian topological group  Y , {\displaystyle Y,} define for every  a ∈ X , {\displaystyle a\in X,} f a ( x ) = { 0 x ≠ a , f ( a ) x = a , {\displaystyle f_{a}(x)={\begin{cases}0&x\neq a,\\\f(a)&x=a,\\\\\end{cases}}} a function whose support is a singleton { a } . {\displaystyle \\{a\\}.} Then  f = ∑ a ∈ X f a {\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  Y X {\displaystyle \textstyle Y^{X}} ).
* In the definition of partitions of unity, one constructs sums of functions over arbitrary index set  I , {\displaystyle I,} ∑ i ∈ I φ i ( x ) = 1. {\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 , {\displaystyle 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 {\displaystyle x} there is a neighborhood of  x {\displaystyle x} in which all but a finite number of functions vanish. Any regularity property of the  φ i , {\displaystyle \varphi _{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.
* On the first uncountable ordinal ω 1 {\displaystyle \omega _{1}} viewed as a topological space in the order topology, the constant function  f : [ 0 , ω 1 ) -> [ 0 , ω 1 ] {\displaystyle f:\left[0,\omega _{1}\right)\to \left[0,\omega _{1}\right]} given by  f ( α ) = 1 {\displaystyle f(\alpha )=1} satisfies  ∑ α ∈ [ 0 , ω 1 ) f ( α ) = ω 1 {\displaystyle \sum _{\alpha \in [0,\omega _{1})}\\!\\!\\!f(\alpha )=\omega _{1}} (in other words,  ω 1 {\displaystyle \omega _{1}} copies of 1 is  ω 1 {\displaystyle \omega _{1}} ) only if one takes a limit over all countable partial sums, rather than finite partial sums. This space is not separable.

## See also

[edit]

* Continued fraction
* Convergence tests
* Convergent series
* Divergent series
* Infinite compositions of analytic functions
* Infinite expression
* Infinite product
* Iterated binary operation
* List of mathematical series
* Prefix sum
* Sequence transformation
* Series expansion

## Notes

[edit]

1. ^ Thompson, Silvanus; Gardner, Martin (1998). Calculus Made Easy. Macmillan. ISBN 978-0-312-18548-0.
2. ^ Huggett, Nick (2024), "Zeno's Paradoxes", in Zalta, Edward N.; Nodelman, Uri (eds.), The Stanford Encyclopedia of Philosophy (Spring 2024 ed.), Metaphysics Research Lab, Stanford University, retrieved 2024-03-25
3. ^ Apostol 1967, pp. 374–375
4. ^ Swain, Gordon; Dence, Thomas (1998). "Archimedes' Quadrature of the Parabola Revisited". Mathematics Magazine. 71 (2): 123–130\. doi:10.2307/2691014. ISSN 0025-570X. JSTOR 2691014.
5. ^ a b Russo, Lucio (2004). The Forgotten Revolution. Translated by Levy, Silvio. Germany: Springer-Verlag. pp. 49–52\. ISBN 978-3-540-20396-4.
6. ^ Apostol 1967, p. 377
7. ^ Apostol 1967, p. 378
8. ^ a b c Apostol 1967, p. 37
9. ^ a b c d e f Spivak 2008, pp. 471–472
10. ^ a b c d e Apostol 1967, p. 384
11. ^ a b c d e f Ablowitz, Mark J.; Fokas, Athanassios S. (2003). Complex Variables: Introduction and Applications (2nd ed.). Cambridge University Press. p. 110\. ISBN 978-0-521-53429-1.
12. ^ a b Dummit, David S.; Foote, Richard M. (2004). Abstract Algebra (3rd ed.). Hoboken, NJ: John Wiley and Sons. p. 238\. ISBN 978-0-471-43334-7.
13. ^ a b c d Spivak 2008, pp. 486–487, 493
14. ^ a b Wilf, Herbert S. (1990). Generatingfunctionology. San Diego: Academic Press. pp. 27–28\. ISBN 978-1-48-324857-8.
15. ^ Swokoski, Earl W. (1983). Calculus with Analytic Geometry (Alternate ed.). Boston: Prindle, Weber & Schmidt. p. 501\. ISBN 978-0-87150-341-1.
16. ^ a b c d Rudin 1976, p. 59
17. ^ Spivak 2008, p. 426
18. ^ Apostol 1967, p. 281
19. ^ Rudin 1976, p. 63
20. ^ a b c d e Spivak 2008, pp. 473–478
21. ^ a b c d e Apostol 1967, pp. 388–390, 399–401
22. ^ a b c Rudin 1976, p. 61
23. ^ Spivak 2008, p. 453
24. ^ Knuth, Donald E. (1992). "Two Notes on Notation". American Mathematical Monthly. 99 (5): 403–422\. doi:10.2307/2325085. JSTOR 2325085.
25. ^ Atkinson, Kendall E. (1989). An Introduction to Numerical Analysis (2nd ed.). New York: Wiley. p. 20\. ISBN 978-0-471-62489-9. OCLC 803318878.
26. ^ Stoer, Josef; Bulirsch, Roland (2002). Introduction to Numerical Analysis (3rd ed.). Princeton, N.J.: Recording for the Blind & Dyslexic. OCLC 50556273.
27. ^ Wilkins, David (2007). "Section 6: The Extended Real Number System" (PDF). maths.tcd.ie. Retrieved 2019-12-03.
28. ^ a b Kifowit, Steven J.; Stamps, Terra A. (2006). "The harmonic series diverges again and again" (PDF). American Mathematical Association of Two-Year Colleges Review. 27 (2): 31–43.
29. ^ a b c Spivak 2008, p. 496
30. ^ a b Rudin 1976, p. 61
31. ^ Spivak 2008, pp. 483–486
32. ^ Apostol 1967, pp. 412–414
33. ^ Rudin 1976, p. 76
34. ^ Spivak 2008, p. 482
35. ^ a b c Apostol 1967, pp. 385–386
36. ^ a b c Saff, E. B.; Snider, Arthur D. (2003). Fundamentals of Complex Analysis (3rd ed.). Pearson Education. pp. 247–249\. ISBN 0-13-907874-6.
37. ^ Rudin 1976, p. 72
38. ^ Rudin 1976, p. 73
39. ^ Rudin 1976, p. 74
40. ^ Apostol 1967, p. 384
41. ^ Apostol 1967, pp. 403–404
42. ^ Apostol 1967, p. 386
43. ^ a b Apostol 1967, p. 387
44. ^ Apostol 1967, p. 396
45. ^ Gasper, G., Rahman, M. (2004). Basic hypergeometric series. Cambridge University Press.
46. ^ Spivak 2008, p. 473
47. ^ a b c Rudin 1976, p. 60
48. ^ Apostol 1967, pp. 381, 394–395
49. ^ Spivak 2008, pp. 457, 473–474
50. ^ Rudin 1976, pp. 71–72
51. ^ Apostol 1967, pp. 395–396
52. ^ Spivak 2008, pp. 474–475
53. ^ Apostol 1967, p. 396
54. ^ Spivak 2008, p. 475–476
55. ^ a b Apostol 1967, pp. 399–401
56. ^ Spivak 2008, pp. 476–478
57. ^ Rudin 1976, p. 66
58. ^ Spivak 2008, p. 493
59. ^ Rudin 1976, p. 65
60. ^ Apostol 1967, pp. 397–398
61. ^ Spivak 2008, pp. 478–479
62. ^ Apostol 1967, pp. 403–404
63. ^ Spivak 2008, p. 481
64. ^ Rudin 1976, p. 71
65. ^ Apostol 1967, pp. 413–414
66. ^ Spivak 2008, pp. 482–483
67. ^ a b Apostol 1967, pp. 407–409
68. ^ Spivak 2008, p. 495
69. ^ Rudin 1976, p. 70
70. ^ Spivak 2008, p. 524
71. ^ Positive and Negative Terms: Alternating Series
72. ^ Johansson, F. (2016). Computing hypergeometric functions rigorously. arXiv preprint arXiv:1606.06977.
73. ^ Higham, N. J. (2008). Functions of matrices: theory and computation. Society for Industrial and Applied Mathematics.
74. ^ Higham, N. J. (2009). The scaling and squaring method for the matrix exponential revisited. SIAM review, 51(4), 747-764.
75. ^ How and How Not to Compute the Exponential of a Matrix
76. ^ Nicolas Bourbaki (1989), Algebra, Springer: §III.2.11.
77. ^ Huggett, Nick (2024), "Zeno's Paradoxes", in Zalta, Edward N.; Nodelman, Uri (eds.), The Stanford Encyclopedia of Philosophy (Spring 2024 ed.), Metaphysics Research Lab, Stanford University, retrieved 2024-03-25
78. ^ Snyder, H. (1947), "Quantized space-time", Physical Review, 67 (1): 38–41, Bibcode:1947PhRv...71...38S, doi:10.1103/PhysRev.71.38.
79. ^ "The Unraveling of Space-Time". Quanta Magazine. 2024-09-25. Retrieved 2024-10-11.
80. ^ O'Connor, J.J. & Robertson, E.F. (1996). "A history of calculus". University of St Andrews. Retrieved 2007-08-07.
81. ^ Bidwell, James K. (30 November 1993). "Archimedes and Pi-Revisited". School Science and Mathematics. 94 (3): 127–129\. doi:10.1111/j.1949-8594.1994.tb15638.x.
82. ^ "Indians predated Newton 'discovery' by 250 years". manchester.ac.uk.
83. ^ Jean Dieudonné, Foundations of mathematical analysis, Academic Press
84. ^ Bourbaki, Nicolas (1998). General Topology: Chapters 1–4. Springer. pp. 261–270\. ISBN 978-3-540-64241-1.
85. ^ Choquet, Gustave (1966). Topology. Academic Press. pp. 216–231\. ISBN 978-0-12-173450-3.
86. ^ Schaefer, Helmut H.; Wolff, Manfred P. (1999). Topological Vector Spaces. Graduate Texts in Mathematics. Vol. 8 (2nd ed.). New York, NY: Springer. pp. 179–180\. ISBN 978-1-4612-7155-0.

## References

[edit]

* Apostol, Tom M. (1967) [1961]. Calculus. Vol. 1 (2nd ed.). John Wiley & Sons. ISBN 0-471-00005-1.
* Rudin, Walter (1976) [1953]. Principles of Mathematical Analysis (3rd ed.). New York: McGraw-Hill. ISBN 0-07-054235-X. OCLC 1502474.
* Spivak, Michael (2008) [1967]. Calculus (4th ed.). Houston, TX: Publish or Perish. ISBN 978-0-914098-91-1.

## Further reading

[edit]

* Bromwich, T. J. (1926). An Introduction to the Theory of Infinite Series (2nd ed.). MacMillan.
* Dvoretzky, Aryeh; Rogers, C. Ambrose (1950). "Absolute and unconditional convergence in normed linear spaces". Proc. Natl. Acad. Sci. U.S.A. 36 (3): 192–197\. Bibcode:1950PNAS...36..192D. doi:10.1073/pnas.36.3.192. PMC 1063182. PMID 16588972.
* Narici, Lawrence; Beckenstein, Edward (2011). Topological Vector Spaces (2nd ed.). Boca Raton, FL: CRC Press. ISBN 978-1584888666.
* Swokowski, Earl W. (1983), Calculus with analytic geometry (Alternate ed.), Boston: Prindle, Weber & Schmidt, ISBN 978-0-87150-341-1
* Pietsch, Albrecht (1972). Nuclear locally convex spaces. Berlin, New York: Springer-Verlag. ISBN 0-387-05644-0. OCLC 539541.
* Robertson, A. P. (1973). Topological vector spaces. Cambridge England: University Press. ISBN 0-521-29882-2.
* Ryan, Raymond (2002). Introduction to tensor products of Banach spaces. London New York: Springer. ISBN 1-85233-437-1. OCLC 48092184.
* Schaefer, Helmut H.; Wolff, Manfred P. (1999). Topological Vector Spaces (2nd ed.). New York: Springer. ISBN 978-1-4612-7155-0.
* Trèves, François (1967). Topological Vector Spaces, Distributions and Kernels. New York: Academic Press. Reprinted by Dover, 2006, ISBN 978-0-486-45352-1.
* Wong (1979). Schwartz spaces, nuclear spaces, and tensor products. Berlin New York: Springer-Verlag. ISBN 3-540-09513-6. OCLC 5126158.

## External links

[edit]

Wikimedia Commons has media related to Series (mathematics).

* "Series", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
* Infinite Series Tutorial
* "Series-TheBasics". Paul's Online Math Notes.
* "Show-Me Collection of Series" (PDF). Leslie Green.

* v
* t
* e

Sequences and series

Integer sequences|

| Basic|

* Arithmetic progression
* Geometric progression
* Harmonic progression
* Square number
* Cubic number
* Factorial
* Powers of two
* Powers of three
* Powers of 10

|

Advanced (list)|

* Complete sequence
* Fibonacci sequence
* Figurate number
* Heptagonal number
* Hexagonal number
* Lucas number
* Pell number
* Pentagonal number
* Polygonal number
* Triangular number
* array

Properties of sequences|

* Cauchy sequence
* Monotonic function
* Periodic sequence

Properties of series|

| Series|

* Alternating
* Convergent
* Divergent
* Telescoping

|

Convergence|

* Absolute
* Conditional
* Uniform

Explicit series|

| Convergent|

* 1/2 − 1/4 + 1/8 − 1/16 + ⋯
* 1/2 + 1/4 + 1/8 + 1/16 + ⋯
* 1/4 + 1/16 + 1/64 + 1/256 + ⋯
* 1 + 1/2s \+ 1/3s \+ ... (Riemann zeta function)

|

Divergent|

* 1 + 1 + 1 + 1 + ⋯
* 1 − 1 + 1 − 1 + ⋯ (Grandi's series)
* 1 + 2 + 3 + 4 + ⋯
* 1 − 2 + 3 − 4 + ⋯
* 1 + 2 + 4 + 8 + ⋯
* 1 − 2 + 4 − 8 + ⋯
* Infinite arithmetic series
* 1 − 1 + 2 − 6 + 24 − 120 + ⋯ (alternating factorials)
* 1 + 1/2 + 1/3 + 1/4 + ⋯ (harmonic series)
* 1/2 + 1/3 + 1/5 + 1/7 + 1/11 + ⋯ (inverses of primes)

Kinds of series|

* Taylor series
* Power series
* Formal power series
* Laurent series
* Puiseux series
* Dirichlet series
* Trigonometric series
* Fourier series
* Generating series

Hypergeometric series|

* Generalized hypergeometric series
* Hypergeometric function of a matrix argument
* Lauricella hypergeometric series
* Modular hypergeometric series
* Riemann's differential equation
* Theta hypergeometric series

* Category

* v
* t
* e

Major topics in mathematical analysis

* Calculus: Integration
* Differentiation
* Differential equations
* ordinary
* partial
* stochastic
* Fundamental theorem of calculus
* Calculus of variations
* Vector calculus
* Tensor calculus
* Matrix calculus
* Lists of integrals
* Table of derivatives

* Real analysis
* Complex analysis
* Hypercomplex analysis (quaternionic analysis)
* Functional analysis
* Fourier analysis
* Least-squares spectral analysis
* Harmonic analysis
* P-adic analysis (P-adic numbers)
* Measure theory
* Representation theory

* Functions
* Continuous function
* Special functions
* Limit
* Series
* Infinity

Mathematics portal

Authority control databases

International|

* FAST

National|

* Germany
* United States
* France
* BnF data
* Japan
* Czech Republic
* Spain
* Israel

Other|

* Yale LUX

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template
*[c.]: circa