Compact Metric Spaces: Subcover of Balls with Limited Number

  • Thread starter Thread starter Mathmos6
  • Start date Start date
  • Tags Tags
    Compact Metric
Mathmos6
Messages
76
Reaction score
0

Homework Statement



Is the following statement true: for every compact metric space X there is a constant N S.T. every subcover of X by balls of radius one has a subcover with at most N balls?

Homework Equations


The Attempt at a Solution



I know you're meant to post your working but I really can't get started on this one! I can't even work out which way I should be proving, I have no clue whether this is true or false :( I have a feeling it's true but that's really got no actual mathematical basis sadly. I know the definitions of compactness - each open cover must have a finite subcover - and of balls, metric space etc, but I'm not sure how to apply it or how to approach the problem. Could someone please please get me started? Many many thanks,

Mathmos6
 
Physics news on Phys.org
Maybe your feeling it's true is holding you back from trying to construct a counterexample. Think about a closed disk of radius 2. What you want to do is construct a series of open covers with the number of open sets needed to cover going to infinity.
 
Last edited:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top