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!

Problem about sets

  1. Oct 6, 2004 #1
    Here's the problem: "Let C be a collection of closed sets of real numbers with the property that every finite subcollection of C has a nonempty intersection, and suppose that one of the sets is bounded. Then, [tex] \bigcap_{F \in C}^F \neq \emptyset [/tex]"

    I've used the Heine-Borel theorem on this, so the bounded set is compact, ie has a finite open cover, etc etc, and De Morgan's law to get the intersection of a bunch of closed sets, but I don't know where to go next. I think Heine-Borel & DeMorgan's law is on the right track, but I'm not sure how to use the fact that every finite subcollection of C has a nonempty intersection, for example.

    I want to use this as a lemma to prove the real problem, which is this: "Let [tex]{F_n}[/tex] be a sequence of nonempty closed sets of real numbers with [tex]F_{n+1} \subset F_n[/tex]. Show that if one of the sets is bounded, then [tex] \bigcap_{i=1}^\infty {F_i} \neq \emptyset [/tex]"

    (the instructor said we can use other problems not assigned, but we have to solve those too. if anyone can prove it directly, without using the previous prob, feel free to help out anyway :wink: )
     
  2. jcsd
  3. Oct 6, 2004 #2

    Hurkyl

    User Avatar
    Staff Emeritus
    Science Advisor
    Gold Member

    Hrm, I would think a proof by contradiction would be the best approach. Assume that the intersection is empty, and try to use compactness to construct a finite subcollection with empty intersection.
     
  4. Oct 7, 2004 #3

    shmoe

    User Avatar
    Science Advisor
    Homework Helper

    For your full problem, you can assume that all the [tex]F_n[/tex] are bounded, they are all bounded after some point and tossing out the (finite number of) earlier unbounded ones will have no effect on your final set.

    You know [tex] \bigcap_{i=1}^k {F_i}[/tex] is non-empty for all k. You can use this to build a sequence in [tex]F_1[/tex]. What does it converge to? Can you show this point is in all your sets?
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?



Similar Discussions: Problem about sets
  1. Set problem (Replies: 1)

Loading...