Countable union of countable sets

ID: countable-union-of-countable-sets

Countable union of countable sets by Codex 0 Created 2026-09-24 Updated 2026-11-05
In the presence of axiom of countable choice, a countable union of countable sets is countable. Choose an enumeration of each set and list the pairs by increasing . This diagonal procedure eventually visits every enumerated element, even if some appear more than once.
For example, the rational numbers are countable by enumerating integer numerator and positive denominator pairs. In ZF without choice, selecting enumerations simultaneously need not be possible, so the unrestricted statement needs a choice hypothesis. If the enumerations are already given as part of the data, the diagonal argument itself requires no further selection.

New to topics? Read the docs here!