Skip to main content
Engineering LibreTexts

4.6.C Uncountable sets

  • Page ID
    10905
  • On the other hand, R is uncountable. It is not possible to make an infinite list that con- tains every real number. It is not even possible to make a list that contains every real number between zero and one. Another way of saying this is that every infinite list of real numbers between zero and one, no matter how it is constructed, leaves something out. To see why this is true, imagine such a list, displayed in an infinitely long column. Each row contains one number, which has an infinite number of digits after the decimal point. Since it is a number between zero and one, the only digit before the decimal point is zero. For example, the list might look like this:

    0.90398937249879561297927654857945...

    0.12349342094059875980239230834549...

    0.22400043298436234709323279989579...

    0.50000000000000000000000000000000...

    0.77743449234234876990120909480009...

    0.77755555588888889498888980000111...

    0.12345678888888888888888800000000...

    0.34835440009848712712123940320577...

    0.93473244447900498340999990948900...

    ...

    This is only (a small part of) one possible list. How can we be certain that every such list leaves out some real number between zero and one? The trick is to look at the digits shown in bold face. We can use these digits to build a number that is not in the list. Since the first number in the list has a 9 in the first position after the decimal point, we know that this number cannot equal any number of, for example, the form 0.4.... Since the second number has a 2 in the second position after the decimal point, neither of the first two numbers in the list is equal to any number that begins with 0.44.... Since the third number has a 4 in the third position after the decimal point, none of the first three numbers in the list is equal to any number that begins 0.445.... We can continue to construct a number in this way, and we end up with a number that is different from every number in the list. The \(n^{\text { th }}\) digit of the number we are building must differ from the \(n^{t h}\)digit of the \(n^{\text { th }}\) number in the list. These are the digits shown in bold face in the above 

    list. To be definite, I use a 5 when the corresponding boldface number is 4, and otherwise I use a 4. For the list shown above, this gives a number that begins 0.44544445.... The number constructed in this way is not in the given list, so the list is incomplete. The same construction clearly works for any list of real numbers between zero and one. No such list can be a complete listing of the real numbers between zero and one, and so there can be no complete listing of all real numbers. We conclude that the set R is uncountable.

    The technique used in this argument is called diagonalization. It is named after the fact that the bold face digits in the above list lie along a diagonal line.

    Proofs by diagonalisation are not a part of Reasoning & Logic. You should be able to prove a set is countably infinite (by finding a bijection from N to the set), but you will not be asked to prove a set is uncountable. We leave that for the course Automata, Languages, and Computability later in your curriculum.

    This proof was discovered by a mathematician named Georg Cantor, who caused quite a fuss in the nineteenth century when he came up with the idea that there are different kinds of infinity. Since then, his notion of using one-to-one correspondence to define the cardinalities of infinite sets has been accepted. Mathematicians now consider it almost intuitive that N, Z, and Q have the same cardinality while R has a strictly larger cardinality.

    To say that Georg Cantor (1845–1918) caused a fuss in mathematics is the least you can say. Cantor’s theory of transfinite numbers was originally regarded as so counter-intuitive—even shocking—that it encountered resistance from mathematical contemporaries. Like Frege, Cantor was a German mathematician contributing to logic and set theory. Like Peirce, Cantor’s ideas did not find acceptance until later in his life. In 1904, the Royal Society awarded Cantor its Sylvester Medal, the highest honour it can confer for work in mathematics.

    屏幕快照 2019-07-27 上午1.43.12.png

    Source: en.wikipedia.org/wiki/Georg_Cantor.

     

    Theorem 4.9. 

    Suppose that is an uncountable set, and that is a countable subset of X. Then the set ∖ is uncountable.

    Proof. Let be an uncountable set. Let ⊆ X, and suppose that is countable. LetL ∖ K. We want to show that is uncountable. Suppose that is countable. We will show that this assumption leads to a contradiction. 

    Note that ∪ (∖ K) = ∪ L. You will show in Exercise 11 of this section that the union of two countable sets is countable. Since is the union of the countable sets Kand L, it follows that is countable. But this contradicts the fact that is uncountable. This contradiction proves the theorem.

    In the proof, both and ¬are shown to follow from the assumptions, where is the statement “is countable”. The statement is shown to follow from the assumption that ∖ is countable. The statement ¬is true by assumption. Since and ¬cannot both be true, at least one of the assumptions must be false. The only assumption that can be false is the assumption that ∖ is countable.

    This theorem, by the way, has the following easy corollary. (A corollary is a theorem that follows easily from another, previously proved theorem.)

    Corollary 4.10. 

    The set of irrational real numbers is uncountable.

     Proof. Let be the set of irrational real numbers. By definition, = R ∖ Q. We have already shown that R is uncountable and that Q is countable, so the result follows immediately from the previous theorem.

    You might still think that R is as big as things get, that is, that any infinite set is in one-to-one correspondence with R or with some subset of R. In fact, though, if is any set then it’s possible to find a set that has strictly larger cardinality than X. In fact,P(X) is such a set. A variation of the diagonalization technique can be used to show that there is no one-to-one correspondence between and P(X). Note that this is obvious for finite sets, since for a finite set \(X,|\mathcal{P}(X)|=2^{|X|},\) which is larger than \(|X| .\) The point of the theorem is that it is true even for infinite sets.

    Theorem 4.11. 

    Let be any set. Then there is no one-to-one correspondence between and P(X).

    Proof. Given an arbitrary function → P(X), we can show that is not onto. Since a one-to-one correspondence is both one-to-one and onto, this shows that is not a one- to-one correspondence. 

    Recall that P(X) is the set of subsets of X. So, for each ∈ Xf(x) is a subset of X. We have to show that no matter how is defined, there is some subset of that is not in the image of f.

    Given \(f,\) we define \(A\) to be the set \(A=\{x \in X | x \notin f(x)\} .\) The test \(^{\prime} x \notin f(x)^{\prime \prime}\) makes sense because (x) is a set. Since ⊆ X, we have that ∈ P(X). However, A is not in the image of \(f .\) That is, for every \(y \in X, A \neq f(y) .^{7}\) To see why this is true, let \(y\) be any element of \(X .\) There are two cases to consider. Either \(y \in f(y)\) or \(y \notin f(y)\). We show that whichever case holds, \(A \neq f(y) .\) If it is true that \(y \in f(y),\) then by the definition of \(A, y \notin A .\) since \(y \in f(y)\) but \(y \notin A, f(y)\) and \(A\) do not have the same elements and therefore are not equal. On the other hand, suppose that \(y \notin f(y) .\) Again, by the definition of \(A,\) this implies that \(y \in A .\) since \(y \notin f(y)\) but \(y \in A, f(y)\) and \(A\) do not have the same elements and therefore are not equal. In either case, \(A \neq f(y) .\) Since this is true for any ∈ X, we conclude that is not in the image of and therefore is not a one-to-one correspondence.

    From this theorem, it follows that there is no one-to-one correspondence between R and P(R). The cardinality of P(R) is strictly bigger than the cardinality of R. But it doesn’t stop there. P(P(R)) has an even bigger cardinality, and the cardinality ofP(P(P(R))) is bigger still. We could go on like this forever, and we still won’t have exhausted all the possible cardinalities. If we let X be the infinite union R ∪ P(R) ∪P(P(R)) ∪ · · · , then X has larger cardinality than any of the sets in the union. And then there’s P(X), P(P(X)), X ∪ P(X) ∪ P(P(X)) ∪ · · · . There is no end to this. There is no upper limit on possible cardinalities, not even an infinite one! We have counted past infinity.