Homepage › Solution manuals › Stephen Abbott › Understanding Analysis › Exercise 3.2.12
Exercise 3.2.12
Let be an uncountable set and let be the set of real numbers that divides into two uncountable sets; that is, if both : and and and are uncountable. Show is nonempty and open.
Answers
Our primary tool will be that countably infinite unions preserve countability (see Exercise ?? ).
Consider . must be nonempty; otherwise, is a union of countable or finite sets, which by ?? means that is countable (which it isn’t). Note that if and , then . Moreover, so that ; we can prove this by contradiction. If there is no such , then must be countable for all ; by ?? ,
is also countable, a contradiction. Therefore, is open. Now note that must be of the form , where (or if is undefined). Similarly, is of the form .
Note that ; therefore and so . Moreover since and are both open, so is .