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 {An} nJ be an indexed family of countable sets, where the index set J is {1,,N } or +. Assume that each set An is nonempty for convenience since this does not change anything. Now, for each n J, let Bn be the set of surjective functions from + to An. Since each An is countable, it follows from Theorem 7.1 that Bn. Then, by the axiom of choice, the collection {Bn} nJ has a choice function c such that c(Bn) Bn for every n J.

Now set fn = c(Bn) for every n J so that fn Bn and hence is a surjection from + into An. Since J is countable, there is also a surjection g : + J by Theorem 7.1. Then define h : + × + nJAn by h(k,m) = fg(k)(m) for k,m +.

We now show that h is surjective. So consider any a nJAn so that a An for some n J. Since g : + J is surjective, there is a k + where g(k) = n. Also, since fn : + An is surjective, there is an m + where fn(m) = a. We then have by definition that

h(k,m) = fg(k)(m) = fn(m) = a,

which shows that h is surjective since a was arbitrary.

Lastly, since + × + is countable by Example 7.2, there is a bijection h : + + × +. It then follows that h h is a surjection from + to nJAn, which shows that nJAn is countable again by Theorem 7.1. □

User profile picture
2019-12-01 00:00
Comments