Questions on inductive definitions in a proof

  • Thread starter Thread starter issacnewton
  • Start date Start date
  • Tags Tags
    Definitions Proof
issacnewton
Messages
1,035
Reaction score
37
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 \mathbb{R} and suppose that
\mbox{sup }S\notin S. Prove that there is a non decreasing sequence
(s_n) of points in S such that \lim s_n =\mbox{sup }S.

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
 

Attachments

  • 2.png
    2.png
    64.3 KB · Views: 461
Physics news on Phys.org
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".
 
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.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top