ConceptComplete

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

Definition5.4Countable and uncountable

A set AA is countable if ∣A∣≤ℵ0|A| \leq \aleph_0, i.e., there exists an injection A↪NA \hookrightarrow \mathbb{N}. A set is countably infinite if ∣A∣=ℵ0|A| = \aleph_0, and uncountable if ∣A∣>ℵ0|A| > \aleph_0.

Equivalently, AA is countable if and only if AA is finite or there exists a surjection N↠A\mathbb{N} \twoheadrightarrow A (i.e., AA can be enumerated as a sequence).

Theorem5.2Properties of countable sets
  1. Every subset of a countable set is countable.
  2. A countable union of countable sets is countable: if AnA_n is countable for each n∈Nn \in \mathbb{N}, then ⋃n=0∞An\bigcup_{n=0}^{\infty} A_n is countable.
  3. The Cartesian product of finitely many countable sets is countable.
  4. Z\mathbb{Z}, Q\mathbb{Q}, and the set of algebraic numbers are countable.

Cantor's Diagonal Argument

Theorem5.3Uncountability of the reals

R\mathbb{R} is uncountable. More specifically, [0,1][0,1] is uncountable.

Proof

Suppose f:N→[0,1]f: \mathbb{N} \to [0,1] is a surjection. Write each f(n)f(n) in decimal: f(n)=0.dn,1dn,2dn,3…f(n) = 0.d_{n,1}d_{n,2}d_{n,3}\ldots (choosing the non-terminating representation when ambiguous).

Define x=0.e1e2e3…x = 0.e_1 e_2 e_3 \ldots where en=5e_n = 5 if dn,n≠5d_{n,n} \neq 5 and en=6e_n = 6 if dn,n=5d_{n,n} = 5. Then x∈[0,1]x \in [0,1] but x≠f(n)x \neq f(n) for any nn (since xx and f(n)f(n) differ in the nn-th decimal place). This contradicts surjectivity. ■\blacksquare

■

Cardinality Comparisons

ExampleSets with cardinality of the continuum

All of the following have cardinality c=2ℵ0\mathfrak{c} = 2^{\aleph_0}:

  • R\mathbb{R}, (0,1)(0,1), [0,1][0,1] (via bijections using tangent or similar).
  • Rn\mathbb{R}^n for any finite nn (by space-filling curve arguments or interleaving decimals).
  • P(N)\mathcal{P}(\mathbb{N}) (by characteristic functions).
  • The Cantor set C\mathcal{C} (despite having Lebesgue measure zero).
  • C([0,1])C([0,1]), the space of continuous functions on [0,1][0,1].
RemarkThe beth numbers

The beth numbers are defined by: ℶ0=ℵ0\beth_0 = \aleph_0, ℶα+1=2ℶα\beth_{\alpha+1} = 2^{\beth_\alpha}, ℶλ=sup⁡α<λℶα\beth_\lambda = \sup_{\alpha < \lambda}\beth_\alpha. So ℶ1=c\beth_1 = \mathfrak{c}, ℶ2=2c\beth_2 = 2^{\mathfrak{c}}, etc. The GCH is equivalent to ℶα=ℵα\beth_\alpha = \aleph_\alpha for all α\alpha. Without GCH, the relationship between the aleph and beth hierarchies is highly non-trivial.