<?xml version="1.0" encoding="UTF-8"?>

<record version="5" id="2130">
 <title>monotonically decreasing</title>
 <name>MonotonicallyDecreasing</name>
 <created>2002-02-18 21:33:39</created>
 <modified>2005-08-16 00:49:23</modified>
 <type>Definition</type>
 <creator id="2" name="akrowne"/>
 <author id="2" name="akrowne"/>
 <classification>
	<category scheme="msc" code="40-00"/>
 </classification>
 <synonyms>
	<synonym concept="monotonically decreasing" alias="monotone decreasing"/>
	<synonym concept="monotonically decreasing" alias="strictly decreasing"/>
 </synonyms>
 <related>
	<object name="MonotonicallyIncreasing"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

%\usepackage{psfrag}
%\usepackage{graphicx}
%\usepackage{xypic}</preamble>
 <content>A sequence $(s_n)$ is \emph{monotonically decreasing} if 

$$ s_m &lt; s_n \;\forall\; m &gt; n $$

Similarly, a real function $f(x)$ is monotonically decreasing if

$$ f(x) &lt; f(y) \;\forall\; x &gt; y$$

Compare this to monotonically nonincreasing.

\textbf{Conflict note.} In other context, such as \cite{NIST}, this is called \emph{strictly decreasing}.  When this is the case, ``monotonically nonincreasing'' is instead called ``monotonically decreasing.'' 

\begin{thebibliography}{3}
\bibitem{NIST}  ``\PMlinkexternal{strictly decreasing}{http://www.nist.gov/dads/HTML/strictlyDecreasing.html},'' from the NIST Dictionary of Algorithms and Data Structures, Paul E. Black, ed.
\end{thebibliography}</content>
</record>
