Theorem 4.1.6: Absolute Convergence and Rearrangement

Let be an absolutely convergent series. Then any rearrangement of terms in that series results in a new series that is also absolutely convergent to the same limit.
Let be a conditionally convergent series. Then, for any real number c there is a rearrangement of the series such that the new resulting series will converge to c.
Context

Proof:

Suppose

is absolutely convergent. Then the sequence

S_n = |a₁| + |a₂| + ... + | a_n|

converges. In particular, it is bounded, i.e. |S_n| < K for some number K. If we take any rearrangement of terms in the series and form a new sequence of partial sums:

T_n = | | + | | + ... | |

then T_n is again bounded by the same number K. But since all terms in the partial sum T_n are positive the sequence is monotone increasing. Therefore {T_n} is monotone increasing and bounded and must therefore converge.

It remains to show that the limit of the rearrangement is the same as the limit of the original series. That is left as an exercise.

Finally suppose the series converges conditionally. Let's first collect a few facts:

By the divergence test (which we will prove later) we know that the sequence of general terms a_n converges to zero.
The series does not converge absolutely.
Since the sequence of partial sums of absolute values is increasing it means that the series of absolute values must "converge" to positive infinity.
There must be infinitely many positive terms among the a_j. If we call them b_j and collect them to form a series then that new series must "converge" to positive infinity (why?).
There must be infinitely many negative terms among the a_j. If we call them c_j and collect them to form a series then that new series must "converge" to negative infinity (why?).

Now we can describe the idea of the proof, leaving the details as an exercise:

Collect enough b_j so that they add up to a number just bigger than c
Add as many terms from c_j as is necessary to make the resulting sum just less than c
Add again terms from b_j to be just bigger than c, then again terms from c_j to be less than c, and so on.

Then you can show that the resulting arrangment of b_j's and c_j indeed forms a series that converges to c. As usual, the details of this proof are left as an exercise.

Interactive Real Analysis, ver. 1.9.5
(c) 1994-2007, Bert G. Wachsmuth
Page last modified: Mar 28, 2007