Chapter IV · Limits of functions of a positive integral variable

Upper and lower limits

§82 40 min

Hardy’s “limits of indetermination” lim⁡‾ ϕ(n)\overline{\lim}\,\phi(n) and lim⁡‾ ϕ(n)\underline{\lim}\,\phi(n), which every bounded sequence has, and which coincide exactly when it converges.

Why this matters

A bounded sequence need not converge, but it does not wander arbitrarily either. The terms of (−1)n(1+1/n)(-1)^n(1 + 1/n) crowd ever closer to 11 and −1-1; the terms of sin⁡13nπ\sin \tfrac13 n\pi take three values over and over. §82 attaches to every bounded sequence two numbers that describe its long-run range: the upper limit Λ\Lambda and the lower limit λ\lambda. Unlike the bounds, they ignore any finite number of terms. Unlike the limit, they always exist. And the sequence converges exactly when they are equal, which is the key to Cauchy’s principle in the next lesson.

The idea

Hold a horizontal level ξ\xi against the plotted sequence and ask about the large values of nn only. Three things can happen:

  1. eventually every term is at or below ξ\xi: call ξ\xi superior;
  2. eventually every term is at or above ξ\xi: call ξ\xi inferior;
  3. infinitely many terms are above ξ\xi and infinitely many below: call ξ\xi intermediate.

A level far above the sequence is superior, one far below is inferior. Raise ξ\xi from the bottom: at some height it stops being inferior; lower it from the top: at some height it stops being superior. Those two heights are λ\lambda and Λ\Lambda.

Explore Sort the levels

Try this. With (−1)n(1+1/n)(-1)^n(1 + 1/n), move ξ\xi from top to bottom and read the classification. Pay special attention to ξ=1\xi = 1 and ξ=−1\xi = -1 (the slider snaps to them). Then try 1+(−1)n/n1 + (-1)^n/n at ξ=1\xi = 1, and sin⁡13nπ\sin\tfrac13 n\pi. Turn on “Show Λ\Lambda and λ\lambda”.

ϕ(n)=(−1)n(1+1n)\phi(n) = (-1)^n\left(1 + \frac1n\right)
nφ(n)
  • your level ξ
  • terms above ξ
  • terms below ξ
Of the first 60 terms, 30 lie above ξ=0.5\xi = 0.5 and 30 below. In the long run: infinitely many terms lie above ξ, namely the terms for even n (they tend to 1); infinitely many lie below ξ, namely the terms for odd n (they tend to −1). So ξ is intermediate.
What to notice

Every ξ>1\xi > 1 is superior and every ξ<−1\xi < -1 inferior; everything strictly between is intermediate. So Λ=1\Lambda = 1 and λ=−1\lambda = -1, although the bounds are 32\tfrac32 and −2-2. Whether Λ\Lambda itself is superior or intermediate depends on how the terms approach it, which is why Λ\Lambda is defined as the lower bound of the superior numbers. For 1+(−1)n/n1 + (-1)^n/n, Λ=λ=1\Lambda = \lambda = 1: the sequence converges, and its limit is the one intermediate number.

There is a second way to see Λ\Lambda, which most modern books use as the definition. For each kk take the upper bound of the tail ϕ(k),ϕ(k+1),…\phi(k), \phi(k+1), \dots; call it MkM_k. Dropping terms can only lower an upper bound, so M1≥M2≥M3≥⋯M_1 \ge M_2 \ge M_3 \ge \cdots, and this decreasing sequence tends to Λ\Lambda. Similarly the tail lower bounds mkm_k increase to λ\lambda.

Explore Envelopes that close in

Try this. Drag the purple tail start kk to the right, or step it with the buttons. Watch the ochre envelopes MkM_k (upper bound of the tail) and mkm_k (lower bound of the tail). Then show more terms.

ϕ(n)=(−1)n(1+1n)\phi(n) = (-1)^n\left(1+\frac1n\right)
nφ(n)
  • φ(n) (hollow: before the tail)
  • Mₖ = sup of the tail from k
  • mₖ = inf of the tail
  • lim sup / lim inf
  • tail start k (drag)
Tail from n=1n = 1: M1=1.5M_{1} = 1.5, m1=−2m_{1} = −2, gap 3.5 (sup and inf over 1≤n≤2401 \le n \le 240). Moving k to the right can only lower Mₖ and raise mₖ. Here lim sup = 1 and lim inf = −1: the envelopes never meet, so the sequence oscillates.
What to notice

The envelopes can only move inwards as kk grows. For (−1)n(1+1/n)(-1)^n(1 + 1/n) they settle on 11 and −1-1, not on each other, so the sequence oscillates. Early terms (here ϕ(1)=−2\phi(1) = -2 and ϕ(2)=32\phi(2) = \tfrac32) affect the bounds but not Λ\Lambda and λ\lambda.

Precise statements

Definition Superior, inferior and intermediate numbers Hardy: §82

Let ϕ(n)\phi(n) be bounded. A number ξ\xi is superior if ξ≥ϕ(n)\xi \ge \phi(n) for all sufficiently large nn; inferior if ξ≤ϕ(n)\xi \le \phi(n) for all sufficiently large nn; and intermediate if ξ<ϕ(n)\xi < \phi(n) for infinitely many nn and ξ>ϕ(n)\xi > \phi(n) for infinitely many nn.

Every ξ\xi falls under at least one heading. (Only a sequence that is eventually constant, equal to ξ\xi, makes ξ\xi both superior and inferior.) Every number ≥M\ge M is superior and every number ≤m\le m is inferior, while no superior number is below mm and no inferior number above MM. So the superior numbers form a set bounded below, and the inferior numbers a set bounded above.

Definition Upper and lower limits Hardy: §82

The upper limit Λ\Lambda of ϕ(n)\phi(n) is the lower bound of the set of superior numbers, and the lower limit λ\lambda is the upper bound of the set of inferior numbers. Hardy writes

Λ=lim⁡n→∞‾ ϕ(n),λ=lim⁡n→∞‾ ϕ(n).\Lambda = \overline{\lim_{n\to\infty}}\, \phi(n), \qquad \lambda = \underline{\lim_{n\to\infty}}\, \phi(n).
Theorem Properties of the upper and lower limits Hardy: §82 (1)–(5)

For a bounded sequence ϕ(n)\phi(n) with bounds m≤Mm \le M:

  • (1) m≤λ≤Λ≤Mm \le \lambda \le \Lambda \le M.
  • (2) If λ<Λ\lambda < \Lambda, they are the lower and upper bounds of the set of intermediate numbers.
  • (3) For every δ>0\delta > 0: ϕ(n)<Λ+δ\phi(n) < \Lambda + \delta for all sufficiently large nn, and ϕ(n)>Λ−δ\phi(n) > \Lambda - \delta for infinitely many nn.
  • (4) For every δ>0\delta > 0: ϕ(n)>λ−δ\phi(n) > \lambda - \delta for all sufficiently large nn, and ϕ(n)<λ+δ\phi(n) < \lambda + \delta for infinitely many nn.
  • (5) ϕ(n)\phi(n) tends to a limit if and only if λ=Λ\lambda = \Lambda, and the limit is then their common value.

Property (3) characterises Λ\Lambda: it is the only number with both halves of (3). Compare property (ii) of the upper bound MM, which asks for one term above M−δM - \delta; here we ask for infinitely many, and in exchange only large nn are constrained.

Theorem The envelope description

If MkM_k and mkm_k are the upper and lower bounds of the tail ϕ(k),ϕ(k+1),…\phi(k), \phi(k+1), \dots, then MkM_k decreases to Λ\Lambda and mkm_k increases to λ\lambda.

Proofs

Proof Property (3)
Strategy

Λ+δ\Lambda + \delta is above the lower bound of the superior numbers, so some superior number lies below it; Λ−δ\Lambda - \delta is below that lower bound, so it is not superior. Translate each fact back into a statement about the terms.

Λ+δ\Lambda + \delta is superior

By property (ii) of a lower bound, some superior number ξ\xi satisfies ξ<Λ+δ\xi < \Lambda + \delta. Any number above a superior number is superior. So ϕ(n)≤ξ<Λ+δ\phi(n) \le \xi < \Lambda + \delta for all large nn.

Λ−δ\Lambda - \delta is not superior

No superior number is less than their lower bound Λ\Lambda.

So infinitely many terms exceed Λ−δ\Lambda - \delta

“Not superior” means: it is not true that ϕ(n)≤Λ−δ\phi(n) \le \Lambda - \delta for all large nn. Then however large n0n_0 is, some n≥n0n \ge n_0 has ϕ(n)>Λ−δ\phi(n) > \Lambda - \delta; that gives infinitely many such nn.

Property (4) is the mirror image. Property (1): an inferior number η\eta and a superior number ξ\xi satisfy η≤ϕ(n)≤ξ\eta \le \phi(n) \le \xi for all large nn, so η≤ξ\eta \le \xi; taking bounds, λ≤Λ\lambda \le \Lambda. The outer inequalities hold because MM is superior and mm inferior. For (2): if ξ\xi is intermediate and η\eta superior, then eventually ϕ(n)≤η\phi(n) \le \eta, while ϕ(n)>ξ\phi(n) > \xi infinitely often, so η>ξ\eta > \xi; thus ξ≤Λ\xi \le \Lambda, and similarly ξ≥λ\xi \ge \lambda. Conversely, a ξ\xi strictly between λ\lambda and Λ\Lambda is not superior (superior numbers are ≥Λ\ge \Lambda) and not inferior (inferior numbers are ≤λ\le \lambda), so it is intermediate. Hence the intermediate numbers fill the gap between λ\lambda and Λ\Lambda, whose ends are their bounds.

Proof Property (5): convergence if and only if λ=Λ\lambda = \Lambda
Strategy

If λ=Λ=l\lambda = \Lambda = l, properties (3) and (4) squeeze the tail into (l−δ,l+δ)(l - \delta, l + \delta). Conversely, if ϕ(n)→l\phi(n) \to l, then l+δl + \delta is superior and l−δl - \delta inferior, which squeezes Λ\Lambda and λ\lambda together.

If λ=Λ=l\lambda = \Lambda = l, then ϕ(n)→l\phi(n) \to l

Let δ>0\delta > 0. By the first half of (3), ϕ(n)<l+δ\phi(n) < l + \delta for all large nn; by the first half of (4), ϕ(n)>l−δ\phi(n) > l - \delta for all large nn. Taking the larger of the two thresholds, ∣ϕ(n)−l∣<δ|\phi(n) - l| < \delta from some n0n_0 on.

If ϕ(n)→l\phi(n) \to l, then l+δl + \delta is superior and l−δl - \delta inferior

For large nn, l−δ<ϕ(n)<l+δl - \delta < \phi(n) < l + \delta.

So Λ−λ≤2δ\Lambda - \lambda \le 2\delta for every δ\delta

Λ\Lambda is at most any superior number, so Λ≤l+δ\Lambda \le l + \delta; λ\lambda is at least any inferior number, so λ≥l−δ\lambda \ge l - \delta. Hence 0≤Λ−λ≤2δ0 \le \Lambda - \lambda \le 2\delta.

Conclude

A number ≥0\ge 0 that is at most 2δ2\delta for every δ>0\delta > 0 is 00. So Λ=λ\Lambda = \lambda, and the first step shows the limit is this common value.

Proof The envelope description
Strategy

MkM_k is decreasing and bounded below (by mm), so it has a limit. Property (3) pins that limit to within δ\delta of Λ\Lambda for every δ\delta.

MkM_k decreases

The tail from k+1k + 1 is part of the tail from kk, so its upper bound is no larger (previous lesson’s exercise on inclusion).

Eventually Mk≤Λ+δM_k \le \Lambda + \delta

By (3), there is n0n_0 with ϕ(n)<Λ+δ\phi(n) < \Lambda + \delta for n≥n0n \ge n_0. For k≥n0k \ge n_0 the whole tail from kk is below Λ+δ\Lambda + \delta, so Mk≤Λ+δM_k \le \Lambda + \delta.

Always Mk>Λ−δM_k > \Lambda - \delta

By (3), infinitely many terms exceed Λ−δ\Lambda - \delta, so every tail contains one, and Mk>Λ−δM_k > \Lambda - \delta for every kk.

Conclude

For k≥n0k \ge n_0, ∣Mk−Λ∣≤δ|M_k - \Lambda| \le \delta. So Mk→ΛM_k \to \Lambda. The argument for mk→λm_k \to \lambda is the same with (4).

Worked examples and exercises

Exercise ●○○ Hardy: Examples XXXII, 1

Show that altering finitely many terms of ϕ(n)\phi(n) changes neither Λ\Lambda nor λ\lambda. Does it change MM and mm?

Hint
Being superior or inferior is a statement about all sufficiently large nn.

Solution

If the altered terms all have n≤Nn \le N, then a statement “for all sufficiently large nn” is true for one sequence exactly when it is true for the other (just take n0>Nn_0 > N). So the two sequences have the same superior and the same inferior numbers, hence the same Λ\Lambda and λ\lambda. The bounds can change: altering ϕ(1)\phi(1) of 1/n1/n from 11 to 55 changes MM from 11 to 55.

Exercise ●○○ Hardy: Examples XXXII, 3–6

Find mm, λ\lambda, Λ\Lambda, MM for (a) 1/n1/n; (b) (−1)n(-1)^n; (c) (−1)n/n(-1)^n/n; (d) (−1)n(1+1/n)(-1)^n(1 + 1/n).

Hint
For λ\lambda and Λ\Lambda look only at what the even and odd terms approach.

Solution

(a) m=λ=Λ=0m = \lambda = \Lambda = 0, M=1M = 1. (b) m=λ=−1m = \lambda = -1, Λ=M=1\Lambda = M = 1. (c) m=−1m = -1, λ=Λ=0\lambda = \Lambda = 0, M=12M = \tfrac12. (d) m=−2m = -2, λ=−1\lambda = -1, Λ=1\Lambda = 1, M=32M = \tfrac32.

For (d), say: every ξ>1\xi > 1 is superior, because the even terms 1+1/n1 + 1/n eventually drop below ξ\xi and the odd terms are negative; every ξ\xi with −1<ξ<1-1 < \xi < 1 is intermediate. So the lower bound of the superior numbers is 11. The same reasoning upside down gives λ=−1\lambda = -1.

Exercise ●●○ Hardy: Examples XXXII, 7

Let ϕ(n)=sin⁡nθπ\phi(n) = \sin n\theta\pi with θ=p/q\theta = p/q, where pp and qq are positive, odd, coprime, and q>1q > 1. Show that m=λ=−cos⁡(π/2q)m = \lambda = -\cos(\pi/2q) and Λ=M=cos⁡(π/2q)\Lambda = M = \cos(\pi/2q). Check the case θ=13\theta = \tfrac13 in the first widget.

Hint
The values repeat with period 2q2q. Which multiples of π/q\pi/q occur as npπ/qnp\pi/q modulo 2π2\pi?
Hint
Since pp is odd and coprime to qq, it is coprime to 2q2q, so npnp runs through all residues modulo 2q2q as nn runs through 2q2q consecutive integers.

Solution

sin⁡(npπ/q)\sin(np\pi/q) depends only on npnp modulo 2q2q. As pp is coprime to 2q2q, the numbers npnp (n=1,…,2qn = 1, \dots, 2q) leave every remainder j=0,1,…,2q−1j = 0, 1, \dots, 2q - 1 exactly once. So the set of values is {sin⁡(jπ/q):0≤j<2q}\{\sin(j\pi/q) : 0 \le j < 2q\}, and each value occurs for infinitely many nn.

The largest of these is at the jj for which jπ/qj\pi/q is closest to π/2\pi/2. Since qq is odd, j=(q±1)/2j = (q \pm 1)/2 give jπ/q=π/2∓π/(2q)j\pi/q = \pi/2 \mp \pi/(2q), so the largest value is sin⁡(π/2−π/2q)=cos⁡(π/2q)\sin(\pi/2 - \pi/2q) = \cos(\pi/2q); by symmetry the smallest is −cos⁡(π/2q)-\cos(\pi/2q). Because every value recurs infinitely often, a level is superior only if it is at least the largest value, so Λ=M=cos⁡(π/2q)\Lambda = M = \cos(\pi/2q), and likewise λ=m=−cos⁡(π/2q)\lambda = m = -\cos(\pi/2q). For θ=13\theta = \tfrac13 this gives cos⁡(π/6)=123≈0.866\cos(\pi/6) = \tfrac12\sqrt3 \approx 0.866.

Exercise Sums of upper limits ●●● Hardy: §82

Let ϕ\phi and ψ\psi be bounded. Show that lim⁡‾ (ϕ+ψ)≤lim⁡‾ ϕ+lim⁡‾ ψ\overline{\lim}\,(\phi + \psi) \le \overline{\lim}\,\phi + \overline{\lim}\,\psi, and that equality can fail.

Hint
Use the first half of property (3) for each sequence with 12δ\tfrac12\delta.
Hint
For the failure, try ϕ(n)=(−1)n\phi(n) = (-1)^n and ψ(n)=−(−1)n\psi(n) = -(-1)^n.

Solution

Let Λ1,Λ2\Lambda_1, \Lambda_2 be the upper limits of ϕ\phi, ψ\psi and let δ>0\delta > 0. For all large nn, ϕ(n)<Λ1+12δ\phi(n) < \Lambda_1 + \tfrac12\delta and ψ(n)<Λ2+12δ\psi(n) < \Lambda_2 + \tfrac12\delta, so ϕ(n)+ψ(n)<Λ1+Λ2+δ\phi(n) + \psi(n) < \Lambda_1 + \Lambda_2 + \delta. Thus Λ1+Λ2+δ\Lambda_1 + \Lambda_2 + \delta is superior for ϕ+ψ\phi + \psi, and the upper limit of ϕ+ψ\phi + \psi is at most Λ1+Λ2+δ\Lambda_1 + \Lambda_2 + \delta. As δ\delta is arbitrary, it is at most Λ1+Λ2\Lambda_1 + \Lambda_2.

With ϕ=(−1)n\phi = (-1)^n and ψ=−(−1)n\psi = -(-1)^n, both upper limits are 11, but ϕ+ψ=0\phi + \psi = 0 has upper limit 0<20 < 2. The largest values of the two sequences occur at different nn.

Check yourself

Check yourself Choose one

What is lim⁡‾ (−1)n(1+1/n)\overline{\lim}\,(-1)^n(1 + 1/n)?

Why

32\tfrac32 is the upper bound, reached once at n=2n = 2; any ξ\xi slightly above 11 is exceeded by only finitely many terms, so it is superior, and Λ=1\Lambda = 1. Upper limits exist for every bounded sequence, oscillating or not; that is their purpose.

Check yourself Choose one

For ϕ(n)=1+(−1)n/n\phi(n) = 1 + (-1)^n/n, the number ξ=1\xi = 1 is

Why

The even terms 1+1/n1 + 1/n are above 11 and the odd terms 1−1/n1 - 1/n are below, both infinitely often. So 11 is intermediate, although it is the limit. Every other number is superior or inferior: the argument for property (2) shows that every intermediate number lies between λ\lambda and Λ\Lambda, so when λ=Λ\lambda = \Lambda there is at most one intermediate number.

Check yourself True or false?

The upper limit Λ\Lambda of a bounded sequence is always one of its terms, or is approached by terms from below.

Why

False on both counts. For 1/n1/n, Λ=0\Lambda = 0 is never a term, and the terms approach it from above. What is always true is property (3): every strip (Λ−δ,Λ+δ)(\Lambda - \delta, \Lambda + \delta) contains infinitely many terms, and eventually none lie above it.

Check yourself Enter a number

What is lim⁡‾ {5+3(−1)n}\overline{\lim}\,\{5 + 3(-1)^n\}?

Why

The terms are 2,8,2,8,…2, 8, 2, 8, \dots. Every ξ≥8\xi \ge 8 is superior; every ξ<8\xi < 8 is exceeded by all the even terms, infinitely often. So Λ=8\Lambda = 8, and in the same way λ=2\lambda = 2. When the values recur in a cycle, Λ\Lambda and λ\lambda are simply the largest and smallest values of the cycle.

Check yourself True or false?

A bounded sequence converges if and only if its upper and lower limits are equal.

Why

True: this is property (5). As a test it still requires us to find Λ\Lambda and λ\lambda. The next lesson turns it into Cauchy’s criterion, which compares the terms with each other and needs nothing else.

Hardy’s language

Summary

Summary
  • A level ξ\xi is superior if eventually ϕ(n)≤ξ\phi(n) \le \xi, inferior if eventually ϕ(n)≥ξ\phi(n) \ge \xi, and intermediate if the terms are frequently above and frequently below it.
  • Λ=lim⁡‾ ϕ(n)\Lambda = \overline{\lim}\,\phi(n) is the lower bound of the superior numbers; λ=lim⁡‾ ϕ(n)\lambda = \underline{\lim}\,\phi(n) the upper bound of the inferior ones. Both exist for every bounded sequence, and m≤λ≤Λ≤Mm \le \lambda \le \Lambda \le M.
  • Working form: for every δ>0\delta > 0, eventually ϕ(n)<Λ+δ\phi(n) < \Lambda + \delta, and infinitely often ϕ(n)>Λ−δ\phi(n) > \Lambda - \delta.
  • Equivalently, Λ\Lambda is the limit of the upper bounds of the tails.
  • ϕ(n)\phi(n) converges if and only if λ=Λ\lambda = \Lambda, and then the limit is their common value.