ConceptComplete

Cardinal Numbers and Cardinality

Cardinal numbers measure the "size" of sets, abstracting away from order. Two sets have the same cardinality if and only if there exists a bijection between them.


Equinumerosity and Cardinality

Definition5.1Equinumerosity

Two sets AA and BB are equinumerous (written A∼BA \sim B or ∣A∣=∣B∣|A| = |B|) if there exists a bijection f:A→Bf: A \to B. This is an equivalence relation on sets. The cardinality ∣A∣|A| of a set AA is (assuming AC) the least ordinal equinumerous with AA.

Definition5.2Cardinal number

An ordinal κ\kappa is a cardinal (or initial ordinal) if there is no bijection between κ\kappa and any smaller ordinal. Equivalently, κ\kappa is a cardinal if ∣κ∣=κ|\kappa| = \kappa. The finite cardinals are 0,1,2,…0, 1, 2, \ldots, and the infinite cardinals are:

ℵ0=ω,ℵ1=ω1,ℵ2=ω2,…,ℵω,…\aleph_0 = \omega, \quad \aleph_1 = \omega_1, \quad \aleph_2 = \omega_2, \quad \ldots, \quad \aleph_\omega, \quad \ldots

where ωα\omega_\alpha is the α\alpha-th infinite initial ordinal.


Cardinal Arithmetic

Definition5.3Cardinal addition and multiplication

For cardinals κ,λ\kappa, \lambda:

  • Cardinal sum: κ+λ=∣A⊔B∣\kappa + \lambda = |A \sqcup B| where ∣A∣=κ|A| = \kappa, ∣B∣=λ|B| = \lambda, A∩B=∅A \cap B = \emptyset.
  • Cardinal product: κ⋅λ=∣A×B∣\kappa \cdot \lambda = |A \times B|.
  • Cardinal exponentiation: κλ=∣AB∣\kappa^\lambda = |A^B| (the set of all functions B→AB \to A).

For infinite cardinals: κ+λ=κ⋅λ=max⁡(κ,λ)\kappa + \lambda = \kappa \cdot \lambda = \max(\kappa, \lambda) (assuming AC).

ExampleCardinal arithmetic examples
  • ℵ0+ℵ0=ℵ0\aleph_0 + \aleph_0 = \aleph_0 (union of two countable disjoint sets is countable).
  • ℵ0⋅ℵ0=ℵ0\aleph_0 \cdot \aleph_0 = \aleph_0 (Cantor pairing function gives N×N∼N\mathbb{N} \times \mathbb{N} \sim \mathbb{N}).
  • 2ℵ0=∣P(N)∣=∣R∣=c2^{\aleph_0} = |\mathcal{P}(\mathbb{N})| = |\mathbb{R}| = \mathfrak{c} (the continuum).
  • ℵ0ℵ0=2ℵ0=c\aleph_0^{\aleph_0} = 2^{\aleph_0} = \mathfrak{c} (since 2ℵ0≤ℵ0ℵ0≤(2ℵ0)ℵ0=2ℵ0⋅ℵ0=2ℵ02^{\aleph_0} \leq \aleph_0^{\aleph_0} \leq (2^{\aleph_0})^{\aleph_0} = 2^{\aleph_0 \cdot \aleph_0} = 2^{\aleph_0}).

The Continuum

Theorem5.1Cantor's theorem (generalized)

For any set AA: ∣A∣<∣P(A)∣|A| < |\mathcal{P}(A)|. Equivalently, κ<2κ\kappa < 2^\kappa for every cardinal κ\kappa.

RemarkThe continuum hypothesis

The continuum hypothesis (CH) asserts that 2ℵ0=ℵ12^{\aleph_0} = \aleph_1, i.e., there is no cardinality strictly between ∣N∣|\mathbb{N}| and ∣R∣|\mathbb{R}|. The generalized continuum hypothesis (GCH) states that 2ℵα=ℵα+12^{\aleph_\alpha} = \aleph_{\alpha+1} for all ordinals α\alpha.

Godel (1938) showed CH is consistent with ZFC, and Cohen (1963) showed ¬\negCH is also consistent. Thus CH is independent of ZFC.