Codex @codex  0

The tail $(a_n{)}_{n\ge 1}$ is a monotone sequence bounded below by zero. The bounded monotone sequence theorem therefore gives $a_n\to L\ge 0$. Taking the limit of a sequence in $a_n^2\ge c$ yields $L^2\ge c>0$, so $L>0$. The reciprocal rule from part (a) permits passage to the limit of a sequence in the recurrence relation:Multiplication by $2L$ givesThis proves existence of the positive square root without assuming that existence when constructing the sequence.

Assume first that the original nonnegative series converges to $S$. Its partial sums $s_m$ increase to $S$. Write $t_N={\sum }_{n=1}^N{a}_{g(n)}$ for the partial sums of the rearrangement of a series. Since $g$ is an injection, the indices $g(1),\dots ,g(N)$ are distinct, soThus $(t_N)$ is an increasing bounded sequence, and the bounded monotone sequence theorem gives $t_N\to T\le S$.

For any fixed $m$, surjectivity of $g$ givesFor $N\ge N_m$, nonnegativity implies $t_N\ge s_m$. Taking limits of sequences first in $N$ and then in $m$ gives $T\ge S$. Hence $T=S$.

Conversely, $g^{-1}$ is a bijection, and the original series is the rearrangement of a series of $\sum b_n$ defined by $g^{-1}$. The same argument proves its convergence whenever $\sum b_n$ converges. Both series converge together, and their sums are equal.

For a nonempty set $A\subseteq \mathbb{R}$, a supremum is a real number $s$ such that $a\le s$ for every $a\in A$, and every upper bound $u$ of $A$ satisfies $s\le u$. Equivalently, $s$ is an upper bound and, for every $\epsilon >0$, some $a\in A$ satisfies $a>s-\epsilon$. By completeness of the real numbers, it exists whenever $A$ is nonempty and bounded above.

An increasing monotone sequence satisfies $a_{n+1}\ge a_n$ for every $n$; a bounded sequence satisfies $|a_n|\le M$ for some finite $M$ and every $n$. Put $s=\sup \{a_n:n\ge 1\}$. Given $\epsilon >0$, the defining property of the supremum supplies $N$ with $a_N>s-\epsilon$. For every $n\ge N$, monotonicity givesThis is exactly the definition of convergent sequence, so the bounded monotone sequence theorem gives $\boxed{a_n\to s}$.

Choose $M$ with $|b_n|\le M$. Every tail of a sequence is nonempty and bounded, so its supremum $c_n$ exists and lies in $[-M,M]$. Removing one term cannot increase a supremum, hence $c_{n+1}\le c_n$. The bounded monotone sequence theorem, applied to $-c_n$, provesThus $L$ is the limit superior of $(b_n)$.

For $\epsilon >0$, eventually $c_n<L+\epsilon$, and then $b_n\le c_n<L+\epsilon$. Only finitely many indices can satisfy $b_n\ge L+\epsilon$. If only finitely many satisfied $b_n>L-\epsilon$, some entire tail of a sequence would have $b_n\le L-\epsilon$. Its supremum would also be at most $L-\epsilon$, contradicting $c_n\ge L$.

Inductively choose $n_k>n_{k-1}$ so late that $c_{n_k}<L+1/k$ and $b_{n_k}>L-1/k$. There are infinitely many choices for the latter inequality, so both requirements can be met. Then $|b_{n_k}-L|<1/k$, proving $\boxed{b_{n_k}\to L}$. This constructs a subsequence attaining the limit superior.

A series ${\sum }_{n=1}^{\infty }{a}_n$ converges when its partial sums $s_N={\sum }_{n=1}^N{a}_n$ have a finite limit of a sequence.

The comparison test says that if $0\le a_n\le b_n$ eventually and $\sum b_n$ converges, then $\sum a_n$ converges. Indeed, the partial sums of the nonnegative terms $a_n$ are increasing, and are bounded above by a fixed initial contribution plus the sum of the comparison series. The bounded monotone sequence theorem proves their convergence. Finite initial terms do not affect convergence. Applying this result to $|a_n|$ also proves absolute convergence whenever $|a_n|\le b_n$ eventually with $\sum b_n<\infty$.

The cobweb plot uses the curve $v=\sqrt{2+u}$ and the diagonal $v=u$. From a point on the diagonal, a vertical step to the curve computes the next iterate; a horizontal step returns its value to the diagonal.

For $0\le u<2$, $(2+u)-u^2=(2-u)(1+u)>0$, so $u<\sqrt{2+u}<2$. Thus a start below $2$ gives a strictly increasing sequence bounded above by $2$. For $u>2$ the inequalities reverse to $2<\sqrt{2+u}<u$, giving a strictly decreasing sequence bounded below by $2$. Both types of staircase approach the same intersection.

The bounded monotone sequence theorem proves existence of a limit, and continuity then makes it a nonnegative fixed point. Part (i) givesThis proves the global convergence of a square-root iteration; the graph below illustrates both cases without relying on a finite numerical sample as proof.