Homepage › Solution manuals › James Munkres › Topology › Exercise 9.4
Exercise 9.4
There was a theorem in §7 whose proof involved an infinite number of arbitrary choices. Which one was it? Rewrite the proof so as to make explicit use of the choice axiom. (Several of the earlier exercises have used the choice axiom also.)
Answers
This was the proof of Theorem 7.5, which asserts that a countable union of countable sets is also countable. The following rewritten proof makes explicit use of the choice axiom and so points out where it is needed.
Proof. Let be an indexed family of countable sets, where the index set is or . Assume that each set is nonempty for convenience since this does not change anything. Now, for each , let be the set of surjective functions from to . Since each is countable, it follows from Theorem 7.1 that . Then, by the axiom of choice, the collection has a choice function such that for every .
Now set for every so that and hence is a surjection from into . Since is countable, there is also a surjection by Theorem 7.1. Then define by for .
We now show that is surjective. So consider any so that for some . Since is surjective, there is a where . Also, since is surjective, there is an where . We then have by definition that
which shows that is surjective since was arbitrary.
Lastly, since is countable by Example 7.2, there is a bijection . It then follows that is a surjection from to , which shows that is countable again by Theorem 7.1. □