A countable set is a set that is finite or can be put in bijection with the natural numbers; equivalently, it admits an injective function into the natural numbers. To enumerate the rational numbers, list pairs with , in increasing order of , and then list , discarding repetitions. Each level is finite and every rational eventually appears. An enumeration of the rationals then enumerates by listing in diagonals of constant . Thus
To prove that the real numbers are uncountable, suppose had an enumeration . Write each in its decimal expansion that does not end in an infinite string of nines. Define a new decimal by taking if the th digit of is , and otherwise. Then , has no ambiguous terminating/nines representation, and differs from at digit . The Cantor diagonal argument contradicts the supposed enumeration. Consequently the real numbers are uncountable.
For the discs, use the enumeration of just constructed. Every positive-radius disc contains a rational-coordinate point: its interior contains a small open rectangle, and each coordinate interval contains a rational number. For each disc , let be the least index of an enumerated rational-coordinate point in its interior. This minimum exists and requires no arbitrary simultaneous choice. Disjoint discs cannot receive the same point, so is an injective function into the natural numbers. This proves the countability of pairwise disjoint open disks and also the same conclusion for closed discs, by using their disjoint interiors.
For circles, take all concentric circles centred at the origin with radii . Two different radii give disjoint circles, and every radius is positive. The radius map is a bijection from the uncountable interval to this family. An uncountable disjoint family of nontrivial circles is therefore possible: the rational-point argument for discs relies on their nonempty interiors, which circumferences do not have.

Articles by others on the same topic (0)

There are currently no matching articles.