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).
Posted: Thu May 12, 2022 3:50 pm
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).