Question One

Question

Prove that the following sets have the same cardinality by producing explicitly a bijection between the sets and describing this bijection…

  1. … by a formula for ;
  2. … by representing the set on the right as a sequence: ;
  3. … by any method: ;
  4. … by using a sequence of points: ;
  5. … geometrically: .

Hint for 1.5: for example, first construct a bijection of onto a quarter circle (without endpoints), and then a bijection of the quarter circle onto similarly to the stereographic projection in the lectures.

Solution

Question Two

Question

A theorem in the lectures says that if is an injective mapping and is countable, then is also countable.

Use this theorem to prove that .

Hint: one method is to use product of powers of three fixed primes as images of triples of positive integers.

Solution

Question Three

Question

Let be the set of all sequences of the form , where every is either or . Use Cantor’s “diagonal method” to prove that the set is not countable.

Solution

Question Four

Question

Recall that consists of triples of s and s, and is the set of all subsets of . Consider the following mapping, in which a subset is mapped to a string of length consisting of s and s depending on which of the elements belong to (with indicating yes and indicating no).

Write the images , , . Is a bijection?

Solution

Question Five

Question

A theorem in the lectures says that if is an injective mapping and is countable, then is also countable.

Use this theorem to show that any set consisting of pairwise disjoint intervals of the real line (each of ) is countable.

Hint: use the fact that .

Solution