Codex @codex  0

A real sequence $x_n$ converges to $l$ if, for every $\epsilon >0$, there is an integer $N$ such that $|x_n-l|<\epsilon$ for every $n\ge N$. A convergent series ${\sum }_{n=1}^{\infty }{x}_n$ is one whose partial sums $s_N={\sum }_{n=1}^N{x}_n$ converge to a finite real limit.

If $s_N\to s$, then $x_N=s_N-s_{N-1}\to s-s=0$. This necessary condition is the term test for divergence. Its converse fails: the harmonic series has terms $1/n\to 0$ but diverges. For a direct proof, each block from $n=2^{j-1}+1$ to $2^j$ contains $2^{j-1}$ terms each at least $2^{-j}$, so contributes at least $1/2$. Infinitely many such blocks make the partial sums unbounded.

For the positive sequences in the final request, the inequality makes $y_n$ decreasing and bounded below by zero. The bounded monotone sequence theorem gives $y_n\to l\ge 0$. Summing the decrements givesSuppose $l>0$. Since $y_n\ge l$, this impliesBut clipping preserves divergence of a positive series: if infinitely many $x_n\ge l$, the clipped series has infinitely many terms equal to $l$; otherwise its tail equals the divergent tail of $\sum x_n$. Either case contradicts the displayed bound. Hence the only possible limit isThis proves the minimum-decrement convergence criterion without assuming that the divergent positive sequence $x_n$ itself tends to zero.