Chapter IV · Limits of functions of a positive integral variable
The bounds of a bounded set
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 has no largest member: whichever one you pick, the next is larger. Yet the number 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 that no member of a set exceeds is an upper bound of in the everyday sense. If there is one, there are many: anything larger than is one too. The question is whether there is a least one. Hardy answers it by sorting every real number into one of two classes:
- goes into if some member of exceeds it;
- goes into if no member of exceeds it (that is, if is an upper bound).
Every member of is less than every member of , so the two classes form a Dedekind section, and Dedekind’s theorem (§17) supplies the number that divides them.
Try this. For the set , move and read whether some member exceeds it. Bring as close to from below as the slider allows. Then turn on “Show the two classes”, and try the decimals of and the lower bound of .
- members of S
- your number ξ
- a member exceeding ξ
What to notice
Every below , however close, has a witness: a member beyond it (with larger than ). No member exceeds itself. So is the least upper bound, although it is not a member. For the decimals of every member is rational, but the dividing point is not: this is why the theorem needs the real numbers.
Precise statements
A set of real numbers is bounded above if there is a number with for every in , bounded below if there is a with for every in , and bounded if it is both.
If is non-empty and bounded above, there is a number such that
- no member of exceeds , and
- every number less than is exceeded by at least one member of .
There is only one such number. Hardy calls it the upper bound of ; today it is the least upper bound or supremum, .
Condition 1 says is an upper bound; condition 2 says nothing smaller is one. Together they say is the least upper bound. In terms of a tolerance: for every there is a member with .
If is non-empty and bounded below, there is a unique number (the lower bound, or greatest lower bound, ) such that no member of is less than , and every number greater than exceeds at least one member of . If is bounded, with for all in , then .
Whether the bounds belong to varies: for , is a member and is not; for it is the other way round; for both are members ( at , at ). When is a member it is the greatest member of .
Proofs
Divide all real numbers into (exceeded by some member of ) and (exceeded by none). Check that this is a Dedekind section, let 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 is in exactly one class, and neither class is empty
By construction each is in or in and not both. has some member , and every is in . The given bound is in .
Every member of is less than every member of
Let and . Some member exceeds ; no member exceeds , so . Hence .
Dedekind’s theorem gives a dividing number
By §17, there is a number such that every number less than is in and every number greater than is in . ( itself is in one or the other; we do not need to know which.)
No member of exceeds (property 1)
Suppose a member with . The number is greater than , so it is in ; it is less than the member , so it is in . A number cannot be in both classes.
Every number below is exceeded by a member (property 2)
A number less than is in , which by definition means that some member of exceeds it.
Uniqueness
If and both have properties 1 and 2 and , then by property 2 for some member exceeds , contradicting property 1 for . So .
The lower bound is found in the same way, or by applying the theorem to the set : if is the upper bound of , then . The inequality holds because any member satisfies ; and because is an upper bound while is the least.
Worked examples and exercises
Find the upper and lower bounds of each set, and say whether they are members: (a) ; (b) ; (c) .
Hint
Solution
(a) (a member, ). : no is negative, and any exceeds once . is not a member.
(b) The members are . () and (), both members: the positive members are for even , the largest being , and the negative members are for odd , the smallest being .
(c) and , neither a member (they are irrational). No member exceeds , since gives . If , there is a rational with (rationals are dense, Chapter I), and then , so is a member exceeding . The lower bound follows by symmetry.
Give an infinite bounded set that has no least member, and find its lower bound.
Hint
Solution
is bounded (between and ) and has no least member, since . Its lower bound is , 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.
Let and be bounded above with every member of also a member of . Show that . Must the inequality be strict when has members that lacks?
Hint
Solution
No member of exceeds ; members of are members of ; so is an upper bound of . The least upper bound of is at most any upper bound, so .
It need not be strict: and both have upper bound . Adding members changes the bound only if one of them exceeds the old bound.
Let and be bounded above, and let be the set of all sums (, ). Show that .
Hint
Solution
Let and . Every sum satisfies , so property 1 holds for . For property 2, let and put . By property 2 for and for there are members and . Then . So every number below is exceeded by a member of , and by uniqueness .
Check yourself
Every non-empty set of real numbers that is bounded above contains its upper bound .
False. has , and is not of the form . The theorem promises that exists, not that it is attained. When it is a member it is the greatest member, and many sets have none.
Which statement is exactly property 2 of the upper bound of ?
Property 2 says no number below is an upper bound: each is beaten by some member. The first option is attainment, which may fail. The second is false whenever is a member. The fourth is far too strong: it would force all of into for every , so .
For and , what is the smallest for which the member exceeds ?
means , that is . The member equals and does not exceed it, so the answer is .
What are the upper and lower bounds of ?
The members are . The positive ones decrease from and the negative ones increase from , so and , both attained. The values and are what the terms approach for large : they are the upper and lower limits, the subject of §82, not the bounds.
Hardy’s language
Summary
- A non-empty set bounded above has a unique least upper bound : no member exceeds it, and every smaller number is exceeded by some member.
- need not be a member; if it is, it is the greatest member. The same holds for the greatest lower bound .
- The proof is a Dedekind section: = numbers exceeded by a member, = upper bounds.
- In language: for every some member lies in . This form is the one used in proofs.
- Hardy’s “upper bound” is our supremum; our “an upper bound” is his “a number such that is bounded above by ”.