Chapter VIII · The convergence of infinite series and infinite integrals

Absolutely convergent series

§§191–192 30 min

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.

Why this matters

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∣\sum |u_n| with the old tests, and if it converges, conclude that ∑un\sum u_n 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\sum u_n and sort its terms into two piles. The positive part vnv_n is unu_n when un>0u_n > 0 and 00 otherwise; the negative part wnw_n is −un-u_n when un<0u_n < 0 and 00 otherwise. Both are ≥0\ge 0, and

un=vn−wn,∣un∣=vn+wn.u_n = v_n - w_n, \qquad |u_n| = v_n + w_n .

For example, for 1−122+132−⋯1 - \tfrac{1}{2^2} + \tfrac{1}{3^2} - \cdots the positive part is 1,0,132,0,152,…1, 0, \tfrac{1}{3^2}, 0, \tfrac{1}{5^2}, \dots and the negative part is 0,122,0,142,…0, \tfrac{1}{2^2}, 0, \tfrac{1}{4^2}, \dots.

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.

Explore The two halves of a series

Try this. With ∑(−1)n−1/n2\sum (-1)^{n-1}/n^2 selected, increase NN to 20 00020\,000 and watch the three curves. Then switch to ∑(−1)n−1/n\sum (-1)^{n-1}/n and ∑(−1)n−1/n\sum (-1)^{n-1}/\sqrt n, and compare.

∑n=1∞(−1)n−1n2\sum_{n=1}^{\infty} \dfrac{(-1)^{n-1}}{n^2}
Npartial sums
  • positive part VN=∑n≤NvnV_N = \sum_{n \le N} v_n
  • negative part WN=∑n≤NwnW_N = \sum_{n \le N} w_n
  • the series sN=VN−WNs_N = V_N - W_N
  • its sum
At N=200N = 200: VN=1.2312V_N = 1.2312, WN=0.408746W_N = 0.408746, so ∑n≤N∣un∣=VN+WN=1.63995\sum_{n\le N}|u_n| = V_N + W_N = 1.63995 and sN=VN−WN=0.822455s_N = V_N - W_N = 0.822455. Both parts level off (at π2/8\pi^2/8 and π2/24\pi^2/24): the series is absolutely convergent, and its sum is the difference of two finite sums.
What to notice

For 1/n21/n^2 (and for sin⁡n/n2\sin n / n^2) both the blue and the ochre curve level off, so the purple curve, their difference, settles too. For 1/n1/n and 1/n1/\sqrt 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

Definition Absolute convergence Hardy: §191

The series ∑un\sum u_n is absolutely convergent if the series of moduli ∑∣un∣\sum |u_n| is convergent.

The definition says nothing directly about ∑un\sum u_n itself. That it converges is a theorem, and Hardy warns that it is not a tautology: from the convergence of one series, ∑∣un∣\sum |u_n|, we must deduce the convergence of a different series.

Theorem Absolutely convergent series converge Hardy: §191

If ∑un\sum u_n is absolutely convergent, then the series of its positive terms ∑vn\sum v_n and of its negative terms ∑wn\sum w_n both converge, ∑un\sum u_n converges, and

∑un=∑vn−∑wn,∣∑un∣≤∑∣un∣.\sum u_n = \sum v_n - \sum w_n , \qquad \Big|\sum u_n\Big| \le \sum |u_n| .

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.

Theorem Rearranging an absolutely convergent series Hardy: §192

If ∑un\sum u_n is absolutely convergent with sum ss, then every rearrangement of it (every series containing exactly the same terms, each once, in another order) is absolutely convergent with the same sum ss.

Proofs

Proof Absolutely convergent series converge
Strategy

Each of vnv_n and wnw_n is a positive term no larger than ∣un∣|u_n|, so the comparison test makes both ∑vn\sum v_n and ∑wn\sum w_n converge. Then ∑un=∑(vn−wn)\sum u_n = \sum (v_n - w_n) is the difference of two convergent series.

0≤vn≤∣un∣0 \le v_n \le |u_n| and 0≤wn≤∣un∣0 \le w_n \le |u_n|

One of vnv_n, wnw_n equals ∣un∣|u_n| and the other is 00.

∑vn\sum v_n and ∑wn\sum w_n converge

They are series of positive terms dominated by the convergent series ∑∣un∣\sum |u_n| (comparison, §173). Hardy phrases this as “a series selected from the terms of a convergent series of positive terms converges”: ∑vn\sum v_n is ∑∣un∣\sum|u_n| with some terms replaced by 00.

Subtract

Write V=∑vnV = \sum v_n and W=∑wnW = \sum w_n. The partial sums of ∑un\sum u_n are sN=VN−WNs_N = V_N - W_N, the difference of the partial sums of the two parts. Since VN→VV_N \to V and WN→WW_N \to W, we get sN→V−Ws_N \to V - W (§77, Theorem (6)).

The inequality

∣sN∣≤∣u1∣+⋯+∣uN∣≤∑∣un∣|s_N| \le |u_1| + \cdots + |u_N| \le \sum |u_n| for every NN. Let N→∞N \to \infty.

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.

Proof Rearrangement does not change the sum
Strategy

Rearranging ∑un\sum u_n rearranges each of the two positive series ∑vn\sum v_n and ∑wn\sum w_n 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′\sum u'_n be a rearrangement, and form vn′v'_n, wn′w'_n from un′u'_n as vnv_n, wnw_n were formed from unu_n. Then ∑∣un′∣\sum |u'_n|, ∑vn′\sum v'_n, ∑wn′\sum w'_n are rearrangements of ∑∣un∣\sum |u_n|, ∑vn\sum v_n, ∑wn\sum w_n, which are all convergent series of positive terms.

Apply Dirichlet’s theorem three times

By §176, ∑∣un′∣\sum |u'_n| converges (so the new series is absolutely convergent), ∑vn′=∑vn=V\sum v'_n = \sum v_n = V, and ∑wn′=∑wn=W\sum w'_n = \sum w_n = W.

Conclude

By the previous theorem, ∑un′=V−W=∑un\sum u'_n = V - W = \sum u_n.

You can test this. Below, the absolutely convergent series 1−122+132−⋯1 - \tfrac{1}{2^2} + \tfrac{1}{3^2} - \cdots is dealt out in blocks: pp positive terms, then qq negative ones, and so on. Every term is eventually used.

Explore No pattern moves the sum

Try this. Try blocks of 33 positive and 11 negative, then 11 positive and 55 negative, and look at the partial sums for 1000 terms. Then choose “chase a target” and set the target to 1.51.5.

Rearranging 1−122+132−⋯1 - \tfrac{1}{2^2} + \tfrac{1}{3^2} - \cdots
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.8237050.823705. Every term is used eventually, so this is a genuine rearrangement. Its sum is 0.8224670.822467, the same as before.
What to notice

Every pattern settles on the same value π2/12≈0.822\pi^2/12 \approx 0.822, however lopsided. Chasing 1.51.5 fails: the positive terms on their own total only π2/8≈1.234\pi^2/8 \approx 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−12+13−⋯1 - \tfrac12 + \tfrac13 - \cdots reaches any target you like.

Worked examples and exercises

Exercise Via Cauchy’s principle ●●○ Hardy: Examples LXXVII, 1

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∣\sum |u_n|.
Hint
Use the triangle inequality on a block un1+1+⋯+un2u_{n_1+1} + \cdots + u_{n_2}.

Solution

Let δ>0\delta > 0. Since ∑∣un∣\sum |u_n| converges, Cauchy’s principle gives n0n_0 such that ∣un1+1∣+⋯+∣un2∣<δ|u_{n_1+1}| + \cdots + |u_{n_2}| < \delta whenever n2>n1≥n0n_2 > n_1 \ge n_0. By the triangle inequality,

∣un1+1+⋯+un2∣≤∣un1+1∣+⋯+∣un2∣<δ|u_{n_1+1} + \cdots + u_{n_2}| \le |u_{n_1+1}| + \cdots + |u_{n_2}| < \delta

for the same n1,n2n_1, n_2. So ∑un\sum u_n satisfies Cauchy’s principle, and converges. This proof never mentions positive and negative parts, and it works word for word for complex series.

Exercise Domination ●○○ Hardy: Examples LXXVII, 2–4

Let ∑an\sum a_n be a convergent series of positive terms. Show that (i) if ∣bn∣≤Kan|b_n| \le K a_n for some constant KK, then ∑bn\sum b_n is absolutely convergent; (ii) ∑anxn\sum a_n x^n is absolutely convergent for −1≤x≤1-1 \le x \le 1; (iii) ∑ancos⁡nθ\sum a_n \cos n\theta and ∑ansin⁡nθ\sum a_n \sin n\theta are absolutely convergent for every θ\theta.

Hint
All three are the comparison test applied to ∑∣bn∣\sum |b_n|.

Solution

(i) ∑Kan\sum K a_n converges, and 0≤∣bn∣≤Kan0 \le |b_n| \le K a_n, so ∑∣bn∣\sum |b_n| converges by comparison.

(ii) For ∣x∣≤1|x| \le 1, ∣anxn∣=an∣x∣n≤an|a_n x^n| = a_n |x|^n \le a_n: apply (i) with K=1K = 1.

(iii) ∣ancos⁡nθ∣≤an|a_n \cos n\theta| \le a_n and ∣ansin⁡nθ∣≤an|a_n \sin n\theta| \le a_n: apply (i) again. For instance ∑rncos⁡nθ\sum r^n \cos n\theta with 0≤r<10 \le r < 1 (from §88) is absolutely convergent, and so is ∑(cos⁡nθ)/n2\sum (\cos n\theta)/n^2.

Exercise Selections ●○○ 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−12+13−⋯1 - \tfrac12 + \tfrac13 - \cdots?

Hint
The moduli of the selected terms are a selection from the moduli of all the terms.

Solution

If ∑unk\sum u_{n_k} is the selection, its series of moduli ∑∣unk∣\sum |u_{n_k}| is a selection from the convergent positive series ∑∣un∣\sum |u_n|, so its partial sums are bounded by ∑∣un∣\sum |u_n| and it converges.

For 1−12+13−⋯1 - \tfrac12 + \tfrac13 - \cdots it is false: selecting the positive terms gives 1+13+15+⋯1 + \tfrac13 + \tfrac15 + \cdots, which diverges (its terms exceed half those of the harmonic series 12+14+16+⋯\tfrac12 + \tfrac14 + \tfrac16 + \cdots). This is a first sign that conditionally convergent series are fragile.

Exercise When is the inequality an equality? ●●○ Hardy: Examples LXXVII, 6

If ∑∣un∣\sum |u_n| converges, show that ∣∑un∣≤∑∣un∣\big|\sum u_n\big| \le \sum |u_n|, with equality only when all the non-zero terms have the same sign.

Hint
Write both sides in terms of V=∑vnV = \sum v_n and W=∑wnW = \sum w_n.

Solution

By the theorem, ∑un=V−W\sum u_n = V - W and ∑∣un∣=V+W\sum |u_n| = V + W, with V,W≥0V, W \ge 0. Then ∣V−W∣≤V+W|V - W| \le V + W, and

(V+W)2−(V−W)2=4VW,(V + W)^2 - (V - W)^2 = 4VW ,

so equality holds exactly when VW=0VW = 0, that is, when V=0V = 0 (no positive terms) or W=0W = 0 (no negative terms).

Check yourself

Check yourself True or false?

“An absolutely convergent series is convergent” is true by definition.

Why

False. The definition is about the series ∑∣un∣\sum |u_n|; the conclusion is about a different series, ∑un\sum u_n. 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 yourself Choose one

Suppose ∑un\sum u_n converges absolutely. Which statement about its positive part ∑vn\sum v_n and negative part ∑wn\sum w_n is correct?

Why

Each part is dominated term by term by ∣un∣|u_n|. The first option describes conditionally convergent series. The third option is impossible for any convergent series: if ∑wn\sum w_n converged and ∑vn\sum v_n diverged, the partial sums VN−WNV_N - W_N would tend to +∞+\infty.

Check yourself Enter a number

Given ∑n≥11/n2=π2/6\sum_{n \ge 1} 1/n^2 = \pi^2/6, the sum of the positive terms of 1−122+132−⋯1 - \tfrac{1}{2^2} + \tfrac{1}{3^2} - \cdots is π2/8\pi^2/8. Give it to four decimal places.

Why

The even terms total ∑1/(2k)2=14⋅π2/6=π2/24\sum 1/(2k)^2 = \tfrac14 \cdot \pi^2/6 = \pi^2/24, so the odd terms total π2/6−π2/24=π2/8≈1.2337\pi^2/6 - \pi^2/24 = \pi^2/8 \approx 1.2337. The series itself is π2/8−π2/24=π2/12≈0.8225\pi^2/8 - \pi^2/24 = \pi^2/12 \approx 0.8225.

Check yourself True or false?

If ∑(−1)nan\sum (-1)^n a_n 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\Sigma u_n is ‘absolutely convergent’ we do not assert directly that Σun\Sigma u_n is convergent: we assert the convergence of another series Σ∣un∣\Sigma |u_n|.

— G. H. Hardy, §191

Summary

Summary
  • Every real series is the difference of its positive part and its negative part: un=vn−wnu_n = v_n - w_n, while ∣un∣=vn+wn|u_n| = v_n + w_n.
  • ∑un\sum u_n is absolutely convergent if ∑∣un∣\sum |u_n| converges; then both parts converge and ∑un=∑vn−∑wn\sum u_n = \sum v_n - \sum w_n.
  • So absolute convergence is tested with the tests for positive series, applied to ∣un∣|u_n|.
  • An absolutely convergent series may be rearranged freely: its sum never changes.