Abel Convergence Test
Consider the series
. Suppose that
converges.
This test is rather sophisticated. Its main application is to prove the
Alternating Series test, but one can sometimes use it for other series as
well, if the more obvious tests do not work.
Proof:

- the partial sums
S N =
form a bounded sequence
- the sequence
is decreasing
- lim b n = 0

First, we need a lemma, called the Summation by Parts Lemma:
Lemma: Summation by Parts
Assuming this lemma is proved, we will use it as follows for Abel's Test:
Consider the two sequences
and
. Let
S N =
be the
n-th partial sum. Then for any
0
m
n
we have:
First, let's assume that the partial sums
S N
are bounded by, say, K. Next, since the sequence
converges to zero, we can choose an integer N such that
| b n | <
/ 2K.
Using the Summation by Parts lemma, we then have:
But the sequence![]()
![]()

But by our choice of N this is less than![]()

What remains to do is the proof of the lemma, which can be found here.