Chapter VIII · The convergence of infinite series and infinite integrals

Abel’s and Dirichlet’s tests

§196 35 min

Summation by parts turns bounded partial sums and steadily decreasing factors into convergence; the alternating series test, the series ∑φncos⁡nθ\sum \varphi_n \cos n\theta, and Abel’s test all follow.

Why this matters

The alternating series test handles the sign pattern +,−,+,−,…+, -, +, -, \dots only. But the series that matter most in later analysis, such as ∑(cos⁡nθ)/n\sum (\cos n\theta)/n and ∑(sin⁡nθ)/n\sum (\sin n\theta)/n, the building blocks of Fourier series, have signs that follow no simple pattern. §196 gives a test that needs much less: the factor carrying the signs must have bounded partial sums, and the factor carrying the sizes must decrease steadily to zero. The tool behind it, summation by parts, is the discrete version of integration by parts and will reappear in §203 for integrals.

The idea

Think of ∑anφn\sum a_n \varphi_n as a product of two factors with different jobs. The ana_n (for instance cos⁡nθ\cos n\theta) supply the cancellation: their running totals An=a1+⋯+anA_n = a_1 + \cdots + a_n never wander far from 00, although the series ∑an\sum a_n itself need not converge. The φn\varphi_n (for instance 1/n1/n) supply the damping: they shrink steadily to 00.

Summation by parts rewrites the sum so that it uses only the totals AnA_n and the drops φn−φn+1\varphi_n - \varphi_{n+1}:

∑n=1Nanφn=∑n=1N−1An(φn−φn+1)+ANφN.\sum_{n=1}^{N} a_n \varphi_n = \sum_{n=1}^{N-1} A_n(\varphi_n - \varphi_{n+1}) + A_N \varphi_N .

The drops are positive and add up to φ1−φN<φ1\varphi_1 - \varphi_N < \varphi_1; the AnA_n are bounded. So the right-hand side is a series that converges absolutely, plus a last term that tends to 00. The cancellation hidden in the ana_n has been converted into absolute convergence.

Explore Bounded totals times shrinking factors

Try this. With an=cos⁡nθa_n = \cos n\theta and φn=1/n\varphi_n = 1/n, move θ\theta and watch both plots. Then take θ\theta close to 00 (or close to 2π2\pi). Then change ana_n to 1,1,1,…1, 1, 1, \dots, and try φn=1/log⁡(n+1)\varphi_n = 1/\log(n+1) with the other factors.

∑anφn with an=cos⁡nθ, φn=1n\sum a_n \varphi_n \text{ with } a_n = \cos n\theta,\ \varphi_n = \frac1nPartial sums An=a1+⋯+anA_n = a_1 + \cdots + a_n of the factor ana_n
nAₙ
Partial sums of ∑anφn\sum a_n\varphi_n
nΣ aₖφₖ
  • Aₙ
  • band ±K
  • partial sums of Σ aₙφₙ
  • room left for the tail: ±2Kφₙ₊₁
  • the sum
Every ∣An∣≤K=2.086|A_n| \le K = 2.086 (K=1/∣sin⁡12θ∣K = 1/|\sin\frac12\theta|). Summation by parts then gives, for every mm, ∣amφm+⋯+anφn∣≤2Kφm|a_m\varphi_m + \cdots + a_n\varphi_n| \le 2K\varphi_m. After 200 terms the partial sum is 0.0392280.039228, and the rest of the series can move it by at most 2Kφ201=0.02082K\varphi_{201} = 0.0208. The sum is 0.04201950.0420195.
What to notice

As long as the ochre totals AnA_n stay inside the green band ±K\pm K, the blue partial sums settle, and the purple bar, of half-length 2Kφn+12K\varphi_{n+1}, always contains everything that is still to come. Near θ=0\theta = 0 the band widens like 2/θ2/\theta and convergence is slow. With an=1a_n = 1 there is no band, and the blue curve climbs for ever.

Precise statements

Following Hardy we index from 00 here, write sn=a0+a1+⋯+ans_n = a_0 + a_1 + \cdots + a_n, and say that φn\varphi_n tends steadily to zero if it is positive, decreasing and has limit 00.

Lemma Abel’s summation by parts Hardy: §196

For any numbers a0,…,ana_0, \dots, a_n and φ0,…,φn\varphi_0, \dots, \varphi_n, with sk=a0+⋯+aks_k = a_0 + \cdots + a_k,

a0φ0+a1φ1+⋯+anφn=s0(φ0−φ1)+s1(φ1−φ2)+⋯+sn−1(φn−1−φn)+snφn.a_0\varphi_0 + a_1\varphi_1 + \cdots + a_n\varphi_n = s_0(\varphi_0 - \varphi_1) + s_1(\varphi_1 - \varphi_2) + \cdots + s_{n-1}(\varphi_{n-1} - \varphi_n) + s_n\varphi_n .
Theorem Dirichlet’s test Hardy: §196

If φn\varphi_n tends steadily to zero, and ∑an\sum a_n converges or oscillates finitely (that is, its partial sums are bounded), then ∑anφn\sum a_n \varphi_n converges. Moreover, if ∣sn∣≤K|s_n| \le K for all nn, then for every m≤nm \le n

∣amφm+⋯+anφn∣≤2Kφm.|a_m\varphi_m + \cdots + a_n\varphi_n| \le 2K\varphi_m .

With an=(−1)na_n = (-1)^n, whose partial sums are 1,0,1,0,…1, 0, 1, 0, \dots, this is exactly the alternating series test of §195.

Theorem Abel’s test Hardy: §196

If φn\varphi_n is positive and decreasing (its limit need not be 00), and ∑an\sum a_n converges, then ∑anφn\sum a_n\varphi_n converges. In Hardy’s words: a convergent series stays convergent when its terms are multiplied by any sequence of positive decreasing factors.

Corollary Trigonometric series Hardy: Examples LXXIX, 2

If θ\theta is not a multiple of 2π2\pi, the partial sums of ∑n≥1cos⁡nθ\sum_{n\ge1} \cos n\theta and ∑n≥1sin⁡nθ\sum_{n \ge 1}\sin n\theta are bounded by 1/∣sin⁡12θ∣1/|\sin\tfrac12\theta|. Hence, if φn\varphi_n tends steadily to zero, ∑φncos⁡nθ\sum \varphi_n \cos n\theta and ∑φnsin⁡nθ\sum \varphi_n \sin n\theta converge for every θ\theta, except perhaps the cosine series when θ\theta is a multiple of 2π2\pi (where it becomes ∑φn\sum \varphi_n).

Proofs

The identity is pure algebra: substitute ak=sk−sk−1a_k = s_k - s_{k-1} (with s−1=0s_{-1} = 0) on the left and collect the coefficient of each sks_k; it is φk−φk+1\varphi_k - \varphi_{k+1} for k<nk < n and φn\varphi_n for k=nk = n. Exercise 1 asks you to check it.

Proof Dirichlet’s test
Strategy

Use summation by parts. The new series ∑sk(φk−φk+1)\sum s_k(\varphi_k - \varphi_{k+1}) has bounded sks_k times positive drops whose total is finite, so it converges absolutely; the leftover term snφns_n\varphi_n tends to 00.

Bound the partial sums

Because ∑an\sum a_n converges or oscillates finitely, its partial sums are bounded: there is KK with ∣sk∣≤K|s_k| \le K for all kk.

The drops form a convergent positive series

φk−φk+1≥0\varphi_k - \varphi_{k+1} \ge 0, and (φ0−φ1)+⋯+(φn−1−φn)=φ0−φn→φ0(\varphi_0 - \varphi_1) + \cdots + (\varphi_{n-1} - \varphi_n) = \varphi_0 - \varphi_n \to \varphi_0. So ∑(φk−φk+1)\sum (\varphi_k - \varphi_{k+1}) converges.

∑sk(φk−φk+1)\sum s_k(\varphi_k - \varphi_{k+1}) converges absolutely

∣sk(φk−φk+1)∣≤K(φk−φk+1)|s_k(\varphi_k - \varphi_{k+1})| \le K(\varphi_k - \varphi_{k+1}): comparison with the previous step. So, by §191, its partial sums tend to a limit.

The last term vanishes

∣snφn∣≤Kφn→0|s_n\varphi_n| \le K\varphi_n \to 0.

Conclude

By the identity, the partial sums of ∑anφn\sum a_n\varphi_n are the partial sums of a convergent series plus a term tending to 00; so they converge.

The tail bound

Apply the identity to the block am,…,ana_m, \dots, a_n with the partial sums sk−sm−1s_k - s_{m-1}, which are bounded by 2K2K. The same estimate gives at most 2K(φm−φn)+2Kφn=2Kφm2K(\varphi_m - \varphi_n) + 2K\varphi_n = 2K\varphi_m.

Proof Abel’s test from Dirichlet’s
Strategy

A decreasing positive φn\varphi_n has a limit l≥0l \ge 0. Then φn−l\varphi_n - l tends steadily to 00, and Dirichlet’s test applies to ∑an(φn−l)\sum a_n(\varphi_n - l).

φn→l\varphi_n \to l

φn\varphi_n is decreasing and bounded below by 00, so it has a limit l≥0l \ge 0 (§69), and φn−l\varphi_n - l decreases steadily to 00.

Apply Dirichlet

∑an\sum a_n converges, so its partial sums are bounded, and ∑an(φn−l)\sum a_n(\varphi_n - l) converges.

Add back

∑anφn=∑an(φn−l)+l∑an\sum a_n\varphi_n = \sum a_n(\varphi_n - l) + l\sum a_n, a sum of two convergent series.

Proof The bound for ∑cos⁡nθ\sum \cos n\theta and ∑sin⁡nθ\sum \sin n\theta
Strategy

Add the two series as one complex geometric series ∑zn\sum z^n with z=cos⁡θ+isin⁡θz = \cos\theta + i\sin\theta (§88).

Sum the geometric series

With z≠1z \ne 1,   z+z2+⋯+zn=z(1−zn)1−z\; z + z^2 + \cdots + z^n = \dfrac{z(1 - z^n)}{1 - z}, whose modulus is at most 2∣1−z∣\dfrac{2}{|1 - z|} since ∣z∣=1|z| = 1.

Take real and imaginary parts

By De Moivre, the real and imaginary parts of the left-hand side are ∑k≤ncos⁡kθ\sum_{k \le n}\cos k\theta and ∑k≤nsin⁡kθ\sum_{k \le n}\sin k\theta; each is at most the modulus of the whole.

Compute ∣1−z∣|1 - z|

∣1−z∣2=(1−cos⁡θ)2+sin⁡2θ=2−2cos⁡θ=4sin⁡212θ|1 - z|^2 = (1 - \cos\theta)^2 + \sin^2\theta = 2 - 2\cos\theta = 4\sin^2\tfrac12\theta, so 2/∣1−z∣=1/∣sin⁡12θ∣2/|1 - z| = 1/|\sin \tfrac12\theta|.

Worked examples and exercises

Exercise Checking summation by parts ●○○ Hardy: §196

Verify Abel’s identity for n=2n = 2, and explain why it is the discrete analogue of ∫abfg=[Fg]ab−∫abFg′\int_a^b f g = \big[F g\big]_a^b - \int_a^b F g', where F′=fF' = f.

Hint
Expand the right-hand side using s0=a0s_0 = a_0, s1=a0+a1s_1 = a_0 + a_1, s2=a0+a1+a2s_2 = a_0 + a_1 + a_2.

Solution

s0(φ0−φ1)+s1(φ1−φ2)+s2φ2=a0φ0−a0φ1+a0φ1+a1φ1−a0φ2−a1φ2+a0φ2+a1φ2+a2φ2=a0φ0+a1φ1+a2φ2s_0(\varphi_0 - \varphi_1) + s_1(\varphi_1 - \varphi_2) + s_2\varphi_2 = a_0\varphi_0 - a_0\varphi_1 + a_0\varphi_1 + a_1\varphi_1 - a_0\varphi_2 - a_1\varphi_2 + a_0\varphi_2 + a_1\varphi_2 + a_2\varphi_2 = a_0\varphi_0 + a_1\varphi_1 + a_2\varphi_2.

The partial sums sks_k play the part of the antiderivative FF of f=af = a, the drops φk−φk+1\varphi_k - \varphi_{k+1} play the part of −g′-g', and snφns_n\varphi_n is the boundary term [Fg][Fg] (the lower boundary term vanishes because s−1=0s_{-1} = 0). Dirichlet’s test is the discrete form of the argument used in §203 for ∫φ(x)cos⁡tx dx\int \varphi(x)\cos tx\,dx.

Exercise The bare trigonometric series ●○○ Hardy: Examples LXXIX, 2

Show that ∑cos⁡nθ\sum \cos n\theta and ∑sin⁡nθ\sum \sin n\theta oscillate finitely when θ\theta is not a multiple of π\pi. What happens when θ\theta is a multiple of π\pi?

Hint
Bounded partial sums are the corollary. For non-convergence, look at the terms.

Solution

By the corollary the partial sums are bounded. The series do not converge because their terms do not tend to 00: if cos⁡nθ→0\cos n\theta \to 0 then cos⁡2nθ=2cos⁡2nθ−1→−1\cos 2n\theta = 2\cos^2 n\theta - 1 \to -1, a contradiction; and if sin⁡nθ→0\sin n\theta \to 0 then cos⁡2nθ→1\cos^2 n\theta \to 1, so ∣sin⁡(n+1)θ∣=∣sin⁡nθcos⁡θ+cos⁡nθsin⁡θ∣→∣sin⁡θ∣≠0|\sin(n+1)\theta| = |\sin n\theta\cos\theta + \cos n\theta\sin\theta| \to |\sin\theta| \ne 0, again a contradiction. So both oscillate finitely.

If θ=kπ\theta = k\pi: the sine series is 0+0+⋯0 + 0 + \cdots and converges to 00. The cosine series is ∑(−1)kn\sum (-1)^{kn}: for odd kk it is −1+1−1+⋯-1 + 1 - 1 + \cdots (finite oscillation), and for even kk it is 1+1+⋯1 + 1 + \cdots (divergence to ∞\infty).

Exercise The series ∑n−scos⁡nθ\sum n^{-s}\cos n\theta ●●○ Hardy: Examples LXXIX, 3–4

Classify ∑n≥1n−scos⁡nθ\sum_{n\ge1} n^{-s}\cos n\theta and ∑n≥1n−ssin⁡nθ\sum_{n \ge 1} n^{-s}\sin n\theta: show that they are absolutely convergent if s>1s > 1, convergent if 0<s≤10 < s \le 1 (except the cosine series when θ\theta is a multiple of 2π2\pi), and not convergent if s≤0s \le 0 (apart from the sine series when θ\theta is a multiple of π\pi).

Hint
s>1s > 1: domination. 0<s≤10 < s \le 1: the corollary with φn=n−s\varphi_n = n^{-s}.
Hint
s≤0s \le 0: the terms do not tend to 00 (see the previous exercise).

Solution

s>1s > 1. ∣n−scos⁡nθ∣≤n−s|n^{-s}\cos n\theta| \le n^{-s} and ∑n−s\sum n^{-s} converges: absolute convergence for every θ\theta.

0<s≤10 < s \le 1. φn=n−s\varphi_n = n^{-s} tends steadily to 00, so both series converge by the corollary, except the cosine series at θ=2kπ\theta = 2k\pi, which is ∑n−s\sum n^{-s} and diverges. (They are not absolutely convergent, apart from the trivial sine series at θ=kπ\theta = k\pi: that is Examples LXXIX, 6, the last exercise below.)

s≤0s \le 0. By the argument of the previous exercise, ∣cos⁡nθ∣≥12|\cos n\theta| \ge \tfrac12 for infinitely many nn (if ∣cos⁡nθ∣<12|\cos n\theta| < \tfrac12 then ∣cos⁡2nθ∣>12|\cos 2n\theta| > \tfrac12), and similarly for the sine when θ\theta is not a multiple of π\pi. So the terms, of size n∣s∣∣cos⁡nθ∣n^{|s|}|\cos n\theta|, do not tend to 00, and the series cannot converge. For s<0s < 0 the terms are even unbounded; since un=sn−sn−1u_n = s_n - s_{n-1}, the partial sums are unbounded too, so the oscillation (if any) is not finite. At θ=2kπ\theta = 2k\pi the cosine series is ∑n∣s∣\sum n^{|s|} and diverges to ∞\infty; otherwise Hardy states that the series oscillate infinitely. Unboundedness alone does not show this (the partial sums might tend to +∞+\infty or −∞-\infty): one way to finish is to multiply the partial sums of ∑n∣s∣zn\sum n^{|s|}z^n, with z=cos⁡θ+isin⁡θz = \cos\theta + i\sin\theta, by 1−z1 - z, which isolates a boundary term −N∣s∣zN+1-N^{|s|}z^{N+1} whose real and imaginary parts take large values of both signs. We omit the details. For s=0s = 0 we are back at the previous exercise.

Exercise Raising the exponent ●●○ Hardy: Examples LXXIX, 5

If ∑ann−s\sum a_n n^{-s} converges or oscillates finitely, show that ∑ann−t\sum a_n n^{-t} converges for every t>st > s.

Hint
Write ann−ta_n n^{-t} as a product of two factors suited to Dirichlet’s test.

Solution

ann−t=(ann−s)⋅n−(t−s)a_n n^{-t} = (a_n n^{-s}) \cdot n^{-(t-s)}. The first factor is the general term of a series with bounded partial sums; the second, φn=n−(t−s)\varphi_n = n^{-(t-s)}, tends steadily to 00 because t−s>0t - s > 0. Dirichlet’s test applies. For example, since ∑(−1)n\sum (-1)^n oscillates finitely, ∑(−1)nn−t\sum (-1)^n n^{-t} converges for every t>0t > 0.

Exercise Convergent, but not absolutely ●●● Hardy: Examples LXXIX, 6

Let φn\varphi_n tend steadily to 00 with ∑φn\sum\varphi_n divergent. Show that ∑φncos⁡nθ\sum \varphi_n\cos n\theta is not absolutely convergent for any θ\theta. Where does the corresponding argument for the sine series break down?

Hint
cos⁡2nθ≤∣cos⁡nθ∣\cos^2 n\theta \le |\cos n\theta|, and cos⁡2nθ=12(1+cos⁡2nθ)\cos^2 n\theta = \tfrac12(1 + \cos 2n\theta).

Solution

Suppose ∑φn∣cos⁡nθ∣\sum \varphi_n |\cos n\theta| converged. Since 0≤cos⁡2nθ≤∣cos⁡nθ∣0 \le \cos^2 n\theta \le |\cos n\theta|, so would ∑φncos⁡2nθ=12∑φn+12∑φncos⁡2nθ\sum\varphi_n\cos^2 n\theta = \tfrac12\sum\varphi_n + \tfrac12\sum\varphi_n\cos 2n\theta. If θ\theta is not a multiple of π\pi, then 2θ2\theta is not a multiple of 2π2\pi and ∑φncos⁡2nθ\sum\varphi_n\cos 2n\theta converges by the corollary; then 12∑φn\tfrac12\sum\varphi_n would converge, which it does not. If θ\theta is a multiple of π\pi, then ∣cos⁡nθ∣=1|\cos n\theta| = 1 and ∑φn∣cos⁡nθ∣=∑φn\sum \varphi_n|\cos n\theta| = \sum\varphi_n diverges directly.

For the sine series use sin⁡2nθ=12(1−cos⁡2nθ)\sin^2 n\theta = \tfrac12(1 - \cos 2n\theta): the same argument works when θ\theta is not a multiple of π\pi. When it is, sin⁡nθ=0\sin n\theta = 0 for all nn, the series is identically zero and trivially absolutely convergent: that is the exception.

Explore Slow decrease still works

Try this. Choose an=sin⁡nθa_n = \sin n\theta and φn=1/log⁡(n+1)\varphi_n = 1/\log(n+1), and show 5000 terms. Compare with φn=1/n\varphi_n = 1/n.

∑anφn with an=sin⁡nθ, φn=1log⁡(n+1)\sum a_n \varphi_n \text{ with } a_n = \sin n\theta,\ \varphi_n = \frac{1}{\log(n+1)}Partial sums An=a1+⋯+anA_n = a_1 + \cdots + a_n of the factor ana_n
nAₙ
Partial sums of ∑anφn\sum a_n\varphi_n
nΣ aₖφₖ
  • Aₙ
  • band ±K
  • partial sums of Σ aₙφₙ
  • room left for the tail: ±2Kφₙ₊₁
Every ∣An∣≤K=1.188|A_n| \le K = 1.188 (K=1/∣sin⁡12θ∣K = 1/|\sin\frac12\theta|). Summation by parts then gives, for every mm, ∣amφm+⋯+anφn∣≤2Kφm|a_m\varphi_m + \cdots + a_n\varphi_n| \le 2K\varphi_m. After 200 terms the partial sum is 0.6775320.677532, and the rest of the series can move it by at most 2Kφ201=0.4482K\varphi_{201} = 0.448.
What to notice

Even though ∑1/log⁡(n+1)\sum 1/\log(n+1) diverges far more slowly than anything we can easily sum, the product series converges, just slowly: the purple bar, which bounds the whole remaining tail, shrinks only like 1/log⁡n1/\log n. Dirichlet’s test asks nothing about how fast φn\varphi_n decreases.

Check yourself

Check yourself Choose one

Which pair of hypotheses does Dirichlet’s test use for ∑anφn\sum a_n\varphi_n?

Why

Bounded partial sums, not bounded terms: with an=1a_n = 1 the terms are bounded but ∑1/n\sum 1/n diverges. The steady decrease of φn\varphi_n is what makes the drops φn−φn+1\varphi_n - \varphi_{n+1} positive with a finite total. The first option is too weak in one place and Abel’s test in the other.

Check yourself True or false?

∑n≥1(sin⁡n)/n\sum_{n\ge1} (\sin n)/n converges.

Why

True: θ=1\theta = 1 is not a multiple of π\pi, so the partial sums of ∑sin⁡n\sum \sin n are bounded by 1/sin⁡12≈2.091/\sin\tfrac12 \approx 2.09, and 1/n1/n tends steadily to 00. (Its sum is (π−1)/2(\pi - 1)/2.)

Check yourself Enter a number

For θ=π/3\theta = \pi/3, what is the bound 1/∣sin⁡12θ∣1/|\sin\tfrac12\theta| for the partial sums of ∑cos⁡nθ\sum \cos n\theta?

Why

sin⁡(π/6)=12\sin(\pi/6) = \tfrac12, so K=2K = 2. In fact the partial sums of ∑cos⁡(nπ/3)\sum\cos(n\pi/3) run 12,0,−1,−32,−1,0,…\tfrac12, 0, -1, -\tfrac32, -1, 0, \dots, which stay inside [−2,2][-2, 2]; the bound is not sharp.

Check yourself True or false?

Since ∑(−1)n−1/n\sum (-1)^{n-1}/n converges, so does ∑(−1)n−1n+1n2\sum (-1)^{n-1}\dfrac{n+1}{n^2}.

Why

True, by Abel’s test: (−1)n−1n+1n2=(−1)n−1n⋅(1+1n)(-1)^{n-1}\frac{n+1}{n^2} = \frac{(-1)^{n-1}}{n}\cdot\big(1 + \frac1n\big), and 1+1/n1 + 1/n is positive and decreasing (its limit is 11, not 00, which Abel’s test allows).

Hardy’s language

A convergent series remains convergent if we multiply its terms by any sequence of positive and decreasing factors.

— G. H. Hardy, §196

Summary

Summary
  • Summation by parts: ∑anφn=∑sk(φk−φk+1)+snφn\sum a_n\varphi_n = \sum s_k(\varphi_k - \varphi_{k+1}) + s_n\varphi_n, a discrete integration by parts.
  • Dirichlet: bounded partial sums of ana_n, times φn\varphi_n decreasing steadily to 00, give a convergent series, with tails at most 2Kφm2K\varphi_m.
  • Abel: a convergent ∑an\sum a_n, times positive decreasing factors (any limit), stays convergent.
  • The partial sums of ∑cos⁡nθ\sum\cos n\theta, ∑sin⁡nθ\sum\sin n\theta are bounded by 1/∣sin⁡12θ∣1/|\sin\tfrac12\theta|, so ∑φncos⁡nθ\sum\varphi_n\cos n\theta and ∑φnsin⁡nθ\sum\varphi_n\sin n\theta converge (except the cosine series at θ=2kπ\theta = 2k\pi), and only conditionally when ∑φn\sum\varphi_n diverges.