Scribd
Upload
155 views

Cardinality: Countable and Uncountable Sets

This document provides an overview of cardinality, countable, and uncountable sets. It defines key terms like bijection, cardinality, countable, uncountable, and finite sets. It also summarizes two famous theorems - that the rational numbers are countable using a "zigzag" method, and that the real numbers are uncountable using Cantor's diagonalization method. Finally, it outlines some general results about countable and uncountable sets, like subsets of countable sets being countable and unions of countable sets being countable.

Uploaded by

Hermann Dejero Lozano
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
155 views

Cardinality: Countable and Uncountable Sets

This document provides an overview of cardinality, countable, and uncountable sets. It defines key terms like bijection, cardinality, countable, uncountable, and finite sets. It also summarizes two famous theorems - that the rational numbers are countable using a "zigzag" method, and that the real numbers are uncountable using Cantor's diagonalization method. Finally, it outlines some general results about countable and uncountable sets, like subsets of countable sets being countable and unions of countable sets being countable.

Uploaded by

Hermann Dejero Lozano
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Math 347 Cardinality, Countable and Uncountable Sets A.J.

Hildebrand

Cardinality: Countable and Uncountable Sets


• Tool: Bijections.
– Bijection from of a set S: Let A and B be sets. A bijection from A to B is a function f : A → B that is both
injective and surjective.
– Some properties of bijections:
∗ Inverse functions: The inverse function of a bijection is a bijection.
∗ Compositions: The composition of bijections is a bijection.
• Definitions.

– Cardinality: Two sets A and B are said to have the same cardinality if there exists a bijection from A to B.
– Finite and infinite sets: A set is called finite if it is empty or has the same cardinality as the set {1, 2, . . . , n}
for some n ∈ N; it is called infinite otherwise.
– Countable sets:1 A set is called countable (or countably infinite) if it has the same cardinality as N.
Equivalently, a set A is countable if it can be enumerated in a sequence, i.e., if all of its elements can be listed
as a sequence a1 , a2 , . . . .A set is called uncountable if it is infinite and not countable.

• Two famous results with memorable proofs.


The following are key results in set theory, and their proofs are among the most famous and memorable in all of
mathematics. You should know both the results and the proofs.

– The rational numbers are countable.


Proof idea: “Zigzag method”. Arrange the rationals in matrix and enumerate by traversing the matrix in zigzag
fashion. (See text, p. 90).
– The real numbers are uncountable. Similarly, any interval [a, b] with a < b is uncountable.
Proof idea: “Cantor’s diagonalization method”. Assuming the reals are countable, the decimal expansions of all
real numbers in [0, 1) can be put in a matrix with countably many rows and columns. Use the digits in the diagonal
to construct a real number in [0, 1) not accounted for, thus obtaining a contradiction. (See text, p. 266.)

• Some general results on countable and uncountable sets.

– An infinite subset of a countable set is countable; a superset of an uncountable set is uncountable.


Proof idea: For the first statement, assume A is a countable set and B ⊆ A an infinite subset of A. Enumerate A
as a sequence a1 , a2 , . . . . The subsequence consisting of those elements that belong to B then is an enumeration
of B. The second statement follows by contraposition. (A “superset” is the opposite of the subset relation, i.e., B
is a superset of A if A ⊆ B).
– A finite or countable union of countable sets countable. In other words, if A1 , A2 , . . . , Ak are each
countable, then so is A1 ∪ A2 ∪ . . . Ak , and the same holds for unions of countably many countable sets: If
A1 , A2 , A3 , . . . are each countable, then so is the union A1 ∪ A2 ∪ Ac ∪ · · · .
Proof idea: For two countable sets A and B, enumerate the sets as A = {a1 , a2 , a3 , . . . } and B = {b1 , b2 , b3 , . . . },
and “interlace” these enumerations to get an enumeration of the union: A ∪ B = {a1 , b1 , a2 , b2 , a3 , b3 , . . . }. The
same method works for unions of finitely many countable sets A1 , . . . , Ak .
For unions of countably many sets A1 , A2 , A3 , . . . , use the “zigzag” trick: Enumerate each Ai as {ai1 , ai2 , . . . },
arrange these elements in an infinite matrix and traverse this matrix in “zigzag” fashion to get an enumeration of
all elements aij , i ∈ N, j ∈ N.
– The cartesian product of finitely many countable sets is countable. In other words, if A1 , . . . , Ak are
countable, then so is A1 × · · · × Ak .
Proof idea: For the case of two countable sets A and B, enumerate these sets as A = {a1 , a2 , . . . } and B =
{b1 , b2 , . . . }, arrange the elements (ai , bj ) of A × B in an infinite matrix and use a “zigzag” argument to traverse
this matrix and obtain an enumeration of all matrix elements. To extend this result to the product of k countable
sets A1 × · · · × Ak , use induction on k.
Remark: While unions of countably many countable sets are countable, cartesian products involving countably
many countable (or even finite) “factors” need not be countable.

1 Some texts (e.g., Rosen’s “Discrete Mathematics”) use the term “countable” in the sense of “finite or countably infinite”. We use here the

convention of the D’Angelo/West text where the term “countable” is reserved for infinite sets.

You might also like