# Alternating series test

__: Method used to show that an alternating series is convergent__

**Short description**Part of a series of articles about |

Calculus |
---|

In mathematical analysis, the **alternating series test** is the method used to show that an alternating series is convergent when its terms (1) decrease in absolute value, and (2) approach zero in the limit.
The test was used by Gottfried Leibniz and is sometimes known as **Leibniz's test**, **Leibniz's rule**, or the **Leibniz criterion**. The test is only sufficient, not necessary, so some convergent alternating series may fail the first part of the test.

## Formal Statement

### Alternating series test

A series of the form

- [math]\displaystyle{ \sum_{n=0}^\infty (-1)^{n} a_n = a_0-a_1 + a_2 - a_3 + \cdots \! }[/math]

where either all *a*_{n} are positive or all *a*_{n} are negative, is called an alternating series.

The **alternating series test** guarantees that an alternating series converges if the following two conditions are met:

- [math]\displaystyle{ |a_n| }[/math] decreases monotonically
^{[1]}, i.e., [math]\displaystyle{ |a_{n+1}|\leq|a_n| }[/math], and - [math]\displaystyle{ \lim_{n \to \infty} a_n = 0 }[/math]

### Alternating series estimation theorem

Moreover, let *L* denote the sum of the series, then the partial sum

- [math]\displaystyle{ S_k = \sum_{n=0}^k (-1)^{n} a_n\! }[/math]

approximates *L* with error bounded by the next omitted term:

- [math]\displaystyle{ \left | S_k - L \right \vert \le \left | S_k - S_{k+1} \right \vert = a_{k+1}.\! }[/math]

## Proof

Suppose we are given a series of the form [math]\displaystyle{ \sum_{n=1}^\infty (-1)^{n-1} a_n\! }[/math], where [math]\displaystyle{ \lim_{n\rightarrow\infty}a_{n}=0 }[/math] and [math]\displaystyle{ a_n \geq a_{n+1} }[/math] for all natural numbers *n*. (The case [math]\displaystyle{ \sum_{n=1}^\infty (-1)^{n} a_n\! }[/math] follows by taking the negative.)^{[1]}

### Proof of the alternating series test

We will prove that both the partial sums [math]\displaystyle{ S_{2m+1}=\sum_{n=1}^{2m+1} (-1)^{n-1} a_n }[/math] with odd number of terms, and [math]\displaystyle{ S_{2m}=\sum_{n=1}^{2m} (-1)^{n-1} a_n }[/math] with even number of terms, converge to the same number *L*. Thus the usual partial sum [math]\displaystyle{ S_k=\sum_{n=1}^k (-1)^{n-1} a_n }[/math] also converges to *L*.

The odd partial sums decrease monotonically:

- [math]\displaystyle{ S_{2(m+1)+1}=S_{2m+1}-a_{2m+2}+a_{2m+3} \leq S_{2m+1} }[/math]

while the even partial sums increase monotonically:

- [math]\displaystyle{ S_{2(m+1)}=S_{2m}+a_{2m+1}-a_{2m+2} \geq S_{2m} }[/math]

both because *a*_{n} decreases monotonically with *n*.

Moreover, since *a*_{n} are positive, [math]\displaystyle{ S_{2m+1}-S_{2m}=a_{2m+1} \geq 0 }[/math]. Thus we can collect these facts to form the following suggestive inequality:

- [math]\displaystyle{ a_1 - a_2 = S_2 \leq S_{2m} \leq S_{2m+1} \leq S_1 = a_1. }[/math]

Now, note that *a*_{1} − *a*_{2} is a lower bound of the monotonically decreasing sequence *S*_{2m+1}, the monotone convergence theorem then implies that this sequence converges as *m* approaches infinity. Similarly, the sequence of even partial sum converges too.

Finally, they must converge to the same number because

- [math]\displaystyle{ \lim_{m\to\infty}(S_{2m+1}-S_{2m})=\lim_{m\to\infty}a_{2m+1}=0. }[/math]

Call the limit *L*, then the monotone convergence theorem also tells us extra information that

- [math]\displaystyle{ S_{2m} \leq L \leq S_{2m+1} }[/math]

for any *m*. This means the partial sums of an alternating series also "alternates" above and below the final limit. More precisely, when there is an odd (even) number of terms, i.e. the last term is a plus (minus) term, then the partial sum is above (below) the final limit.

This understanding leads immediately to an error bound of partial sums, shown below.

### Proof of the alternating series estimation theorem

We would like to show [math]\displaystyle{ \left| S_k - L \right| \leq a_{k+1}\! }[/math] by splitting into two cases.

When k = 2m+1, i.e. odd, then

- [math]\displaystyle{ \left| S_{2m+1} - L \right| = S_{2m+1} - L \leq S_{2m+1} - S_{2m+2} = a_{(2m+1)+1} }[/math]

When k = 2m, i.e. even, then

- [math]\displaystyle{ \left| S_{2m} - L \right| = L - S_{2m} \leq S_{2m+1} - S_{2m} = a_{2m+1} }[/math]

as desired.

Both cases rely essentially on the last inequality derived in the previous proof.

For an alternative proof using Cauchy's convergence test, see Alternating series.

For a generalization, see Dirichlet's test.

## Examples

### A typical example

The alternating harmonic series [math]\displaystyle{ \sum_{n=1}^\infty\frac{(-1)^{n+1}}{n}=1-\frac{1}{2}+\frac{1}{3}-\frac{1}{4}+\frac{1}{5}-\cdots }[/math]meets both conditions for the alternating series test and converges.

### An example to show monotonicity is needed

All of the conditions in the test, namely convergence to zero and monotonicity, should be met in order for the conclusion to be true. For example, take the series

- [math]\displaystyle{ \frac{1}{\sqrt{2}-1}-\frac{1}{\sqrt{2}+1}+\frac{1}{\sqrt{3}-1}-\frac{1}{\sqrt{3}+1}+\cdots }[/math]

The signs are alternating and the terms tend to zero. However, monotonicity is not present and we cannot apply the test. Actually the series is divergent. Indeed, for the partial sum [math]\displaystyle{ S_{2n} }[/math] we have [math]\displaystyle{ S_{2n}=\frac{2}{1}+\frac{2}{2}+\frac{2}{3}+\cdots+\frac{2}{n-1} }[/math] which is twice the partial sum of the harmonic series, which is divergent. Hence the original series is divergent.

### The test is only sufficient, not necessary

Leibniz test's monotonicity is not a necessary condition, thus the test itself is only sufficient, but not necessary. (The second part of the test is well known necessary condition of convergence for all series.) Examples of nonmonotonic series that converge are [math]\displaystyle{ \sum_{n=2}^\infty \dfrac{(-1)^n}{n+(-1)^n} }[/math] and [math]\displaystyle{ \sum_{n=1}^{\infty} (-1)^n\dfrac{\cos^2n}{n^2}. }[/math]

## See also

## Notes

**^**In practice, the first few terms may increase. What is important is that [math]\displaystyle{ b_{n} \geq b_{n+1} }[/math] for all [math]\displaystyle{ n }[/math] after some point,^{[2]}because the first finite amount of terms would not change a series' convergence/divergence.

## References

- ↑ The proof follows the idea given by James Stewart (2012) “Calculus: Early Transcendentals, Seventh Edition” pp. 727–730. ISBN:0-538-49790-4
- ↑ Dawkins, Paul. "Calculus II - Alternating Series Test". Lamar University. http://tutorial.math.lamar.edu/Classes/CalcII/AlternatingSeries.aspx.

- Konrad Knopp (1956)
*Infinite Sequences and Series*, § 3.4, Dover Publications ISBN:0-486-60153-6 - Konrad Knopp (1990)
*Theory and Application of Infinite Series*, § 15, Dover Publications ISBN:0-486-66165-2 - James Stewart, Daniel Clegg, Saleem Watson (2016)
*Single Variable Calculus: Early Transcendentals (Instructor's Edition) 9E*, Cengage ISBN 978-0-357-02228-9 - E. T. Whittaker & G. N. Watson (1963)
*A Course in Modern Analysis*, 4th edition, §2.3,*Cambridge University Press*ISBN:0-521-58807-3

## External links

- Weisstein, Eric W.. "Leibniz Criterion". http://mathworld.wolfram.com/LeibnizCriterion.html.
- Jeff Cruzan. "Alternating series"

Original source: https://en.wikipedia.org/wiki/Alternating series test.
Read more |