Interactive Real Analysis - part of MathCS.org

Next | Previous | Glossary | Map | Discussion

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.

Proof:

Suppose is absolutely convergent. Then the sequence
Sn = |a1| + |a2| + ... + | an|
converges. In particular, it is bounded, i.e. |Sn| < K for some number K. If we take any rearrangement of terms in the series and form a new sequence of partial sums:
Tn = | | + | | + ... | |
then Tn is again bounded by the same number K. But since all terms in the partial sum Tn are positive the sequence is monotone increasing. Therefore {Tn} 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:

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

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

Next | Previous | Glossary | Map | Discussion