Convergent series explained

In mathematics, a series is the sum of the terms of an infinite sequence of numbers. More precisely, an infinite sequence

(a1,a2,a3,\ldots)

defines a series that is denoted

S=a1+a2+a3+

infty
… =\sum
k=1

ak.

The th partial sum is the sum of the first terms of the sequence; that is,

Sn=a1+a2++an=

n
\sum
k=1

ak.

A series is convergent (or converges) if and only if the sequence

(S1,S2,S3,...)

of its partial sums tends to a limit; that means that, when adding one

ak

after the other in the order given by the indices, one gets partial sums that become closer and closer to a given number. More precisely, a series converges, if and only if there exists a number

\ell

such that for every arbitrarily small positive number

\varepsilon

, there is a (sufficiently large) integer

N

such that for all

n\geN

,

\left|Sn-\ell\right|<\varepsilon.

If the series is convergent, the (necessarily unique) number

\ell

is called the sum of the series.

The same notation

infty
\sum
k=1

ak

is used for the series, and, if it is convergent, to its sum. This convention is similar to that which is used for addition: denotes the operation of adding and as well as the result of this addition, which is called the sum of and .

Any series that is not convergent is said to be divergent or to diverge.

Examples of convergent and divergent series

{1\over1}+{1\over2}+{1\over3}+{1\over4}+{1\over5}+{1\over6}+ … infty.

{1\over1}-{1\over2}+{1\over3}-{1\over4}+{1\over5}- … =ln(2)

{1\over2}+{1\over3}+{1\over5}+{1\over7}+{1\over11}+{1\over13}+ … infty.

{1\over1}+{1\over3}+{1\over6}+{1\over10}+{1\over15}+{1\over21}+ … =2.

1
1

+

1
1

+

1
2

+

1
6

+

1
24

+

1
120

+=e.

{1\over1}+{1\over4}+{1\over9}+{1\over16}+{1\over25}+{1\over36}+ … ={\pi2\over6}.

{1\over1}+{1\over2}+{1\over4}+{1\over8}+{1\over16}+{1\over32}+ … =2.

{1\over1}+{1\overn}+{1\overn2}+{1\overn3}+{1\overn4}+{1\overn5}+ … ={n\overn-1}.

{1\over1}-{1\over2}+{1\over4}-{1\over8}+{1\over16}-{1\over32}+ … ={2\over3}.

{1\over1}-{1\overn}+{1\overn2}-{1\overn3}+{1\overn4}-{1\overn5}+ … ={n\overn+1}.

1
1

+

1
1

+

1
2

+

1
3

+

1
5

+

1
8

+=\psi.

Convergence tests

See main article: Convergence tests.

There are a number of methods of determining whether a series converges or diverges.Comparison test. The terms of the sequence

\left\{an\right\}

are compared to those of another sequence

\left\{bn\right\}

. If,for all n,

0\lean\lebn

, and \sum_^\infty b_n converges, then so does \sum_^\infty a_n.

However,if, for all n,

0\lebn\lean

, and \sum_^\infty b_n diverges, then so does \sum_^\infty a_n.

Ratio test. Assume that for all n,

an

is not zero. Suppose that there exists

r

such that

\limn\left|{

an+1
an
}\right| = r.

If r < 1, then the series is absolutely convergent. If then the series diverges. If the ratio test is inconclusive, and the series may converge or diverge.

Root test or nth root test. Suppose that the terms of the sequence in question are non-negative. Define r as follows:

r=\limsupn\toinfty\sqrt[n]{|an|},

where "lim sup" denotes the limit superior (possibly ∞; if the limit exists it is the same value).

If r < 1, then the series converges. If then the series diverges. If the root test is inconclusive, and the series may converge or diverge.

The ratio test and the root test are both based on comparison with a geometric series, and as such they work in similar situations. In fact, if the ratio test works (meaning that the limit exists and is not equal to 1) then so does the root test; the converse, however, is not true. The root test is therefore more generally applicable, but as a practical matter the limit is often difficult to compute for commonly seen types of series.

Integral test. The series can be compared to an integral to establish convergence or divergence. Let

f(n)=an

be a positive and monotonically decreasing function. If
infty
\int
1

f(x)dx=\limt

t
\int
1

f(x)dx<infty,

then the series converges. But if the integral diverges, then the series does so as well.

Limit comparison test. If

\left\{an\right\},\left\{bn\right\}>0

, and the limit

\limn

an
bn
exists and is not zero, then \sum_^\infty a_n converges if and only if \sum_^\infty b_n converges.

Alternating series test. Also known as the Leibniz criterion, the alternating series test states that for an alternating series of the form \sum_^\infty a_n (-1)^n, if

\left\{an\right\}

is monotonically decreasing, and has a limit of 0 at infinity, then the series converges.

Cauchy condensation test. If

\left\{an\right\}

is a positive monotone decreasing sequence, then \sum_^\infty a_n converges if and only if \sum_^\infty 2^k a_ converges.

Dirichlet's test

Abel's test

Conditional and absolute convergence

For any sequence

\left\{a1,a2,a3,...\right\}

,

an\le\left|an\right|

for all n. Therefore,
infty
\sum
n=1

an\le

infty
\sum
n=1

\left|an\right|.

This means that if \sum_^\infty \left| a_n \right| converges, then \sum_^\infty a_n also converges (but not vice versa).

If the series \sum_^\infty \left| a_n \right| converges, then the series \sum_^\infty a_n is absolutely convergent. The Maclaurin series of the exponential function is absolutely convergent for every complex value of the variable.

ln(1+x)

is conditionally convergent for .

The Riemann series theorem states that if a series converges conditionally, it is possible to rearrange the terms of the series in such a way that the series converges to any value, or even diverges.

Uniform convergence

See main article: Uniform convergence.

Let

\left\{f1,f2,f3,...\right\}

be a sequence of functions. The series \sum_^\infty f_n is said to converge uniformly to fif the sequence

\{sn\}

of partial sums defined by

sn(x)=

n
\sum
k=1

fk(x)

converges uniformly to f.

There is an analogue of the comparison test for infinite series of functions called the Weierstrass M-test.

Cauchy convergence criterion

The Cauchy convergence criterion states that a series

infty
\sum
n=1

an

converges if and only if the sequence of partial sums is a Cauchy sequence.This means that for every

\varepsilon>0,

there is a positive integer

N

such that for all

n\geqm\geqN

we have

\left|

n
\sum
k=m

ak\right|<\varepsilon.

This is equivalent to

\limm\left(\supn>m

n
\left|\sum
k=m

ak\right|\right)=0.

See also

External links