Exercise 7.8

Let X denote the two-element set {0,1}; let be the set of countable subsets of Xω. Show that Xω and have the same cardinality.

Answers

Again let AB denote the set of functions from A to B.

Proof. First, for x Xω, clearly the function that maps x to the set {x} is an injective function from Xω to B.

Now we construct an injection f1 : B (Xω)ω. So consider any S B so that S is a countable subset of Xω. Then, by Theorem 7.1, we can choose a surjective function g : + S. Note that this does require the Axiom of Choice since we must choose such a surjection for each S B, and clearly B is infinite. Since S Xω, g can be considered as a function from + to Xω so that g (Xω)ω, though of course it would no longer necessarily be surjective with this range. So we simply set f1(S) = g

To show that f1 is injective consider S,SB where SS. Then, setting g = f1(S) and g = f1(S), we have that g(+) = S and g(+) = S by definition. Since SS, we have that g and g have the same domain but different image sets. Clearly this means that f1(S) = gg = f1(S), which shows that f1 is injective since S and S were arbitrary.

Hence f1 is an injection from B to (Xω)ω = (X+)+. Now, from Lemma 2, we have that (X+)+ has the same cardinality as X+×+ so that there is a bijection f2 : (X+)+ X+×+, which is of course also an injection. Finally, since + × + has the same cardinality as + (by Corollary 7.4), it follows that there is an injection from + × + to +. Since also the identity function on X is an injection, we have that there is an injection f3 : X+×+ X+ by Lemma 1. Then clearly f3 f2 f1 is an injection from B to X+ = Xω.

Since there is an injection from Xω to B and vice-versa, it follows that they have the same cardinality by Exercise 7.6 part (b) as desired. □

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