# Proof of Convergence for Recursive Sequence

Printable View

• June 3rd 2010, 07:18 AM
moemoe
Proof of Convergence for Recursive Sequence
I am trying to figure out how to prove that the following sequence converges:

$a_{n+1}=\sqrt{2+\sqrt{a_{n}}}$

with $a_{1}=\sqrt{2}$

Thoughts anyone?
• June 3rd 2010, 07:53 AM
moemoe
Quote:

Originally Posted by General
Since the sequence converges, then $\lim_{n\to\infty} a_n = L$ , where L is a finite number ..

Recall that, for the convergent sequence $a_n$:
$\lim_{n\to\infty} a_n=\lim_{n\to\infty} a_{n+1}$ ..

Since : $a_{n+1}=\sqrt{2+\sqrt{a_{n}}}$

By taking the limit of both sides, we will conclude the following equation :

$L=\sqrt{2+\sqrt{L}}$ , solve it for L ..

Thanks for the quick replies. I believe that in a formal proof

$L=\sqrt{2+\sqrt{L}}$

can be used to solve for the limit L if we know that the series converges. However, I need to first prove that the series converges given

$a_{1}=\sqrt{2}$

• June 3rd 2010, 07:54 AM
parkhid
I think we should say this :

$|a_{n+1} - L|<\epsilon$

and $-\epsilon < a_{n+1} - L < \epsilon$

it means :

$0 < a_{n+1} - L < 2\epsilon$

and $a_{n+1} < 2\epsilon+L$

also if $2\epsilon<<L$ we can unspot $2\epsilon$ .
and $a_{n+1} < L$

this is the proof. but to complete it

(Cool)

we should proof that $2\epsilon<<L$ . or

$\epsilon<<\frac{L}{2}$

We Know L is 1 as here :

$\lim_{n\rightarrow\infty}\sqrt{\frac{2}{a_{n}} +1} = 1$

so the $\epsilon<<0.5$
• June 3rd 2010, 07:57 AM
Plato
Quote:

Originally Posted by moemoe
However, I need to first prove that the series converges given

Show that the sequence is increasing and bounded.
Use induction to do that.
• June 3rd 2010, 08:00 AM
Defunkt
Quote:

Originally Posted by parkhid
I think we should say this :

$|a_{n+1} - L|<\epsilon$
...

You can't assume convergence if you're trying to prove it...

@moemoe: The usual way to prove that this type of recursive sequences converge is to prove by induction that the sequence is monotone and bounded.

In your case, plug in the values for the first few terms to see whether the sequence is increasing or decreasing, and then prove it by induction. After you do that, prove that it is bounded (this can be done by induction as well).

EDIT: Plato ahead of me :<
• June 3rd 2010, 03:53 PM
moemoe
So assuming

$<br /> a_{n} \geq a_{n-1} \geq 0<br />$

we have

$<br /> a_{n+1} = \sqrt{2+\sqrt{a_{n}}} \geq \sqrt{2+\sqrt{a_{n-1}}}= a_{n}<br />$

Does anyone have a slick way of showing the sequence is bounded?
• June 3rd 2010, 03:59 PM
moemoe
Maybe define a new sequence

$<br /> b_{n+1}=\sqrt{2+\sqrt{b_{n}}}<br />$ with $<br /> b_{1}=2<br />$

where $<br /> a_{n} \leq b_{n}<br />$ for each $n$ and $<br /> b_{n}<br />$ is decreasing by the same induction argument above?

Is there another simpler way?
• June 3rd 2010, 04:08 PM
Defunkt
There is a simpler way.

First, validate that $a_1, a_2 < 2$.

Now, assume $a_n < 2$ and use the induction hypothesis to prove that $a_{n+1} < 2$.
This will prove that the sequence is bounded by 2 (it doesn't mean that 2 is the limit, though..)
• June 3rd 2010, 05:47 PM
galactus
Perhaps we can try this.

By the induction step it can be shown that $a_{n}<2$

$a_{n+1}=\sqrt{2+\sqrt{a_{n}}}$

$(a_{n+1})^{2}=2+\sqrt{a_{n}}$

$(a_{n+1})^{2}-1=1+\sqrt{a_{n}}$

$(a_{n+1}+1)(a_{n+1}-1)=1+\sqrt{a_{n}}$

Since for all n, $a_{n}<2$

$a_{n+1}-1<1$

$a_{n+1}+1>a_{n}+1$

$a_{n+1}>a_{n}$

and it is monotone increasing.
• June 4th 2010, 01:59 AM
chisigma
The sequence is defined recursively as...

$\Delta_{n} = a_{n+1} - a_{n} = \sqrt{2 + \sqrt{a_{n}}} - a_{n} = f(a_{n})$ (1)

The function $f(x)= \sqrt{2 + \sqrt{x}} - x$ is represented here...

http://digilander.libero.it/luposabatini/MHF63.bmp

It has a single zero at $x_{0} = 1.83117720721...$ and because $|f(x)|$ is less that the line crossing the x axis in $x=x_{0}$ with unity negative slope, any $a_{0} \ge 0$ will produce a sequence converging at $x_{0}$ without oscillations...

Kind regards

$\chi$ $\sigma$
All times are GMT -8. The time now is 02:12 PM.
{"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": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 49, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "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": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9427016973495483, "perplexity_flag": "middle"}