Countable and Uncountable Sets
The distinction between countable and uncountable infinity is one of the most profound discoveries in mathematics, revealing that there are fundamentally different "sizes" of infinity.
Countability
A set is countable if , i.e., there exists an injection . A set is countably infinite if , and uncountable if .
Equivalently, is countable if and only if is finite or there exists a surjection (i.e., can be enumerated as a sequence).
- Every subset of a countable set is countable.
- A countable union of countable sets is countable: if is countable for each , then is countable.
- The Cartesian product of finitely many countable sets is countable.
- , , and the set of algebraic numbers are countable.
Cantor's Diagonal Argument
is uncountable. More specifically, is uncountable.
Suppose is a surjection. Write each in decimal: (choosing the non-terminating representation when ambiguous).
Define where if and if . Then but for any (since and differ in the -th decimal place). This contradicts surjectivity.
Cardinality Comparisons
All of the following have cardinality :
- , , (via bijections using tangent or similar).
- for any finite (by space-filling curve arguments or interleaving decimals).
- (by characteristic functions).
- The Cantor set (despite having Lebesgue measure zero).
- , the space of continuous functions on .
The beth numbers are defined by: , , . So , , etc. The GCH is equivalent to for all . Without GCH, the relationship between the aleph and beth hierarchies is highly non-trivial.