You are on page 1of 132

Seatwork: Always, Sometimes, Never

Fill in the blanks with ALWAYS, SOMETIMES, or NEVER.


Let S be a set, and let T be a subset of S.
1 If S is countable, then S is denumerable.
2 If S is denumerable, then S is countable.
3 If S if finite, then S is denumerable.
4 If S if denumerable, then S is infinite.
5 If S is countable, then T is countable.
6 If T is countable, then S is countable.
7 If S is uncountable, then T is
denumerable.
8 If T is uncountable, then S is
denumerable.
9 If S is finite, then T is countable.
10 If T is countable, then S is finite.
PhD Math Ed.
Seatwork: Always, Sometimes, Never

Fill in the blanks with ALWAYS, SOMETIMES, or NEVER.


Let S be a set, and let T be a subset of S.
1 If S is countable, then S is sometimes denumerable.
2 If S is denumerable, then S is always countable.
3 If S if finite, then S is never denumerable.
4 If S if denumerable, then S is always infinite.
5 If S is countable, then T is always countable.
6 If T is countable, then S is sometimes countable.
7 If S is uncountable, then T is sometimes denumerable.
8 If T is uncountable, then S is never denumerable.
9 If S is finite, then T is always countable.
10 If T is countable, then S is sometimes finite.

PhD Math Ed.


Seatwork: Always, Sometimes, Never

Fill in the blanks with ALWAYS, SOMETIMES, or NEVER.


Let A and B be denumerable sets.
1 Then A ∩ B is denumerable.
2 Then A ∪ B is denumerable.
Let A and B be countable sets.
1 Then A ∩ B is countable.
2 Then A ∪ B is countable.

PhD Math Ed.


Seatwork: Always, Sometimes, Never

Fill in the blanks with ALWAYS, SOMETIMES, or NEVER.


Let A and B be denumerable sets.
1 Then A ∩ B is sometimes denumerable.
2 Then A ∪ B is always denumerable.
Let A and B be countable sets.
1 Then A ∩ B is always countable.
2 Then A ∪ B is always countable.

PhD Math Ed.


Georg Cantor

“I see it, but I don’t believe it.”

PhD Math Ed.


Georg Cantor
Georg Cantor proved very astonishing results and was one of the
original thinkers of his time, and yet he failed to get a university
position.

PhD Math Ed.


Georg Cantor
Georg Cantor proved very astonishing results and was one of the
original thinkers of his time, and yet he failed to get a university
position.
His adversary: Leopold Kronecker who said, “God made the
integers, and all the rest is the work of man.”

PhD Math Ed.


Georg Cantor
Georg Cantor proved very astonishing results and was one of the
original thinkers of his time, and yet he failed to get a university
position.
His adversary: Leopold Kronecker who said, “God made the
integers, and all the rest is the work of man.”
Cantor suffered several nervous breakdowns, and eventually died in
a mental institution in 1918.

PhD Math Ed.


Georg Cantor
Georg Cantor proved very astonishing results and was one of the
original thinkers of his time, and yet he failed to get a university
position.
His adversary: Leopold Kronecker who said, “God made the
integers, and all the rest is the work of man.”
Cantor suffered several nervous breakdowns, and eventually died in
a mental institution in 1918.
Sadly, it was only after his death when his contributions were
recognized.

PhD Math Ed.


Georg Cantor
Georg Cantor proved very astonishing results and was one of the
original thinkers of his time, and yet he failed to get a university
position.
His adversary: Leopold Kronecker who said, “God made the
integers, and all the rest is the work of man.”
Cantor suffered several nervous breakdowns, and eventually died in
a mental institution in 1918.
Sadly, it was only after his death when his contributions were
recognized.
David Hilbert described Cantor’s transfinite arithmetic as “the
most astonishing product of mathematical thought, one of the
most beautiful realizations of human activity in the domain of the
purely intelligible.”

PhD Math Ed.


Georg Cantor
Georg Cantor proved very astonishing results and was one of the
original thinkers of his time, and yet he failed to get a university
position.
His adversary: Leopold Kronecker who said, “God made the
integers, and all the rest is the work of man.”
Cantor suffered several nervous breakdowns, and eventually died in
a mental institution in 1918.
Sadly, it was only after his death when his contributions were
recognized.
David Hilbert described Cantor’s transfinite arithmetic as “the
most astonishing product of mathematical thought, one of the
most beautiful realizations of human activity in the domain of the
purely intelligible.”
“No one shall expel us from the paradise which Cantor has created
for us.”
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.


Galileo

“We just can’t understand the


infinite. Maybe God can. But
with our finite minds, we can-
not.”

PhD Math Ed.


Galileo

“We just can’t understand the


infinite. Maybe God can. But
with our finite minds, we can-
not.”
“Let us use the concept if we
must, but let’s not try to un-
derstand it.”

PhD Math Ed.


Denumerable Sets

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. 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. A set S is countable if
S is either finite or denumerable. Otherwise, it is uncountable.

Theorem
The following sets are denumerable: the set of even numbers,
N \ {1}, Z, and 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. A set S is countable if
S is either finite or denumerable. Otherwise, it is uncountable.

Theorem
The following sets are denumerable: the set of even numbers,
N \ {1}, Z, and Q.

Theorem
R is uncountable.

PhD Math Ed.


Georg Cantor’s Astonishing Discovery

There are two sizes of infinity! Is this even possible?

PhD Math Ed.


Georg Cantor

Galileo said, our finite minds cannot grasp infinity, but Cantor
sought to understand it.

PhD Math Ed.


Georg Cantor

Galileo said, our finite minds cannot grasp infinity, but Cantor
sought to understand it.
If we could do 1 + 1, he thought of ∞ + ∞. He literally saw things
no one has thought of before.

PhD Math Ed.


Georg Cantor

Galileo said, our finite minds cannot grasp infinity, but Cantor
sought to understand it.
If we could do 1 + 1, he thought of ∞ + ∞. He literally saw things
no one has thought of before. He was breaking new ground.

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.

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.
Show that 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.
Show that the list contains no repetitions, and show 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.
Show that the list contains no repetitions, and show that the list
goes on forever.
Perform this idea if T = {n ∈ N : n is a prime number}.

PhD Math Ed.


Theorems

Theorem
Every subset of N is countable.

Question: Can we replace the word “countable” in the previous


theorem with “denumerable”?

PhD Math Ed.


Theorems

Theorem
Every subset of N is countable.

Question: Can we replace the word “countable” in the previous


theorem with “denumerable”?

Corollary
Every subset of a countable set is countable.

PhD Math Ed.


Theorems

Theorem
Every subset of N is countable.

Question: Can we replace the word “countable” in the previous


theorem with “denumerable”?

Corollary
Every subset of a countable set is countable.

Corollary
Every subset of a denumerable set is denumerable.

PhD Math Ed.


Theorems

Theorem
Suppose that A and B are countable. Then A ∪ B is countable.

Theorem
Suppose that A and B are denumerable. Then A ∪ B is
denumerable.
State the contrapositive of the these theorems. The contrapositive
version can help in proofs later on.

PhD Math Ed.


Two sizes of inifinity

One size of infinity is N. We have already shown that several other


sets have the same size or cardinality as N. These are the
denumerable sets.

PhD Math Ed.


Two sizes of inifinity

One size of infinity is N. We have already shown that several other


sets have the same size or cardinality as N. These are the
denumerable sets.
Now, what other sets have the same size as R?

PhD Math Ed.


Two sizes of inifinity

One size of infinity is N. We have already shown that several other


sets have the same size or cardinality as N. These are the
denumerable sets.
Now, what other sets have the same size as R?
Remarkably, one such set is (0, 1).

Think of a one-to-one correspondence between these two sets.

PhD Math Ed.


A simpler problem
Think of a one-to-one correspondence between these two sets.

PhD Math Ed.


A simpler problem
Think of a one-to-one correspondence between these two sets.

Is this even possible?

PhD Math Ed.


Solution

PhD Math Ed.


What about R?

PhD Math Ed.


What about R?

PhD Math Ed.


The Solid Square

Do these two sets have the same cardinality?

PhD Math Ed.


The Solid Square

Do these two sets have the same cardinality?

PhD Math Ed.


The Solid Square

To make our naming of points unambiguous, use the decimal


representation ending in all 0s rather than in 9s whenever
applicable.
For example, use 0.500000 . . . instead of 0.499999 . . ..

PhD Math Ed.


The Solid Square

To make our naming of points unambiguous, use the decimal


representation ending in all 0s rather than in 9s whenever
applicable.
For example, use 0.500000 . . . instead of 0.499999 . . ..
Let (x, y ) = (0.1407394458 . . . , 0.2338007016 . . .) be a point on
the square. To which point on the segment [0, 1] can we map it to?
Let t = 0.521170941654 . . . be a point on the number line. To
which point on the square can we map it to?

PhD Math Ed.


The Solid Square

To make our naming of points unambiguous, use the decimal


representation ending in all 0s rather than in 9s whenever
applicable.
For example, use 0.500000 . . . instead of 0.499999 . . ..
Let (x, y ) = (0.1407394458 . . . , 0.2338007016 . . .) be a point on
the square. To which point on the segment [0, 1] can we map it to?
Let t = 0.521170941654 . . . be a point on the number line. To
which point on the square can we map it to?
One strategy: Consider alternating digits.
(0.1407394458 . . . , 0.2338007016 . . .) →
0.12430378309047405186 . . .
t = 0.521170941654 . . . → (0.517915 . . . , 0.210464 . . .)

PhD Math Ed.


The Solid Square

To make our naming of points unambiguous, use the decimal


representation ending in all 0s rather than in 9s whenever
applicable.
For example, use 0.500000 . . . instead of 0.499999 . . ..
Let (x, y ) = (0.1407394458 . . . , 0.2338007016 . . .) be a point on
the square. To which point on the segment [0, 1] can we map it to?
Let t = 0.521170941654 . . . be a point on the number line. To
which point on the square can we map it to?
One strategy: Consider alternating digits.
(0.1407394458 . . . , 0.2338007016 . . .) →
0.12430378309047405186 . . .
t = 0.521170941654 . . . → (0.517915 . . . , 0.210464 . . .)
Does this strategy work? Try for other points.
PhD Math Ed.
The Solid Square

To which point on the number line will we map the number

t = 0.512903929795999491959 . . .?

PhD Math Ed.


The Solid Square

To which point on the number line will we map the number

t = 0.512903929795999491959 . . .?

Alternate digits:

t = 512903929795999491959 . . .

PhD Math Ed.


The Solid Square

To which point on the number line will we map the number

t = 0.512903929795999491959 . . .?

Alternate digits:

t = 512903929795999491959 . . .

Answer:
(x, y ) = (0.52099999999 . . . , 0.1932759415 . . .)

PhD Math Ed.


The Solid Square

To which point on the number line will we map the number

t = 0.512903929795999491959 . . .?

Alternate digits:

t = 512903929795999491959 . . .

Answer:
(x, y ) = (0.52099999999 . . . , 0.1932759415 . . .)
There’s a problem! At the start, we decided to use the decimal
representation 0.5210000000 instead of 0.52099999999. We have
to revise our rule.
PhD Math Ed.
A Solution
If a 9 appears, group it with the next digit so that no group
consists entirely of 9s.

PhD Math Ed.


A Solution
If a 9 appears, group it with the next digit so that no group
consists entirely of 9s.
Thus, for
t = 0.51290392979599949195 . . . ,

the grouping is

t = 0.51290392979599949195 . . . ,

PhD Math Ed.


A Solution
If a 9 appears, group it with the next digit so that no group
consists entirely of 9s.
Thus, for
t = 0.51290392979599949195 . . . ,

the grouping is

t = 0.51290392979599949195 . . . ,

which gives

(x, y ) = (0.52397999495 . . . , 0.190929591 . . .)


and the problem is solved.
PhD Math Ed.
Some Strange Results We’ve Seen

PhD Math Ed.


Some Strange Results We’ve Seen

1 There are so many rational numbers, but the cardinality of Q


is equal to the cardinality of N.

PhD Math Ed.


Some Strange Results We’ve Seen

1 There are so many rational numbers, but the cardinality of Q


is equal to the cardinality of N.
2 The cardinality of (0, 1) is larger than the cardinality of N.

PhD Math Ed.


Some Strange Results We’ve Seen

1 There are so many rational numbers, but the cardinality of Q


is equal to the cardinality of N.
2 The cardinality of (0, 1) is larger than the cardinality of N.
3 The cardinality of (0, 1) is the same as the cardinality of the
unit square.

PhD Math Ed.


Some Strange Results We’ve Seen

1 There are so many rational numbers, but the cardinality of Q


is equal to the cardinality of N.
2 The cardinality of (0, 1) is larger than the cardinality of N.
3 The cardinality of (0, 1) is the same as the cardinality of the
unit square.
4 If you randomly pick a number from the number line, the
probability that you will pick a rational number is 0.

PhD Math Ed.


Some Strange Results We’ve Seen

1 There are so many rational numbers, but the cardinality of Q


is equal to the cardinality of N.
2 The cardinality of (0, 1) is larger than the cardinality of N.
3 The cardinality of (0, 1) is the same as the cardinality of the
unit square.
4 If you randomly pick a number from the number line, the
probability that you will pick a rational number is 0.

PhD Math Ed.


Georg Cantor

“I see it, but I don’t believe it.”

PhD Math Ed.


Introduction to Exercises

Definition
√ number is a number of the form a + bi where a, b ∈ R
A complex
and i = −1.

Definition
A complex number is said to be algebraic if it is a root of some
polynomial equation

f (x) = an x n + an−1 x n−1 + · · · + a1 x + a0 = 0,

where an 6= 0 and all the ai ’s are integers. A complex number


which is not algebraic is said to be transcendental.

PhD Math Ed.


Introduction to Exercises
Theorem
The set of all algebraic numbers is denumerable.

PhD Math Ed.


Introduction to Exercises
Theorem
The set of all algebraic numbers is denumerable.

Proof. We need to describe a systematic way of listing all algebraic


numbers.

PhD Math Ed.


Introduction to Exercises
Theorem
The set of all algebraic numbers is denumerable.

Proof. We need to describe a systematic way of listing all algebraic


numbers. Let us first list all solutions to polynomials where an > 0.

PhD Math Ed.


Introduction to Exercises
Theorem
The set of all algebraic numbers is denumerable.

Proof. We need to describe a systematic way of listing all algebraic


numbers. Let us first list all solutions to polynomials where an > 0.
Consider the so-called height of the polynomial, defined by

h = n + an + |an−1 | + |an−2 | + · · · + |a2 | + |a1 | + |a0 |.

PhD Math Ed.


Introduction to Exercises
Theorem
The set of all algebraic numbers is denumerable.

Proof. We need to describe a systematic way of listing all algebraic


numbers. Let us first list all solutions to polynomials where an > 0.
Consider the so-called height of the polynomial, defined by

h = n + an + |an−1 | + |an−2 | + · · · + |a2 | + |a1 | + |a0 |.

Clearly, h is an integer ≥ 1, and there are only a finite number of


polynomials of a given height,

PhD Math Ed.


Introduction to Exercises
Theorem
The set of all algebraic numbers is denumerable.

Proof. We need to describe a systematic way of listing all algebraic


numbers. Let us first list all solutions to polynomials where an > 0.
Consider the so-called height of the polynomial, defined by

h = n + an + |an−1 | + |an−2 | + · · · + |a2 | + |a1 | + |a0 |.

Clearly, h is an integer ≥ 1, and there are only a finite number of


polynomials of a given height, and therefore only a finite number
of algebraic numbers arising from polynomials of a given height h.

PhD Math Ed.


Introduction to Exercises
Theorem
The set of all algebraic numbers is denumerable.

Proof. We need to describe a systematic way of listing all algebraic


numbers. Let us first list all solutions to polynomials where an > 0.
Consider the so-called height of the polynomial, defined by

h = n + an + |an−1 | + |an−2 | + · · · + |a2 | + |a1 | + |a0 |.

Clearly, h is an integer ≥ 1, and there are only a finite number of


polynomials of a given height, and therefore only a finite number
of algebraic numbers arising from polynomials of a given height h.
So we list algebraic numbers this way. First list all solutions to
polynomials with h = 1 (there are only a finite number of these.

PhD Math Ed.


Introduction to Exercises
Theorem
The set of all algebraic numbers is denumerable.

Proof. We need to describe a systematic way of listing all algebraic


numbers. Let us first list all solutions to polynomials where an > 0.
Consider the so-called height of the polynomial, defined by

h = n + an + |an−1 | + |an−2 | + · · · + |a2 | + |a1 | + |a0 |.

Clearly, h is an integer ≥ 1, and there are only a finite number of


polynomials of a given height, and therefore only a finite number
of algebraic numbers arising from polynomials of a given height h.
So we list algebraic numbers this way. First list all solutions to
polynomials with h = 1 (there are only a finite number of these.
Then list all solutions to polynomials with h = 2. Continuing this
process lists all algebraic numbers.
PhD Math Ed.
Exercises

1 List all polynomials of height 1, height 2, height 3, and height


4.
2 List all algebraic numbers resulting from these polynomials.

3 Is 2 an algebraic number? Why or why not?

4 Prove that 3/4 and 1 ± 2 are algebraic.
5 Make a Venn diagram showing the relationship of rational
numbers, irrational numbers, algebraic numbers,
transcendental numbers, real numbers, and complex numbers.
6 Do transcendental numbers exist? Use theorems discussed
during this session to justify your answer. Hint 1: The union
of two countable sets is countable. Hint 2: The union of
algebraic and transcendental numbers is C.

PhD Math Ed.


Answer to Number 6

Let A be the set of algebraic numbers and let T be the set of


transcendental numbers. Then A ∪ T = C.
From the previous theorem, A is denumerable.
Also, R is uncountable. Since R ⊆ C, then C is also uncountable.
Thus, T must be uncountable. If T were countable, then A ∪ T
would be the union of two countable sets, which is countable. This
is a contradiction because A ∪ T = C, which is uncountable.
Because T is uncountable, it must consist of infinitely many
elements. In particular, T cannot be the empty set. Therefore,
there must exist some transcendental numbers.

PhD Math Ed.


Different Sizes of Infinity

So far, we have seen two sizes of infinity.


1 cardinality of N, or ℵ0 (read as aleph-null)
2 cardinality of R, or c (read as cardinality of the continuum)

PhD Math Ed.


Different Sizes of Infinity

So far, we have seen two sizes of infinity.


1 cardinality of N, or ℵ0 (read as aleph-null)
2 cardinality of R, or c (read as cardinality of the continuum)

Are there other sizes of infinity?

PhD Math Ed.


Different Sizes of Infinity

So far, we have seen two sizes of infinity.


1 cardinality of N, or ℵ0 (read as aleph-null)
2 cardinality of R, or c (read as cardinality of the continuum)

Are there other sizes of infinity?


To answer this question, first consider this definition:
Definition
Let S be a set. The power set of S, denoted by P(S), is the set
of all subsets of S.

PhD Math Ed.


Exercises
Let the set A be defined as A = {5, 7, {5}, {5, 7, {7}}}.1

1
Zazkis, R., & Gunn, C. (1997). Sets, subsets, and the empty set:
Students’ constructions and mathematical conventions. Journal of Computers
in Mathematics and Science Teaching, 16, 133-169.
PhD Math Ed.
Exercises
Let the set A be defined as A = {5, 7, {5}, {5, 7, {7}}}.1
Determine n(A).

1
Zazkis, R., & Gunn, C. (1997). Sets, subsets, and the empty set:
Students’ constructions and mathematical conventions. Journal of Computers
in Mathematics and Science Teaching, 16, 133-169.
PhD Math Ed.
Exercises
Let the set A be defined as A = {5, 7, {5}, {5, 7, {7}}}.1
Determine n(A).
True or False

1 5 is an element of A. 8 {7} is a subset of A.


2 7 is an element of A. 9 ∅ is a subset of A.
3 {5} is an element of A. 10 {∅} is a subset of A.
4 {7} is an element of A. 11 {{5}} is a subset of A.
5 {5, 7, {7}} is an element of A.12 {{7}} is a subset of A.
6 ∅ is an element of A. 13 {5, 7, {7}} is a subset of A.
7 {5} is a subset of A. 14 {5, 7, {5}} is a subset of A.
1
Zazkis, R., & Gunn, C. (1997). Sets, subsets, and the empty set:
Students’ constructions and mathematical conventions. Journal of Computers
in Mathematics and Science Teaching, 16, 133-169.
PhD Math Ed.
Exercises

Let the set A be defined as A = {5, 7, {5}, {5, 7, {7}}}.2

2
Zazkis, R., & Gunn, C. (1997). Sets, subsets, and the empty set:
Students’ constructions and mathematical conventions. Journal of Computers
in Mathematics and Science Teaching, 16, 133-169.
PhD Math Ed.
Exercises

Let the set A be defined as A = {5, 7, {5}, {5, 7, {7}}}.2


Determine n(A). Answer: 4
True or False

1 5 is an element of A. 8 {7} is a subset of A.


2 7 is an element of A. 9 ∅ is a subset of A.
3 {5} is an element of A. 10 {∅} is a subset of A.
4 {7} is an element of A. 11 {{5}} is a subset of A.
5 {5, 7, {7}} is an element of A.12 {{7}} is a subset of A.
6 ∅ is an element of A. 13 {5, 7, {7}} is a subset of A.
7 {5} is a subset of A. 14 {5, 7, {5}} is a subset of A.

2
Zazkis, R., & Gunn, C. (1997). Sets, subsets, and the empty set:
Students’ constructions and mathematical conventions. Journal of Computers
in Mathematics and Science Teaching, 16, 133-169.
PhD Math Ed.
Cardinality of the Power Set

Theorem
A set containing n elements has 2n subsets.

PhD Math Ed.


Power Set of S
Theorem
Let S be a set (finite or infinite). Then the cardinality of P(S) is
strictly greater than the cardinality of S.

PhD Math Ed.


Power Set of S
Theorem
Let S be a set (finite or infinite). Then the cardinality of P(S) is
strictly greater than the cardinality of S.

Proof. Clearly, S ≤ P(S) because each element s in S can


correspond to the element {s} in P(S).

PhD Math Ed.


Power Set of S
Theorem
Let S be a set (finite or infinite). Then the cardinality of P(S) is
strictly greater than the cardinality of S.

Proof. Clearly, S ≤ P(S) because each element s in S can


correspond to the element {s} in P(S).
Now suppose that there is a one-to-one correspondence between S
and P(S).

PhD Math Ed.


Power Set of S
Theorem
Let S be a set (finite or infinite). Then the cardinality of P(S) is
strictly greater than the cardinality of S.

Proof. Clearly, S ≤ P(S) because each element s in S can


correspond to the element {s} in P(S).
Now suppose that there is a one-to-one correspondence between S
and P(S). We will show that there is an element T of P(S) such
that no such element of S corresponds to T . We will construct T
as follows.

PhD Math Ed.


Power Set of S
Theorem
Let S be a set (finite or infinite). Then the cardinality of P(S) is
strictly greater than the cardinality of S.

Proof. Clearly, S ≤ P(S) because each element s in S can


correspond to the element {s} in P(S).
Now suppose that there is a one-to-one correspondence between S
and P(S). We will show that there is an element T of P(S) such
that no such element of S corresponds to T . We will construct T
as follows.
Let s1 ∈ S. Then it corresponds to some S1 in P(S). If s1 ∈ S1 ,
then let s1 ∈
/ T.

PhD Math Ed.


Power Set of S
Theorem
Let S be a set (finite or infinite). Then the cardinality of P(S) is
strictly greater than the cardinality of S.

Proof. Clearly, S ≤ P(S) because each element s in S can


correspond to the element {s} in P(S).
Now suppose that there is a one-to-one correspondence between S
and P(S). We will show that there is an element T of P(S) such
that no such element of S corresponds to T . We will construct T
as follows.
Let s1 ∈ S. Then it corresponds to some S1 in P(S). If s1 ∈ S1 ,
/ T . But if s1 ∈
then let s1 ∈ / S1 , then let s1 ∈ T .

PhD Math Ed.


Power Set of S
Theorem
Let S be a set (finite or infinite). Then the cardinality of P(S) is
strictly greater than the cardinality of S.

Proof. Clearly, S ≤ P(S) because each element s in S can


correspond to the element {s} in P(S).
Now suppose that there is a one-to-one correspondence between S
and P(S). We will show that there is an element T of P(S) such
that no such element of S corresponds to T . We will construct T
as follows.
Let s1 ∈ S. Then it corresponds to some S1 in P(S). If s1 ∈ S1 ,
/ T . But if s1 ∈
then let s1 ∈ / S1 , then let s1 ∈ T .
We were able to construct T ∈ P(S) such that no element of S
corresponds to it. Thus, there is no one-to-one correspondence
between S and P(S).
PhD Math Ed.
Power Set of S

Theorem
Let S be a set (finite or infinite). Then the cardinality of P(S) is
strictly greater than the cardinality of S.

Proof (Shorter Version).

PhD Math Ed.


Power Set of S

Theorem
Let S be a set (finite or infinite). Then the cardinality of P(S) is
strictly greater than the cardinality of S.

Proof (Shorter Version).


Consider f : S → P(S). Then {x ∈ S : x ∈
/ f (x)} ∈
/ f (S).

PhD Math Ed.


Implication

Since S < P(S), then we can build sets with larger and larger
infinities.

PhD Math Ed.


Implication

Since S < P(S), then we can build sets with larger and larger
infinities.
That is,
P(N) > N.

PhD Math Ed.


Implication

Since S < P(S), then we can build sets with larger and larger
infinities.
That is,
P(N) > N.

Further,
P(P(N)) > P(N).

PhD Math Ed.


Implication

Since S < P(S), then we can build sets with larger and larger
infinities.
That is,
P(N) > N.

Further,
P(P(N)) > P(N).

Continuing, we obtain

P(P(P(N))) > P(P(N)),

PhD Math Ed.


Implication

Since S < P(S), then we can build sets with larger and larger
infinities.
That is,
P(N) > N.

Further,
P(P(N)) > P(N).

Continuing, we obtain

P(P(P(N))) > P(P(N)),

and so on, and so forth.

PhD Math Ed.


Georg Cantor

The previous theorem is another of Cantor’s significant result: that


there are infinitely many sizes of infinity .

PhD Math Ed.


Georg Cantor

The previous theorem is another of Cantor’s significant result: that


there are infinitely many sizes of infinity .
Cantor found it really strange. How can infinity be larger than
infinity? And yet, there was logic in his proofs. Again, this pull
between what seems logically valid and his initial intuition led him
to question himself even further.

PhD Math Ed.


Georg Cantor

The previous theorem is another of Cantor’s significant result: that


there are infinitely many sizes of infinity .
Cantor found it really strange. How can infinity be larger than
infinity? And yet, there was logic in his proofs. Again, this pull
between what seems logically valid and his initial intuition led him
to question himself even further.
Such was the significance of his results —these challenged the
prevailing assumptions of his time and led many mathematicians to
silence him.

PhD Math Ed.


Georg Cantor

The fact that other mathematicians rejected his ideas could also
have strengthened his doubts.

PhD Math Ed.


Georg Cantor

The fact that other mathematicians rejected his ideas could also
have strengthened his doubts.
His papers were rejected, and he failed to get a university position
in the University of Berlin.

PhD Math Ed.


Georg Cantor

The fact that other mathematicians rejected his ideas could also
have strengthened his doubts.
His papers were rejected, and he failed to get a university position
in the University of Berlin.
The great mathematician Poincare said, “Cantor’s mathematics is
a sickness from which one day, maths would recover.”

PhD Math Ed.


Georg Cantor

The fact that other mathematicians rejected his ideas could also
have strengthened his doubts.
His papers were rejected, and he failed to get a university position
in the University of Berlin.
The great mathematician Poincare said, “Cantor’s mathematics is
a sickness from which one day, maths would recover.”
His one-time mentor Kronecker said, that Cantor was a corruptor
of youth.

PhD Math Ed.


Georg Cantor

The fact that other mathematicians rejected his ideas could also
have strengthened his doubts.
His papers were rejected, and he failed to get a university position
in the University of Berlin.
The great mathematician Poincare said, “Cantor’s mathematics is
a sickness from which one day, maths would recover.”
His one-time mentor Kronecker said, that Cantor was a corruptor
of youth.
Hermann Minkowski was the first mathematician who understood
the importance of Cantor’s work. He said that it is very regretful
that a prominent mathematician (Kronecker) led an opposition not
based on facts that spoiled Cantor’s pleasure in his scientific
investigations.

PhD Math Ed.


Detour

Shinichi Mochizuki

PhD Math Ed.


Shinichi Mochizuki3

In 2012, Mochizuki presented a 500-page proof over the


abc-conjecture. This is a gruelling problem in Number Theory
posed in 1985 and in 1988.

3
https://www.sciencealert.com/nightmarish-500-page-math-proof-even-
experts-can-t-understand-about-published-shinichi-mochizuki
PhD Math Ed.
Shinichi Mochizuki3

In 2012, Mochizuki presented a 500-page proof over the


abc-conjecture. This is a gruelling problem in Number Theory
posed in 1985 and in 1988.
The proof took him over 10 years of working in isolation.

3
https://www.sciencealert.com/nightmarish-500-page-math-proof-even-
experts-can-t-understand-about-published-shinichi-mochizuki
PhD Math Ed.
Shinichi Mochizuki3

In 2012, Mochizuki presented a 500-page proof over the


abc-conjecture. This is a gruelling problem in Number Theory
posed in 1985 and in 1988.
The proof took him over 10 years of working in isolation.
The problem? No one can understand his proof (more than 5
years after being published) so there is no confirmation of
whether the proof is right or wrong.

3
https://www.sciencealert.com/nightmarish-500-page-math-proof-even-
experts-can-t-understand-about-published-shinichi-mochizuki
PhD Math Ed.
Shinichi Mochizuki3

In 2012, Mochizuki presented a 500-page proof over the


abc-conjecture. This is a gruelling problem in Number Theory
posed in 1985 and in 1988.
The proof took him over 10 years of working in isolation.
The problem? No one can understand his proof (more than 5
years after being published) so there is no confirmation of
whether the proof is right or wrong.
In one seminar organized to convene mathematicians to
understand his proof, one participant commented, “At the
afternoon tea break, everybody was confused. I asked many
people and nobody had a clue.”

3
https://www.sciencealert.com/nightmarish-500-page-math-proof-even-
experts-can-t-understand-about-published-shinichi-mochizuki
PhD Math Ed.
Georg Cantor

The fact that Cantor saw beyond what other mathematicians did
allowed him to see more clearly, but it also raised so many more
questions.

PhD Math Ed.


Georg Cantor

The fact that Cantor saw beyond what other mathematicians did
allowed him to see more clearly, but it also raised so many more
questions.
By 1882, Cantor started working intensely on the Continuum
Hypothesis (CH), a problem which he himself proposed. It states
that there is no set whose cardinality is between those of N
and R.

PhD Math Ed.


Georg Cantor

The fact that Cantor saw beyond what other mathematicians did
allowed him to see more clearly, but it also raised so many more
questions.
By 1882, Cantor started working intensely on the Continuum
Hypothesis (CH), a problem which he himself proposed. It states
that there is no set whose cardinality is between those of N
and R.
In 1884, attacks on Cantor were at their peak, and Cantor suffered
a nervous breakdown, and was brought to a mental asylum, where
he continued to work on the CH. He was consumed by the problem.

PhD Math Ed.


The Continuum Hypothesis (CH)
In August of 1884, Cantor wrote a letter to a friend. He was
ecstatic, stating that he proved the CH, and that he will send the
proof in the following weeks.

PhD Math Ed.


The Continuum Hypothesis (CH)
In August of 1884, Cantor wrote a letter to a friend. He was
ecstatic, stating that he proved the CH, and that he will send the
proof in the following weeks.
The proof never arrives. In October 1884, Cantor wrote another
letter. In it, you could feel his embarrassment. “I should never have
claimed to have proved it. My beautiful proof lies all in ruins.”

PhD Math Ed.


The Continuum Hypothesis (CH)
In August of 1884, Cantor wrote a letter to a friend. He was
ecstatic, stating that he proved the CH, and that he will send the
proof in the following weeks.
The proof never arrives. In October 1884, Cantor wrote another
letter. In it, you could feel his embarrassment. “I should never have
claimed to have proved it. My beautiful proof lies all in ruins.”
Then three weeks later, he wrote a letter again, now saying that
the CH is not true.

PhD Math Ed.


The Continuum Hypothesis (CH)
In August of 1884, Cantor wrote a letter to a friend. He was
ecstatic, stating that he proved the CH, and that he will send the
proof in the following weeks.
The proof never arrives. In October 1884, Cantor wrote another
letter. In it, you could feel his embarrassment. “I should never have
claimed to have proved it. My beautiful proof lies all in ruins.”
Then three weeks later, he wrote a letter again, now saying that
the CH is not true.
And this pattern continues, saying he’s proved it, then saying
otherwise.

PhD Math Ed.


The Continuum Hypothesis (CH)
In August of 1884, Cantor wrote a letter to a friend. He was
ecstatic, stating that he proved the CH, and that he will send the
proof in the following weeks.
The proof never arrives. In October 1884, Cantor wrote another
letter. In it, you could feel his embarrassment. “I should never have
claimed to have proved it. My beautiful proof lies all in ruins.”
Then three weeks later, he wrote a letter again, now saying that
the CH is not true.
And this pattern continues, saying he’s proved it, then saying
otherwise. And slowly, the circumstances are driving him insane.

PhD Math Ed.


The Continuum Hypothesis (CH)
In August of 1884, Cantor wrote a letter to a friend. He was
ecstatic, stating that he proved the CH, and that he will send the
proof in the following weeks.
The proof never arrives. In October 1884, Cantor wrote another
letter. In it, you could feel his embarrassment. “I should never have
claimed to have proved it. My beautiful proof lies all in ruins.”
Then three weeks later, he wrote a letter again, now saying that
the CH is not true.
And this pattern continues, saying he’s proved it, then saying
otherwise. And slowly, the circumstances are driving him insane.
He was starting to feel that infinity was an abyss. It was there, but
it was outside his reach.

PhD Math Ed.


The Continuum Hypothesis (CH)
In August of 1884, Cantor wrote a letter to a friend. He was
ecstatic, stating that he proved the CH, and that he will send the
proof in the following weeks.
The proof never arrives. In October 1884, Cantor wrote another
letter. In it, you could feel his embarrassment. “I should never have
claimed to have proved it. My beautiful proof lies all in ruins.”
Then three weeks later, he wrote a letter again, now saying that
the CH is not true.
And this pattern continues, saying he’s proved it, then saying
otherwise. And slowly, the circumstances are driving him insane.
He was starting to feel that infinity was an abyss. It was there, but
it was outside his reach.
Still, he continued working on this problem for the rest of his life,
and each failure would hurt him profoundly.
PhD Math Ed.
Resolution of the Continuum Hypothesis

In 1900, David Hilbert published 23 problems that were unsolved


during that time, and this included the Continuum Hypothesis.

PhD Math Ed.


Resolution of the Continuum Hypothesis

In 1900, David Hilbert published 23 problems that were unsolved


during that time, and this included the Continuum Hypothesis.
Eventually, the CH was resolved—the CH is neither true nor false!

PhD Math Ed.


Resolution of the Continuum Hypothesis

In 1900, David Hilbert published 23 problems that were unsolved


during that time, and this included the Continuum Hypothesis.
Eventually, the CH was resolved—the CH is neither true nor false!
In 1940, Kurt Gödel proved that it is impossible to disprove the
Continuum Hypothesis.

PhD Math Ed.


Resolution of the Continuum Hypothesis

In 1900, David Hilbert published 23 problems that were unsolved


during that time, and this included the Continuum Hypothesis.
Eventually, the CH was resolved—the CH is neither true nor false!
In 1940, Kurt Gödel proved that it is impossible to disprove the
Continuum Hypothesis.
In 1963, Paul Cohen proved that it is impossible to prove the
Continuum Hypothesis.

PhD Math Ed.


Review: Quantifiers

A physicist, chemist, and mathematician are traveling through


Kabacan. From the tri-sikad, they spot a chicken crossing the
road.

PhD Math Ed.


Review: Quantifiers

A physicist, chemist, and mathematician are traveling through


Kabacan. From the tri-sikad, they spot a chicken crossing the
road. The chemist says, “Ah, all the chickens in Kabacan are
black.”

PhD Math Ed.


Review: Quantifiers

A physicist, chemist, and mathematician are traveling through


Kabacan. From the tri-sikad, they spot a chicken crossing the
road. The chemist says, “Ah, all the chickens in Kabacan are
black.” The physicist says, “No, no. You can’t conclude that. You
can only say that some of the chickens in Kabacan are black.

PhD Math Ed.


Review: Quantifiers

A physicist, chemist, and mathematician are traveling through


Kabacan. From the tri-sikad, they spot a chicken crossing the
road. The chemist says, “Ah, all the chickens in Kabacan are
black.” The physicist says, “No, no. You can’t conclude that. You
can only say that some of the chickens in Kabacan are black. The
mathematician says, “No, no, no. All you can say is there is a
chicken in Kabacan, and one side of it is black.”

PhD Math Ed.


Review: Quantifiers

1 Write the following statements symbolically.


a. For every x, there is a y such that x = 2y .
b. For every y , there is an x such that x = 2y .
c. For every x and for every y , it is the case that x = 2y .
d. There exists an x such that for all y , the equality x = 2y holds.
e. There exists an x and a y such that x = 2y .
2 Which of the statements in Item 1 are true if the universe for
both x and y is R?
3 Which of the statements in Item 1 are true if the universe for
both x and y is Z?
4 Negate each statement in Item 1. Push the negation as far
into the sentence as possible.

PhD Math Ed.


Review: Quantifiers
Negate the following statements.
1 For every girl, there is a boy she does not like.
2 If I am hungry, then I eat chocolate.
3 For all x ∈ R, we have x 2 > 0.
4 Every odd integer is nonzero.
5 There exists x such that x − 7 > 0.
6 For every x, there is a y such that xy = 1.
7 There is a y such that xy = 0 for every x.
8 If x 6= 0, then there exists y such that xy = 1.
9 If x > 0, then xy 2 ≥ 0 for all y .
1
10 For all  > 0, there exists N ∈ N such that n <  for all
n ≥ N.
11 For all real numbers M, there exists a real number N such
that n − 5 > M for all n > N.
PhD Math Ed.
Review: Quantifiers

If the universe for x and y is the set of all real numbers, determine
whether each of Statements 3-11 in the previous slide is true or
false.

PhD Math Ed.

You might also like