Exercise 1.3.6

Given sets A and B , define A + B = { a + b : a A and b B } . Follow these steps to prove that if A and B are nonempty and bounded above then sup ( A + B ) = sup A + sup B

(a)
Let s = sup A and t = sup B . Show s + t is an upper bound for A + B .
(b)
Now let u be an arbitrary upper bound for A + B , and temporarily fix a A . Show t u a .
(c)
Finally, show sup ( A + B ) = s + t .
(d)
Construct another proof of this same fact using Lemma 1.3.8.

Answers

(a)
We have a s and b t , adding the equations gives a + b s + t .
(b)
t u a should be true since u a is an upper bound on b , meaning it is greater then or equal to the least upper bonud t . Formally a + b u implies b u a and since t is the least upper bound on b we have t u a .
(c)
From (a) we know s + t is an upper bound, so we must only show it is the least upper bound.

Let u = sup ( A + B ) , from (a) we have t u a and s u b adding and rearranging gives a + b 2 u s t . since 2 u s t is an upper bound on A + B it is less then the least upper bound, so u 2 u s t implying s + t u . and since u is the least upper bound s + t must equal u .

Stepping back, the key to this proof is that a + b s , a , b implying sup ( A + B ) s can be used to transition from all a + b to a single value sup ( A + B ) , avoiding the 𝜖 -hackery I would otherwise use.

(d)
Showing s + t 𝜖 is not an upper bound for any 𝜖 > 0 proves it is the least upper bound by Lemma 1.3.8. Rearranging gives ( s 𝜖 2 ) + ( t 𝜖 2 ) we know there exists a > ( s 𝜖 2 ) and b > ( t 𝜖 2 ) therefore a + b > s + t 𝜖 meaning s + t cannot be made smaller, and thus is the least upper bound.
User profile picture
2022-01-27 00:00
Comments