Quote:
Originally Posted by Mariogs379
Let set A be bounded below and B = {b in B s.t. b is a lower bound of A}.
Aim to show: sup B = inf A.
Proof:
Assume not: Either sup B > inf A, or sup B < inf A
If sup B > inf A, there is a b in B that is not a lower bound of A (that is, there is an b in B greater than an a in A). But B is the set of all lower bounds of A and we've just discovered a b in B that is not a lower bound of A. Contradiction.
If sup B < inf A, there is a lower bound of A greater than any b in B. But B is the set of all lower bounds of A. Contradiction.
So it must be the case that sup B = inf A.
Look right?
A is a set with a lower bound, and B is the set of lower bounds of A. Prove sup B = inf A.
1) sup B <= inf A.
If x is a lower bound for A, then x <= inf(A) [def'n of inf]
Every element of B is a lower bound for A, so for each b in B, b <= inf(A).
Hence inf(A) is an upper bound for B.
Hence inf(A) >= sup(B) [by the def'n of sup].
2) sup B >= inf A.
inf A is (by definition) a lower bound for A. Hence it is in B. Hence it is <= sup B, since sup B is (by definition) an upper bound for B.
Hence sup(B)=inf(A)