Show that the sequence $(x_n)$ defined as $x_{n+1}=\sqrt[3]{x_n+x_{n-1}}, x_0=3,x_1=2$ converges. Here i wil try to prove that $(x_n)$ converges considering all details. So. i would like to have a critical feedback on my proof and would like to know if i missed something or did much more than it should be.. Here $\mathbf{R}^*$ will denote $\mathbf{R}\ \ \not \ \{0\}$.
Consider a function $f(x)=\sqrt[3]{x}$. First, we show that it's defined on $\mathbf{R}$ and then we will show that $f(x)$ is an increasing function on $\mathbf{R}$.
We remark that $f(x)$ is differntiable on $\mathbf{R}^*$. Let $a \in \mathbf{R}^*$. By definition of differentiable function the $\lim_{x\to a}\frac{f(x)-f(a)}{x-a}$ msut exist:
$\lim_{x\to a}\frac{f(x)-f(a)}{x-a}=\frac{1}{3\sqrt[3]{a^2}}$ and so it exists $\forall a \in \mathbf{R}^*$ as we chose an arbitrary $a$. So $f(x)$ is differentiable on $\mathbf{R}^*$ and so is continious on $\mathbf{R}^*$.
We show now that $f(x)$ is continious on $0$. To show that we pass by the definition :
$\forall \varepsilon>0 \ \exists \delta>0 \ \forall x \in \mathbf{R}$: $|x|<\delta \implies |f(x)|=|\sqrt[3]{x}|<\varepsilon$
To satisfy the definition, one can take $\delta=\varepsilon^3$, so it holds and we can conclude that $f(x)$ is continious on $\mathbf{R}$.
Let $a,b \in \mathbf{R}$ such that $a<b$. As $f(x)$ is continious on $\mathbf{R}$ we can write:
$a<b \iff \sqrt[3]{a}<\sqrt[3]{b} \iff f(a)<f(b)$
As $a,b$ are arbitrary numbers (satisfying $a<b$), we can conclude that $f(x)$ is strictly incrasing function.
Now, as all preliminary results are proven, we can show that $(x_n)$ is a convergent sequence. For that, we show that $(x_n)$ is monotonic and bounded.
$\bullet$ $(x_n)$ is decreasing: Suppose $x_{n+1}<x_n$. The previous inequality holds for $n=1$ so we can suppose that it works up to a certain $n\in \mathbf{N}^*$. We show nowthat it holds for $n+1$:
$x_{n+2}<x_{n+1} \iff \sqrt[3]{x_{n+1}+x_n}<\sqrt[3]{x_n+x_{n-1}}$. But, as $f(x)=\sqrt[3]{x}$ is strictly increasing function and by induction hypothesis $x_{n+1}<x_n$, we can conclude that $x_{n+2}<x_{n+1}$ and so $x_{n+1}<x_n$ holds $\forall n\in\mathbf{N}^*$. So $(x_n)$ is decreasing.
$\bullet$ $(x_n)$ is bounded below: Suppose $x_n>1$. It holds for $n=1$ so we can suppose that it works up to a certain $n\in \mathbf{N}^*$. We want to show now that t holds for $n+1$:
$x_{n+1}>1 \iff \underbrace{x_{n}}_{>1}+\underbrace{x_{n-1}}_{>1}>1$ which is true, because $(x_n)$ is decreasing. So we conclude that $x_n>1 \ \forall n\in \mathbf{N}^*$.
So, we have shown that $(x_n)$ converges.