Countable and Uncountable Sets · seed 1 · A4, ink-friendly. The answer key prints on its own page for grown-ups.

Pairing up infinite sets

Mathematics · Mathematical Thinking · ages 18-19
Name ______________________   Date ____________
  1. Number positions starting at 1 in the integer list 0,1,-1,2,-2,3,-3,... . At which position does -4 appear?

    Answer: ______________

  2. Let f(n)=2n map N={1,2,...} to E={2,4,...}. Injectivity has been proved. Which fact completes the proof that f is a bijection?

    • Every odd number has a positive natural preimage.
    • Every e in E has the natural preimage e/2.
    • Every integer has a positive natural preimage.
    • Every e in E has two different natural preimages.
  3. The rule f(n)=2n pairs positive naturals with positive evens. Where does 7 go?

    • 7
    • 49
    • 14
  4. A proper subset can have a bijection with its whole set even when the whole set is finite.

    Circle one:   True   False

  5. How many subsets of {a,b,c,d} contain a?

    Answer: ______________

  6. A full hotel has rooms 1,2,3,... . Each current guest moves from room n to room n+1. Which room receives the guest from room 5?

    Answer: ______________

  7. Why does the decimal diagonal proof avoid a constructed decimal ending in an endless tail of 9s?

    • A tail of 9s can also be written with a tail of 0s.
    • A tail of 9s always represents a number outside (0,1).
    • A tail of 9s makes the represented number irrational.
    • A tail of 9s means the number has no decimal expansion.
  8. Every infinite subset of N={1,2,3,...} can be listed in increasing order and is countably infinite.

    Circle one:   True   False

  9. List reals in (0,1) using decimals without a tail of 9s. Construct digit n of d as 2 if digit n of row r_n is 1, and as 1 otherwise. What follows?

    • The list includes every real in (0,1)
    • The list misses a real in (0,1)
    • The list has only rational numbers
  10. Let N={1,2,...} and let f:N -> P(N) be arbitrary. Define D={n in N: n is not in f(n)}. Which argument proves P(N) is uncountable?

    • D differs from f(1), so that single comparison rules out every proposed surjection.
    • D is a subset of N, so listing the members of N also lists every subset of N.
    • For every k, D and f(k) disagree at k, so no such f is onto.
    • D is infinite for every f, whereas every output f(k) must be a finite subset of N.
LightMySky · lightmysky.comW1-mt_VTHPloNBbJ-s1

Answer key

For grown-ups. Fold this page away before handing over the rest.

Pairing up infinite sets W1-mt_VTHPloNBbJ-s1

  1. 9 · Negative -k occurs at position 2k+1. With k=4, the position is 9.
  2. Every e in E has the natural preimage e/2. · For every positive even e, e/2 is in N and f(e/2)=e. This proves surjectivity, completing the bijection proof.
  3. 14 · Substitute n=7: f(7)=2 times 7=14.
  4. False · A finite proper subset has fewer members than the whole set. A bijection requires a distinct partner for every member on both sides.
  5. 8 · Fix a as included. Each of b,c,d can independently be included or excluded, giving 2 times 2 times 2=8 subsets.
  6. 6 · The guest from room 5 moves to 5+1=6. Moving every current guest by this rule leaves room 1 free.
  7. A tail of 9s can also be written with a tail of 0s. · An endless tail of 9s can give an alternate expansion of the same number. Different digit strings alone need not mean different numbers.
  8. True · Repeatedly choose the least unused member. Every member has only finitely many smaller naturals, so it is eventually reached.
  9. The list misses a real in (0,1) · The constructed d lies in (0,1) and differs numerically from every listed row. The list therefore misses d.
  10. For every k, D and f(k) disagree at k, so no such f is onto. · For any k, the definition gives opposite membership of k in D and f(k), so D differs from every output. Since D belongs to P(N), f is not onto. This works for every f, proving P(N) is uncountable.
Worksheet · LightMySky