1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Open cover with no finite subcover

  1. Nov 16, 2008 #1
    1. The problem statement, all variables and given/known data
    I want to find an open cover of x>0 with no finite subcover.



    2. Relevant equations



    3. The attempt at a solution
    What about (0,1). Would{1/n,1} have no finite subcover?
     
  2. jcsd
  3. Nov 16, 2008 #2
    Let x be a point in (0,1) and let O_x be the open interval (x/2, 1). Then the union from 0 to infinite of your O_x's covers (0,1). Now to find a finite subcover, consider a finite subcollection of O_x's. Try to see here how reducing the upper limit on your union from infinite to some finite value reduces the points that are contained in the cover. For example, let the finite subcover be the union of O_1, O_2,..., O_n. Then if y is the min of 1, 2,...., n, any number less than n/2 is not contained in the finite union.

    To think about how this is different for closed sets, consider [0,1], the same thing as the previous set except that it contains 0 and 1. An open cover for this set must contain it's endpoints. So we can take an open cover for this set by fixing a c > 0 and let O_1 = (-c,c), O_2, = (1-c, 1+c), etc. Then you can see that this covers [0,1]. But it contains a finite subcover since now we can choose y such that y/2 is less than c. So the addition of the set (-c, c) allows us to take the finite subcover as the union of O_1, O_2, and O_y. Note that this is only one open cover of [0,1], but you can try other cases for examples.
     
  4. Nov 16, 2008 #3
    Oh ok, I see how that works.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?



Similar Discussions: Open cover with no finite subcover
  1. Finite subcovering (Replies: 23)

Loading...