countable
A set is countable if it can be put into one-to-one correspondence with the natural numbers (or is finite); equivalently, if it 'fits into Hilbert's Hotel'.
As defined in Joel David Hamkins
Where it comes up · 1
- Joel David Hamkins4 claims
Most important claims · 4 of 4Search all claims for “countable” →
- Cantor proved that the set of real numbers is an uncountable infinity that is strictly larger than the infinity of natural numbers, establishing that there is more than one size of infinity, which broke and then rebuilt mathematics.Joel David Hamkins
- The theorem that not everyone can be more pointed-at than pointing fails for infinitely many people; with countably many people each holding one dollar, you can arrange a pattern of passing dollars (mapping the Nth train car to the Nth hotel room) so that afterward everyone has infinitely many dollars while each paid out only one.Joel David Hamkins
- The union of countably many countable sets is still countable; using prime factorization (3 to the C times 5 to the S), the passengers of an infinite train with infinitely many cars each with infinitely many seats can all be assigned unique room numbers.Joel David Hamkins
- Hilbert's Hotel demonstrates that a countably infinite set can accommodate additional elements without becoming larger, because a one-to-one correspondence still exists; this violates Euclid's principle that the whole is always greater than the part.Joel David Hamkins