(more info)

Math for the people, by the people.

Main Menu

sections Encyclopædia
Papers
Books
Expositions

meta Requests (198)
Orphanage
Unclass'd
Unproven (490)
Corrections (7)
Classification

talkback Polls
Forums
Feedback
Bug Reports

downloads Snapshots
PM Book

information News
Docs
Wiki
ChangeLog
TODO List
Legalese
About

Entry average rating: No information on entry rating

monotonically nonincreasing

(Definition)

A sequence is monotonically nonincreasing if

$\displaystyle s_m \le s_n$ for all $\displaystyle m > n$

Similarly, a real function is monotonically nonincreasing if

$\displaystyle f(x) \le f(y)$ for all $\displaystyle x > y$

Compare this to monotonically decreasing.

Conflict note. In some contexts, such as [1], this is called monotonically decreasing (in turn, our “monotonically decreasing” is called “strictly decreasing”). This is unfortunately counter-intuitive, since a sequence or function that is “flat” (such as ) is somehow “decreasing.” Beware!

Examples

$(s_n) = 1, 0, -1, -2, \ldots$ is monotonically nonincreasing. It is also monotonically decreasing.
$(s_n) = 1, 1, 1, 1, \ldots$ is nonincreasing but not monotonically decreasing.
$(s_n) = (\frac{1}{n+1})$ is nonincreasing (note that is nonnegative).
$(s_n) = 1, 1, 2, 1, 1, \ldots$ is not nonincreasing. It also happens to fail to be monotonically nondecreasing.
$(s_n) = 1, 2, 3, 4, 5, \ldots$ is not nonincreasing, rather it is nondecreasing (and monotonically increasing).

Bibliography

1: ``monotonically decreasing,'' from the NIST Dictionary of Algorithms and Data Structures, Paul E. Black, ed.

"monotonically nonincreasing" is owned by akrowne.

(view preamble)