Exercise 9.7

Let A and B be two nonempty sets. If there is an injection of B into A, but no injection of A into B, we say that A has greater cardinality than B.

(a)
Conclude from Theorem 9.1 that every uncountable set has greater cardinality than +.
(b)
Show that if A has greater cardinality than B, and B has greater cardinality than C, then A has greater cardinality than C.
(c)
Find a sequence A1,A2, of infinite sets, such that for each n +, the set An+1 has greater cardinality than An.
(d)
Find a set that for every n has cardinality greater than An.

Answers

Lemma 1. For any set A, P (A) has greater cardinality than A.

Proof. Clearly the function that maps a A to {a} P (A) is an injection. However, we know from Theorem 7.8 that there is no injection from P (A) to A. Together these show that P (A) has greater cardinality than A as desired. □

Main Problem.

(a)

Proof. Suppose that A is any uncountable set. Clearly A is not finite for then it would be countable. Hence it is infinite and so there is a injection from + to A by Theorem 9.1. There also cannot be an injection from A to +, for if there were then A would be countable by Theorem 7.1. This shows that A has greater cardinality than + by definition. □

(b)

Proof. Since A has greater cardinality than B, there is an injection f : B A. Likewise, since B has greater cardinality than C, there is an injection g : C B. It then follows that f g is an injection of C into A. Now suppose that h : A C is injective. Then g h would be an injection of A into B, which we know cannot exist since A has greater cardinality than B. Hence it must be that no such injection h exists, which shows that A has greater cardinality than C as desired. □

(c) We define a sequence of sets recursively:

A1 = +, An = P (An1) for n > 1.

We show that this meets the requirements.

Proof. First we show that each An is infinite by induction. Clearly A1 = + is infinite. Now assume that An is infinite for n + so that there is an injection f : + An by Theorem 9.1. Then, by Lemma 1 , An+1 = P (An) has greater cardinality than An so that there is an injection g : An An+1. Then g f is an injection from + to An+1 so that An+1 is infinite as well by Theorem 9.1. This completes the induction.

Finally, for any n + we have that n + 1 > 1 so that An+1 = P (A(n+1)1) = P (An). Then clearly An+1 has greater cardinality than An by Lemma 1 . This shows the desired result. □

(d) Let A = n+An, which we claim has the required property.

Proof. Consider any n +. Clearly An A so that the identity function iAn is an injection of An into A. Now suppose for the moment that g : A An is injective. Since clearly also An+1 A, it follows that g An+1 is then an injection of An+1 into An. However this contradicts the proven fact that An+1 has greater cardinality than An. Hence it has to be that no such injection g exists, which shows that A has greater cardinality than An. Since n was arbitrary, this shows the desired result. □

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