Chapter VIII · The convergence of infinite series and infinite integrals
Dirichlet's theorem: rearranging a positive series
The sum of a convergent series of positive terms does not depend on the order of its terms, and the two-line reason why.
Why this matters
Addition of finitely many numbers is commutative: the order does not matter. Is the same true of the infinitely many terms of a series? A series is a limit of partial sums, and changing the order changes every partial sum, so there is something to prove. §176 proves that for series of positive terms the answer is yes. The answer for series with terms of both signs is a dramatic no (§193), and the contrast is one of the main themes of this chapter. The next lesson uses Dirichlet’s theorem at once, to multiply two series.
The idea
Take a convergent series of positive terms with sum , and write the same terms in another order: . Every must appear exactly once among the ’s, and every is one of the ’s.
Look at the first terms of the new series. They are finitely many of the ’s, so they all have indices at most some number . Since all terms are positive, their sum is at most the sum of all of , which is at most . So the new partial sums never exceed . That is half the proof, and the widget shows it.
Try this. With and the reversed-block order, move and watch the purple dot (the new partial sum ) and the hollow dot (the old partial sum ). Then try the other orders, and finally the divergent series .
- new order:
- original order:
- the sum s
- your , and (hollow)
What to notice
The new partial sums sometimes lag behind the old ones and never overtake the dashed line: each is at most , which is at most . And they always catch up, because after enough new terms every one of has appeared. For both sequences grow without bound in every order.
The other half is the same argument with the two series exchanged: the original series is a rearrangement of the new one. So each sum is at most the other, and they are equal.
Precise statements
A rearrangement of the series is a series whose terms are the same terms in another order: there is a one-to-one correspondence between the positions, so that every is exactly one and every is exactly one . No term may be left out and none repeated. (Putting “all the even-numbered terms first, then the odd-numbered ones” is not a rearrangement in this sense: the odd-numbered terms would never be reached.)
If is a convergent series of positive terms with sum , then every rearrangement of it converges, and its sum is .
If a series of positive terms diverges, every rearrangement of it diverges.
The corollary follows from the theorem: if some rearrangement converged, the original series, being a rearrangement of it, would converge too.
Proofs
Use Theorem B: a positive series converges exactly when its partial sums are bounded. Show that bounds the partial sums of the new series, so it converges to some . Then swap the roles of the two series to get .
Any finite selection of ’s adds up to at most
Take finitely many distinct terms and let be the largest of the indices. Since all terms are positive, adding the missing terms with indices up to can only increase the total: .
So the new partial sums are bounded by
The partial sum is such a finite selection, since the ’s are distinct terms of the original series. Hence for every .
The new series converges, with sum
By Theorem B (§173), converges. Its sum is the limit of numbers , so .
Exchange the roles
The original series is a rearrangement of the new one: every is some . The argument of the first two steps, with and exchanged, shows for every , hence .
Conclude
and , so .
Where did we use positivity? In the first step only: “adding the missing terms can only increase the total”. With negative terms allowed, a finite selection of terms can add up to more than any partial sum, and the argument collapses. It is not merely the proof that fails: for the series a suitable rearrangement converges to any number we like (§193). What survives is the case in which the series of absolute values converges (§192).
Worked examples and exercises
Show that
and that the series obtained from by omitting every term whose index is a multiple of has sum .
Hint
Hint
Solution
Let , the sum over odd and the sum over even . Both and converge, by comparison with . The series and written alternately () is just again, and the partial sums of the original series are sums of partial sums of and ; letting gives . (Equally, write the terms in the order “all of ’s first terms, then ’s first terms” blockwise: Dirichlet’s theorem guarantees the sum is unchanged.)
Now , so .
In the same way the terms with index divisible by are , so the remaining terms add up to .
Let . Show that if the bracketed series converges, then converges to the same sum. Why does this fail for ?
Hint
Solution
Let be the sum of the bracketed series; its partial sums are , so . Since the terms are positive, increases, and . So the odd partial sums are squeezed between even ones and also tend to . Hence .
For the bracketed series converges to , but the partial sums alternate . The squeeze used , which needs positive terms. Hardy removes brackets in exactly this way in the next section.
The numbers with are written as a single sequence in some order (every pair used exactly once). Show that the resulting series converges to , whatever the order.
Hint
Hint
Solution
In the “growing squares” order, the sum of all terms with is
These are some of the partial sums of the series in that order; since the terms are positive, the partial sums increase, and an increasing sequence with a subsequence tending to tends to . So this arrangement has sum , and by Dirichlet’s theorem every other arrangement does too. This is the idea of the next lesson.
Explain why the sequence “, followed by ” does not define a rearrangement of , and what its “partial sums” actually are.
Solution
A series is indexed by : every term must stand at some finite position. Here the term would have to come after infinitely many others, so it has no position . The partial sums of the sequence that is defined, , only ever see the even-indexed terms; for they tend to , not to . Dirichlet’s theorem does not apply because no term may be left out.
Check yourself
The sum of every convergent series is unchanged by rearranging its terms.
If is a convergent series of positive terms with sum , then every partial sum of every rearrangement is at most .
True: this is the first half of the proof. A partial sum of a rearrangement is a finite selection of the ’s, and a finite selection of positive terms is at most some , hence at most .
In the widget, the new partial sums sometimes lie below the old partial sums . Why does this not contradict ?
For each fixed , the terms all appear among the first terms of the new series for some , and then for all . So the may lag, but they catch up with every and never pass . The theorem claims equality of the limits, not of the partial sums.
Given that , what is ? (Give a decimal.)
By the first exercise it is .
Hardy’s language
Of course no terms must be omitted: every u must come somewhere among the v’s, and vice versa.
Summary
- A rearrangement uses every term exactly once, each at a finite position.
- Dirichlet’s theorem: a convergent positive series converges to the same sum in every order; a divergent one diverges in every order.
- Proof: any finite set of terms adds up to at most , so the new series converges with ; by symmetry .
- Positivity is used essentially; for series with infinitely many terms of each sign the theorem can fail.