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

Questions on inductive definitions in a proof

  1. Feb 27, 2012 #1
    Hi

    I was trying to solve the following problem from Kenneth Ross's Elementary Analysis book.
    here is the problem.

    Let S be a bounded nonempty subset of [itex]\mathbb{R}[/itex] and suppose that
    [itex]\mbox{sup }S\notin S[/itex]. Prove that there is a non decreasing sequence
    [itex](s_n)[/itex] of points in S such that [itex]\lim s_n =\mbox{sup }S [/itex].

    Now the author has provided the solution at back of the book. I have attached the snapshot of the proof. I am trying to understand it. He is using induction here in the proof. Now in induction, we usually have a statement P(n) , which depends upon the natutal number n. And then we use either weak or strong induction. So what would be P(n) in his proof. I am trying to understand the logical structure of the proof. Thats why I decided to post in this part of PF.

    thanks
     

    Attached Files:

    • 2.png
      2.png
      File size:
      116.9 KB
      Views:
      69
  2. jcsd
  3. Feb 27, 2012 #2
    It's induction in the sense that given the n-1 term he can construct the nth term. He starts with the 1st term and shows you how to construct the 2nd term. He could then, just as well, have said "proceeding in this manner". Notice that below he just says "therefore the construction continues".
     
  4. Feb 27, 2012 #3
    Sorry, maybe I didn't answer your question. He shows that the first term exists. Then he shows that given that the n-1 term exists then the nth term exists by his construction. Therefore all terms exist.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Questions on inductive definitions in a proof
  1. A Proof by induction (Replies: 4)

  2. Induction Proof (Replies: 3)

  3. Proof By Induction (Replies: 0)

Loading...