Is it possible to cover the closed line segment [ 0 , 1 ] with (possibly infinitely many) circles of positive radius such that no circles overlap (they can touch each other) and the circles only touch the line segments?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Followup question: can you cover every rational point on the line segment?
Log in to reply
Yes.
Let { x n = ( q n , 0 ) : n ∈ N } be an enumeration of the rationals on the x -axis. Pick r 1 > 0 , and let C 1 be the disk with centre ( q 1 , r 1 ) and radius r 1 .
For any n ∈ N , suppose that we have found disjoint circles C 1 , . . . , C n which touch the x -axis so that x k ∈ C k for each 1 ≤ k ≤ n . Then x n + 1 lies outside all of C 1 , . . . , C n , and so we can find r > 0 such that the distance from x n + 1 to C k is at least r for all 1 ≤ k ≤ n . Now set r n + 1 = 2 1 r , and let C n + 1 be the disk with centre ( q n + 1 , r n + 1 ) and radius r n + 1 . Then C n + 1 touches the x -axis at x n + 1 and is disjoint from C 1 , . . . , C n . The result now follows by induction.
See Ford Circle .
Is it wrong to think that no matter how small the circles are, there will always be a small amount of gap between them, leaving at least a very small, say x amount of area uncovered. So x may tend to 0 as the circles get smaller, but it can never be equal to 0 .
Log in to reply
This exact argument would only work for a finite amount of circles. If you only consider rational numbers, for example, your argument will still hold but it is actually possible to cover all rational numbers with infinitely many circles.
Log in to reply
It is quite difficult for me to imagine this, but thank you! Learnt a new thing.
Problem Loading...
Note Loading...
Set Loading...
Let { x n : n ∈ N } be an enumeration of the subset Q 2 of R 2 . For any disk C with positive radius, there must be some elements of Q 2 in the interior of C , and so we can define the integer F ( C ) , where F ( C ) is the smallest integer n such that x n belongs to the interior of C .
If C is any collection of nonoverlapping disks of positive radius, then the function F : C → N is injective (distinct elements of C have disjoint interiors). This means that C is countable.
Suppose that all elements of C are tangential to the x -axis, and that every element of the x -axis belongs to at least one element of C . If we define G ( x ) to be equal to the least integer F ( C ) where C is a disk in C that contains ( x , 0 ) (there is always at least one, and no more than two, such disks for any x ∈ R ), then G : R → N is injective (no two elements of the x -axis can belong to the same disk in C ). This would require R to be countable, which is not true.
Thus no such collection of disks C can exist.