Chapter IV · Limits of functions of a positive integral variable

Limits of complex sequences and series

§§85–86 30 min

A complex sequence converges when its real and imaginary parts do, or equivalently when its distance from the limit tends to zero; all the real theorems carry over.

Why this matters

Chapter III built the complex numbers; this chapter has so far dealt only with real sequences. The two meet in §85 and §86, and the meeting is needed at once: the next lesson studies znz^n and 1+z+z2+⋯1 + z + z^2 + \cdots for complex zz, and Chapter X builds eze^z, cos⁡z\cos z and log⁡z\log z from complex series. The good news is that no new theory is required. A complex sequence is a pair of real sequences, and closeness in the plane can be measured by the modulus, which behaves like the absolute value.

The idea

Write each term as ϕ(n)=ρ(n)+iσ(n)\phi(n) = \rho(n) + i\sigma(n) with ρ(n)\rho(n) and σ(n)\sigma(n) real. Plotting ϕ(n)\phi(n) in the Argand diagram gives a sequence of points in the plane. “ϕ(n)\phi(n) is close to ll” can be read in two ways: the point is in a small square around ll (both coordinates are close), or in a small disc around ll (the distance ∣ϕ(n)−l∣|\phi(n) - l| is small). Since every disc around ll contains a square around ll, and every square a disc, the two readings give the same notion of limit.

Explore Disc, square, and two real sequences

Try this. For (1+i/n)n(1 + i/n)^n, shrink δ\delta and compare the three values of n0n_0 in the read-out: for the disc, for the real part alone, and for the imaginary part alone. Then look at in/ni^n/n, at the partial sums of ∑(i/2)k\sum (i/2)^k, and finally at ini^n.

ϕ(n)=(1+in)n\phi(n) = \left(1 + \frac{i}{n}\right)^n
ReIm
  • φ(1), …, φ(40)
  • disc |z − l| < δ
  • square: |Re(z − l)| < δ and |Im(z − l)| < δ
nρ(n) = Re φ(n)
nσ(n) = Im φ(n)
Limit l=cos⁡1+isin⁡1l = \cos 1 + i \sin 1. Checked up to n=4000n = 4000, the terms stay in the disc from n0=6n_0 = 6; the real parts stay within δ of rr from n=4n = 4 and the imaginary parts within δ of ss from n=4n = 4. The disc lies inside the square, so the disc’s n0n_0 is never smaller than either of the others.
What to notice

The disc’s n0n_0 is always at least as large as the other two, because the disc fits inside the square; but it is never much larger, because a slightly smaller square fits inside the disc. The partial sums of ∑(i/2)k\sum (i/2)^k spiral into 0.8+0.4i0.8 + 0.4i, and the real and imaginary parts each converge on their own. For ini^n the modulus is always 11 but both parts oscillate: no limit.

Precise statements

Definition Limit of a complex sequence; sum of a complex series Hardy: §85

Let ϕ(n)=ρ(n)+iσ(n)\phi(n) = \rho(n) + i\sigma(n) with ρ(n)\rho(n), σ(n)\sigma(n) real. If ρ(n)→r\rho(n) \to r and σ(n)→s\sigma(n) \to s, then ϕ(n)\phi(n) converges to the limit l=r+isl = r + is, and we write lim⁡ϕ(n)=l\lim \phi(n) = l.

A series ∑un\sum u_n of complex terms un=vn+iwnu_n = v_n + i w_n is convergent with sum l=r+isl = r + is if ∑vn\sum v_n converges to rr and ∑wn\sum w_n to ss; equivalently, if its partial sums u1+⋯+unu_1 + \cdots + u_n converge to ll.

For complex sequences Hardy does not try to classify the ways of failing to converge (divergence, finite or infinite oscillation) as he did for real ones: with two real parts behaving independently there are too many combinations. When needed he says what the real and imaginary parts do.

Theorem The real theorems carry over Hardy: §86 (1)–(9)

For complex sequences and series: changing the start (a shift ϕ(n+p)\phi(n + p), adding or removing finitely many terms of a series) does not affect convergence; limits of sums, constant multiples and products are the sums, multiples and products of the limits; the sum of two convergent series converges to the sum of the sums; the terms of a convergent series tend to 00; and brackets may be inserted in a convergent series.

Theorem Convergence measured by the modulus Hardy: §86 (10), (11)

ϕ(n)→0\phi(n) \to 0 if and only if ∣ϕ(n)∣=ρ(n)2+σ(n)2→0|\phi(n)| = \sqrt{\rho(n)^2 + \sigma(n)^2} \to 0. More generally, ϕ(n)→l\phi(n) \to l if and only if ∣ϕ(n)−l∣→0|\phi(n) - l| \to 0.

So the familiar definition survives word for word: ϕ(n)→l\phi(n) \to l if for every δ>0\delta > 0 there is n0n_0 with ∣ϕ(n)−l∣<δ|\phi(n) - l| < \delta for n≥n0n \ge n_0, where now ∣⋅∣|\cdot| is the modulus.

Theorem Cauchy’s criterion for complex sequences Hardy: §86 (12)

Theorems 1 and 2 of §§83–84 hold for complex sequences and series: ϕ(n)\phi(n) converges if and only if for every δ>0\delta > 0 there is n0n_0 with ∣ϕ(n2)−ϕ(n1)∣<δ|\phi(n_2) - \phi(n_1)| < \delta whenever n2>n1≥n0n_2 > n_1 \ge n_0.

Proofs

Everything rests on two inequalities between a complex number z=x+iyz = x + iy and its parts, which say that the disc and the square nest inside each other:

∣x∣≤∣z∣,∣y∣≤∣z∣,∣z∣≤∣x∣+∣y∣.|x| \le |z|, \qquad |y| \le |z|, \qquad |z| \le |x| + |y|.

The first two hold because x2≤x2+y2x^2 \le x^2 + y^2; the third because (∣x∣+∣y∣)2=x2+y2+2∣x∣∣y∣≥∣z∣2(|x| + |y|)^2 = x^2 + y^2 + 2|x||y| \ge |z|^2.

Proof Convergence measured by the modulus
Strategy

Apply the three inequalities to z=ϕ(n)−lz = \phi(n) - l, whose real and imaginary parts are ρ(n)−r\rho(n) - r and σ(n)−s\sigma(n) - s.

If the parts converge, so does the modulus

If ρ(n)→r\rho(n) \to r and σ(n)→s\sigma(n) \to s, then ∣ρ(n)−r∣+∣σ(n)−s∣→0|\rho(n) - r| + |\sigma(n) - s| \to 0 (sum of two null sequences). Since 0≤∣ϕ(n)−l∣≤∣ρ(n)−r∣+∣σ(n)−s∣0 \le |\phi(n) - l| \le |\rho(n) - r| + |\sigma(n) - s|, also ∣ϕ(n)−l∣→0|\phi(n) - l| \to 0.

If the modulus converges to 00, so do the parts

∣ρ(n)−r∣≤∣ϕ(n)−l∣|\rho(n) - r| \le |\phi(n) - l| and ∣σ(n)−s∣≤∣ϕ(n)−l∣|\sigma(n) - s| \le |\phi(n) - l|. If the right-hand side is less than δ\delta from n0n_0 on, so is each left-hand side.

Conclude

By the definition, ϕ(n)→l\phi(n) \to l means ρ(n)→r\rho(n) \to r and σ(n)→s\sigma(n) \to s, which by the two steps is equivalent to ∣ϕ(n)−l∣→0|\phi(n) - l| \to 0. The case l=0l = 0 is (10).

As an example of the theorems in (1)–(9), here is the product rule, the one Hardy works out.

Proof The limit of a product
Strategy

Multiply out in real and imaginary parts and use the real theorems on each part.

Set up

Let ϕ=ρ+iσ→l=r+is\phi = \rho + i\sigma \to l = r + is and ψ=ρ′+iσ′→m=r′+is′\psi = \rho' + i\sigma' \to m = r' + is'. Then ϕψ=(ρρ′−σσ′)+i(ρσ′+σρ′)\phi\psi = (\rho\rho' - \sigma\sigma') + i(\rho\sigma' + \sigma\rho').

Real part

By the real theorems on sums and products, ρρ′−σσ′→rr′−ss′\rho\rho' - \sigma\sigma' \to rr' - ss'.

Imaginary part

Similarly ρσ′+σρ′→rs′+sr′\rho\sigma' + \sigma\rho' \to rs' + sr'.

Conclude

So ϕψ→(rr′−ss′)+i(rs′+sr′)=(r+is)(r′+is′)=lm\phi\psi \to (rr' - ss') + i(rs' + sr') = (r + is)(r' + is') = lm.

Proof Cauchy’s criterion for complex sequences
Strategy

Necessity is the triangle inequality for the modulus. For sufficiency, the real and imaginary parts inherit Cauchy’s condition from ϕ\phi, because each part of a complex number is at most its modulus; then use the real theorem on each part.

Necessary

If ϕ(n)→l\phi(n) \to l, choose n0n_0 with ∣ϕ(n)−l∣<12δ|\phi(n) - l| < \tfrac12\delta for n≥n0n \ge n_0. Then ∣ϕ(n2)−ϕ(n1)∣≤∣ϕ(n2)−l∣+∣l−ϕ(n1)∣<δ|\phi(n_2) - \phi(n_1)| \le |\phi(n_2) - l| + |l - \phi(n_1)| < \delta.

The parts satisfy the real condition

∣ρ(n2)−ρ(n1)∣≤∣ϕ(n2)−ϕ(n1)∣<δ|\rho(n_2) - \rho(n_1)| \le |\phi(n_2) - \phi(n_1)| < \delta for n2>n1≥n0n_2 > n_1 \ge n_0, and the same for σ\sigma.

Sufficient

By the real criterion, ρ(n)\rho(n) tends to some rr and σ(n)\sigma(n) to some ss, so ϕ(n)→r+is\phi(n) \to r + is.

Worked examples and exercises

Exercise ●○○ Hardy: §86 (10)

Show that in/n→0i^n/n \to 0, and that ini^n has no limit.

Hint
Use the modulus for the first. For the second, look at the real part.

Solution

∣in/n∣=1/n→0|i^n/n| = 1/n \to 0, so in/n→0i^n/n \to 0 by (10).

The values of ini^n cycle through i,−1,−i,1i, -1, -i, 1, so its real part runs through 0,−1,0,1,…0, -1, 0, 1, \dots, which oscillates. Since the real part has no limit, neither has ini^n. Note that ∣in∣=1|i^n| = 1 for every nn: a modulus that converges says nothing about the sequence itself unless its limit is 00.

Exercise Modulus and conjugate ●○○ Hardy: §86

Show that if ϕ(n)→l\phi(n) \to l, then ∣ϕ(n)∣→∣l∣|\phi(n)| \to |l| and ϕ(n)‾→lˉ\overline{\phi(n)} \to \bar l.

Hint
For the modulus, use the triangle inequality in the form ∣∣a∣−∣b∣∣≤∣a−b∣\big||a| - |b|\big| \le |a - b|.

Solution

∣∣ϕ(n)∣−∣l∣∣≤∣ϕ(n)−l∣→0\big||\phi(n)| - |l|\big| \le |\phi(n) - l| \to 0, so ∣ϕ(n)∣→∣l∣|\phi(n)| \to |l|. The conjugate has real part ρ(n)→r\rho(n) \to r and imaginary part −σ(n)→−s-\sigma(n) \to -s, so ϕ(n)‾→r−is=lˉ\overline{\phi(n)} \to r - is = \bar l.

The converse of the first statement is false: ∣in∣→1|i^n| \to 1, but ini^n has no limit.

Exercise ●○○ Hardy: §86 (8)

Show that the terms of a convergent complex series tend to 00, and deduce that ∑in\sum i^n does not converge.

Hint
Copy the real proof: un=sn−sn−1u_n = s_n - s_{n-1}.

Solution

If sn→ls_n \to l, then sn−1→ls_{n-1} \to l by (1), and un=sn−sn−1→l−l=0u_n = s_n - s_{n-1} \to l - l = 0 by (3) and (4). Since ∣in∣=1|i^n| = 1 does not tend to 00, ini^n does not tend to 00 (by (10)), so ∑in\sum i^n cannot converge.

Exercise A complex geometric series, by parts ●●○ Hardy: §86

Find the sum of ∑k≥0(i/2)k\sum_{k \ge 0} (i/2)^k by splitting it into real and imaginary parts.

Hint
The powers of i/2i/2 are 1,i2,−14,−i8,116,…1, \tfrac i2, -\tfrac14, -\tfrac i8, \tfrac1{16}, \dots. The real terms form one geometric series, the imaginary terms another.

Solution

The even powers give the real terms 1−14+116−⋯1 - \tfrac14 + \tfrac1{16} - \cdots, a geometric series with ratio −14-\tfrac14 and sum 11+1/4=45\dfrac{1}{1 + 1/4} = \tfrac45. The odd powers give the imaginary terms i(12−18+132−⋯)i\big(\tfrac12 - \tfrac18 + \tfrac1{32} - \cdots\big), with sum i⋅1/21+1/4=25ii\cdot\dfrac{1/2}{1 + 1/4} = \tfrac25 i. (Strictly, the real and imaginary parts of the kk-th term are 00 for odd and even kk respectively, and dropping zero terms does not affect convergence or sum.) So the sum is 45+25i=0.8+0.4i\tfrac45 + \tfrac25 i = 0.8 + 0.4i, which agrees with 1/(1−i/2)1/(1 - i/2), the formula of the next lesson: 11−i/2=1+i/21+1/4=0.8+0.4i\dfrac{1}{1 - i/2} = \dfrac{1 + i/2}{1 + 1/4} = 0.8 + 0.4i.

Check yourself

Check yourself True or false?

If ∣ϕ(n)∣|\phi(n)| converges, then ϕ(n)\phi(n) converges.

Why

False: ∣in∣=1|i^n| = 1 for every nn, but ini^n circles round i,−1,−i,1i, -1, -i, 1 for ever. The modulus throws away the direction. Theorem (10) only works for the limit 00, where the direction does not matter; in general one must use ∣ϕ(n)−l∣|\phi(n) - l|, which needs a candidate ll.

Check yourself Enter a number

Suppose ∣ρ(n)−r∣<0.03|\rho(n) - r| < 0.03 and ∣σ(n)−s∣<0.04|\sigma(n) - s| < 0.04. What is the best bound this gives for ∣ϕ(n)−l∣|\phi(n) - l|?

Why

∣ϕ(n)−l∣=(ρ−r)2+(σ−s)2<0.032+0.042=0.05|\phi(n) - l| = \sqrt{(\rho - r)^2 + (\sigma - s)^2} < \sqrt{0.03^2 + 0.04^2} = 0.05. The cruder bound ∣ρ−r∣+∣σ−s∣<0.07|\rho - r| + |\sigma - s| < 0.07 used in the proof is also fine for proving limits: any bound that tends to 00 will do.

Check yourself Choose one

Why does Hardy not define “oscillates finitely” and “diverges to ∞\infty” for complex sequences?

Why

Each part could converge, diverge to ±∞\pm\infty, or oscillate finitely or infinitely, independently of the other. Instead Hardy describes the parts separately when needed. (Some later books do say “ϕ(n)→∞\phi(n) \to \infty” when ∣ϕ(n)∣→+∞|\phi(n)| \to +\infty; Hardy uses that idea in Chapter X.)

Hardy’s language

Summary

Summary
  • ρ(n)+iσ(n)→r+is\rho(n) + i\sigma(n) \to r + is means ρ(n)→r\rho(n) \to r and σ(n)→s\sigma(n) \to s.
  • Equivalently ∣ϕ(n)−l∣→0|\phi(n) - l| \to 0: the definition of a limit reads as before, with the modulus for the absolute value. Discs and squares around ll nest inside each other.
  • All the algebra of limits, the theorems on series, and Cauchy’s criterion hold for complex sequences.
  • A convergent modulus does not make the sequence converge (ini^n), except when the limit of the modulus is 00.