Plenty of room at the Hotel Hilbert

There she stood in the doorway
I heard the mission bell
And I was thinking to myself
"This could be Heaven or this could be Hell"
$\tiny{\text{The Eagles - Hotel California}}$

Infinity in mathematics is a topic that I often see raising curiosity in non mathematicians. And why wouldn't it? It seems mysterious and is often attributed mystical implications.
This post will be an attempt to explain a few definitions and properties of cardinal numbers, which are a type of numbers that reach "to infinity and beyond". I intend to give meaning to this and explain some (and by some I mean a very small fraction) of what can and what can't be done with those concepts.

Now, there are many different things that we call "infinite" in mathematics. For instance, a "point at infinity" in geometry has little to do (to my knowledge at least) with the topic being discussed here. So I should disclaim right away that this is not an explanation to the whole concept of infinity in mathematics. This concept is far too vast to be covered in one blog post. Hopefully, I'll be able to talk about other occurences of infinity in math in later discussions.

What are cardinal numbers?

Numbers have two different fundamental uses that common language itself distinguishes pretty eloquently :
There are cardinal numbers. We use them to count things. If I claim that I own three apples, I am refering to the cardinal number 3.
And then, there are ordinal numbers. Their purpose is to order thing. If I claim that I am third in line, I am refering to the ordinal number 3.
Of course, when we are manipulating finite numbers, distinguishing between cardinal and ordinal number is just a matter of precision. The numbers themselves are the same. But things do not go so well when we consider infinite numbers.
This post will focus on cardinal numbers.

In mathematics a set is an object that can contain other objects. Sets are the basic brick on which lay modern mathematics (although other foundations are possible and studied, set theory is the most common). And cardinal numbers in mathematics are a measure of the size of sets.
For instance, $\{1;2;3\}$ is the set that contains the numbers 1, 2 and 3. Its cardinal is 3, because it contains 3 distinct elements. Here is a visual representation of this set:
A visual of the set $\{1;2;3\}$

Now, sets can contain many things aside from numbers, such as functions, vectors, other sets... In fact, assuming you are doing mathematics based on set theory (which is by far the most common manner), every mathematical object is a set. There are a few rules to keep things coherent, such as the fact that a set may not contain itself.

We are trying to define cardinal numbers. That is, we are trying to give meaning to the sentence "the set $\{cow;potato; truck\}$ has 3 elements". In order to do that, we are going to use our set $\{1;2;3\}$ as a reference : as set will be said to have 3 elements if it has as many elements as the set $\{1;2;3\}$. But this tentative definition raises a new question : what those it mean for two sets to have "as many elements" ?

Of course, we could be tempted to just count. The set $\{cow, potato, truck\}$ has 3 elements, just like $\{1;2;3\}$. But then we would be going in circles, as we are trying do define what it means to have 3 elements. And circular definitions are to be avoided at all cost! Instead, we will say that two sets have as many elements, or that they have the same cardinal if there exists a bijection between them. A bijection will be a one-to-one correspondance between all objects of the first set, and all objects of the second set. Allow me to demonstrate:
A bijection
Here, we have drawn a bijection that associates 1 to cow, 2 to potato and 3 to truck. Of course, we could have made other choices, and if I had decided instead to associate 1 to potato and 2 to cow, the result would have been the same:
Each element of the first set is associated with a unique element of the second set, and likewise every element of the second set is associated with a unique element of the first set
We will say that two sets have the same cardinal, that is, that they have as many elements, if it is possible to find a bijection between them. In particular, we can say that a set has 7 elements if there is a bijection between said set and $\{1;2;3;4;5;6;7\}$.
We may now proceed to introduce infinite sets.

To infinity...

We explained in the last section what it means for a set to have a certain numbers of elements:
If $n$ is a whole number, a set $A$ has $n$ elements if there exists a bijection between $A$ and the set $\{1;2;...;n\}$.
But what of the set $\mathbb{N}$ of whole numbers? That is, $\mathbb{N} = \{1;2;3;...\}$ is the set that contains every positive number. Certainly, we can not assign it a finite number of elements. By its very definition, it will go beyond that. $\mathbb{N}$ is our first infinite set, and so its number of elements is our fist cardinal number. It is often denoted $\aleph_0$ (read "aleph nought"). This simply mean that this is the smallest infinite cardinal number.

And you may have noticed that what I just wrote implied that there are more infinite cardinals. Considering I have been bragging about going "to infinity and beyon", this may not be much of a surprised, but I believe that this whole idea can be hard to grasp at first. Fine, let's experiment!

In order to understand our bijections, we are going to proceed with the following experiment:
When we compare two sets, one will play the role of the hotel and the second will be the set of visitors. Then, following our earlier definitions, we will say that our sets have same size if we can attribute one room to each visitor in a way that will make the hotel complete. This thought experiment is commonly refered to as "Hilbert's Hotel", which explains the title of this post. Here is a photograph I took during my stay at Hotel Hilbert. Unfortunately, I wasn't able to fit the whole building in the picture.

Now, let's put our thought experiment to use. I use you to take a small pause and ponder the following question for yourself before looking at the answer:
Do the sets $\mathbb{N} = \{1;2;3;4;...\}$ and $\mathbb{N} \cup \{0\} = \{0;1;2;3;4;...\}$ have as many elements?


Well, let $\mathbb{N}$ be our hotel, and $\mathbb{N} \cup \{0\}$ be our set of visitors. That is, we imagine that an infinite amount of people show up at Hotel Hilbert. Each of them is wearing a T-shirt with a number written on it. The first visitor has a T-shirt with 0, the second one has a T-shirt with 1, and so on...
Can we give everyone a room in a way that makes the hotel complete?
Well, we could start by giving the room numbered $n$ to the person with the T-shirt $n$. That is, the person with T-shirt 1 gets room 1, the person with T-shirt 33 gets room 33 and so on...
And then, on the door step, remains one lonely visitor, the one who had the misfortune to wear T-shirt zero. Seeing that, their friends decide to make a little room: the visitor in room 1 moves to room 2, the visitor in room 2 moves to room 3, the visitor in room 3 moves to room 4 and so on...
After they all move following this pattern (which may take quite some time, but fortunately a clever arrangement of black holes around the hotel allows for appropriate space-time distorsion and makes this operation feasible), every room of the hotel is occupied except for room number 1. Letting our visitor number 0 occupy this room, we have a complete hotel and no visitor left outside : we have a bijection between $\{0;1;2;3;...\}$ and $\{1;2;3;...\}$.
Here is another illustration of what is going on:
$\alpeh_0$ = $\alpeh_0 + 1$

Another way to look at what we just did is to say that if we take the set $\mathbb{N}$ and we add to it one element, 0, its size doesn't change. We could express this fact by writing $\aleph_0 = \aleph_0 + 1$. (remember, $\aleph_0$ is how we write the infinite number representing the cardinal of $\mathbb{N}$).

We were trying to build an infinite cardinal number that is bigger that $\aleph_0$, and our first attempt has been unfruitful. Let's try something else! We start, again, with an empty hotel.

This time, imagine that two buses show up at the same time in front of Hotel Hilbert. Each but has an infinite amount of passenger: one bus has seats numbered 1, 2, 3,... and so on to infinity and the second bus has seats numbered -1,-2,-3,... and so on... Will all the passengers be able to fit in the hotel?
This happens more often than you think...
Again, I encourage you to take some time and ponder this to yourself before reading further.


The organizers of both trips (they are the passengers labeled -1 and 1) deliber for a little while on the (infinite) parking lot of the hotel. Fortunately, both buses are parked on small black holes, which helps make the wait bearable for the passengers.

They come to a conclusion: passengers of the "negative bus" will occupy even numbered rooms and passengers of the "positive" bus will occupy odd numbered rooms. That is, passenger 1 will take room 1, passenger -1 will take room 2, passenger 2 will take room 3, passenger -2 will take room 4, and so on...

Again, after they explain the process to their co-travelers, everyone reachers their room peacefully and the hotel ends up complete. Here is an other illustration of the strategy:
Your text to link here...
So this time, what we managed to fit two copies of the set $\mathbb{N}$ inside itself. We could translate this operation in terms of cardinal numbers: $\aleph_0 + \aleph_0 = \aleph_0$.

It may seem tempting to give up at this point. If even two copies of $\mathbb{N}$ can fit in $\mathbb{N}$, can we really hope to find a bigger infinity? Well, let's get a bit more creative.

... and beyond!

We will now have to expand a bit more on our analogy:
One more time, we forget about our last thought experiment and consider the hotel empty.
A simple good old infinite bus of visitors shows up at the hotel, and each visitor is numbered as 1,2,3,... and so on. But this time, they're here for business. In fact, they are all spies and want to be able to share information to exactly the people that they want.
In order to implement that, they ask that each possible combination of them be attributed a specific room. For instance, if visitors number 1,54,256 and 10000003 want to talk, there is one room to which only they have access. Of course, there is also a different room to which only visitors 1,54 and 256 have access (they actually use it to prepare visitor 10000003's surprise birthday party), and another room to which only visitors 1, 54, 256 and 10000004 have access, and so on for any possible set of visitor.
In fact, they even want meeting rooms for infinite sets of visitors. For instance, odd numbered visitors sometimes like to gather without "the evens".
Finally, for some classified, top secret reason, they also ask for a room to which absolutely no visitor has access.

In other words, we need to find a bijection between $\mathbb{N}$ and the "set of subsets of $\mathbb{N}$", which we shall denote $P(\mathbb{N})$. Here is an illustration of the set of subsets of $\{1;2;3\}$, $P(\{1;2;3\})$:
Your text to link here...

Each element of $P(\{1;2;3\})$ is itself a set. Note that it also includes an empty set which contains nothing. We write $\emptyset$ to refer to it. You can also notice that the set $P(\{1;2;3\})$ has $8 = 2^3$ elements. This might be relevant later on.

Back to Hotel Hilbert, we are dealing with the same construction, but this time we are working with infinite sets. So our question follows: is it possible to fulfill the Spy Workshop's request? As you will have guessed, I encourage you to take a little while to ponder this by yourself before you proceed further.


Well, this time, it's hard to think right away of an organisation method that will solve our problem. We may use a different method: we will start by assuming that actually have a way to organise our hotel into this infinite conference center (that is, we will assume that we have a bijection between $\mathbb{N}$ and $P(\mathbb{N})$) and we will try to draw conclusions from this assumption. A few things may then happen:

  • We may gain a better understanding of what a solution to the problem looks like, and that would give us hints to find such a solution.
  • We may arrive to a contradiction, some sort of absurd statement. This would prove that a solution to the problem doesn't exist.
  • We may learn nothing of value and adopt another strategy to solve our problem.

So, we assume for now that each room has been attributed a set of visitors. Remember that rooms of the hotel are all attributed one specific natural number, and that the same goes for visitors. If $n$ is a natural number, we write $R_n$ for the set of visitors that may enter room number $n$. For instance, we read on the picture below that $R_{1728}$ is the set of prime numbers. (note that this is just an example that the number may very well have been a different one) Your text to link here...

But then, something happens. Visitor number 42 realizes that they are not welcome in room number 42. That is, 42 is not one of the elements of $R_{42}$. They feel a bit jealous of their friend, visitor 44, because room 44 is the room that welcomes visitors whose number has only one digit repeating a certain number of time, so visitor number 44 is welcome in room number 44 (and so are visitors 222, 5555555 and 7777777777777777777777).

Visitor number 42 would like to gather visitors who are not welcome in the room bearing their name. They look for the room that welcomes all the visitors who do not have access to the room that has the same number as them. So visitor number 42 is welcome in that room, but visitor number 44 isn't. Recalling our previous example, visitor number 1728 is welcome in this room, because 1728 is not a prime number. While we do not know the number of this room, we know that it must have one. So we will simply write it $k$.
Your text to link here...

As some visitors arrive in room number $k$, one of them asks: "Wait! Will visitor number $k$ be joining us?"
"Of course not!" Another one replies, "people who can enter the room bearing their number are not welcome here."
"But this is room number $k$, so if visitor number $k$ is not welcome here, then by the rules of the room they should be welcome here... But if they are welcome here then the rules say that they shouldn't be?" concludes visitor number 42, with a glimpse of fear in their eyes.

As those last words are uttered, the ground starts shaking. Dust and lumps of plaster are falling from the ceiling, and the loud, deep voice of the occupant of the room welcoming elements of $\emptyset$, coming from no particular location, yells: "I have detected a logical incoherence in this universe. Please wait peacefully for imminent rapture."

The visitors, not having paid attention to the second sentence, panick. Chaos ensues. As they see visitor 1728 running around, flailing their arms, visitor 42 wakes up on a couch in the lobby. They had fallen asleep, waiting for the administrator of the hotel to find a solution to the matter at hand.


This little story shows that the administrator will never manage to access the request at hand. If they did, it would create a logical incoherence, and so it is impossible that they do. There are simply not enough rooms to accomodate every possible gathering of visitors.

Mathematically, this means that we can not fit the set $P(\mathbb{N})$ inside the set $\mathbb{N}$. Another way to put it, is that $\aleph_0 < 2^{\aleph_0}$. Indeed, remember how we saw that the cardinal of $P(\{1;2;3\})$ was $8 = 2^3$ ? Well we keep this formula as a notation even for infinite cardinals, and so the cardinal of the set $P(\mathbb{N})$ is written $2^{\aleph_0}$, since the cardinal of $\mathbb{N}$ is $\aleph_0$.

Conclusion

We have found one new infinite cardinal number, strictly larger than $\aleph_0$. We may be tempted to call it $\aleph_1$, but doubts remains:
Is $2^{\aleph_0}$ equal to $\aleph_1$? That is, is $2^{\aleph_0}$ the smallest cardinal number strictly larger than $\aleph_0$?

This question, raised by Georg Cantor (who invented/discovered most, if not all, of what was discussed in this post) in 1878. A surprising answer was found by logicians Kurt Gödel and Paul Cohen in the $\text{XX}^{\text{th}}$ century: using the common theory of set, it is impossible to prove or disprove that $2^{\aleph_0} = \aleph_1$. In fact, one may freely assume either that it is true or that it is false, and it should not affect the coherence of their mathematics.

Explaining the methods they used to prove this goes way beyond the scope of this blog post, and so we will stop here, content with our discovery that not only infinite cardinal numbers do exist, but that there is more than one. In fact, with a bit of imagination, the interested reader could prove that there is an infinity of infinite cardinal numbers.

Leave a Reply