Last Time | Next Time |
Natural numbers are things which have a size, and if you add one to a natural number, you get a bigger number.
You don't get "a bigger number" -- more hate -- when you hate someone "infinity plus one".
In part because you don't have a number to begin with; but trying to add a number (1) to NaN doesn't work to give you a bigger number.
Intuitively: We will say that two sets have the same size if they have the same cardinality.
One-to-one correspondence: \(\mathbb{N} \to \{2,3,4,\ldots,n,\ldots\}\), by \[ n \to n+1 \]
This result informs us that when someone on the playground hollers "I hate you infinity plus 1!", they really haven't hated any more than a simple infinity.
Alternatively, if your lover says they love you infinitely much, you can't impress them by saying that you love them infinitely plus one. They will scoff, and perhaps leave you for a better mathematician! So take note....
One-to-one correspondence: \(\mathbb{N} \to \{2,4,6,\ldots,2n,\ldots\}\), by \[ n \to 2n \] We send the people in their rooms to twice their room number.
Then we slide the students on the bus into rooms \[ n \to 2n-1 \]
One-to-one correspondence: \(\mathbb{N} \to \{1,3,5,\ldots,2n-1,\ldots\}\).
This result informs us that when someone on the playground hollers "I hate you 2*infinity!", they really haven't hated any more than a simple infinity.
The natural numbers have the same cardinality as the set of even natural numbers, and the same cardinality as the set of odd natural numbers.
One-to-one correspondence: Each bus gets mapped to a prime number \(\mathbb{N} \to \{2,3,5,\ldots,p_n,\ldots\}\), so that the bus \(m\), \(B_m\), gets mapped to the \(m^{th}\) prime number: \[ B_m \to p_m \] Then the kids on bus \(B_m\) get mapped to powers of that prime: \[ n \to p_m^n \]
Because of the prime factorization theorem, which says that every natural number (other than 1) is either prime, or can be written as a product of primes in a unique way, we know that two students cannot be assigned to the same room number. If so, we would have two different prime factorizations of the same number, i.e.
\[ p_r^s=p_m^n \]
But since prime factorizations are unique, and so that can't happen, every student has their own private room. I hope that the chaperones are ready for this! :)
This result proves that there are just as many rational numbers (ratios of integers, of the form \(\frac{m}{n}\)) as there are natural numbers.
The real numbers (containing both the rational and irrational numbers) is just too big for Hilbert's Hotel. Mathematicians' guts lead them to believe (generally) that the real numbers are the next largest infinity (the first "uncountable" one).
Let me try to convince you of that, in the following way (called "Cantor's diagonalization argument"):
Let me show you how.....
We often denote a set by using braces, e.g. \(S=\{1,2,3\}\) is the set of the first three natural numbers. Thus we would say that \(S\) is a subset of the natural numbers \(\mathbb{N}\), and we denote it \(S \subseteq \mathbb{N}\).
We say that \(a\) is an element of \(S\) if \(a\) is contained in \(S\), and we write \(a \in S\). So \(1 \in S\), \(2 \in S\), and \(3 \in S\). We deny that an object is in \(S\) this way: \(4 \notin S\).
Thus for every set, \(S \subseteq S\) and \(\{\} \subseteq S\).
And if the sets are finite, the proper subset is always smaller, but if the set is infinite, we may actually be able to throw away elements of a set and not change the size of the set!
It's about how many ways we have of choosing \(r\) things from \(n\), right? That's exactly what a subset of \(r\) elements is: a choice of \(r\) things from \(n\). Here are the four different groups of subsets represented by that line:
Imagine that each of the \(n\) elements is a person, who decides if they're going to stand up and join a subset, or not. Each person has two choices, and they make them independently. Thus we have \(2 \cdot 2 \cdot \ldots 2\) -- \(n\) times -- ways of making a choice of a subset, of choosing.
(We know that since each row of Pascal's triangle adds to a power of 2, and the elements in each row represent all the different subsets of each size possible, from 0 up to \(n\).)
This property holds true for all finite sets -- and it turns out to be true for infinite sets, too!
Here's a silly video to illustrate how the power set grows with sets of increasing size. (Thanks to Dr. Towanna Roller (Asbury University) and her daughter Kristyn Roller (UK) for this one!)
And the power set of that set is bigger yet, and so on forever, forever, Hallelujah, Hallelujah!
That symbol that you've been familiar with for all your lives, $\infty$: you thought it stood for a single thing; but it stands for a whole collection of monstrously big things, all too big to really think about properly. (Well, Cantor did!:)
"I love you more than the power set of your set of infinite love."
Amen!