Homepage › Solution manuals › Stephen Abbott › Understanding Analysis › Exercise 1.3.6
Exercise 1.3.6
Given sets and , define and . Follow these steps to prove that if and are nonempty and bounded above then
- (a)
- Let and . Show is an upper bound for .
- (b)
- Now let be an arbitrary upper bound for , and temporarily fix . Show .
- (c)
- Finally, show .
- (d)
- Construct another proof of this same fact using Lemma 1.3.8.
Answers
- (a)
- We have and , adding the equations gives .
- (b)
- should be true since is an upper bound on , meaning it is greater then or equal to the least upper bonud . Formally implies and since is the least upper bound on we have .
- (c)
-
From (a) we know
is an upper bound, so we must only show it is the least upper bound.
Let , from (a) we have and adding and rearranging gives . since is an upper bound on it is less then the least upper bound, so implying . and since is the least upper bound must equal .
Stepping back, the key to this proof is that implying can be used to transition from all to a single value , avoiding the -hackery I would otherwise use.
- (d)
- Showing is not an upper bound for any proves it is the least upper bound by Lemma 1.3.8. Rearranging gives we know there exists and therefore meaning cannot be made smaller, and thus is the least upper bound.