Chapter IV · Limits of functions of a positive integral variable

Oscillating sequences

§62 30 min

A sequence that neither tends to a limit nor to plus or minus infinity oscillates, finitely if it is bounded and infinitely if not.

Why this matters

The last lesson defined three definite behaviours: tending to a limit ll, to +∞+\infty, or to −∞-\infty. Most sequences you can write down do none of these. §62 gives them a name, oscillation, and splits them into two kinds according to whether they stay within fixed bounds. The result is a complete classification: every sequence behaves in exactly one of five ways, and much of the rest of the chapter asks which of the five a given sequence falls into.

The idea

(−1)n(-1)^n jumps between −1-1 and 11 for ever. It certainly does not tend to +∞+\infty or −∞-\infty, since it never exceeds 11 in size. Does it tend to some limit ll? Try to find one.

Explore No limit for (−1)n(-1)^n

Try this. Keep δ=0.5\delta = 0.5. Move the candidate limit ll anywhere you like, and look for an n0n_0 after which no point is orange.

ϕ(n)=(−1)n\phi(n) = (-1)^n , candidate limit l=0l = 0
nφ(n)
  • band l ± δ
  • l
  • n₀ (drag)
  • n ≥ n₀, good
  • n ≥ n₀, bad
40 terms with n ≥ n₀ fall outside the band: n = 1, 2, 3, 4, 5, ….
What to notice

With ll near 11 the odd terms escape, with ll near −1-1 the even ones, and with ll in between both do. A band of total width 2δ=12\delta = 1 cannot contain two points at distance 22 apart, whatever ll is.

So (−1)n(-1)^n does none of the three things. Hardy’s definition of oscillation is simply the name for this: it is defined negatively, as the failure of all three. That makes oscillation a large and varied class. It includes sequences whose values repeat in a cycle, like (−1)n(-1)^n or cos⁡13nπ\cos \tfrac13 n\pi, sequences that never repeat but settle near two values, like (−1)n+1/n(-1)^n + 1/n, and sequences whose size grows without bound, like (−1)nn(-1)^n n.

The last example suggests the split. Some oscillating sequences stay in a fixed range −K<ϕ(n)<K-K < \phi(n) < K; others do not. Classify the gallery yourself.

Explore Five behaviours

Try this. For each sequence, choose one of the five verdicts before reading the reason. Use “show the largest ∣ϕ(n)∣|\phi(n)| so far” and the number of terms shown. Look hardest at numbers 3, 6, 7 and 13.

ϕ(n)=(−1)n\phi(n) = (-1)^n (§62)
nφ(n)
  • φ(n)
  • ± largest |φ(n)| so far
Terms shown
Your verdict
Largest ∣ϕ(n)∣|\phi(n)| for n≤100n \le 100: 11 (at n=1n = 1). A picture of finitely many terms can suggest, never prove. Choose a verdict, then read the reason.
What to notice

The dashed lines show the largest size so far. If they keep moving outwards as you show more terms, the sequence is unbounded (it tends to ±∞\pm\infty or oscillates infinitely); if they stop, it is bounded (it tends to a limit or oscillates finitely). Number 6 goes backwards at every odd step yet tends to +∞+\infty; number 13 changes sign at every step yet tends to 00.

Precise statements

Definition Oscillation Hardy: §62

A sequence ϕ(n)\phi(n) oscillates (as n→∞n \to \infty) if it does not tend to a limit, does not tend to +∞+\infty and does not tend to −∞-\infty.

Definition Finite and infinite oscillation Hardy: §62

An oscillating sequence ϕ(n)\phi(n) oscillates finitely if there is a number KK such that ∣ϕ(n)∣<K|\phi(n)| < K for every nn, and oscillates infinitely if there is no such KK.

A sequence with ∣ϕ(n)∣<K|\phi(n)| < K for all nn is called bounded. So the five behaviours are:

behaviourbounded?example
tends to a limityes(−1)n/n(-1)^n/n
oscillates finitelyyes(−1)n(-1)^n
tends to +∞+\inftynon2+(−1)n2nn^2 + (-1)^n 2n
tends to −∞-\inftyno100−n100 - n
oscillates infinitelyno(−1)nn(-1)^n n

The table claims that boundedness splits the five behaviours exactly as shown. Two facts are needed.

Theorem A convergent sequence is bounded

If ϕ(n)\phi(n) tends to a limit ll, there is a number KK with ∣ϕ(n)∣<K|\phi(n)| < K for every nn.

Theorem A sequence tending to ±∞\pm\infty is unbounded

If ϕ(n)→+∞\phi(n) \to +\infty or ϕ(n)→−∞\phi(n) \to -\infty, there is no KK with ∣ϕ(n)∣<K|\phi(n)| < K for every nn.

Corollary The classification

A bounded sequence either tends to a limit or oscillates finitely. An unbounded sequence either tends to +∞+\infty, tends to −∞-\infty, or oscillates infinitely. Every sequence does exactly one of the five.

Proofs

Proof A convergent sequence is bounded
Strategy

The tail is trapped in a band around ll of width 11; the finitely many terms before it are bounded by their largest size. Take the larger of the two bounds.

Use the definition with δ=1\delta = 1

There is an n0n_0 with ∣ϕ(n)−l∣<1|\phi(n) - l| < 1 for all n≥n0n \ge n_0. For those nn, ∣ϕ(n)∣≤∣ϕ(n)−l∣+∣l∣<1+∣l∣|\phi(n)| \le |\phi(n) - l| + |l| < 1 + |l|.

Deal with the first few terms

The terms ϕ(1),…,ϕ(n0−1)\phi(1), \dots, \phi(n_0 - 1) are finitely many, so one of them, say of size MM, is largest in absolute value (take M=0M = 0 if n0=1n_0 = 1).

Combine

Put K=max⁡(M+1, 1+∣l∣)K = \max(M + 1,\ 1 + |l|). Every nn is either below n0n_0, when ∣ϕ(n)∣≤M<K|\phi(n)| \le M < K, or at least n0n_0, when ∣ϕ(n)∣<1+∣l∣≤K|\phi(n)| < 1 + |l| \le K.

Proof A sequence tending to ±∞\pm\infty is unbounded
Strategy

Any proposed bound KK is itself a value of Δ\Delta that the sequence must eventually exceed.

Suppose ∣ϕ(n)∣<K|\phi(n)| < K for every nn

If ϕ(n)→+∞\phi(n) \to +\infty, apply Definition II with Δ=K\Delta = K: for large nn, ϕ(n)>K\phi(n) > K, contradicting ϕ(n)≤∣ϕ(n)∣<K\phi(n) \le |\phi(n)| < K.

The case −∞-\infty

If ϕ(n)→−∞\phi(n) \to -\infty, then for large nn, ϕ(n)<−K\phi(n) < -K, so ∣ϕ(n)∣>K|\phi(n)| > K: again a contradiction.

The corollary now follows by sorting: a bounded sequence cannot tend to ±∞\pm\infty, so if it does not converge it oscillates, and then finitely; an unbounded one cannot converge, so it tends to ±∞\pm\infty or oscillates, and then infinitely. The five cases exclude one another because a sequence cannot have two different limits (an exercise below), and cannot tend both to a limit and to ±∞\pm\infty (bounded versus unbounded).

Finally, the example we started with, done properly.

Proof (−1)n(-1)^n oscillates finitely
Strategy

It is bounded, so by the classification we only need to show that it has no limit. If it had a limit ll, then from some point on both 11 and −1-1 would be within 12\tfrac12 of ll, which is impossible.

Bounded

∣(−1)n∣=1<2|(-1)^n| = 1 < 2 for every nn, so K=2K = 2 works.

Suppose (−1)n→l(-1)^n \to l; take δ=12\delta = \tfrac12

There is an n0n_0 with ∣(−1)n−l∣<12|(-1)^n - l| < \tfrac12 for all n≥n0n \ge n_0. Among the n≥n0n \ge n_0 there are even ones and odd ones.

Contradiction

An even nn gives ∣1−l∣<12|1 - l| < \tfrac12 and an odd one gives ∣−1−l∣<12|{-1} - l| < \tfrac12. Then 2=∣1−(−1)∣≤∣1−l∣+∣l−(−1)∣<12+12=12 = |1 - (-1)| \le |1 - l| + |l - (-1)| < \tfrac12 + \tfrac12 = 1, which is false.

Worked examples and exercises

Exercise Five quick verdicts ●○○ Hardy: Examples XXIV, 1–3

Classify: (a) 5+3(−1)n5 + 3(-1)^n; (b) 1 000 000 n−1+(−1)n1\,000\,000\,n^{-1} + (-1)^n; (c) 1 000 000+(−1)nn1\,000\,000 + (-1)^n n; (d) 1 000 000−n1\,000\,000 - n; (e) (−1)n(1 000 000−n)(-1)^n(1\,000\,000 - n).

Solution

(a) Values 2,8,2,8,…2, 8, 2, 8, \dots: bounded, no limit (as for (−1)n(-1)^n), so oscillates finitely. (b) ∣ϕ(n)∣≤106+1|\phi(n)| \le 10^6 + 1 for all nn, and for large nn the values are near 11 (even nn) or −1-1 (odd nn), so there is no limit: oscillates finitely, despite the huge early values. (c) Unbounded, and the odd terms 106−n10^6 - n are eventually negative while the even ones are eventually huge, so it neither tends to +∞+\infty nor to −∞-\infty: oscillates infinitely. (d) Tends to −∞-\infty: it is below −Δ-\Delta once n>106+Δn > 10^6 + \Delta. (e) For n>106n > 10^6 the size n−106n - 10^6 is unbounded and the sign alternates: oscillates infinitely.

Exercise Steps back do not make oscillation ●○○ Hardy: Examples XXIV, 5

Show that ϕ(n)=n2+(−1)n2n\phi(n) = n^2 + (-1)^n 2n tends to +∞+\infty, although ϕ(2k+1)<ϕ(2k)\phi(2k + 1) < \phi(2k) for every k≥1k \ge 1.

Hint
ϕ(n)≥n2−2n=(n−1)2−1\phi(n) \ge n^2 - 2n = (n-1)^2 - 1.

Solution

Since (−1)n2n≥−2n(-1)^n 2n \ge -2n, we have ϕ(n)≥(n−1)2−1\phi(n) \ge (n-1)^2 - 1. Given Δ\Delta, if n>1+Δ+1n > 1 + \sqrt{\Delta + 1} (for Δ≥−1\Delta \ge -1; any nn works otherwise) then (n−1)2−1>Δ(n-1)^2 - 1 > \Delta. So ϕ(n)>Δ\phi(n) > \Delta for large nn. On the other hand ϕ(2k)=4k2+4k\phi(2k) = 4k^2 + 4k and ϕ(2k+1)=(2k+1)2−2(2k+1)=4k2−1\phi(2k+1) = (2k+1)^2 - 2(2k+1) = 4k^2 - 1, which is smaller. The sequence takes a step back at every odd nn, but “oscillates” is defined by what a sequence does not do, and this one does tend to +∞+\infty.

Exercise A limit is unique ●○○ Hardy: §62

Show that a sequence cannot tend to two different limits ll and l′l'.

Hint
Take δ=12∣l−l′∣\delta = \tfrac12|l - l'| and use the “two properties at once” theorem from “For large values of n”.

Solution

Suppose ϕ(n)→l\phi(n) \to l and ϕ(n)→l′\phi(n) \to l' with l≠l′l \ne l', and let δ=12∣l−l′∣>0\delta = \tfrac12|l - l'| > 0. For large nn, ∣ϕ(n)−l∣<δ|\phi(n) - l| < \delta, and for large nn, ∣ϕ(n)−l′∣<δ|\phi(n) - l'| < \delta; so for large nn both hold at once. For such an nn, ∣l−l′∣≤∣l−ϕ(n)∣+∣ϕ(n)−l′∣<2δ=∣l−l′∣|l - l'| \le |l - \phi(n)| + |\phi(n) - l'| < 2\delta = |l - l'|, a contradiction.

Exercise Crossing an oscillating sequence ●●○ Hardy: Examples XXV, 6

Is this true? “If ϕ(n)\phi(n) oscillates, and for arbitrarily large nn we have both ψ(n)>ϕ(n)\psi(n) > \phi(n) and ψ(n)<ϕ(n)\psi(n) < \phi(n), then ψ(n)\psi(n) oscillates.” Prove it or give a counterexample.

Solution

False. Take ϕ(n)=(−1)n\phi(n) = (-1)^n, which oscillates, and ψ(n)=0\psi(n) = 0. For every odd nn, ψ(n)=0>−1=ϕ(n)\psi(n) = 0 > -1 = \phi(n), and for every even nn, ψ(n)=0<1=ϕ(n)\psi(n) = 0 < 1 = \phi(n), so both happen for arbitrarily large nn. But ψ(n)→0\psi(n) \to 0. Crossing an oscillating sequence infinitely often says nothing about one’s own behaviour.

Exercise The least n0n_0 ●●○ Hardy: Examples XXV, 10 (a), 11 (b)

Find the least n0n_0 such that n+(−1)n>1000n + (-1)^n > 1000 for all n≥n0n \ge n_0. Then do the same with 10001000 replaced by Δ>0\Delta > 0.

Hint
Treat even and odd nn separately: the even terms are n+1n + 1, the odd terms n−1n - 1.

Solution

Even nn: n+1>1000n + 1 > 1000 means n≥1000n \ge 1000. Odd nn: n−1>1000n - 1 > 1000 means n≥1003n \ge 1003. So n=1001n = 1001 fails (its term is exactly 10001000), while 10021002 (term 10031003) and every later nn succeed. The least n0n_0 is 10021002.

In general, write m=[Δ]m = [\Delta]. Even nn need n+1>Δn + 1 > \Delta, odd nn need n−1>Δn - 1 > \Delta, that is n−1≥m+1n - 1 \ge m + 1. Working through the parities as above gives n0=m+1n_0 = m + 1 if mm is odd and n0=m+2n_0 = m + 2 if mm is even, which is Hardy’s answer n0=1+[Δ]+12{1+(−1)[Δ]}n_0 = 1 + [\Delta] + \tfrac12\{1 + (-1)^{[\Delta]}\}. Check: Δ=1000\Delta = 1000, mm even, n0=1002n_0 = 1002.

Exercise sin⁡nθπ\sin n\theta\pi oscillates unless θ\theta is an integer ●●● Hardy: Examples XXIV, 7

Let θ\theta be a real number that is not an integer. Show that sin⁡nθπ\sin n\theta\pi oscillates finitely. (Use the rules for limits of sums and products from Limits of sums, products and quotients.)

Hint
It is bounded, so suppose sin⁡nθπ→l\sin n\theta\pi \to l. Use sin⁡(n+1)α−sin⁡(n−1)α=2sin⁡αcos⁡nα\sin(n+1)\alpha - \sin(n-1)\alpha = 2\sin\alpha\cos n\alpha with α=θπ\alpha = \theta\pi to show cos⁡nθπ→0\cos n\theta\pi \to 0.
Hint
Then expand cos⁡(n+1)α=cos⁡nαcos⁡α−sin⁡nαsin⁡α\cos(n+1)\alpha = \cos n\alpha\cos\alpha - \sin n\alpha \sin\alpha, and compare with sin⁡2+cos⁡2=1\sin^2 + \cos^2 = 1.

Solution

Put α=θπ\alpha = \theta\pi. Since θ\theta is not an integer, sin⁡α≠0\sin\alpha \ne 0. The sequence is bounded by 11, so we must only rule out a limit. Suppose sin⁡nα→l\sin n\alpha \to l. The shifted sequences sin⁡(n+1)α\sin(n+1)\alpha and sin⁡(n−1)α\sin(n-1)\alpha also tend to ll (shifting does not change a limit), so

2sin⁡α cos⁡nα=sin⁡(n+1)α−sin⁡(n−1)α→l−l=0,2\sin\alpha\,\cos n\alpha = \sin(n+1)\alpha - \sin(n-1)\alpha \to l - l = 0,

and dividing by the constant 2sin⁡α≠02\sin\alpha \ne 0, cos⁡nα→0\cos n\alpha \to 0. Now cos⁡(n+1)α=cos⁡nαcos⁡α−sin⁡nαsin⁡α\cos(n+1)\alpha = \cos n\alpha \cos\alpha - \sin n\alpha \sin\alpha. The left side tends to 00 (a shift of cos⁡nα\cos n\alpha) and the right side tends to 0⋅cos⁡α−lsin⁡α0 \cdot \cos\alpha - l\sin\alpha. So lsin⁡α=0l\sin\alpha = 0, and l=0l = 0. But then sin⁡2nα+cos⁡2nα→0+0=0\sin^2 n\alpha + \cos^2 n\alpha \to 0 + 0 = 0, while it equals 11 for every nn. This contradiction shows that there is no limit: sin⁡nθπ\sin n\theta\pi oscillates finitely. (For integral θ\theta every term is 00.)

Check yourself

Check yourself Choose one

A sequence “oscillates” in Hardy’s sense when:

Why

Oscillation is defined negatively. Going up and down is not enough: n2+(−1)n2nn^2 + (-1)^n 2n goes up and down and tends to +∞+\infty. Changing sign is not enough: (−1)n/n(-1)^n/n changes sign and tends to 00. Repeating in a cycle is one way to oscillate, but (−1)n+1/n(-1)^n + 1/n oscillates without ever repeating.

Check yourself True or false?

A bounded sequence either tends to a limit or oscillates finitely.

Why

True. A bounded sequence cannot tend to +∞+\infty or −∞-\infty (those are unbounded), so if it has no limit it oscillates, and its oscillation is finite because it is bounded.

Check yourself Choose one

Which sequence oscillates finitely?

Why

∣100(−1)n+1000/n∣≤900|100(-1)^n + 1000/n| \le 900 for every nn (the largest is at n=1n = 1), and for large nn the values are near ±100\pm 100, so it oscillates and is bounded. The first and third are unbounded (infinite oscillation), and the last tends to 00.

Check yourself True or false?

If the first million terms of a sequence include values larger than 10910^{9}, the sequence cannot oscillate finitely.

Why

False. Finite oscillation asks only for some bound KK, however large; finitely many huge terms just make KK huge. 1015/n+(−1)n10^{15}/n + (-1)^n starts enormous and oscillates finitely.

Hardy’s language

Oscillation is defined in a negative manner: a function oscillates when it does not do certain other things.

— G. H. Hardy, §62

Summary

Summary
  • A sequence oscillates if it tends neither to a limit nor to +∞+\infty nor to −∞-\infty; the definition is purely negative.
  • It oscillates finitely if some KK bounds every ∣ϕ(n)∣|\phi(n)|, and infinitely otherwise.
  • Convergent sequences are bounded; sequences tending to ±∞\pm\infty are not. So bounded sequences converge or oscillate finitely, unbounded ones tend to ±∞\pm\infty or oscillate infinitely.
  • Every sequence does exactly one of the five things. Going backwards now and then, or changing sign, does not by itself make a sequence oscillate.
  • To show there is no limit, suppose ll exists and choose δ\delta small enough to produce a contradiction, as for (−1)n(-1)^n with δ=12\delta = \tfrac12.