A bounded sequence need not converge, but it does not wander arbitrarily either. The terms of (−1)n(1+1/n) crowd ever closer to 1 and −1; the terms of sin31nπ take three values over and over. §82 attaches to every bounded sequence two numbers that describe its long-run range: the upper limitΛ and the lower limitλ. 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 ξ against the plotted sequence and ask about the large values of n only. Three things can happen:
eventually every term is at or below ξ: call ξsuperior;
eventually every term is at or above ξ: call ξinferior;
infinitely many terms are above ξ and infinitely many below: call ξintermediate.
A level far above the sequence is superior, one far below is inferior. Raise ξ 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 λ and Λ.
ExploreSort the levels
Try this.With (−1)n(1+1/n), move ξ from top to bottom and read the classification. Pay special attention to ξ=1 and ξ=−1 (the slider snaps to them). Then try 1+(−1)n/n at ξ=1, and sin31nπ. Turn on “Show Λ and λ”.
ϕ(n)=(−1)n(1+n1)
nφ(n)
your level ξ
terms above ξ
terms below ξ
Of the first 60 terms, 30 lie above ξ=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 is superior and every ξ<−1 inferior; everything strictly between is intermediate. So Λ=1 and λ=−1, although the bounds are 23 and −2. Whether Λ itself is superior or intermediate depends on how the terms approach it, which is why Λ is defined as the lower bound of the superior numbers. For 1+(−1)n/n, Λ=λ=1: the sequence converges, and its limit is the one intermediate number.
There is a second way to see Λ, which most modern books use as the definition. For each k take the upper bound of the tailϕ(k),ϕ(k+1),…; call it Mk. Dropping terms can only lower an upper bound, so M1≥M2≥M3≥⋯, and this decreasing sequence tends to Λ. Similarly the tail lower bounds mk increase to λ.
ExploreEnvelopes that close in
Try this.Drag the purple tail start k to the right, or step it with the buttons. Watch the ochre envelopes Mk (upper bound of the tail) and mk (lower bound of the tail). Then show more terms.
ϕ(n)=(−1)n(1+n1)
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=1: M1=1.5, m1=−2, gap 3.5 (sup and inf over 1≤n≤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 k grows. For (−1)n(1+1/n) they settle on 1 and −1, not on each other, so the sequence oscillates. Early terms (here ϕ(1)=−2 and ϕ(2)=23) affect the bounds but not Λ and λ.
Precise statements
DefinitionSuperior, inferior and intermediate numbersHardy: §82
Let ϕ(n) be bounded. A number ξ is superior if ξ≥ϕ(n) for all sufficiently large n; inferior if ξ≤ϕ(n) for all sufficiently large n; and intermediate if ξ<ϕ(n) for infinitely many n and ξ>ϕ(n) for infinitely many n.
Every ξ falls under at least one heading. (Only a sequence that is eventually constant, equal to ξ, makes ξ both superior and inferior.) Every number ≥M is superior and every number ≤m is inferior, while no superior number is below m and no inferior number above M. So the superior numbers form a set bounded below, and the inferior numbers a set bounded above.
DefinitionUpper and lower limitsHardy: §82
The upper limitΛ of ϕ(n) is the lower bound of the set of superior numbers, and the lower limitλ is the upper bound of the set of inferior numbers. Hardy writes
Λ=n→∞limϕ(n),λ=n→∞limϕ(n).
TheoremProperties of the upper and lower limitsHardy: §82 (1)–(5)
For a bounded sequence ϕ(n) with bounds m≤M:
(1) m≤λ≤Λ≤M.
(2) If λ<Λ, they are the lower and upper bounds of the set of intermediate numbers.
(3) For every δ>0: ϕ(n)<Λ+δ for all sufficiently large n, and ϕ(n)>Λ−δ for infinitely many n.
(4) For every δ>0: ϕ(n)>λ−δ for all sufficiently large n, and ϕ(n)<λ+δ for infinitely many n.
(5) ϕ(n) tends to a limit if and only if λ=Λ, and the limit is then their common value.
Property (3) characterises Λ: it is the only number with both halves of (3). Compare property (ii) of the upper bound M, which asks for one term above M−δ; here we ask for infinitely many, and in exchange only largen are constrained.
TheoremThe envelope description
If Mk and mk are the upper and lower bounds of the tail ϕ(k),ϕ(k+1),…, then Mk decreases to Λ and mk increases to λ.
Proofs
ProofProperty (3)
Strategy
Λ+δ is above the lower bound of the superior numbers, so some superior number lies below it; Λ−δ is below that lower bound, so it is not superior. Translate each fact back into a statement about the terms.
Λ+δ is superior
By property (ii) of a lower bound, some superior number ξ satisfies ξ<Λ+δ. Any number above a superior number is superior. So ϕ(n)≤ξ<Λ+δ for all large n.
Λ−δ is not superior
No superior number is less than their lower bound Λ.
So infinitely many terms exceed Λ−δ
“Not superior” means: it is not true that ϕ(n)≤Λ−δ for all large n. Then however large n0 is, some n≥n0 has ϕ(n)>Λ−δ; that gives infinitely many such n.
∎
Property (4) is the mirror image. Property (1): an inferior number η and a superior number ξ satisfy η≤ϕ(n)≤ξ for all large n, so η≤ξ; taking bounds, λ≤Λ. The outer inequalities hold because M is superior and m inferior. For (2): if ξ is intermediate and η superior, then eventually ϕ(n)≤η, while ϕ(n)>ξ infinitely often, so η>ξ; thus ξ≤Λ, and similarly ξ≥λ. Conversely, a ξ strictly between λ and Λ is not superior (superior numbers are ≥Λ) and not inferior (inferior numbers are ≤λ), so it is intermediate. Hence the intermediate numbers fill the gap between λ and Λ, whose ends are their bounds.
ProofProperty (5): convergence if and only if λ=Λ
Strategy
If λ=Λ=l, properties (3) and (4) squeeze the tail into (l−δ,l+δ). Conversely, if ϕ(n)→l, then l+δ is superior and l−δ inferior, which squeezes Λ and λ together.
If λ=Λ=l, then ϕ(n)→l
Let δ>0. By the first half of (3), ϕ(n)<l+δ for all large n; by the first half of (4), ϕ(n)>l−δ for all large n. Taking the larger of the two thresholds, ∣ϕ(n)−l∣<δ from some n0 on.
If ϕ(n)→l, then l+δ is superior and l−δ inferior
For large n, l−δ<ϕ(n)<l+δ.
So Λ−λ≤2δ for every δ
Λ is at most any superior number, so Λ≤l+δ; λ is at least any inferior number, so λ≥l−δ. Hence 0≤Λ−λ≤2δ.
Conclude
A number ≥0 that is at most 2δ for every δ>0 is 0. So Λ=λ, and the first step shows the limit is this common value.
∎
ProofThe envelope description
Strategy
Mk is decreasing and bounded below (by m), so it has a limit. Property (3) pins that limit to within δ of Λ for every δ.
Mk decreases
The tail from k+1 is part of the tail from k, so its upper bound is no larger (previous lesson’s exercise on inclusion).
Eventually Mk≤Λ+δ
By (3), there is n0 with ϕ(n)<Λ+δ for n≥n0. For k≥n0 the whole tail from k is below Λ+δ, so Mk≤Λ+δ.
Always Mk>Λ−δ
By (3), infinitely many terms exceed Λ−δ, so every tail contains one, and Mk>Λ−δ for every k.
Conclude
For k≥n0, ∣Mk−Λ∣≤δ. So Mk→Λ. The argument for mk→λ is the same with (4).
∎
Worked examples and exercises
Exercise●○○Hardy: Examples XXXII, 1
Show that altering finitely many terms of ϕ(n) changes neither Λ nor λ. Does it change M and m?
Hint
Being superior or inferior is a statement about all sufficiently largen.
Solution
If the altered terms all have n≤N, then a statement “for all sufficiently large n” is true for one sequence exactly when it is true for the other (just take n0>N). So the two sequences have the same superior and the same inferior numbers, hence the same Λ and λ. The bounds can change: altering ϕ(1) of 1/n from 1 to 5 changes M from 1 to 5.
Exercise●○○Hardy: Examples XXXII, 3–6
Find m, λ, Λ, M for (a) 1/n; (b) (−1)n; (c) (−1)n/n; (d) (−1)n(1+1/n).
Hint
For λ and Λ look only at what the even and odd terms approach.
For (d), say: every ξ>1 is superior, because the even terms 1+1/n eventually drop below ξ and the odd terms are negative; every ξ with −1<ξ<1 is intermediate. So the lower bound of the superior numbers is 1. The same reasoning upside down gives λ=−1.
Exercise●●○Hardy: Examples XXXII, 7
Let ϕ(n)=sinnθπ with θ=p/q, where p and q are positive, odd, coprime, and q>1. Show that m=λ=−cos(π/2q) and Λ=M=cos(π/2q). Check the case θ=31 in the first widget.
Hint
The values repeat with period 2q. Which multiples of π/q occur as npπ/q modulo 2π?
Hint
Since p is odd and coprime to q, it is coprime to 2q, so np runs through all residues modulo 2q as n runs through 2q consecutive integers.
Solution
sin(npπ/q) depends only on np modulo 2q. As p is coprime to 2q, the numbers np (n=1,…,2q) leave every remainder j=0,1,…,2q−1 exactly once. So the set of values is {sin(jπ/q):0≤j<2q}, and each value occurs for infinitely many n.
The largest of these is at the j for which jπ/q is closest to π/2. Since q is odd, j=(q±1)/2 give jπ/q=π/2∓π/(2q), so the largest value is sin(π/2−π/2q)=cos(π/2q); by symmetry the smallest is −cos(π/2q). Because every value recurs infinitely often, a level is superior only if it is at least the largest value, so Λ=M=cos(π/2q), and likewise λ=m=−cos(π/2q). For θ=31 this gives cos(π/6)=213≈0.866.
ExerciseSums of upper limits●●●Hardy: §82
Let ϕ and ψ be bounded. Show that lim(ϕ+ψ)≤limϕ+limψ, and that equality can fail.
Hint
Use the first half of property (3) for each sequence with 21δ.
Hint
For the failure, try ϕ(n)=(−1)n and ψ(n)=−(−1)n.
Solution
Let Λ1,Λ2 be the upper limits of ϕ, ψ and let δ>0. For all large n, ϕ(n)<Λ1+21δ and ψ(n)<Λ2+21δ, so ϕ(n)+ψ(n)<Λ1+Λ2+δ. Thus Λ1+Λ2+δ is superior for ϕ+ψ, and the upper limit of ϕ+ψ is at most Λ1+Λ2+δ. As δ is arbitrary, it is at most Λ1+Λ2.
With ϕ=(−1)n and ψ=−(−1)n, both upper limits are 1, but ϕ+ψ=0 has upper limit 0<2. The largest values of the two sequences occur at different n.
Check yourself
Check yourselfChoose one
What is lim(−1)n(1+1/n)?
Why
23 is the upper bound, reached once at n=2; any ξ slightly above 1 is exceeded by only finitely many terms, so it is superior, and Λ=1. Upper limits exist for every bounded sequence, oscillating or not; that is their purpose.
Check yourselfChoose one
For ϕ(n)=1+(−1)n/n, the number ξ=1 is
Why
The even terms 1+1/n are above 1 and the odd terms 1−1/n are below, both infinitely often. So 1 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 λ and Λ, so when λ=Λ there is at most one intermediate number.
Check yourselfTrue or false?
The upper limit Λ of a bounded sequence is always one of its terms, or is approached by terms from below.
Why
False on both counts. For 1/n, Λ=0 is never a term, and the terms approach it from above. What is always true is property (3): every strip (Λ−δ,Λ+δ) contains infinitely many terms, and eventually none lie above it.
Check yourselfEnter a number
What is lim{5+3(−1)n}?
Why
The terms are 2,8,2,8,…. Every ξ≥8 is superior; every ξ<8 is exceeded by all the even terms, infinitely often. So Λ=8, and in the same way λ=2. When the values recur in a cycle, Λ and λ are simply the largest and smallest values of the cycle.
Check yourselfTrue 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 Λ and λ. 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 ξ is superior if eventually ϕ(n)≤ξ, inferior if eventually ϕ(n)≥ξ, and intermediate if the terms are frequently above and frequently below it.
Λ=limϕ(n) is the lower bound of the superior numbers; λ=limϕ(n) the upper bound of the inferior ones. Both exist for every bounded sequence, and m≤λ≤Λ≤M.
Working form: for every δ>0, eventually ϕ(n)<Λ+δ, and infinitely often ϕ(n)>Λ−δ.
Equivalently, Λ is the limit of the upper bounds of the tails.
ϕ(n) converges if and only if λ=Λ, and then the limit is their common value.