Using the least upper bound property, let us suppose that a is an upper bound for S1 and b is an upper bound for S2, as they are both a set of real numbers. Then there exists an x in S1 s.t. x≤a and there exists a y in S2 s.t. y≤b. By adding them together, x+y≤a+b where a and b are the upper bounds for their respected set of real numbers. Thus, it is equal to l.u.b. S1 + l.u.b. S2

I think this is how it goes. I'm sorry if my proof is horrible; it has been a significant period of time since I've done proofs, as statistics and probability classes don't use proofs! Also, I can't get \in to work. Sorry about that!

Using the least upper bound property, let us suppose that a is an upper bound for S1 and b is an upper bound for S2, as they are both a set of real numbers. Then there exists an x in S1 s.t. x≤a and there exists a y in S2 s.t. y≤b. By adding them together, x+y≤a+b where a and b are the upper bounds for their respected set of real numbers. Thus, it is equal to l.u.b. S1 + l.u.b. S2

I think this is how it goes. I'm sorry if my proof is horrible; it has been a significant period of time since I've done proofs, as statistics and probability classes don't use proofs! Also, I can't get \in to work. Sorry about that!

All that you have shown thus far is that if [itex]x \in S_1[/itex] and [itex]y \in S_2[/itex], then [itex]x + y \leq lub(S_1) + lub(S_2)[/itex].

So let me get this straight. I now have to prove that x ≥ a in S1 and y ≥ b in S2. BUT, isn't that a contradiction? If you add them, you get x+y≥a+b, but if the elements of x, y in their respective sets are greater than the l.u.b., then a and b are not the l.u.b.

I don't quite understand. Perhaps you can guide me in the right direction. Much thanks.

So let me get this straight. I now have to prove that x ≥ a in S1 and y ≥ b in S2. BUT, isn't that a contradiction? If you add them, you get x+y≥a+b, but if the elements of x, y in their respective sets are greater than the l.u.b., then a and b are not the l.u.b.

I don't quite understand. Perhaps you can guide me in the right direction. Much thanks.

If there were specific elements x in S_1 and y in S_2 such that x + y >= a + b, then you'd be done, because x + y <= c. But there might not be such elements. In fact, if there were, then you would have x = a and y = b. Thus each of the two sets S_1 and S_2 would contain its supremum. This is not guaranteed.

However, if you let [itex]\epsilon > 0[/itex], can you find x in S_1 and y in S_2 such that [itex]x > a - \epsilon[/itex] and [itex]y > b - \epsilon[/itex]? i.e. you might not be able to find elements that achieve the upper bound, but can you get them arbitrarily close? If so, what can you do with that?