150 likes | 241 Views
Cantor's Diagonal Method. To prove that the power set of N has a higher cardinal number than N we must show that it is not possible to establish a one to one correspondence between the two:. Imagine that all subsets of N are listed below:.
E N D
To prove that the power set of N has a higher cardinal number than N we must show that it is not possible to establish a one to one correspondence between the two: Imagine that all subsets of N are listed below:
To prove that the power set of N has a higher cardinal number than N we must show that it is not possible to establish a one to one correspondence between the two: Now number them:
The infinitely many natural numbers are listed here: x is under a member o is under a nonmember
Suppose we have a numbered list of sets of natural numbers Draw a diagonal
The green set is different from set 1because the first element is different
The green set is different from set 2because the second element is different
The green set is different from set 3because the third element is different
The green set is different from set 4because the fourth element is different
For every k , the k th element in the green set differs from the k th element in the set numbered k. It is impossible to count the power set of the set of natural numbers!
No matter how you try to line up the subsets on the right to count them, you can use this method to produce a set (like the green one) that is not on the list!