Let A and B be non-empty bounded subsets of R. DefineA − B := {a − b : a ∈ A, b ∈ B}.Prove thatsup(A − B) = sup A − inf B
Question
Let A and B be non-empty bounded subsets of R. DefineA − B := {a − b : a ∈ A, b ∈ B}.Prove thatsup(A − B) = sup A − inf B
Solution
Step 1: Define the sets
Let A and B be non-empty bounded subsets of R. We define A - B as the set of all differences a - b, where a is an element of A and b is an element of B.
Step 2: Show that sup(A - B) is an upper bound for A - B
We know that for any a in A and b in B, a - b is less than or equal to sup A - inf B. This is because a is less than or equal to sup A and -b is greater than or equal to -inf B. Therefore, sup A - inf B is an upper bound for A - B.
Step 3: Show that sup(A - B) is the least upper bound
Now we need to show that sup(A - B) is the least upper bound for A - B. Suppose there is another upper bound U for A - B that is less than sup A - inf B. Then there exists an a in A such that a > U + inf B. Similarly, there exists a b in B such that b < sup A - U. Subtracting these inequalities gives a - b > sup A - inf B, which contradicts the assumption that U is an upper bound for A - B. Therefore, sup(A - B) is the least upper bound for A - B.
Step 4: Conclusion
We have shown that sup(A - B) is an upper bound for A - B and that it is the least upper bound. Therefore, sup(A - B) = sup A - inf B.
Similar Questions
Problem 6. Let A, B ⊆ R be nonempty and bounded sets.(a) Prove that if A ⊆ B, then inf B ≤ inf A ≤ sup A ≤ sup B.(b) Prove that sup(A ∪ B) = max{sup A, sup B}. (Hint: A is a subset of A ∪ B, so we canapply part (a) to these two sets.
Prove or disprove that (A ∪ B) − B = A − B for any sets A and B.
Let a, b ∈ R, and suppose that for every ε > 0, we have a ≤ b + ε. Show that a ≤ b.
Let X and Y be non-empty sets, and let h : X × Y → R be a bounded function.(i) Prove thatsupy∈Ysupx∈Xh(x, y) = sup(x,y)∈X×Yh(x, y) = supx∈Xsupy∈Yh(x, y).Hint) Interchanging the roles of X and Y if necessary, it is enough to prove thatsupy∈Ysupx∈Xh(x, y) = sup(x,y)∈X×Yh(x, y)
Let X and Y be non-empty sets, and let h : X × Y → R be a bounded function. Provethatsupy∈Ysupx∈Xh(x, y) = sup(x,y)∈X×Yh(x, y) = supx∈Xsupy∈Yh(x, y).Hint) By symmetry, we can interchange the roles of X and Y if necessary. Therefore, it isenough to prove thatsupy∈Ysupx∈Xh(x, y) = sup(x,y)∈X×Yh(x, y)
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.