Worksheet for Teaching Module

Countability (Lesson 8)

Topic: Cantors Theorem

Introduction

So far all the sets we have considered are either equipotent to a finite set, ` or \ . It is a natural
question to ask whether there are sets whose cardinality is greater than that of \ . Let us try: what
set do you think would be larger than \ ?

Part 1 (The Cardinality of \ 2 )

1.

Design a machine, so that whenever I input two positive integers into your machine, it outputs
another positive integer, from which you can tell the two positive integers which I input. (Of
course, you should assume that the output of your machine is the only way from which you
can get information about the numbers which I input. And remember you are the designer of
the machine, so you know how it works.) You should state an algorithm of how your machine
is going to work. (Try not use the diagonal trick here.)
____________________________________________________________________________
____________________________________________________________________________

2.

Repeat Question 1, but this time the machine should take two positive real numbers and output
a positive real number. In other words, you should design a machine so that whenever I input
two positive real numbers into your machine, it outputs another positive real number from
which you can tell the two positive integers which I input. (Hint: Every real number has a
decimal representation.)
____________________________________________________________________________
____________________________________________________________________________

3.

Can you modify your machine so that it takes two real numbers (positive or not) and outputs
one real number? That is, this time you should design a machine so that it takes two real
numbers and output one real number, from which you can tell the two input real numbers
(positive or not).
1

____________________________________________________________________________
____________________________________________________________________________

4.

Can you make direct use of Question 3 to write down a one-to-one correspondence between
\ 2 and \ ? Why? (Hint: one real number may have two different decimal representations,
like 1.000000 = 0.999999)
____________________________________________________________________________
____________________________________________________________________________

A decimal representation is said to be canonical if it does not end with infinitely many 9s. It is
known that every real number has a unique canonical decimal representation. This provides a way
to overcome the difficulty we met in Question 4.

5.

Can you use the above fact to construct a one-to-one correspondence between \ 2 and a subset
of \ ?
____________________________________________________________________________
____________________________________________________________________________

6.

So we now see that \ \ 2 . Indeed \ 2 \ . Why?

____________________________________________________________________________

7.

What about \ 3 ? \ n ? Are their sizes greater than that of \ ? Why?

____________________________________________________________________________
____________________________________________________________________________

Part 2 (Cantors Theorem)

So it seems that the usual constructions do not work. Is there a better way to construct yet another
larger set from a given set? Here is one.

Definition.
The power set of a set A is defined to be the set of all subsets of A. It is usually denoted by ( A) .
2

For example: if A = {1, 2}, then ( A) = { , {1}, {2} {1, 2}}.

8.

Write down the power set of {1, 2, 3}.

____________________________________________________________________________

9.

What is the number of elements of the power set of A in each of the above cases?
____________________________________________________________________________

10. If the number of elements of a set A is equal to n, what do you think is the number of elements
of ( A) ? Can you prove this?
____________________________________________________________________________
____________________________________________________________________________

So for every finite set A, the power set of A is finite, and card( A) > card A. What if A is infinite?
Let us first try the power set of ` .

11. Recall the diagonal trick for uncountability. Can you use it to prove that the set of all
sequences in 0 or 1 is uncountable?

12. The trick is that the power set of ` is equipotent to the set of all sequences in 0 or 1 by a
natural one-to-one correspondence. Can you write down this one-to-one correspondence?
____________________________________________________________________________
____________________________________________________________________________

13. Suppose A1 , A2 , A3 , ... are subsets of ` . Can you find a subset of ` which is not among
A1 , A2 , A3 ,... ? (Hint: Interpret your proof in Question 11 with the help of Question 12!)
____________________________________________________________________________
3

____________________________________________________________________________

14. Is there any one-to-one correspondence between ` and (`) ? Why?

____________________________________________________________________________
____________________________________________________________________________

15. Does the above argument generalize to the case where ` is replaced by a general set A? How?
____________________________________________________________________________
____________________________________________________________________________
____________________________________________________________________________

So we have reached the celebrated Cantors Theorem.

Theorem (Cantor).
( A) > A for any set A.

16. Can you now name a set whose cardinality is greater than that of \ ?
____________________________________________________________________________

17. Is there a set whose cardinality is greater than or equal to any set? Why?
____________________________________________________________________________

Summary

\ 2 , \ 3 ,... are all equipotent to \ . To find a set whose cardinality strictly exceeds 1 , one needs to
go to the power set of \ . In fact Cantors theorem states that ( A) > A for any set A. Hence there
is no set of greatest cardinality.

~ End of worksheet ~