
#1
Feb2712, 01:20 AM

P: 607

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 



#2
Feb2712, 08:14 AM

P: 188

It's induction in the sense that given the n1 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".




#3
Feb2712, 08:24 AM

P: 188

Sorry, maybe I didn't answer your question. He shows that the first term exists. Then he shows that given that the n1 term exists then the nth term exists by his construction. Therefore all terms exist.



Register to reply 
Related Discussions  
Inductive Proof.  Calculus & Beyond Homework  2  
Inductive proof 4^n >/ n^4  Calculus & Beyond Homework  9  
Inductive Proof on Well Known Sum  Calculus & Beyond Homework  8  
Help with an inductive proof  Introductory Physics Homework  5  
Inductive Proof  General Math  2 