|
A sequence $(s_n)$ (with real elements) is called monotonically nondecreasing if
$$ s_m \ge s_n \;\forall\; m > n $$
Similarly, a real function $f(x)$ is called monotonically nondecreasing if
$$ f(x) \ge f(y) \;\forall\; x > y $$
Compare this to monotonically increasing.
Conflict note. In other contexts, such as [1], this is called monotonically increasing (despite the fact that the sequence could be ``flat.'' In such a context, our definition of ``monotonically increasing'' is called strictly increasing.
- 1
- ``monotonically increasing,'' from the NIST Dictionary of Algorithms and Data Structures, Paul E. Black, ed.
| 
