Exercise 3.2.12

Let A be an uncountable set and let B be the set of real numbers that divides A into two uncountable sets; that is, s B if both { x : x A and x < s } and { x : x A and x > s } are uncountable. Show B is nonempty and open.

Answers

Our primary tool will be that countably infinite unions preserve countability (see Exercise ?? ).

Consider B 1 = { x R : ( , x ) A  is uncountable } . B 1 must be nonempty; otherwise, A = n = 1 ( , n ) A is a union of countable or finite sets, which by ?? means that A is countable (which it isn’t). Note that if x B 1 and y > x , then y B 1 . Moreover, 𝜖 > 0 so that x 𝜖 B 1 ; we can prove this by contradiction. If there is no such 𝜖 , then ( , x 1 n ) A must be countable for all n N ; by ?? ,

n = 1 ( , x 1 n ) A = ( , x ) A

is also countable, a contradiction. Therefore, B 1 is open. Now note that B 1 must be of the form ( , b 1 ) , where b 1 = inf B 1 (or if inf B 1 is undefined). Similarly, B 2 = { x R : ( x , ) A  is uncountable } is of the form ( b 2 , ) .

Note that B 1 B 2 = R ; therefore b 1 > b 2 and so B = B 1 B 2 . Moreover since B 1 and B 2 are both open, so is B .

User profile picture
2022-01-27 00:00
Comments