Cauchy's convergence test

The Cauchy convergence test is a method used to test infinite series for convergence. It relies on bounding sums of terms in the series. This convergence criterion is named after Augustin-Louis Cauchy who published it in his textbook Cours d'Analyse 1821.[1]

Statement

A series

${\displaystyle \sum _{i=0}^{\infty }a_{i}}$ is convergent if and only if for every ${\displaystyle \varepsilon >0}$ there is a natural number N such that

${\displaystyle |a_{n+1}+a_{n+2}+\cdots +a_{n+p}|<\varepsilon }$

holds for all n > N and all p ≥ 1.[2]

Explanation

(a) The plot of a Cauchy sequence ${\displaystyle (x_{n}),}$ shown in blue, as ${\displaystyle x_{n}}$ versus ${\displaystyle n}$ If the space containing the sequence is complete, the "ultimate destination" of this sequence (that is, the limit) exists.

(b) A sequence that is not Cauchy. The elements of the sequence fail to get arbitrarily close to each other as the sequence progresses.

The test works because the space R of real numbers and the space C of complex numbers (with the metric given by the absolute value) are both complete. Then the series is convergent if and only if the partial sum

${\displaystyle s_{n}:=\sum _{i=0}^{n}a_{i}}$

is a Cauchy sequence.

A sequence of real or complex numbers ${\displaystyle s_{n}}$ is a Cauchy sequence if and only if ${\displaystyle s_{n}}$ converges (to some point a in R or C).[3] The formal definition states that for every ${\displaystyle \varepsilon >0}$ there is a number N, such that for all n, m > N holds

${\displaystyle |s_{m}-s_{n}|<\varepsilon .}$

We will assume m > n and thus set p = m − n.

${\displaystyle |s_{n+p}-s_{n}|=|a_{n+1}+a_{n+2}+\cdots +a_{n+p}|<\varepsilon .}$

Showing that a sequence is a Cauchy sequence is useful since we do not need to know the limit of the sequence in question. Cauchy's convergence test can only be used in complete metric spaces (such as R and C), which are spaces where all Cauchy sequences converge. We need only show that its elements become arbitrarily close to each other after a finite progression in the sequence. There are computer applications of the Cauchy sequence, in which an iterative process may be set up to create such sequences.

Proof

We can use the results about convergence of the sequence of partial sums of the infinite series and apply them to the convergence of the infinite series itself. The Cauchy Criterion test is one such application. For any real sequence ${\displaystyle a_{k}}$, the above results on convergence imply that the infinite series

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

converges if and only if for every ${\displaystyle \varepsilon >0}$ there is a number N, such that

m ≥ n ≥ N imply

${\displaystyle |s_{m}-s_{n}|=\left|\sum _{k=n+1}^{m}a_{k}\right|<\varepsilon }$[4]

Probably the most interesting part of [this theorem] is that the Cauchy condition implies the existence of the limit: this is indeed related to the completeness of the real line. The Cauchy criterion can be generalized to a variety of situations, which can all be loosely summarized as "a vanishing oscillation condition is equivalent to convergence".[5]

This article incorporates material from Cauchy criterion for convergence on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.

References

1. cf. the answer to the question “Origin of Cauchy convergence test“ of the Q&A website “History of Science and Mathematics”
2. Abbott, Stephen (2001). Understanding Analysis, p.63. Springer, New York. ISBN 9781441928665
3. Wade, William (2010). An Introduction to Analysis. Upper Saddle River,NJ: Prentice Hall. p. 59. ISBN 9780132296380.
4. Wade, William (2010). An Introduction to Analysis. Upper Saddle River, NJ: Prentice Hall. p. 188. ISBN 9780132296380.
5. Encyclopedia of Mathematics. "Cauchy Criteria". European Mathematical Society. Retrieved 4 March 2014.