From ProofWiki
Jump to: navigation, search


Let $\left({S, \preceq}\right)$ be a totally ordered set.

Then a sequence $\left \langle {a_k} \right \rangle_{k \in A}$ of terms of $S$ is decreasing iff:

$\forall j, k \in A: j < k \implies a_k \preceq a_j$

Real Sequence

The above definition for sequences is usually applied to real number sequences:

Let $\sequence {x_n}$ be a sequence in $\R$.

Then $\sequence {x_n}$ is decreasing if and only if:

$\forall n \in \N: x_{n + 1} \le x_n$

Also known as

A decreasing sequence is also referred to as order-reversing.

Also see