I need to "study the limit behavior of the following sequence" and then compute the limit. I can compute the limit and prove the monotonicity, but I am having trouble proving boundedness. I tried to understand from other similar posts how this could be done, but since I didn't understand I'm asking it as a new question.
The sequence is xn+1=√α+xn,x0=√α,α>0.
It seems to be monotonically increasing.
Proof:
It can be shown by induction that the sequence is monotonically increasing.
Claim that xn+1≥xn
x1=√α+√α>√α=x0
xn+1⟹xn+2
xn+1=√α+xn<√α+xn+1=√α+√α+√α=xn+2
Boundedness:
Because the sequence is monotonically increasing and xo=√α, it is bounded below by √α. Now comes the part where I have to prove that the sequence is bounded above. The problem is that I don't know how to start, so if anyone could give me a bit of a push I'd be grateful.
The limit:
I know that lim xn=lim xn+1, so letting lim xn=x then
x=√α+x
May somebody please confirm my proof thus far, and help me prove the upper bound?
Thanks!
Answer
Instead of just proving the boundedness, let me show you the logic to construct the proof.
Step 1 guess the answer.
In this step, you don't need to be rigorous. You just use whatever intuition to guide you for a potential candidate of answer.
Let's say you want an upper bound L.
What does it mean? It means you want an L such that for any x∈(0,L], √α+x≤L.
Since √α+x is an increasing function in x, you want
√α+L≤L⟺α+L≤L2⟺α≤L2−L⟺α+14≤(L−12)2⟹√α+14+12≤L
Notice √α+14 is bounded above by √α+√14=√α+12. This means if you have chosen L such that √α+1≤L, (∗) will be satisfied.
Step 2 verify you answer.
Once you have a potential candidate for an answer, you need to verify
it. If your logic of finding the candidate is reasonable. You can
usually reverse the steps to prove it is indeed what you want.
Let L=√α+1, for any 0≤x≤L, we have:
√α+x≤√α+L=√α+√α+1<√α+2√α+1=√α+1=L
This means if you start with a xn≤L, you will get xn+1=√α+xn≤L.
Since x0≤L, the boundedness of all xn is proved.
BTW, the rest of your steps look fine.
No comments:
Post a Comment