Given the following conditions: $$\forall n\in \mathbb{N}: a_n \leq a_{n+1} ; b_n \geq b_{n+1} $$ $$\forall n\in \mathbb{N}: a_n \leq b_{n} $$ $$\underset{n\rightarrow\infty}{\lim}a_{n}-b_{n} = 0$$ I am trying to prove that $\underset{n\rightarrow\infty}{\lim}a_{n}=\underset{n\rightarrow\infty}{\lim}b_{n}$
I tried to use the Epsilon-approach, squeeze theorem and tried to bound those sequences and because both are monotonic to say the converge, but still couldn't manage to find any bound on those sequences. Any suggestions?
$$a_1 \le a_2 \le \ldots a_n \leq b_n \le \ldots b_1$$
The sequence $a_i$ is bounded above by $b_1$. Hence by monotone convergence theorem, $\lim_{n \to \infty} a_n$ exists.
Similarly, $\forall i, b_i \ge a_1$.