2. Let A and B be non-empty sets with A C B, and assume B is bounded. (a) Prove that inf(B) < inf(A) < sup(A) < sup(B).
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
2. Let A and B be non-empty sets with A C B, and assume B is bounded. (a) Prove that inf(B) < inf(A) < sup(A) < sup(B).
2. Let A and B be non-empty sets with A C B, and assume B is bounded. (a) Prove that inf(B) < inf(A) < sup(A) < sup(B). (b) Prove or disprove: There exists some A, B with A Ç B (i.e. A is a subset of B but NOT equal to B) where all of the above inequalities are tight (i.e. they can all be equal).
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!