Questions on inductive definitions in a proof

  • Context: Graduate 
  • Thread starter Thread starter issacnewton
  • Start date Start date
  • Tags Tags
    Definitions Proof
Click For Summary
SUMMARY

The discussion centers on a proof from Kenneth Ross's "Elementary Analysis" regarding the existence of a non-decreasing sequence in a bounded nonempty subset S of \mathbb{R} where sup S is not in S. The proof utilizes mathematical induction, specifically constructing terms based on the existence of previous terms. The participants clarify that the proof starts with the first term and demonstrates that if the (n-1)th term exists, the nth term can also be constructed, ensuring all terms in the sequence exist and converge to sup S.

PREREQUISITES
  • Understanding of mathematical induction, including weak and strong induction.
  • Familiarity with the concepts of supremum and bounded sets in real analysis.
  • Knowledge of sequences and limits in the context of real numbers.
  • Basic proficiency in reading and interpreting mathematical proofs.
NEXT STEPS
  • Study the principles of mathematical induction in detail, focusing on examples and applications.
  • Explore the properties of supremum and infimum in real analysis.
  • Learn about constructing sequences and their convergence properties.
  • Review additional proofs in Kenneth Ross's "Elementary Analysis" for further practice.
USEFUL FOR

Students of real analysis, mathematicians interested in proof techniques, and anyone seeking to deepen their understanding of induction and sequence convergence in mathematical contexts.

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 [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
 

Attachments

  • 2.png
    2.png
    64.3 KB · Views: 496
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.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 7 ·
Replies
7
Views
1K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K