Denumerable Sets

Definition
A set S is denumerable if S can be put into one-to-one
correspondence with the positive integers; that is, if S has the
same cardinality as N.

PhD Math Ed.

Denumerable Sets

Definition
A set S is denumerable if S can be put into one-to-one
correspondence with the positive integers; that is, if S has the
same cardinality as N. A set S is countable if S is either finite or
denumerable. Otherwise, it is uncountable.

PhD Math Ed.

Denumerable Sets

Definition
A set S is denumerable if S can be put into one-to-one
correspondence with the positive integers; that is, if S has the
same cardinality as N. A set S is countable if S is either finite or
denumerable. Otherwise, it is uncountable.

The following sets are denumerable: N,

PhD Math Ed.

Denumerable Sets

Definition
A set S is denumerable if S can be put into one-to-one
correspondence with the positive integers; that is, if S has the
same cardinality as N. A set S is countable if S is either finite or
denumerable. Otherwise, it is uncountable.

The following sets are denumerable: N, 3N,

PhD Math Ed.

Denumerable Sets

Definition
A set S is denumerable if S can be put into one-to-one
correspondence with the positive integers; that is, if S has the
same cardinality as N. A set S is countable if S is either finite or
denumerable. Otherwise, it is uncountable.

The following sets are denumerable: N, 3N, Q,

PhD Math Ed.

Denumerable Sets

Definition
A set S is denumerable if S can be put into one-to-one
correspondence with the positive integers; that is, if S has the
same cardinality as N. A set S is countable if S is either finite or
denumerable. Otherwise, it is uncountable.
√
The following sets are denumerable: N, 3N, Q, Q ∪ π, 2,

PhD Math Ed.

Denumerable Sets

Definition
A set S is denumerable if S can be put into one-to-one
correspondence with the positive integers; that is, if S has the
same cardinality as N. A set S is countable if S is either finite or
denumerable. Otherwise, it is uncountable.
√
The following sets are denumerable: N, 3N, Q, Q ∪ π, 2,
N \ {2, 4, 6},

PhD Math Ed.

Denumerable Sets

Definition
A set S is denumerable if S can be put into one-to-one
correspondence with the positive integers; that is, if S has the
same cardinality as N. A set S is countable if S is either finite or
denumerable. Otherwise, it is uncountable.
√
The following sets are denumerable: N, 3N, Q, Q ∪ π, 2,
N \ {2, 4, 6}, 2N ∪ 7N.

PhD Math Ed.

Another Surprise!

Theorem
R is uncountable.
Exercise: Draw a Venn diagram to represent finite, countable, and
denumerable sets.

PhD Math Ed.

Exercises

Let A and B be sets such that A ⊆ B.

True or false. If true, explain why. If false, give a counterexample.

1 If A is finite, then B is countable.
2 If B is finite, then A is countable.
3 If A is denumerable, then B is denumerable.
4 If B is denumerable, then A is denumerable.
5 If A is countable, then it is denumerable.
6 If A is denumerable, then it is countable.

PhD Math Ed.

Back to Galileo...

From infinitely many segments drawn from the center of the circle,
there are larger gaps seen on the larger circle.

PhD Math Ed.

Back to Galileo...

From infinitely many segments drawn from the center of the circle,
there are larger gaps seen on the larger circle. That does not make
any sense... if there are infinitely many segments, there should be
enough to cover the gaps.

PhD Math Ed.

Theorems

Theorem
Every subset of N is countable.

For example, the following subsets of N are countable.

1 {1, 2, 3, 4, 5}
2 2N
3 the set of prime numbers

PhD Math Ed.

The Proof

PhD Math Ed.

The Proof

PhD Math Ed.

Idea Behind The Proof

Let T be any subset of N.

PhD Math Ed.

Idea Behind The Proof

Let T be any subset of N.

If T is finite, we’re done.

PhD Math Ed.

Idea Behind The Proof

Let T be any subset of N.

If T is finite, we’re done.
If T is infinite, list its elements in increasing order. Explain why
the list contains no repetitions,

PhD Math Ed.

Idea Behind The Proof

Let T be any subset of N.

If T is finite, we’re done.
If T is infinite, list its elements in increasing order. Explain why
the list contains no repetitions, and that the list goes on forever.

PhD Math Ed.

Idea Behind The Proof

Let T be any subset of N.

If T is finite, we’re done.
If T is infinite, list its elements in increasing order. Explain why
the list contains no repetitions, and that the list goes on forever.
Perform this idea if T = {n ∈ N : n is a prime number}.

PhD Math Ed.

Oral Recitation

√ √
1 Revise the proof that 2 is irrational to show that 3 is
irrational.
√ √
2 Revise the proof that 2 is irrational to show that p is
irrational for any prime p.
√
3 Revise
√ the proof that 2 is irrational to attempt to show that
4 is irrational. Where does the reasoning break down?
√ √
4 Prove that 2 + 3 is irrational.

PhD Math Ed.

Exercises

PhD Math Ed.

Oral Recitation

Note: For the following, you may assume that Z is closed under
addition and multiplication.
True or false? If true, prove it. If false, give a counterexample.
1 If p and q are rational, then pq is rational.
2 If p and q are rational, then p + q is rational.
3 If p and q are irrational, then p + q is irrational.
4 If p and q are irrational, then pq is irrational.
5 If p is rational and q is irrational, then pq is irrational.
6 If p is rational and q is irrational, then pq is rational.
7 9.2473 is rational.

PhD Math Ed.

Exercises

In each case below, a < b.

1 Given a, b ∈ Q, construct a rational q satisfies a < q < b.
2 Given a, b ∈ Qc , construct a rational q satisfies a < q < b.
3 Given a, b ∈ Q, construct an irrational s satisfies a < s < b.
4 Given a ∈ Q and b ∈ Qc , construct a rational s satisfies
a < s < b.
5 Given a ∈ Q and b ∈ Qc , construct an irrational s satisfies
a < s < b.

PhD Math Ed.