Chapter IV · Limits of functions of a positive integral variable

The bounds of a bounded set

§80 30 min

Every set of real numbers that is bounded above has a least upper bound, and Dedekind’s theorem is what guarantees it.

Why this matters

The set of numbers 1−1/n1 - 1/n has no largest member: whichever one you pick, the next is larger. Yet the number 11 clearly plays the role of its “top”. §80 proves that every set bounded above has such a top, the least upper bound, even when the set has no greatest member. This is one of the standard forms of the completeness of the real numbers, and the next lessons use it at once: to define the bounds of a sequence (§81), its upper and lower limits (§82), and, in Chapter V, to show that a continuous function attains its bounds.

The idea

A number KK that no member of a set SS exceeds is an upper bound of SS in the everyday sense. If there is one, there are many: anything larger than KK is one too. The question is whether there is a least one. Hardy answers it by sorting every real number ξ\xi into one of two classes:

  • ξ\xi goes into LL if some member of SS exceeds it;
  • ξ\xi goes into RR if no member of SS exceeds it (that is, if ξ\xi is an upper bound).

Every member of LL is less than every member of RR, so the two classes form a Dedekind section, and Dedekind’s theorem (§17) supplies the number that divides them.

Explore Squeeze the dividing point

Try this. For the set {1−1/n}\{1 - 1/n\}, move ξ\xi and read whether some member exceeds it. Bring ξ\xi as close to 11 from below as the slider allows. Then turn on “Show the two classes”, and try the decimals of 2\sqrt2 and the lower bound of {1/n}\{1/n\}.

S={1−1/n:n=1,2,… }S = \{1 - 1/n : n = 1, 2, \dots\}
  • members of S
  • your number ξ
  • a member exceeding ξ
Looking for
The member 1−1/3=0.666666671 - 1/3 = 0.66666667 exceeds ξ=0.6\xi = 0.6, so ξ is not an upper bound (ξ is in L). Find the dividing point: how close can ξ come from below and still have a witness?
What to notice

Every ξ\xi below 11, however close, has a witness: a member beyond it (with nn larger than 1/(1−ξ)1/(1-\xi)). No member exceeds 11 itself. So 11 is the least upper bound, although it is not a member. For the decimals of 2\sqrt2 every member is rational, but the dividing point 2\sqrt2 is not: this is why the theorem needs the real numbers.

Precise statements

Definition Bounded above, bounded below, bounded Hardy: §80

A set SS of real numbers is bounded above if there is a number KK with s≤Ks \le K for every ss in SS, bounded below if there is a kk with s≥ks \ge k for every ss in SS, and bounded if it is both.

Theorem Existence of the upper bound Hardy: §80

If SS is non-empty and bounded above, there is a number MM such that

  1. no member of SS exceeds MM, and
  2. every number less than MM is exceeded by at least one member of SS.

There is only one such number. Hardy calls it the upper bound of SS; today it is the least upper bound or supremum, sup⁡S\sup S.

Condition 1 says MM is an upper bound; condition 2 says nothing smaller is one. Together they say MM is the least upper bound. In terms of a tolerance: for every δ>0\delta > 0 there is a member ss with M−δ<s≤MM - \delta < s \le M.

Corollary The lower bound Hardy: §80

If SS is non-empty and bounded below, there is a unique number mm (the lower bound, or greatest lower bound, inf⁡S\inf S) such that no member of SS is less than mm, and every number greater than mm exceeds at least one member of SS. If SS is bounded, with k≤s≤Kk \le s \le K for all ss in SS, then k≤m≤M≤Kk \le m \le M \le K.

Whether the bounds belong to SS varies: for {1−1/n}\{1 - 1/n\}, m=0m = 0 is a member and M=1M = 1 is not; for {1/n}\{1/n\} it is the other way round; for {(−1)n(1+1/n)}\{(-1)^n(1 + 1/n)\} both are members (m=−2m = -2 at n=1n = 1, M=32M = \tfrac32 at n=2n = 2). When MM is a member it is the greatest member of SS.

Proofs

Proof Existence and uniqueness of the upper bound
Strategy

Divide all real numbers into LL (exceeded by some member of SS) and RR (exceeded by none). Check that this is a Dedekind section, let MM be the number at the division, and show it has properties 1 and 2. Uniqueness follows because two different numbers cannot both have them.

Every ξ\xi is in exactly one class, and neither class is empty

By construction each ξ\xi is in LL or in RR and not both. SS has some member ss, and every ξ<s\xi < s is in LL. The given bound KK is in RR.

Every member of LL is less than every member of RR

Let ξ∈L\xi \in L and η∈R\eta \in R. Some member ss exceeds ξ\xi; no member exceeds η\eta, so s≤ηs \le \eta. Hence ξ<s≤η\xi < s \le \eta.

Dedekind’s theorem gives a dividing number MM

By §17, there is a number MM such that every number less than MM is in LL and every number greater than MM is in RR. (MM itself is in one or the other; we do not need to know which.)

No member of SS exceeds MM (property 1)

Suppose a member s=M+ηs = M + \eta with η>0\eta > 0. The number M+12ηM + \tfrac12\eta is greater than MM, so it is in RR; it is less than the member ss, so it is in LL. A number cannot be in both classes.

Every number below MM is exceeded by a member (property 2)

A number less than MM is in LL, which by definition means that some member of SS exceeds it.

Uniqueness

If MM and M′M' both have properties 1 and 2 and M′<MM' < M, then by property 2 for MM some member exceeds M′M', contradicting property 1 for M′M'. So M′=MM' = M.

The lower bound is found in the same way, or by applying the theorem to the set −S={−s:s∈S}-S = \{-s : s \in S\}: if M′M' is the upper bound of −S-S, then m=−M′m = -M'. The inequality m≤Mm \le M holds because any member ss satisfies m≤s≤Mm \le s \le M; and M≤KM \le K because KK is an upper bound while MM is the least.

Worked examples and exercises

Exercise Bounds of three sets ●○○ Hardy: §80

Find the upper and lower bounds of each set, and say whether they are members: (a) {1/n}\{1/n\}; (b) {(−1)n/n}\{(-1)^n/n\}; (c) {x:x rational, x2<2}\{x : x \text{ rational},\ x^2 < 2\}.

Hint
In each case guess the bound, then check property 1 and property 2 separately.

Solution

(a) M=1M = 1 (a member, n=1n = 1). m=0m = 0: no 1/n1/n is negative, and any ξ>0\xi > 0 exceeds 1/n1/n once n>1/ξn > 1/\xi. 00 is not a member.

(b) The members are −1,12,−13,14,…-1, \tfrac12, -\tfrac13, \tfrac14, \dots. M=12M = \tfrac12 (n=2n = 2) and m=−1m = -1 (n=1n = 1), both members: the positive members are 1/n1/n for even nn, the largest being 12\tfrac12, and the negative members are −1/n-1/n for odd nn, the smallest being −1-1.

(c) M=2M = \sqrt2 and m=−2m = -\sqrt2, neither a member (they are irrational). No member exceeds 2\sqrt2, since x>2>0x > \sqrt2 > 0 gives x2>2x^2 > 2. If ξ<2\xi < \sqrt2, there is a rational xx with max⁡(ξ,0)<x<2\max(\xi, 0) < x < \sqrt2 (rationals are dense, Chapter I), and then x2<2x^2 < 2, so xx is a member exceeding ξ\xi. The lower bound follows by symmetry.

Exercise ●○○ Hardy: §80, footnote

Give an infinite bounded set that has no least member, and find its lower bound.

Hint
The set in the previous exercise, part (a).

Solution

{1,12,13,… }\{1, \tfrac12, \tfrac13, \dots\} is bounded (between 00 and 11) and has no least member, since 1/(n+1)<1/n1/(n+1) < 1/n. Its lower bound is 00, which is not a member. A finite non-empty set always has a least and a greatest member, so this cannot happen for finite sets.

Exercise Bounds and inclusion ●●○ Hardy: §80

Let SS and TT be bounded above with every member of SS also a member of TT. Show that sup⁡S≤sup⁡T\sup S \le \sup T. Must the inequality be strict when TT has members that SS lacks?

Hint
Is sup⁡T\sup T an upper bound of SS?

Solution

No member of TT exceeds sup⁡T\sup T; members of SS are members of TT; so sup⁡T\sup T is an upper bound of SS. The least upper bound of SS is at most any upper bound, so sup⁡S≤sup⁡T\sup S \le \sup T.

It need not be strict: S={1−1/n}S = \{1 - 1/n\} and T=S∪{1}T = S \cup \{1\} both have upper bound 11. Adding members changes the bound only if one of them exceeds the old bound.

Exercise Bounds of a sum set ●●○ Hardy: §80

Let SS and TT be bounded above, and let S+TS + T be the set of all sums s+ts + t (s∈Ss \in S, t∈Tt \in T). Show that sup⁡(S+T)=sup⁡S+sup⁡T\sup(S + T) = \sup S + \sup T.

Hint
Check property 1 directly. For property 2, given δ>0\delta > 0 find s>sup⁡S−12δs > \sup S - \tfrac12\delta and t>sup⁡T−12δt > \sup T - \tfrac12\delta.

Solution

Let M=sup⁡SM = \sup S and N=sup⁡TN = \sup T. Every sum satisfies s+t≤M+Ns + t \le M + N, so property 1 holds for M+NM + N. For property 2, let ξ<M+N\xi < M + N and put δ=M+N−ξ>0\delta = M + N - \xi > 0. By property 2 for SS and for TT there are members s>M−12δs > M - \tfrac12\delta and t>N−12δt > N - \tfrac12\delta. Then s+t>M+N−δ=ξs + t > M + N - \delta = \xi. So every number below M+NM + N is exceeded by a member of S+TS + T, and by uniqueness sup⁡(S+T)=M+N\sup(S + T) = M + N.

Check yourself

Check yourself True or false?

Every non-empty set of real numbers that is bounded above contains its upper bound MM.

Why

False. {1−1/n}\{1 - 1/n\} has M=1M = 1, and 11 is not of the form 1−1/n1 - 1/n. The theorem promises that MM exists, not that it is attained. When it is a member it is the greatest member, and many sets have none.

Check yourself Choose one

Which statement is exactly property 2 of the upper bound MM of SS?

Why

Property 2 says no number below MM is an upper bound: each M−δM - \delta is beaten by some member. The first option is attainment, which may fail. The second is false whenever MM is a member. The fourth is far too strong: it would force all of SS into (M−δ,M](M - \delta, M] for every δ\delta, so S={M}S = \{M\}.

Check yourself Enter a number

For S={1−1/n}S = \{1 - 1/n\} and ξ=0.99\xi = 0.99, what is the smallest nn for which the member 1−1/n1 - 1/n exceeds ξ\xi?

Why

1−1/n>0.991 - 1/n > 0.99 means 1/n<0.011/n < 0.01, that is n>100n > 100. The member 1−1/1001 - 1/100 equals 0.990.99 and does not exceed it, so the answer is n=101n = 101.

Check yourself Choose one

What are the upper and lower bounds of {(−1)n(1+1/n):n≥1}\{(-1)^n(1 + 1/n) : n \ge 1\}?

Why

The members are −2,32,−43,54,…-2, \tfrac32, -\tfrac43, \tfrac54, \dots. The positive ones decrease from 32\tfrac32 and the negative ones increase from −2-2, so M=32M = \tfrac32 and m=−2m = -2, both attained. The values 11 and −1-1 are what the terms approach for large nn: they are the upper and lower limits, the subject of §82, not the bounds.

Hardy’s language

Summary

Summary
  • A non-empty set bounded above has a unique least upper bound MM: no member exceeds it, and every smaller number is exceeded by some member.
  • MM need not be a member; if it is, it is the greatest member. The same holds for the greatest lower bound mm.
  • The proof is a Dedekind section: LL = numbers exceeded by a member, RR = upper bounds.
  • In δ\delta language: for every δ>0\delta > 0 some member lies in (M−δ,M](M - \delta, M]. This form is the one used in proofs.
  • Hardy’s “upper bound” is our supremum; our “an upper bound” is his “a number KK such that SS is bounded above by KK”.