Split a series into its positive and negative parts; if the series of moduli converges, both parts converge, the series converges, and no rearrangement can change its sum.
The last lesson ended with a problem: when the signs of the terms change for ever, none of the tests for positive series applies. §191 gives the first and most useful way round it. Throw the signs away, test the series of sizes ∑∣un∣ with the old tests, and if it converges, conclude that ∑un converges too. Series that pass this test behave in every respect like series of positive terms. In particular, as §192 shows, their terms may be added in any order.
The idea
Take any real series ∑un and sort its terms into two piles. The positive partvn is un when un>0 and 0 otherwise; the negative partwn is −un when un<0 and 0 otherwise. Both are ≥0, and
un=vn−wn,∣un∣=vn+wn.
For example, for 1−221+321−⋯ the positive part is 1,0,321,0,521,… and the negative part is 0,221,0,421,….
So a series with mixed signs is the difference of two series of positive terms, and the series of moduli is their sum. Everything now depends on whether those two positive series converge.
ExploreThe two halves of a series
Try this.With ∑(−1)n−1/n2 selected, increase N to 20000 and watch the three curves. Then switch to ∑(−1)n−1/n and ∑(−1)n−1/n, and compare.
∑n=1∞n2(−1)n−1
Npartial sums
positive part VN=∑n≤Nvn
negative part WN=∑n≤Nwn
the series sN=VN−WN
its sum
At N=200: VN=1.2312, WN=0.408746, so ∑n≤N∣un∣=VN+WN=1.63995 and sN=VN−WN=0.822455. Both parts level off (at π2/8 and π2/24): the series is absolutely convergent, and its sum is the difference of two finite sums.
What to notice
For 1/n2 (and for sinn/n2) both the blue and the ochre curve level off, so the purple curve, their difference, settles too. For 1/n and 1/n both halves grow without bound, but they grow together, and their difference still settles. The first kind is absolutely convergent; the second kind, conditionally convergent, is the subject of the next lesson.
Precise statements
DefinitionAbsolute convergenceHardy: §191
The series ∑un is absolutely convergent if the series of moduli ∑∣un∣ is convergent.
The definition says nothing directly about ∑un itself. That it converges is a theorem, and Hardy warns that it is not a tautology: from the convergence of one series, ∑∣un∣, we must deduce the convergence of a different series.
TheoremAbsolutely convergent series convergeHardy: §191
If ∑un is absolutely convergent, then the series of its positive terms ∑vn and of its negative terms ∑wn both converge, ∑un converges, and
∑un=∑vn−∑wn,∑un≤∑∣un∣.
In §176 we met Dirichlet’s theorem: the sum of a convergent series of positive terms does not depend on the order of its terms. It carries over at once.
TheoremRearranging an absolutely convergent seriesHardy: §192
If ∑un is absolutely convergent with sum s, then every rearrangement of it (every series containing exactly the same terms, each once, in another order) is absolutely convergent with the same sum s.
Proofs
ProofAbsolutely convergent series converge
Strategy
Each of vn and wn is a positive term no larger than ∣un∣, so the comparison test makes both ∑vn and ∑wn converge. Then ∑un=∑(vn−wn) is the difference of two convergent series.
0≤vn≤∣un∣ and 0≤wn≤∣un∣
One of vn, wn equals ∣un∣ and the other is 0.
∑vn and ∑wn converge
They are series of positive terms dominated by the convergent series ∑∣un∣ (comparison, §173). Hardy phrases this as “a series selected from the terms of a convergent series of positive terms converges”: ∑vn is ∑∣un∣ with some terms replaced by 0.
Subtract
Write V=∑vn and W=∑wn. The partial sums of ∑un are sN=VN−WN, the difference of the partial sums of the two parts. Since VN→V and WN→W, we get sN→V−W (§77, Theorem (6)).
The inequality
∣sN∣≤∣u1∣+⋯+∣uN∣≤∑∣un∣ for every N. Let N→∞.
∎
The proof makes the point of the definition clear: absolute convergence means that the positive terms on their own, and the negative terms on their own, have finite totals. Nothing has to cancel.
ProofRearrangement does not change the sum
Strategy
Rearranging ∑un rearranges each of the two positive series ∑vn and ∑wn in the same way. Dirichlet’s theorem for positive series says neither total changes, so their difference does not change either.
Set up the rearrangement
Let ∑un′ be a rearrangement, and form vn′, wn′ from un′ as vn, wn were formed from un. Then ∑∣un′∣, ∑vn′, ∑wn′ are rearrangements of ∑∣un∣, ∑vn, ∑wn, which are all convergent series of positive terms.
Apply Dirichlet’s theorem three times
By §176, ∑∣un′∣ converges (so the new series is absolutely convergent), ∑vn′=∑vn=V, and ∑wn′=∑wn=W.
Conclude
By the previous theorem, ∑un′=V−W=∑un.
∎
You can test this. Below, the absolutely convergent series 1−221+321−⋯ is dealt out in blocks: p positive terms, then q negative ones, and so on. Every term is eventually used.
ExploreNo pattern moves the sum
Try this.Try blocks of 3 positive and 1 negative, then 1 positive and 5 negative, and look at the partial sums for 1000 terms. Then choose “chase a target” and set the target to 1.5.
Rearranging 1−221+321−⋯
terms usedpartial sum
after a positive term
after a negative term
original sum 0.82247
Order
After 300 terms (200 positive, 100 negative) the partial sum is 0.823705. Every term is used eventually, so this is a genuine rearrangement. Its sum is 0.822467, the same as before.
What to notice
Every pattern settles on the same value π2/12≈0.822, however lopsided. Chasing 1.5 fails: the positive terms on their own total only π2/8≈1.234, so the greedy rule ends up using positive terms only and never reaches the target. Compare this with the next lesson, where the same game on 1−21+31−⋯ reaches any target you like.
Use Cauchy’s general principle of convergence (§84) to prove again that an absolutely convergent series is convergent.
Hint
Write down what Cauchy’s principle says for the convergent series ∑∣un∣.
Hint
Use the triangle inequality on a block un1+1+⋯+un2.
Solution
Let δ>0. Since ∑∣un∣ converges, Cauchy’s principle gives n0 such that ∣un1+1∣+⋯+∣un2∣<δ whenever n2>n1≥n0. By the triangle inequality,
∣un1+1+⋯+un2∣≤∣un1+1∣+⋯+∣un2∣<δ
for the same n1,n2. So ∑un satisfies Cauchy’s principle, and converges. This proof never mentions positive and negative parts, and it works word for word for complex series.
ExerciseDomination●○○Hardy: Examples LXXVII, 2–4
Let ∑an be a convergent series of positive terms. Show that (i) if ∣bn∣≤Kan for some constant K, then ∑bn is absolutely convergent; (ii) ∑anxn is absolutely convergent for −1≤x≤1; (iii) ∑ancosnθ and ∑ansinnθ are absolutely convergent for every θ.
Hint
All three are the comparison test applied to ∑∣bn∣.
Solution
(i) ∑Kan converges, and 0≤∣bn∣≤Kan, so ∑∣bn∣ converges by comparison.
(ii) For ∣x∣≤1, ∣anxn∣=an∣x∣n≤an: apply (i) with K=1.
(iii) ∣ancosnθ∣≤an and ∣ansinnθ∣≤an: apply (i) again. For instance ∑rncosnθ with 0≤r<1 (from §88) is absolutely convergent, and so is ∑(cosnθ)/n2.
ExerciseSelections●○○Hardy: Examples LXXVII, 5
Show that any series formed by selecting some of the terms of an absolutely convergent series (in their original order) is absolutely convergent. Is the same true for the convergent series 1−21+31−⋯?
Hint
The moduli of the selected terms are a selection from the moduli of all the terms.
Solution
If ∑unk is the selection, its series of moduli ∑∣unk∣ is a selection from the convergent positive series ∑∣un∣, so its partial sums are bounded by ∑∣un∣ and it converges.
For 1−21+31−⋯ it is false: selecting the positive terms gives 1+31+51+⋯, which diverges (its terms exceed half those of the harmonic series 21+41+61+⋯). This is a first sign that conditionally convergent series are fragile.
ExerciseWhen is the inequality an equality?●●○Hardy: Examples LXXVII, 6
If ∑∣un∣ converges, show that ∑un≤∑∣un∣, with equality only when all the non-zero terms have the same sign.
Hint
Write both sides in terms of V=∑vn and W=∑wn.
Solution
By the theorem, ∑un=V−W and ∑∣un∣=V+W, with V,W≥0. Then ∣V−W∣≤V+W, and
(V+W)2−(V−W)2=4VW,
so equality holds exactly when VW=0, that is, when V=0 (no positive terms) or W=0 (no negative terms).
Check yourself
Check yourselfTrue or false?
“An absolutely convergent series is convergent” is true by definition.
Why
False. The definition is about the series ∑∣un∣; the conclusion is about a different series, ∑un. It needs a proof (either through the positive and negative parts, or through Cauchy’s principle), and the proof uses the completeness of the real numbers.
Check yourselfChoose one
Suppose ∑un converges absolutely. Which statement about its positive part ∑vn and negative part ∑wn is correct?
Why
Each part is dominated term by term by ∣un∣. The first option describes conditionally convergent series. The third option is impossible for any convergent series: if ∑wn converged and ∑vn diverged, the partial sums VN−WN would tend to +∞.
Check yourselfEnter a number
Given ∑n≥11/n2=π2/6, the sum of the positive terms of 1−221+321−⋯ is π2/8. Give it to four decimal places.
Why
The even terms total ∑1/(2k)2=41⋅π2/6=π2/24, so the odd terms total π2/6−π2/24=π2/8≈1.2337. The series itself is π2/8−π2/24=π2/12≈0.8225.
Check yourselfTrue or false?
If ∑(−1)nan converges absolutely, then taking its terms in the order “two even-indexed terms, then one odd-indexed term, …” gives the same sum.
Why
True. That is a rearrangement (every term appears exactly once), and by §192 rearrangement never changes the sum of an absolutely convergent series.
Hardy’s language
When we say that Σun is ‘absolutely convergent’ we do not assert directly that Σun is convergent: we assert the convergence of another series Σ∣un∣.
— G. H. Hardy, §191
Summary
Summary
Every real series is the difference of its positive part and its negative part: un=vn−wn, while ∣un∣=vn+wn.
∑un is absolutely convergent if ∑∣un∣ converges; then both parts converge and ∑un=∑vn−∑wn.
So absolute convergence is tested with the tests for positive series, applied to ∣un∣.
An absolutely convergent series may be rearranged freely: its sum never changes.