Exercise 9.8

Show that P (+) and have the same cardinality. [Hint: You may use the fact that every real number has a decimal expansion, which is unique if expansions that end in an infinite string of 9’s are forbidden.]

A famous conjecture of set theory, called the continuum hypothesis, asserts that there exists no set having cardinality greater than + and lesser cardinality than . The generalized continuum hypothesis asserts that, given the infinite set A, there is no set having greater cardinality than A and lesser cardinality than P (A). Surprisingly enough, both of these assertions have been shown to be independent of the usual axioms of set theory. For a readable expository account, see [Sm].

Answers

Lemma 1. If A and B are sets with the same cardinality, then P (A) and P (B) have the same cardinality.

Proof. Since A and B have the same cardinality there is a bijection f : A B. We define a bijection g : P (A) P (B). So, for any X P (A), set g(X) = f(X). Clearly f(X) B, since B is the range of f, so that g(X) = f(X) P (B) and hence P (B) can be the range of g.

To show that g is injective, consider sets X and Y in P (A) so that X,Y A. Also suppose that XY so, without loss of generality, we can assume that there is an x X where xY . Clearly f(x) f(X) since x X. Were it the case that f(x) f(Y ) then there would be a y Y such that f(y) = f(x). But then we would have that y = x since f is injective and hence x = y Y , which we know not to be the case. Hence f(x)f(Y ) so that it has to be that g(X) = f(X)f(Y ) = g(Y ) since f(x) f(X). Since X and Y were arbitrary this shows that g is injective.

To show that g is surjective consider any Y P (B) so that Y B. Let X = f1(Y ), noting that f1 is a bijection from B to A since f is bijective. Clearly X A since A is the range of f1 so that X P (A). Now consider any y f(X) so that there is an x X where f(x) = y. Then, since X = f1(Y ), there is a y Y where x = f1(y), and hence y = f(x) = f(f1(y)) = y. Thus y = y Y so that f(X) Y since y was arbitrary. Now consider y Y and let x = f1(y) so that clearly x = f1(y) f1(Y ) = X. Moreover, f(x) = f(f1(y)) = y so that y f(X). Thus Y f(X) as well since y was arbitrary. This shows that g(X) = f(X) = Y , from which we conclude that g is surjective since Y was arbitrary.

Hence g : P (A) P (B) is a bijection so that P (A) and P (B) have the same cardinality by definition. □

Main Problem.

Proof. We show this using the Cantor-Schroeder-Bernstein (CSB) Theorem, which was proven in Exercise 7.6 part (b).

First, we construct an injective function f from to P (). For any x let Q = {q q < x} so that clearly Q and hence Q P (). Therefore setting f(x) = Q means that f is a function from to P (). To show that f is injective consider x,y where xy. Without loss of generality, we can assume that x < y so that there is a q where x < q < y since the rationals are order-dense in the reals. Also set Q = f(x) and P = f(y). Since q > x we have that qQ. Analogously, since q < y we have that q P. Thus it has to be that f(x) = QP = f(y), which shows that f is injective since x and y were arbitrary.

Now, it was shown in Exercise 7.1 that is countably infinite and thus has the same cardinality as +. From Lemma 1 it then follows that P () has the same cardinality as P (+) so that there is a bijection g : P () P (+). Clearly then g f is an injection from to P (+).

Now let X = {0,1}, and we construct an injection h : Xω . For any sequence x = (x1,x2,) Xω set h(x) to the decimal expansion 0.x1x2x3, where clearly each xn is the digit 0 or 1. Clearly h(x) is a real number so that h is a function from Xω to . It is easy to see that h is injective since different sequences will result in different decimal expansions. Since none of the expansions end in an infinite sequence of 9’s, clearly the corresponding real numbers will be different.

Now, it was shown in Exercise 7.3 that P (+) and Xω have the same cardinality so that there is a bijection i : P (+) Xω. It then follows that h i is an injection of P (+) into . Since we have shown the existence of both injections, the result follows from the CSB Theorem. □

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