Is an analogus function useful for proving sequence monotonicity?

Click For Summary

Homework Help Overview

The discussion revolves around proving the monotonicity of a sequence defined by a recursive relation, specifically examining whether an analogous function can be utilized for this purpose.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore the use of an analogous function to demonstrate that the sequence is increasing, with one suggesting the need to prove the relationship between iterates of the function. Others question the appropriateness of the chosen function and its convergence properties.

Discussion Status

The discussion includes various perspectives on the effectiveness of using an analogous function, with some participants suggesting alternative methods such as mathematical induction or graphical analysis. There is an ongoing exploration of the validity of the initial approach without reaching a definitive consensus.

Contextual Notes

Participants note the importance of the sequence's limit and convergence, raising questions about the assumptions underlying the use of the analogous function. There is mention of the textbook's requirements and the potential implications of the function's behavior beyond the limit.

DivGradCurl
Messages
364
Reaction score
0
Folks,

This is the solution I have for a problem in my textbook regarding sequences. I just need to know whether I have the right idea in mind.

Thank you very much!


We can use an analogus function to show that the sequence given by

[tex]a_{n+1} = \sqrt{2+a_n} \quad a_1 = \sqrt{2}[/tex]

is increasing. Here it goes

[tex]y = \sqrt{2+x} = \left( 2+x \right) ^{\frac{1}{2}}[/tex]

[tex]\frac{dy}{dx}=\frac{1}{2\sqrt{2+x}}>0 \Longrightarrow a_{n+1}>a_n[/tex]
 
Last edited:
Physics news on Phys.org
You'd have to prove not that the function itself is increasing but that the nth iterate of x is less than the n+1st iterate of x. IF f is increasing then x<f(x) will to the job, I think, because then you could take f of both sides n times to get f^n(x)<f^n+1(x).

a_n=f^n(x).
 
Ok I gave it some thought and I really can't give you a definitive answer but I can ask you why you think that your analogous function is analogous? The question posed in the book will have a_infinity = 2 and in fact the function converges to the function y^2 - y - 2 = 0, whereas y = sqrt(2+x) goes well beyond 2. It just doesn't add up too well to me. I'll delete this if someone gives a better response (or maybe my incorrectness will compell someone to answer correctly)
 
Guys,

I've just found out it is better to use mathematical induction or graphical methods instead. Thanks for the help.
 
I've used Differential Calculus to find out when does it increase or decrease a sequence with an anologous function, and then just check for n>= 1 values. I see no problem using this method as long as you understand what you're doing.
 
Oh... really? That's good.

Thank you very much!
 

Similar threads

Replies
11
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 7 ·
Replies
7
Views
1K
  • · Replies 21 ·
Replies
21
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
28
Views
2K