Hilbert's Hotel - kick everyone out In Hilbert's Hotel scenario where an infinite number of new guests arrive, why can't we just kick everyone out and accommodate them again?
Since there is already an infinite number of new guests waiting, kicking an infinite number of guests out of the hotel should leave us with an infinite number of empty rooms and an infinite number of guests waiting for a room. From here we just accommodate everyone again.
Is there a flaw in this logic? I couldn't find an answer to this problem other than the one with moving everyone to a room 2n where n is their current room number.
 A: Here's how I think about this. Let's say you kick out all your current guests. You now have two infinite groups of guests, new arrivals and the ones you just kicked out. Just saying you put both of those groups back into rooms isn't rigorous, you still need to define how you order them, or mix them back together.
One way of doing such ordering/mixing is the common answer you have heard. Assign the first room to a kicked-out guest, the second room to a new guest, etc. After repeating this infinitely, all of your guests will have a room.
However, there are orderings/mixings that will not work. Imagine first giving all of the kicked-out guests rooms and then giving the new guests rooms. Even after an infinite number of steps, you still will be giving kicked-out guests rooms and you will have given no rooms to new guests.
Also note there are many other valid orderings (in fact, infinitely many). An infinite family of such orderings are all the orderings where you first give $n \in \mathbb{N}$ rooms to the kicked-out guests and then start giving every other room to a new guest. The reason you have only heard of the alternating assignment ordering is just that it is simple.
TL;DR: Just saying "just accommodate everyone again" is not enough.

The way mathematicians talk about these ideas is in terms of "bijective functions". Bijective functions are mappings between two sets that satisfy an important property. The mapping must map every member of the second set to one and only one member of the first set. It turns out when you have a bijection between two sets, they are the same size. This is the fundamental idea that HH is built to illustrate.
In this case, the alternating room ordering is a bijection between your guests and the hotel rooms, but the other mapping I gave is not a bijection, in fact, it is not even a function, because the new guests never get mapped to a room.
Bijections can be used to show a lot of crazy results that are even more un-intuitive than HH. Two of the most famous examples are showing the integers and the rationals are the same size and Cantor's diagonal argument which shows there is no bijection between the integers and the reals!
Welcome to infinite set theory!
