Compact sets are covered by finitely many epsilon disks

redone632
Messages
14
Reaction score
0

Homework Statement


Let K be a compact sebset of a metric space (X, d) and let \epsilon greater than 0.
Prove that there exists finitely many points x_1 x_2, ... x_n \in K such that K is a subset of the union of the \epsilon neighborhoods about x_i


Homework Equations


N/A


The Attempt at a Solution



I think all I need to show is that all of the neighborhood epsilon disks about all the x's cover K and since K is is a compact set then finitely many of these neighborhoods cover K. If that is the correct approach then I'm just not sure how to start it. We didn't do any examples of proving that a certain set covers another.
 
Physics news on Phys.org
Yes, that is the right approach. A space is compact if every open cover has a finite subcover. Take a cover of K by <br /> \epsilon<br /> balls. If you assume there does not exist fintely many <br /> x_1 x_2, ... x_n \in K<br /> such that K is a subset of the union of the <br /> \epsilon<br /> neighborhoods about <br /> x_i<br />, then this is an open cover without a finite subcover.
 
Alright, but how do I go about defining my epsilons to be?
 
the proof should be sound for any epsilon
 
Last edited:
lanedance said:
the proof should be sound for any epsilon

That's what I thought. We've just been dealing with defining epsilon so much I want to be sure. I'll go over my notes to see if I can come up with something. Thanks!
 
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