Skip to content

Cardinality

Definition

Two sets AA and BB have the same cardinality, written

card⁡(A)=card⁡(B),\operatorname{card}(A)=\operatorname{card}(B),

if there exists a bijection f ⁣:A→B.f\colon A\to B\text{.}

The empty set has cardinality 0.0\text{.} A set AA has finite cardinality nn if it has the same cardinality as {1,2,…,n}.\{1,2,\ldots,n\}\text{.}


Interpretation

Cardinality measures the size of a set through one-to-one correspondence. For finite sets this reproduces ordinary counting; for infinite sets it provides a precise way to compare sizes.

Two sets A and B with three elements each, joined in pairs by lines that form a bijection, showing that they have the same cardinality.

Each element of AA is joined to exactly one element of BB, and every element of BB is reached once, so the lines form a bijection and card⁡(A)=card⁡(B)=3\operatorname{card}(A)=\operatorname{card}(B)=3. No counting is needed to see that the sets are equally large: the pairing itself shows it, just as a room has as many chairs as people when everyone sits on a chair and no chair is empty.

Because the definition compares sets instead of counting them, it also works for infinite sets, with some surprising answers. N\mathbb{N} and the even natural numbers have the same cardinality, although one is a proper subset of the other, because n↦2nn\mapsto2n pairs them. To show that two sets do not have the same cardinality, one failed attempt is not enough: one must show that no bijection exists at all, as Cantor's diagonal argument does for N\mathbb{N} and R\mathbb{R}.

The infinite sizes have their own names: aleph null, ℵ0\aleph_0, for the countably infinite sets such as N\mathbb{N}, Z\mathbb{Z} and Q\mathbb{Q}, and the cardinality of the continuum, c\mathfrak{c}, for R\mathbb{R}.


Key Results

  • Having equal cardinality is an equivalence relation on sets.
  • A finite set with nn distinct elements has cardinality n.n\text{.}
  • Infinite sets can have the same cardinality even when one is a proper subset of the other.
  • Cantor's theorem shows that every set has strictly smaller cardinality than its power set; here card⁡A<card⁡B\operatorname{card}A<\operatorname{card}B means that there is an injection A→BA\to B but no bijection.

Examples

  • {1,2,3}\{1,2,3\} and {a,b,c}\{a,b,c\} have the same cardinality.
  • N\mathbb{N} and the even natural numbers have the same cardinality because n↦2nn\mapsto 2n is a bijection.
  • N\mathbb{N}, Z\mathbb{Z}, and Q\mathbb{Q} are countably infinite, whereas R\mathbb{R} is uncountable.

Prerequisites

Sources

Aliases: equinumerous, equipotent, cardinal number Symbols: integers, natural numbers, rational numbers, real numbers

Last updated: 20 October 2026 03:02