5. Let S be a non-empty bounded subset of R. If a > 0, show that sup (aS) = a sup S where aS = {as : s E S}. Let c = sup S, show ac = sup (aS). This is done by showing: (a) ac is an upper bound of aS. (b) If y is another upper bound of aS then ac < 7. Both are done using definitions and the fact that c=sup S.
Let A be a non-empty subset of R that is bounded above. (a) Let U = {x ∈ R : x is an upper bound for A}, the set of all upper bounds for A. Prove that there exists a u ∈ R such that U = [u, ∞). (b) Prove that for all ε > 0 there exists an x ∈ A such that u − ε < x ≤ u. This u is one shown to exist in...
(6) Let S c R be non-empty and bounded above. Let q = sup S. Show that q E bd S. (6) Let S c R be non-empty and bounded above. Let q = sup S. Show that q E bd S.
2. Let A be a non-empty subset of R bounded below. Show that inf (A) is a border point of A
Let A be a non empty subset of R that is bounded below and let a=inf A. If a a&A, prove thal x is a limit point of A
#3 A Supremely Infimum Problem (Zorn 1.9 #8) Let S R be non-empty and bounded below. Let-S f-xlxES). Show that sup(-S) exists. Then show that -inf (S) sup(-S). This problem shows that the completeness axiom guaranteeing the existence of supremums implies a similar statement about the existence of infimums. Write down an "infimum" version of the completeness axiom. that-1 #3 A Supremely Infimum Problem (Zorn 1.9 #8) Let S R be non-empty and bounded below. Let-S f-xlxES). Show that sup(-S)...
6. Let X be a non-empty subset of an ordered field with the least upper bound property. Supposed that X is bounded above and define -X = {-1 : TEX} Prove that supX = - inf(-X).
Let T be a bounded subset of R and let S CT. Prove that supS < supT.
Let A, B be non-empty, bounded subsets of R. a) If the statement is true, prove it. If the statement is false, give a counterexample: sup(AUB) = max(sup(A), sup(B)}. b) If the statement is true, prove it. If the statement is false, give a counterexample: If An B + Ø, then sup(A n B) = min{sup(A), sup(B)}. E 选择文件
Use the completeness axiom to show that every non empty subset of R (real numbers) that is bounded below has an infimum in R