A set is countable if it is finite or admits an injection into the natural numbers; equivalently, its elements can be listed by a finite list or a sequence.
The product of two countable sets is countable: after choosing enumerations, its elements are indexed by pairs , and these pairs can be listed diagonally. Thus an injection followed by an injection proves that is countable.
The integers are listed as , so is countable. Every rational number is represented by a pair , so is countable as the image of a countable set.
Finally, if are countable, choose listings , allowing repetitions for finite sets. The diagonal listing of the pairs lists every , proving that a countable union of countable sets is countable.
Fix a positive rational radius . Distinct disjoint circles of radius have centers more than apart, so their open interior disks are pairwise disjoint. Each such disk contains a point of the countable dense set . Fix an enumeration of and assign to each disk the first rational point it contains. Disjointness makes this assignment injective, so there are only countably many circles of radius .
The positive rational numbers are countable. Taking the countable union of countable sets over all rational radii proves that the whole collection is countable.
The conclusion remains true, even though the scaling factor and hence the radius may now be arbitrary. At the point where its handle meets its circle, every lollipop contains a simple triod: take a short arc of the circle in each direction together with a short segment of the handle. Pairwise disjoint lollipops therefore contain pairwise disjoint simple triods. The Moore triod theorem says that every such family in the plane is countable, so
Articles by others on the same topic
There are currently no matching articles.