Hilbert's hotel: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Ragnar Schroder
(Creating initial stub)
 
mNo edit summary
 
(16 intermediate revisions by 4 users not shown)
Line 1: Line 1:
'''Hilbert's hotel''' is a humorous popularization of some mathematical paradoxes arising from [[transfinite]] [[set theory]].
{{subpages}}


'''Hilbert's hotel''' is an often used popular illustration of some properties of infinite sets
like the set of [[natural number|natural numbers]] (or any other [[countable set|countably infinite set]]).


In particular, it shows that infinite subsets of countably infinite sets have as many elements as the set,
and that the "sum" of two countable sets is also countable.


==Introduction==
The story — which is usually attributed to the German mathematician [[David Hilbert]] — appears
The basic idea is that of a hotel with an infinite number of rooms - precisely one room for each positive integer. 
in a book (''One two three ... infinity'', 1947) by [[George Gamow]] (in Chapter 1, ''Big Numbers'', pp.17-18)
with the following footnote:


It's sometimes visualized as an infinitely long corridor, with rooms numbered consecutively 1,2,3, ...  
<blockquote>
From the unpublished, and even never written, but widely circulating volume:
"The Complete Collection of Hilbert Stories" by R. Courant.
</blockquote>


A stranger arriving at the reception when the hotel is full may get a room anyway. The management will simply send out an intercom asking every current guest to go out into the corridor,  and then move into the room one step further down.
== The story ==


This way the first room will be left vacant for the new arrival.
Imagine a hotel with infinitely many rooms, the room numbers being all natural numbers.
Assume further that the hotel is fully booked &mdash; all rooms are occupied.


By a similar procedure, any finite number of new arrivals may be accommodated.  
Nevertheless, if a new guest arrives he need not be sent away
because the manager can provide a room by asking all guests to move: the guest in room '''1''' into room '''2''',
the guest in room '''2''' into room '''3''', the guest in '''3''' into '''4''', and so on, i.e.,
each guest moving from room number ''n'' to room number ''n''+1.
Thus room number '''1''' will become free for the new guest.


If an infinite number of strangers arrive,  they may still be accomodated.  The procedure is similar to the finite case, except each current guest will be asked to move to the room with twice the current room number.
Imagine now the arrival of a bus with infinitely many tourists.
They still can be accommodated: This time the manager asks the guests to move from '''1''' to '''2''',
from '''2''' to '''4''',from '''3''' to '''6''', and so on, namely from ''n'' to 2''n''.
After this, only the rooms with even numbers are occupied,
and the tourists can be put in the rooms with odd numbers.


All odd-numbered rooms will then become vacant, so the first new guest may move into the first odd-numbered room (1),  the second into the second odd-numbered room (3), and so on.
Curiously, in the many circulating versions of the story it usually is not mentioned
 
that the manager could exclude some (even infinitely many) VIPs from moving and,
 
more interesting, that he could spare ''all'' guests the inconvenience of moving
 
by good advance planning:
 
He simply must &mdash; when assigning rooms to arriving guests &mdash; leave free every second available room.[[Category:Suggestion Bot Tag]]
 
== See also ==
*[[Galileo's paradox]]
*[[Set theory]]
 
 
==Related topics==
*[[Cardinal]]
 
 
 
== References==
 
 
 
== External links ==
#[http://planetmath.org/encyclopedia/HilbertsHotel.html PlanetMath]
#[http://mathworld.wolfram.com/HilbertHotel.html MathWorld]

Latest revision as of 16:01, 27 August 2024

This article is developed but not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable, developed Main Article is subject to a disclaimer.

Hilbert's hotel is an often used popular illustration of some properties of infinite sets like the set of natural numbers (or any other countably infinite set).

In particular, it shows that infinite subsets of countably infinite sets have as many elements as the set, and that the "sum" of two countable sets is also countable.

The story — which is usually attributed to the German mathematician David Hilbert — appears in a book (One two three ... infinity, 1947) by George Gamow (in Chapter 1, Big Numbers, pp.17-18) with the following footnote:

From the unpublished, and even never written, but widely circulating volume: "The Complete Collection of Hilbert Stories" by R. Courant.

The story

Imagine a hotel with infinitely many rooms, the room numbers being all natural numbers. Assume further that the hotel is fully booked — all rooms are occupied.

Nevertheless, if a new guest arrives he need not be sent away because the manager can provide a room by asking all guests to move: the guest in room 1 into room 2, the guest in room 2 into room 3, the guest in 3 into 4, and so on, i.e., each guest moving from room number n to room number n+1. Thus room number 1 will become free for the new guest.

Imagine now the arrival of a bus with infinitely many tourists. They still can be accommodated: This time the manager asks the guests to move from 1 to 2, from 2 to 4,from 3 to 6, and so on, namely from n to 2n. After this, only the rooms with even numbers are occupied, and the tourists can be put in the rooms with odd numbers.

Curiously, in the many circulating versions of the story it usually is not mentioned that the manager could exclude some (even infinitely many) VIPs from moving and, more interesting, that he could spare all guests the inconvenience of moving by good advance planning: He simply must — when assigning rooms to arriving guests — leave free every second available room.