$$a_{n+1} = \frac{a_n + b_n}{2}, \frac{1}{b_{n+1}} = \frac{1}{2}\left(\frac{1}{a_n} + \frac{1}{b_n}\right)$$ $$a_1 > 0, b_1 > 0; n \geq 1$$ Show that $\lim_{n\to\infty} a_n = \lim_{n\to\infty} b_n = \sqrt{a_1 b_1}$.
Aryan Yadav, AIR 31, 2025
Since AM $\geq$ HM
$\Rightarrow a_{n+1} \geq b_{n+1}$ $\forall$ $n \geq 1$
Case-I : Assume $a_1 \geq b_1$
Since $a_n \geq b_n$ $\forall$ $n \geq 1$
$a_{n+1} = \frac{a_n + b_n}{2} \leq \frac{a_n + a_n}{2} \leq a_n$
$\Rightarrow a_{n+1} \leq a_n$ $\forall$ $n \geq 1$ $\Rightarrow$ $a_n$ is monotonic decreasing
since $a_n \geq b_n \Rightarrow \frac{1}{a_n} \leq \frac{1}{b_n}$
$\Rightarrow \frac{1}{b_{n+1}} \leq \frac{1}{2}\left(\frac{2}{b_n}\right)$
$\Rightarrow b_{n+1} \geq b_n \;\; \forall n \geq 1$
$\Rightarrow$ $b_n$ is monotonic increasing
Also $a_{n+1} = \frac{a_n + b_n}{2}$
Since $b_n$ is monotonically increasing
$\Rightarrow b_n \geq b_1 \;\; \forall n \geq 1$
and since $a_n \geq b_n \Rightarrow a_n \geq b_1 \;\; \forall n \geq 1$
Hence $a_n$ bounded below by $b_1$
Similarly $a_n \leq a_1 \;\; \forall n \geq 1$
$\Rightarrow b_n \leq a_1 \;\; \forall n \geq 1$ as $b_n \leq a_n$
Hence $b_n$ bounded above by $a_1$
$b_n$ is monotonically increasing, bounded above
$a_n$ " " decreasing, " below
$\Rightarrow$ both $\{a_n\}, \{b_n\}$ converge
let $\lim_{n\to\infty} a_n = a$ , $\lim_{n\to\infty} b_n = b$
$a_{n+1} = \frac{a_n + b_n}{2}$
$\Rightarrow \lim_{n\to\infty} a_{n+1} = \frac{\lim_{n\to\infty}(a_n + b_n)}{2}$
$\Rightarrow a = \frac{a+b}{2}$
$\Rightarrow a = b$
NOTE : If $a_1 < b_1$ solving similarly
We get $a_2 = \frac{a_1+b_1}{2} > a_1$
$\vdots$
$a_{n+1} > a_n \;\forall\; n \geq 1$
$b_{n+1} < b_n \;\forall\; n \geq 1$
$\{a_n\}$ Monotonic increasing bdd above by $b_1$
$\{b_n\}$ " decreasing " below by $a_1$
Now, $AM \times HM = GM^2$
$\Rightarrow a_{n+1} \cdot b_{n+1} = a_n b_n$
$\Rightarrow a_n b_n = a_1 b_1 \;\forall\; n \geq 1$
$\lim_{n\to\infty}(a_n b_n) = a_1 b_1$
$\Rightarrow ab = a_1 b_1$
but $a = b$
$\Rightarrow$ $\boxed{a = b = \sqrt{a_1 b_1}}$