# Show $\lim_n(x_{n+1} - x_n) = 0$ if $<x_n>$ satisfies $2x_n \le x_{n-1} + x_{n+1}$ for all $n \in \mathbb N$

Let $<x_n>$ be a bounded real number sequence. Show $\lim_n(x_{n+1} - x_n) = 0$ if $<x_n>$ satisfies $2x_n \le x_{n-1} + x_{n+1}$ for all $n \in \mathbb N$.

My try : Let $a_n = x_{n+1} - x_n$. The given condition is same as $x_n - x_{n-1} \le x_{n+1} - x_n$. Therefore, $<a_n>$ is monotonic, bounded, and convergent. If we can show $\sum_{n=0}^\infty a_n = 0$, then $lim_n(x_{n+1} - x_n) = 0$.

Now I'm stuck in how to show $\sum_{n=0}^\infty a_n = 0$. Is my approach right? If so, please give me an hint.

• This seems like a good start, but have you used that the sequences is bounded? Apr 12, 2017 at 11:36
• @MichaelBurr Was not the boundedness of $x_n$ used to conclude that $a_n$ is bounded? Apr 12, 2017 at 11:48
• I think you should make use of telescoping sums. Apr 12, 2017 at 11:52
• By the way, it is enough to show $\sum_n a_n < \infty$ to conclude $a_n \to 0$; one does not need to know the value of the sum. Apr 12, 2017 at 11:53
• @LoveTooNap29 One approach is to use the boundedness again. Apr 12, 2017 at 11:53

• You have a good start to observe that $x_n-x_{n-1}\leq x_{n+1}-x_n$.
• Suppose that for some $m$, $x_m-x_{m-1}=\varepsilon>0$. Then, for all $n\geq m$, $x_n-x_{n-1}\geq\varepsilon>0$. This implies that $x_n\geq x_{m-1}+(n-m+1)\varepsilon$. This gives that $x_n$ is unbounded, a contradiction.
• Therefore, $x_n$ is a decreasing sequence. Since bounded decreasing sequences are convergent, $x_n$ is a convergent sequence. But the the pairwise differences in convergent sequences go to zero.
• Thanks for detailed hint. You proved that $<x_n>$ is decreasing, bounded sequence. Therefore, $<x_n>$ is convergent, and it is cauchy sequence. As $<x_n>$ is a cauchy sequence, $lim_n(x_{n+1} - x_n) = 0$. Do I understand right? Apr 12, 2017 at 12:50