# Finding the limit of $x_1=0 , x_{n+1}=\frac{1}{1+x_n}$

I have had big problems finding the limit of the sequence $x_1=0 , x_{n+1}=\frac{1}{1+x_n}$. So far I've only succeeded in proving that for $n\geq2$: $x_n>0\Rightarrow x_{n+1}>0$

(Hopefully that much is correct: It is true for $n=2$, and for $x_{n+1}>0$ exactly when $\frac{1}{1+x_n}>0$, which leads to the inequality $x_n>-1$ which is true by the induction assumption that $x_n>0$.)

On everything else I failed to come up with answers that make sense (such as proving that $x_{n+1}>x_n \forall n\geq1$). I'm new to recursive sequences, so it all seems like a world behind the mirror right now. I'd appreciate any help, thanks!

-
Have you tried writing down the first 5 or 10 terms of the sequence? You know $x_1=0$, so $x_2=1$, $x_3=1/2$, and so on. This usually helps get me going. – icurays1 Nov 12 '12 at 9:25
I did, it's basically fibonacci/fibonacci(n+1), or that much I could tell. But I'm not sure how to use that knowledge. – Dahn Jahn Nov 12 '12 at 9:27

1
Try solving $x=\dfrac{1}{1+x}$. It does not prove convergence, but one of the solutions is the limit if such a limit exists. – Henry Nov 12 '12 at 9:32

1
@DahnJahn: or you can use the closed form formula for the Fibonacci numbers. – Ittay Weiss Nov 12 '12 at 9:39
Couldn't I maybe prove that it is bounded and increasing without proving it's similarity to Fibonnaci? – Dahn Jahn Nov 12 '12 at 9:39
show 3 more comments

## 5 Answers

It is obvious that $f:x\mapsto\frac1{1+x}$ is a monotonically decreasing continuous function $\mathbf R_{\geq0}\to\mathbf R_{\geq0}$, and it is easily computed that $\alpha=\frac{-1+\sqrt5}2\approx0.618$ is its only fixed point (solution of $f(x)=x$). So $f^2:x\mapsto f(f(x))$ is a monotonically increasing function that maps the interval $[0,\alpha)$ into itself. Since $x_3=f^2(x_1)=\frac12>0=x_1$ one now sees by induction that $(x_1,x_3,x_5,...)$ is an increasing sequence bounded by $\alpha$. It then has a limit, which must be a fixed point of $f^2$ (the function mapping each term of the sequence to the next term). One checks that on $\mathbf R_{\geq0}$ the function $f^2$ has no other fixed point than the one of $f$, which is $\alpha$, so that must be value of the limit. The sequence $(x_2,x_4,x_6,...)$ is obtained by applying $f$ to $(x_1,x_3,x_5,...)$, so by continuity of $f$ it is also convergent, with limit $f(\alpha)=\alpha$. Then $\lim_{n\to\infty}x_n=\alpha$.

-

I like this solution.  You just prove $(x_1,x_3,\ldots)$ is increasing (and hence converges), then use continuity of $f$ to prove $(x_2,x_4,\ldots)$ converges to the same limit. – littleO Nov 12 '12 at 11:22
Thanks! Your answer in particular got me to the final idea I used to prove this, only I used the sort of math I know how to use :) – Dahn Jahn Nov 13 '12 at 14:26

Here is a way to show that the sequence converges to the unique positive solution to $a=1/(1+a)$: Define $f(x)=1/(1+x)$. Then $f'(x)=-1/(1+x)^2$. For every $n$, the mean value theorem gives $$x_{n+1}-a=f(x_n)-f(a)=(x_n-a)f'(c_n)$$ for some $c_n$ between $x_n$ and $a$. Since $-1<f'(x)<0$ for all $x>0$, this shows that $\lvert x_n-a\rvert$ decreases with $n$. Moreover, we already have $f'(1/2)=-4/9$, and $f'$ is increasing, so $-4/9<f'(c_n)<0$ for all $n\ge2$. Thus $\lvert x_n-a\rvert$ decreases at least as fast as $(4/9)^n$, i.e., geometrically. In particular, the $x_n-a\to0$.

Addendum: To do this without differentiation, just rely on the computation $$f(x)-f(y)=\frac1{1+x}-\frac1{1+y}=\frac{y-x}{(1+x)(1+y)}$$ instead.

-
Isn't this sequence a Cauchy one? – Babak S. Nov 12 '12 at 9:43
It converges, therefore it is Cauchy. But yes, you can use this sort of argument to show the Cauchy property directly, but I wouldn't know if the OP is expected to know about Cauchy sequences. – Harald Hanche-Olsen Nov 12 '12 at 9:45
Exactly!. In fact, I wish the OP consider why did(and how did) you take $f(x)$ as defined above. Yours here is perfect Harald +1. – Babak S. Nov 12 '12 at 9:47
The problem would be that I'm not even supposed to "know" of differentiation and the mean value theorem yet (first uni semester..). I feel bad for putting such restraints on the method of solution, but although I shall definitely take a look at this method, I can't use it for my proof. But thanks for broadening my horizons :) – Dahn Jahn Nov 12 '12 at 9:47

1
Thanks. I do understand your approach, although at this point I'd never come up with it myself. Still, isn't there a more 'elementar' way of proving this? Or rather - there has to be one! – Dahn Jahn Nov 12 '12 at 9:58
show 1 more comment

Let $\omega\gt0$ such that $\omega^2+\omega=1$, then $x_{n+1}-\omega=-\omega\cdot\frac1{1+x_n}\cdot(x_n-\omega)$ hence $$|x_n-\omega|\leqslant\omega^n\cdot|x_0-\omega|,$$ and the rest is easy since $\omega\lt1$.

-

Firstly, I'd like to thank everybody who contributed! Your insight helped me greatly in understanding the problem. Here is my solution (one that I feel is more down to earth in terms of mathematical skills used!)

It is easy enough to prove that $x_n\in[0,1] \forall n$ through induction. Now we definitely have a bounded sequence.

However, it is not monotonic and after some investigation, one can see that it seems to oscilate around its limit $\frac{\sqrt{5}-1}{2}$ - that is, if it actually converges!

Now the crucial step. I used the expression $x_{n+2}=\cfrac{1}{1+\cfrac{1}{1+x_n}}$ to check for which values it is monotonic, which lead to this:

$x_{n+2}>x_n$ for $x_n\in(0,\frac{\sqrt{5}-1}{2})$

$x_{n+2}<x_n$ for $x_n>\frac{\sqrt{5}-1}{2}$

Thus we have two subsequences, both of which are bounded and monotonic and converging to the same limit, only from two different sides.

This answer isn't probably full, but the additional proofs needed are trivial enough, this was the most important step I needed to take to get to the answer.

-

I wonder which mathematical skills my answer is using, that are not down to earth. – Did Nov 13 '12 at 14:38
Your answer seems to be mathematically beautiful, but even after some working with pen and paper, I wasn't able to understand what is going on there. I wish I did! – Dahn Jahn Nov 13 '12 at 14:48
Did you try to compute $x_{n+1}-\omega$ in terms of $x_n$? Once again, I wonder what could prevent you to reach the first formula stated in my answer (especially since you have some pen and paper at your disposal...)--but surely I am missing something. – Did Nov 13 '12 at 18:25
Like that approach. +1 – Babak S. Dec 30 '12 at 9:50

If you're willing to assume the sequence converges to a number $x$, then you can see that $x = \frac{1}{1 + x}$, and then you can solve for $x$.

-
It is a very dangerous practice to be willing to assume a limit exists and then compute with it as if it really exists to find out what it would be if it were to exists. What if it does not exist??? The question was about finding the limit, and not about finding the value of the limit, should that exist. – Ittay Weiss Nov 12 '12 at 9:31
Then I'd get $x=\frac{-1\pm\sqrt5}{2}$, of which the positive one will be the right candidate. How to prove that it really does converge to that, though? edit: oh and sorry, I actually do want to find the value of the limit! – Dahn Jahn Nov 12 '12 at 9:32
@IttayWeiss: Yes and no. You shouldn't stop there, but it makes very good sense to find out first what the limit must be if it exists, and then try to show that the sequence does (or does not) converge to that limit. – Harald Hanche-Olsen Nov 12 '12 at 9:33

1
I agree that it's important to be careful about issues of convergence, but a different viewpoint is "too much rigor teaches rigor mortis". There's some value in doing "Eulerian math" as well. – littleO Nov 12 '12 at 9:33
@Harald: Yes and no :) It is a good technique since it would either show the limit does not exist or at least give you (several) candidates. But the question posted was about finding the limit and thus the solution offered, I find, reinforces dangerous tendencies of not worrying about existence proofs. – Ittay Weiss Nov 12 '12 at 9:35
show 6 more comments
{"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": 73, "mathjax_display_tex": 3, "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": true, "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": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9623653292655945, "perplexity_flag": "head"}