Chapter IV · Limits of functions of a positive integral variable

The bounds of a sequence

§81 25 min

The upper and lower bounds of a bounded sequence, their working form with δ\delta, and why an increasing bounded sequence tends to its upper bound.

Why this matters

A sequence ϕ(n)\phi(n) has a set of values, and the last lesson gives that set an upper and a lower bound. §81 restates the result for sequences in the form that proofs actually use: one inequality for all nn, and one for at least one nn, with a tolerance δ\delta. With it we can say exactly what an increasing bounded sequence tends to, and we can see why the bounds are not yet the right tool for describing oscillation, which is what the next lesson is for.

The idea

The upper bound MM of a sequence is the least number that no term exceeds. Property (ii) is the interesting half: however thin a strip (M−δ,M](M - \delta, M] we draw below MM, some term falls into it. Sometimes a single term does this for every δ\delta (the bound is attained, a largest term exists). Sometimes no term reaches MM, and then the terms in the strip are pushed further out as the strip narrows.

Explore Every strip below MM catches a term

Try this. For 1−1/n1 - 1/n, shrink δ\delta and watch which term is the first inside the green strip. Then do the same for (−1)n/n(-1)^n/n and for (−1)n(1+1/n)(-1)^n(1 + 1/n). Finally choose nn+1sin⁡12nπ\tfrac{n}{n+1}\sin\tfrac12 n\pi and look at both bounds.

ϕ(n)=1−1n\phi(n) = 1 - \frac1n
nφ(n)
  • upper bound M and lower bound m
  • the strip M − δ < y ≤ M
  • terms in the strip
  • the first of them
Bound
M=1M = 1, not attained: no term equals it. The first term with ϕ(n)>M−δ\phi(n) > M - \delta is ϕ(11)=0.909091\phi(11) = 0.909091. Shrink δ: this term moves further out, but there always is one.
What to notice

For 1−1/n1 - 1/n the first term in the strip has nn just above 1/δ1/\delta: it runs away as δ→0\delta \to 0, because M=1M = 1 is never attained. For (−1)n/n(-1)^n/n the term ϕ(2)=12\phi(2) = \tfrac12 is in every strip: the bound is attained, and this term alone settles property (ii). The last sequence attains neither bound.

Precise statements

Definition Bounds of a sequence Hardy: §81

ϕ(n)\phi(n) is bounded above if there is a KK with ϕ(n)≤K\phi(n) \le K for all nn; then there is a unique number MM, its upper bound, such that

  • (i) ϕ(n)≤M\phi(n) \le M for all nn, and
  • (ii) for every δ>0\delta > 0, ϕ(n)>M−δ\phi(n) > M - \delta for at least one nn.

Similarly, if ϕ(n)\phi(n) is bounded below, its lower bound mm satisfies (i) ϕ(n)≥m\phi(n) \ge m for all nn and (ii) for every δ>0\delta > 0, ϕ(n)<m+δ\phi(n) < m + \delta for at least one nn. A sequence bounded above and below is bounded, and then k≤m≤M≤Kk \le m \le M \le K for any bounds kk, KK.

This is the theorem of §80 applied to the set of values {ϕ(1),ϕ(2),… }\{\phi(1), \phi(2), \dots\}, with “every number less than MM is exceeded” written as “M−δM - \delta is exceeded, for every δ>0\delta > 0”.

Theorem An increasing bounded sequence tends to its upper bound Hardy: cf. §69

If ϕ(n)\phi(n) increases steadily (ϕ(n+1)≥ϕ(n)\phi(n+1) \ge \phi(n) for all nn) and is bounded above, then ϕ(n)→M\phi(n) \to M, its upper bound. Likewise a decreasing sequence bounded below tends to its lower bound.

§69 proved that such a sequence has a limit by a direct Dedekind argument. The bounds tell us at once which number the limit is.

Theorem An unattained bound is approached infinitely often

If ϕ(n)\phi(n) is bounded above and no term equals its upper bound MM, then for every δ>0\delta > 0 there are infinitely many nn with ϕ(n)>M−δ\phi(n) > M - \delta.

Proofs

Proof An increasing bounded sequence tends to its upper bound
Strategy

Property (ii) gives one term inside the strip (M−δ,M](M - \delta, M]. Because the sequence increases, every later term is at least as high, and property (i) keeps all of them at or below MM. So the whole tail lies in the strip.

Let δ>0\delta > 0 and find one term in the strip

By (ii) there is an n0n_0 with ϕ(n0)>M−δ\phi(n_0) > M - \delta.

All later terms are in the strip too

For n≥n0n \ge n_0, ϕ(n)≥ϕ(n0)>M−δ\phi(n) \ge \phi(n_0) > M - \delta because the sequence increases, and ϕ(n)≤M\phi(n) \le M by (i).

Conclude

So ∣ϕ(n)−M∣<δ|\phi(n) - M| < \delta for all n≥n0n \ge n_0. As δ\delta was arbitrary, ϕ(n)→M\phi(n) \to M. For a decreasing sequence apply this to −ϕ(n)-\phi(n), whose upper bound is −m-m.

Proof An unattained bound is approached infinitely often
Strategy

Suppose only finitely many terms lie above M−δM - \delta. The largest of them is still below MM, so a thinner strip would contain no term at all, contradicting property (ii).

Suppose not

Then for some δ>0\delta > 0 only finitely many terms satisfy ϕ(n)>M−δ\phi(n) > M - \delta. There is at least one, by (ii); let μ\mu be the largest of these finitely many values.

μ<M\mu < M

μ≤M\mu \le M by (i), and μ≠M\mu \ne M because MM is not attained.

Contradiction

Put δ′=M−μ>0\delta' = M - \mu > 0. Any term with ϕ(n)>M−δ′\phi(n) > M - \delta' would satisfy ϕ(n)>μ≥M−δ\phi(n) > \mu \ge M - \delta, so it would be one of the finitely many terms, and yet greater than their largest value μ\mu. Hence no term exceeds M−δ′M - \delta', contradicting (ii).

So for 1−1/n1 - 1/n, every strip below 11 contains not one but infinitely many terms. In the language of the next lesson: an unattained upper bound is also the upper limit.

Worked examples and exercises

Exercise ●○○ Hardy: Examples XXXII, 2–6 (bounds only)

Find the upper and lower bounds MM and mm of (a) a constant sequence ϕ(n)=a\phi(n) = a; (b) 1/n1/n; (c) (−1)n(-1)^n; (d) (−1)n/n(-1)^n/n; (e) (−1)n(1+1/n)(-1)^n(1 + 1/n). Which are attained?

Hint
List the first few terms. For (d) and (e) treat even and odd nn separately.

Solution

(a) m=M=am = M = a, attained everywhere. (b) M=1M = 1 (attained at n=1n = 1), m=0m = 0 (not attained). (c) M=1M = 1, m=−1m = -1, both attained infinitely often. (d) The even terms 1/n1/n have largest value 12\tfrac12 at n=2n = 2; the odd terms −1/n-1/n have smallest value −1-1 at n=1n = 1. So M=12M = \tfrac12 and m=−1m = -1, both attained. (e) Even terms 1+1/n1 + 1/n decrease from 32\tfrac32; odd terms −(1+1/n)-(1 + 1/n) increase from −2-2. So M=32M = \tfrac32 (at n=2n = 2) and m=−2m = -2 (at n=1n = 1).

Exercise Convergent sequences are bounded ●○○ Hardy: §84

Show that if ϕ(n)→l\phi(n) \to l, then ϕ(n)\phi(n) is bounded.

Hint
Use the definition of the limit with δ=1\delta = 1. Only finitely many terms are left over.

Solution

Take δ=1\delta = 1: there is an n0n_0 with l−1<ϕ(n)<l+1l - 1 < \phi(n) < l + 1 for n≥n0n \ge n_0. The finitely many terms ϕ(1),…,ϕ(n0−1)\phi(1), \dots, \phi(n_0 - 1) have a largest and a smallest value. So K=max⁡(l+1,ϕ(1),…,ϕ(n0−1))K = \max(l + 1, \phi(1), \dots, \phi(n_0 - 1)) is an upper bound and k=min⁡(l−1,ϕ(1),…,ϕ(n0−1))k = \min(l - 1, \phi(1), \dots, \phi(n_0 - 1)) a lower bound.

Exercise ●●○ Hardy: §81

Find the bounds of ϕ(n)=nn+1sin⁡12nπ\phi(n) = \dfrac{n}{n+1} \sin \tfrac12 n\pi, and show that neither is attained.

Hint
The sine is 1,0,−1,01, 0, -1, 0 as n≡1,2,3,0(mod4)n \equiv 1, 2, 3, 0 \pmod 4.

Solution

The terms are 00 for even nn, nn+1\dfrac{n}{n+1} for n≡1(mod4)n \equiv 1 \pmod 4, and −nn+1-\dfrac{n}{n+1} for n≡3(mod4)n \equiv 3 \pmod 4. Since 0<nn+1<10 < \dfrac{n}{n+1} < 1, every term satisfies −1<ϕ(n)<1-1 < \phi(n) < 1, so 11 and −1-1 are bounds and neither is attained. They are the least and greatest such: given δ>0\delta > 0, choose n≡1(mod4)n \equiv 1 \pmod 4 with n>1/δn > 1/\delta; then nn+1=1−1n+1>1−δ\dfrac{n}{n+1} = 1 - \dfrac{1}{n+1} > 1 - \delta. Similarly with n≡3(mod4)n \equiv 3 \pmod 4 for m=−1m = -1. So M=1M = 1, m=−1m = -1.

Exercise ●●○ Hardy: §81

Let ϕ(n)\phi(n) be bounded above with upper bound MM, and suppose MM is attained. Must ϕ(n)>M−δ\phi(n) > M - \delta hold for infinitely many nn?

Hint
Look at (−1)n/n(-1)^n/n.

Solution

No. For (−1)n/n(-1)^n/n, M=12M = \tfrac12 is attained only at n=2n = 2, and every other term is at most 14\tfrac14. With δ=14\delta = \tfrac14 the only term above M−δ=14M - \delta = \tfrac14 is ϕ(2)\phi(2). So the previous theorem really needs its hypothesis that MM is not attained. It is the tail of the sequence, not a single early term, that controls the long-run behaviour.

Check yourself

Check yourself Choose one

Property (ii) of the upper bound says: for every δ>0\delta > 0 …

Why

One term is enough: (ii) only rules out a smaller upper bound. “For all sufficiently large nn” would make MM the limit, which fails for (−1)n(-1)^n (where M=1M = 1 but the odd terms are −1-1). The third option is trivially true by (i). The last is attainment, which may fail.

Check yourself True or false?

If ϕ(n)→l\phi(n) \to l, then ll is the upper bound or the lower bound of ϕ(n)\phi(n).

Why

False. For (−1)n/n(-1)^n/n, l=0l = 0, but M=12M = \tfrac12 and m=−1m = -1. The bounds depend on every term, including the first few; the limit depends only on the tail. What is true is that m≤l≤Mm \le l \le M, and for a monotone bounded sequence the limit is one of the bounds.

Check yourself Enter a number

For ϕ(n)=1−1/n\phi(n) = 1 - 1/n and δ=0.001\delta = 0.001, what is the first nn with ϕ(n)>M−δ\phi(n) > M - \delta?

Why

M=1M = 1, so we need 1−1/n>0.9991 - 1/n > 0.999, that is n>1000n > 1000. The answer is n=1001n = 1001.

Hardy’s language

Summary

Summary
  • The upper bound MM of a bounded-above sequence: (i) ϕ(n)≤M\phi(n) \le M for all nn; (ii) for every δ>0\delta > 0, ϕ(n)>M−δ\phi(n) > M - \delta for some nn.
  • An increasing sequence that is bounded above tends to its upper bound; a decreasing one bounded below tends to its lower bound.
  • If MM is not attained, every strip (M−δ,M](M - \delta, M] contains infinitely many terms.
  • The bounds depend on all the terms, the limit only on the tail. Describing the tail of an oscillating sequence needs the upper and lower limits, next.