« Section 7: Problem 4 Solution

Section 7: Problem 6 Solution »

Section 7: Problem 5 Solution

Working problems is a crucial part of learning mathematics. No one can learn topology merely by poring over the definitions, theorems, and examples that are worked out in the text. One must work part of it out for oneself. To provide that opportunity is the purpose of the exercises.
James R. Munkres
Determine, for each of the following sets, whether or not it is countable. Justify your answers.
(a) The set of all functions .
(b) The set of all functions .
(c) The set .
(d) The set of all functions .
(e) The set of all functions .
(f) The set of all functions that are "eventually zero." [We say that is eventually zero if there is a positive integer such that for all .]
(g) The set of all functions that are eventually .
(h) The set of all functions that are eventually constant.
(i) The set of all two-element subsets of .
(j) The set of all finite subsets of .
(a) (b) (c) (d) (e) As a general result, the set of all functions from a set of cardinality ( is either a positive integer if is finite or if is countably infinite) to a set is in a bijective correspondence with (there is a bijection between them, see Exercise 7 of §6). Hence, we get countably infinite sets in (a), (b) and (c) (using Corollary 7.4, Theorem 7.5 and Theorem 7.6), and uncountable sets in (d) and (e) (using Theorem 7.7).
(f) (g) To continue the general result stated above, the set of all functions from to a set that are eventually a given fixed element is in a bijective correspondence with the countable union over of the sets all functions from to s.t. (where ). Indeed, having a sequence where , we map it to the function such that , and, hence, . It is clear that the mapping is injective and surjective. Now, is a singleton, is in a bijective correspondence with , and for , each is clearly in a bijective correspondence with . So, if is countable, so is each for , and their countable union together with is countably infinite. And this is what we get in both (f) and (g).
(h) We further continue our result, the set of all functions from to a set that are eventually constant is simply the union over of the sets of all functions from to that are eventually . Hence, if is countable, we have the countable union of countably infinite sets (according to (f) and (g)), which is countably infinite.
(i) Let be such that where and . is clearly injective, and , according to (a), is countably infinite. So is (it is infinite as it contains, for example, all two-element sets of the form for ).
(j) Similar to (i), if is the set of all -element subsets of , then contains one subset only, and for , there is an injective correspondence such that where and . Since, according to (b), for all , is countably infinite, so is (including ).