| Line 1: | Line 1: | ||
| − | I did the first one by contradiction | + | #1 |
| + | |||
| + | I did the first one by contradiction. I noted that the first time I looked through it I forgot to verify their existance via the lub property of the reals, and I still wonder whether the proof needs cases by whether the supremum is infinite or finite. | ||
Given <math>A, B \neq \varnothing \subseteq \mathbf{R}, A+B = \{ a+b \vert a \in A, b \ in B \}</math>, and I'll let <math>\alpha = \sup A, \beta = \sup B</math> | Given <math>A, B \neq \varnothing \subseteq \mathbf{R}, A+B = \{ a+b \vert a \in A, b \ in B \}</math>, and I'll let <math>\alpha = \sup A, \beta = \sup B</math> | ||
| Line 14: | Line 16: | ||
<math>\therefore \alpha + \beta</math> is an upper bound of <math>A+B</math> | <math>\therefore \alpha + \beta</math> is an upper bound of <math>A+B</math> | ||
| + | |||
| + | Now we show that it is the least upper bound. Let <math>\delta</math> be an upper bound of <math>A+B</math>, we need to show that <math>\delta \geq \alpha + \beta</math>. | ||
| + | |||
| + | Assume not, then <math>\delta < \alpha + \beta</math>, let <math>c = \alpha + \beta - \delta > 0</math> and note <math>\delta = \alpha + (\beta - c)</math>. But since <math>\delta</math> is an upper bound of <math>A+B</math> then <math>\forall a,b \in A,B, a+b \leq \alpha + b \leq \delta = \alpha + \beta - c</math>. But then <math>\forall b \in B, b \leq \beta - c</math> so we have an upper bound for <math>B</math> that's smaller than the lub of <math>B</math>, contradiction. | ||
| + | |||
| + | Therefore, <math>\alpha + \beta<math> is the lub of <math>A+B</math> | ||
Revision as of 04:50, 28 August 2008
- 1
I did the first one by contradiction. I noted that the first time I looked through it I forgot to verify their existance via the lub property of the reals, and I still wonder whether the proof needs cases by whether the supremum is infinite or finite.
Given $ A, B \neq \varnothing \subseteq \mathbf{R}, A+B = \{ a+b \vert a \in A, b \ in B \} $, and I'll let $ \alpha = \sup A, \beta = \sup B $
WTS: $ \sup(A+B) = \alpha + \beta $
First of all, by the lub property of $ \mathbf{R} $ we know that these exist.
Now we show that $ \alpha + \beta $ is an upper bound of $ A+B $ by contradiction. Thus $ \exist a,b \in A,B \ni a+b > \alpha + \beta $
$ (\alpha - a) + (\beta - b) < 0 $
WLOG assume $ (\alpha - a) < 0 $, then $ \exists a \in A \ni a > \alpha, but \alpha = \sup A $, contradiction.
$ \therefore \alpha + \beta $ is an upper bound of $ A+B $
Now we show that it is the least upper bound. Let $ \delta $ be an upper bound of $ A+B $, we need to show that $ \delta \geq \alpha + \beta $.
Assume not, then $ \delta < \alpha + \beta $, let $ c = \alpha + \beta - \delta > 0 $ and note $ \delta = \alpha + (\beta - c) $. But since $ \delta $ is an upper bound of $ A+B $ then $ \forall a,b \in A,B, a+b \leq \alpha + b \leq \delta = \alpha + \beta - c $. But then $ \forall b \in B, b \leq \beta - c $ so we have an upper bound for $ B $ that's smaller than the lub of $ B $, contradiction.
Therefore, $ \alpha + \beta<math> is the lub of <math>A+B $
