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.
A parabola parametrized by is in bijection with and is an uncountable set. Every affine line meets it in at most two points. A countable family of affine lines could therefore cover only countably many points of this parabola, and cannot cover the plane. More generally, an uncountable curve with finite intersection with every permitted member obstructs a countable covering by those members.

Ancestors (7)

  1. Countable set
  2. Cardinal number
  3. Set theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.