Chapter VIII · The convergence of infinite series and infinite integrals

Power series and where they converge

§§198–199 30 min

A power series converges everywhere, nowhere but at 0, or somewhere in between; and convergence at one point forces absolute convergence at every point nearer the origin.

Why this matters

The functions of the next two chapters (the exponential, logarithm, sine and cosine, (1+z)m(1+z)^m) are all given by power series ∑anzn\sum a_n z^n, and much of their theory comes from general facts about such series. §198 and §199 prove the first and most important fact: the set of zz where a power series converges cannot be arbitrary. Its shape is forced by a comparison with the geometric series, and the next lesson shows that it is always a disc.

The idea

At a point zz the terms of ∑anzn\sum a_n z^n have sizes ∣an∣ ∣z∣n|a_n|\,|z|^n, which depend only on r=∣z∣r = |z|. Multiplying rr by a factor λ\lambda multiplies the nn-th term by λn\lambda^n. So shrinking rr a little, by a factor λ<1\lambda < 1, damps the terms by a geometric factor, which is enough to make almost anything converge. That is the whole idea of Theorem B: if the terms are merely bounded at radius r1r_1, then at any smaller radius they are dominated by a convergent geometric series.

On a logarithmic scale a geometric sequence KλnK\lambda^n is a straight line of slope log⁡λ\log\lambda, so geometric decay is easy to see.

Explore Shrink the radius, gain a geometric factor

Try this. For ∑zn\sum z^n, keep r1r_1 just below 11 and move rr. Then move r1r_1 above 11. Then look at ∑zn/n!\sum z^n/n! and ∑n! zn\sum n!\,z^n for small and large rr, and at ∑zn/n2\sum z^n/n^2 with r1=1r_1 = 1.

∑zn\sum z^n sizes of the terms at |z| = r and at |z| = r₁
n|aₙ| rⁿ (log scale)
  • |aₙ| rⁿ at your r
  • |aₙ| r₁ⁿ at r₁
  • K (r/r₁)ⁿ
Here r < 1, and the series converges absolutely: its terms decay geometrically. At r1=0.95r_1 = 0.95 the terms are bounded (by K≈1K \approx 1), so at r=0.7r = 0.7 every term lies under the dashed line K(r/r1)nK(r/r_1)^n, a geometric sequence with ratio 0.7370.737: that is Theorem B.
What to notice

Whenever the hollow ochre points (the terms at r1r_1) are bounded, the blue points at a smaller rr lie under the dashed straight line K(r/r1)nK(r/r_1)^n, which falls geometrically. For ∑zn/n!\sum z^n/n! the terms eventually plunge for every rr; for ∑n! zn\sum n!\,z^n they eventually climb for every r>0r > 0: the two extreme cases of Theorem A.

Precise statements

Definition Power series Hardy: §198

A power series in zz is a series ∑n≥0anzn=a0+a1z+a2z2+⋯\sum_{n \ge 0} a_n z^n = a_0 + a_1 z + a_2 z^2 + \cdots, where the coefficients ana_n are fixed (real or complex) numbers and zz is a complex variable.

Every power series converges at z=0z = 0, where its sum is a0a_0. Beyond that, anything from “nowhere else” to “everywhere” can happen.

Theorem Three kinds of behaviour Hardy: §198, A

A power series may converge for all values of zz, for a certain region of values, or for no value except z=0z = 0. For example:

  1. ∑zn/n!\sum z^n/n! converges (absolutely) for every zz;
  2. ∑n! zn\sum n!\,z^n converges for no zz except 00;
  3. ∑zn\sum z^n converges (absolutely) for ∣z∣<1|z| < 1 and for no zz with ∣z∣≥1|z| \ge 1.
Theorem Convergence spreads inwards Hardy: §199, B

If ∑anzn\sum a_n z^n converges at z=z1z = z_1, then it converges absolutely at every zz with ∣z∣<∣z1∣|z| < |z_1|. The same holds if the series only oscillates finitely at z1z_1, or indeed if only its terms anz1na_n z_1^n are bounded.

In Hardy’s words: if the series converges at a point PP, it converges absolutely at all points nearer to the origin than PP. Notice what the theorem does not say: nothing about other points at the same distance ∣z1∣|z_1|, and nothing about points further out.

Proofs

Proof Theorem A: the three examples
Strategy

Apply d’Alembert’s ratio test (§175) to the moduli of the terms, and use the fact that the terms of a convergent series tend to 00.

∑zn/n!\sum z^n/n! converges for every zz

For z≠0z \ne 0 and un=zn/n!u_n = z^n/n!, ∣un+1∣/∣un∣=∣z∣/(n+1)→0<1|u_{n+1}|/|u_n| = |z|/(n+1) \to 0 < 1. So ∑∣un∣\sum |u_n| converges by the ratio test, and the series converges absolutely (§197).

∑n! zn\sum n!\,z^n converges only at 00

For z≠0z \ne 0 and un=n! znu_n = n!\,z^n, ∣un+1∣/∣un∣=(n+1)∣z∣→∞|u_{n+1}|/|u_n| = (n+1)|z| \to \infty. So from some nn on the ratio exceeds 22 and ∣un∣|u_n| at least doubles at every step; hence ∣un∣→∞|u_n| \to \infty, and the series cannot converge.

∑zn\sum z^n

For ∣z∣<1|z| < 1 it is dominated by the convergent geometric series ∑∣z∣n\sum |z|^n. For ∣z∣≥1|z| \ge 1, ∣zn∣≥1|z^n| \ge 1, so the terms do not tend to 00 (§88).

Proof Theorem B
Strategy

Bounded terms at radius r1r_1 give ∣an∣≤K/r1n|a_n| \le K/r_1^n. At radius r<r1r < r_1 this makes ∣anzn∣≤K(r/r1)n|a_n z^n| \le K(r/r_1)^n, the terms of a convergent geometric series.

The terms at z1z_1 are bounded

If ∑anz1n\sum a_n z_1^n converges then anz1n→0a_n z_1^n \to 0, and a convergent sequence is bounded: there is KK with ∣an∣ r1n≤K|a_n|\,r_1^n \le K for all nn, where r1=∣z1∣r_1 = |z_1|. If the series only oscillates finitely, its partial sums sns_n satisfy ∣sn∣<K′|s_n| < K', so ∣anz1n∣=∣sn−sn−1∣<2K′|a_n z_1^n| = |s_n - s_{n-1}| < 2K': again bounded. (We may assume z1≠0z_1 \ne 0, or there is nothing to prove.)

Compare at a smaller radius

Let ∣z∣=r<r1|z| = r < r_1. Then

∣anzn∣=∣an∣ r1n(rr1)n≤K(rr1)n.|a_n z^n| = |a_n|\,r_1^n \Big(\frac{r}{r_1}\Big)^n \le K\Big(\frac{r}{r_1}\Big)^n .

Conclude

Since r/r1<1r/r_1 < 1, ∑K(r/r1)n\sum K (r/r_1)^n is a convergent geometric series. By comparison ∑∣anzn∣\sum |a_n z^n| converges, so ∑anzn\sum a_n z^n converges absolutely.

The proof uses the size of z1z_1 only, never its direction, which is why the conclusion holds in a whole disc. And it gives more than convergence: at radius rr the terms decay at least as fast as (r/r1)n(r/r_1)^n, so the series converges fast well inside.

Worked examples and exercises

Exercise Finite oscillation is enough ●○○ Hardy: §199, Example

Show that Theorem B remains true if ∑anz1n\sum a_n z_1^n oscillates finitely, and give an example where this version is needed.

Hint
Express anz1na_n z_1^n through the partial sums sns_n.

Solution

If ∣sn∣<K|s_n| < K for all nn, then ∣anz1n∣=∣sn−sn−1∣<2K|a_n z_1^n| = |s_n - s_{n-1}| < 2K (with s−1=0s_{-1} = 0), and the proof goes through with 2K2K for KK. Example: ∑zn\sum z^n at z1=−1z_1 = -1 is 1−1+1−⋯1 - 1 + 1 - \cdots, which oscillates finitely, and the conclusion (absolute convergence for ∣z∣<1|z| < 1) is correct, though we could not get it from a point of convergence on the circle ∣z∣=1|z| = 1, because there is none.

Exercise Nothing about the same circle ●○○ Hardy: §199

The series ∑n≥1zn/n\sum_{n\ge1} z^n/n converges at z1=−1z_1 = -1. Does it converge at z=1z = 1? What does Theorem B tell you?

Hint
At z=−1z = -1 the series is −1+12−13+⋯-1 + \tfrac12 - \tfrac13 + \cdots.

Solution

At z=−1z = -1 it is minus the alternating harmonic series, which converges. At z=1z = 1 it is the harmonic series, which diverges. Theorem B gives absolute convergence for ∣z∣<1|z| < 1 only: it says nothing about other points of the circle ∣z∣=∣z1∣|z| = |z_1|, and this example shows that nothing can be said in general.

Exercise Polynomial coefficients ●●○ Hardy: §198

Let kk be a positive integer. Show that ∑nkzn\sum n^k z^n converges absolutely for ∣z∣<1|z| < 1 and does not converge for ∣z∣≥1|z| \ge 1.

Hint
Ratio test for ∣z∣<1|z| < 1; size of the terms for ∣z∣≥1|z| \ge 1.

Solution

For 0<∣z∣<10 < |z| < 1: (n+1)k∣z∣n+1nk∣z∣n=(1+1n)k∣z∣→∣z∣<1\dfrac{(n+1)^k|z|^{n+1}}{n^k|z|^n} = \Big(1 + \frac1n\Big)^k|z| \to |z| < 1, so the series of moduli converges by the ratio test. For ∣z∣≥1|z| \ge 1: ∣nkzn∣≥nk≥1|n^k z^n| \ge n^k \ge 1, so the terms do not tend to 00. The polynomial factor nkn^k, however large kk is, cannot compete with the geometric factor: this is why Theorem B leaves so much room.

Exercise Why n! znn!\,z^n blows up ●●○ Hardy: §198, Examples XXVII

Prove directly, without the ratio test, that ∣n! zn∣→∞|n!\,z^n| \to \infty for every z≠0z \ne 0.

Hint
Choose an integer m>2/∣z∣m > 2/|z| and compare (n+1)! ∣z∣n+1(n+1)!\,|z|^{n+1} with n! ∣z∣nn!\,|z|^n for n≥mn \ge m.

Solution

Fix z≠0z \ne 0 and an integer mm with m∣z∣>2m|z| > 2. For n≥mn \ge m, ∣un+1∣=(n+1)∣z∣ ∣un∣>2∣un∣|u_{n+1}| = (n+1)|z|\,|u_n| > 2|u_n|. Hence ∣um+k∣>2k∣um∣|u_{m+k}| > 2^k|u_m| for every kk, and since ∣um∣>0|u_m| > 0, ∣un∣→∞|u_n| \to \infty. So the terms do not tend to 00, and ∑n! zn\sum n!\,z^n cannot converge.

Check yourself

Check yourself True or false?

If a power series converges at z=2z = 2, it converges at z=−2z = -2.

Why

False. Theorem B only reaches points strictly nearer the origin. For instance ∑(−1)nzn/(n 2n)\sum (-1)^n z^n/(n\,2^n) (from n=1n = 1) converges at z=2z = 2 (alternating harmonic) and diverges at z=−2z = -2 (harmonic). It does converge absolutely at every ∣z∣<2|z| < 2.

Check yourself Choose one

A power series converges at z=3iz = 3i. At which of these points must it converge absolutely?

Why

Only points with ∣z∣<∣3i∣=3|z| < |3i| = 3 are covered by Theorem B, in any direction: 2.92.9 qualifies. −3i-3i and 33 lie on the same circle (no information), and 44 is further out.

Check yourself Enter a number

∑anzn\sum a_n z^n converges at z1=4z_1 = 4. Theorem B bounds ∣anzn∣|a_n z^n| at ∣z∣=2|z| = 2 by KλnK\lambda^n. What is λ\lambda?

Why

λ=r/r1=2/4=12\lambda = r/r_1 = 2/4 = \tfrac12. The terms at radius 22 decay at least like K/2nK/2^n.

Hardy’s language

If the series converges at P then it converges absolutely at all points nearer to the origin than P.

— G. H. Hardy, §199

Summary

Summary
  • A power series ∑anzn\sum a_n z^n always converges at 00; it may converge everywhere (∑zn/n!\sum z^n/n!), nowhere else (∑n! zn\sum n!\,z^n), or in a disc (∑zn\sum z^n).
  • Theorem B: bounded terms at z1z_1 (in particular, convergence at z1z_1) give absolute convergence at every zz with ∣z∣<∣z1∣|z| < |z_1|.
  • The proof: ∣anzn∣≤K(∣z∣/∣z1∣)n|a_n z^n| \le K(|z|/|z_1|)^n, a convergent geometric series.
  • It says nothing about other points with ∣z∣=∣z1∣|z| = |z_1|.