Show that A ∪ B has a least upper bound, and that sup{AUB}=max{supA,supB}?
2016-11-26 2:11 pm
Suppose A and B are nonempty subsets of R that are bounded above. Show that A ∪ B has a least upper bound, and that sup{AUB}=max{supA,supB}
回答 (1)
2016-11-26 2:35 pm
They each have a sup.
One of those numbers is bigger, or they're equal. The bigger one is an upper bound to both sets.
Done.
Now work that out as a formal proof.
One of those numbers is bigger, or they're equal. The bigger one is an upper bound to both sets.
Done.
Now work that out as a formal proof.
收錄日期: 2021-05-01 20:53:46
原文連結 [永久失效]:
https://hk.answers.yahoo.com/question/index?qid=20161126061149AAp4Gxw