Physics Forums

## questions on inductive definitions in a proof

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
Attached Thumbnails

PhysOrg.com  science news on PhysOrg.com  >> Front-row seats to climate change>> Attacking MRSA with metals from antibacterial clays>> New formula invented for microscope viewing, substitutes for federally controlled drug

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.

Thread Tools

Similar Threads for: questions on inductive definitions in a proof
Thread                                                              Forum                          Replies
Calculus & Beyond Homework     2
Calculus & Beyond Homework     9
Calculus & Beyond Homework     8
Introductory Physics Homework  5
General Math                   2
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 4, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9495192766189575, "perplexity_flag": "middle"}