monotonically nondecreasingMonotonicallyNondecreasing2002-02-18 21:37:592005-08-16 00:38:58Definition\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
%\usepackage{psfrag}
%\usepackage{graphicx}
%\usepackage{xypic}A sequence $(s_n)$ (with real elements) is called \emph{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.
\textbf{Conflict note.} In other contexts, such as \cite{NIST}, this is called \emph{monotonically increasing} (despite the fact that the sequence could be ``flat.'' In such a context, our definition of ``monotonically increasing'' is called \emph{strictly increasing}.
\begin{thebibliography}{3}
\bibitem{NIST} ``\PMlinkexternal{monotonically increasing}{http://www.nist.gov/dads/HTML/monotoncincr.html},'' from the NIST Dictionary of Algorithms and Data Structures, Paul E. Black, ed.
\end{thebibliography}