Let A be a subset of R and suppose that s = sup(A) belongs to A. If b is not in A, show that sup(A U {b}) is equal to the larger of the two numbers s and b.
@wio
@ganeshie8
if b < s, show the sup is s and if the s < b, show the sup is b. b = s is trivial
I guess I can do the trivial case first :/ if b = s then every elements in A U {b} is less than or equal to b = s, hence sup(A U {b}) <= s = b
Just argue by contradiction... Suppose \(b < s\) and \(\sup A \cup \{b\} = b\) since \(s \in A \cup \{b\}\) then by definition of supremum we have that \(s \leq b\) However this is false. So we have a contradiction
Now do the other case.
@Alchemista s does doesn't have to be in A U {b} though.
s *doesn't* ...
"Let A be a subset of R and suppose that s = sup(A) belongs to A. "
right. It's in A, but we don't know if it's in A U {b}
If it's in \(A\) then it is in \(A \cup \{b\}\)
:O oh I see
now the other case. Suppose s < b and sup(A U {b} ) = s. for all a in A, a <= s and b <= s. (Contradiction!)
@Alchemista right?
Join our real-time social learning platform and learn together with your friends!