Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Segments,Proof help?

  1. Jun 18, 2007 #1
    Hi,
    i was just wondering how to prove that from every opened set we can create infinitely many segments within it. My point is this, if we have a scaled line, and if we choose an interval, lets say (a,b), then how can i prove that i can construct infinitely many segments whithin the given interval (a,b)???

    I hope u got my point, couse i have been a little ambiguous.
     
  2. jcsd
  3. Jun 18, 2007 #2

    morphism

    User Avatar
    Science Advisor
    Homework Helper

    What is a segment?
     
  4. Jun 18, 2007 #3
    Well, a segment is the set of all points,that lay on a line, between two fixed points, including these two,boundary, points. [a,b].
    Something like this, right?
     
    Last edited: Jun 18, 2007
  5. Jun 18, 2007 #4
    Well, it's a subtle point, but you can't actually "construct" infinitely many segments. Rather what the question is asking you to prove is that there is no upper limit on the number of segments you can construct.

    You would prove there is no upper limit as follows. First prove that you can divide any given line segment into finitely more line segments(two will do). Then assume there is an upper bound N, on the number of segments (a,b) can be divided into. But every one of those line segments can be divided up into more by the first part of the proof, and now (a,b) has been divided up inot more than N segments. So the assumption of an upper bound on the number of segments is false, and there is no upper limit on how many times you can segment an interval.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?



Similar Discussions: Segments,Proof help?
  1. Help with proof (Replies: 3)

  2. Help with a proof (Replies: 5)

  3. Help with a proof (Replies: 3)

  4. Proof help (Replies: 1)

Loading...