What is it?
A monotone sequence converges if and only if it is bounded. It is the cleanest way to prove convergence without knowing the limit in advance.
Statement
If and for all , then .
Idea of the proof
Let (it exists by completeness). Some , and monotonicity keeps every later term in .
Where it shows up in AI
With a small enough step the loss decreases monotonically and is bounded below, so the loss values converge.
Where is it used?
Computing topics reachable from here, through the chain of ideas that leads to them: