\(\DeclarePairedDelimiterX{\Set}[2]{\{}{\}}{#1 \nonscript\;\delimsize\vert\nonscript\; #2}\) \( \DeclarePairedDelimiter{\set}{\{}{\}}\) \( \DeclarePairedDelimiter{\parens}{\left(}{\right)}\) \(\DeclarePairedDelimiterX{\innerproduct}[1]{\langle}{\rangle}{#1}\) \(\newcommand{\ip}[1]{\innerproduct{#1}}\) \(\newcommand{\bmat}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\barray}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\mat}[1]{\begin{matrix}#1\end{matrix}}\) \(\newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}}\) \(\newcommand{\mathword}[1]{\mathop{\textup{#1}}}\)
Needs:
Sequences
Needed by:
None.
Links:
Sheet PDF
Graph PDF

Monotone Sequences

Why

If the base set of a sequence has a partial order, then we can discuss its relation to the order of sequence.

Definition

A sequence on a partially ordered set is non-decreasing if whenever a first index precedes a second index the element associated with the first index precedes the element associated with the second element. A sequence on a partially ordered set is increasing if it is non-decreasing and no two elements are the same.

A sequence on a partially ordered set is non-increasing if whenever a first index precedes a second index the element associated with the first index succedes the element associated with the second element. A sequence on a partially ordered set is decreasing if it is non-increasing and no two elements are the same.

A sequence on a partially ordered set is monotone if it is non-decreasing, or non-increasing. An increasing sequence is non-decreasing. A decreasing sequences is non-increasing. A sequence on a partially ordered set is strictly monotone if it is decreasing, or increasing.

Notation

Let $A$ a non-empty set with partial order $\preceq$. Let $\seq{a}$ a sequence in $A$.

The sequence is non-decreasing if $n \leq m \implies a_n \preceq a_m$, and increasing if $n < m \implies a_n \prec a_m$. The sequence is non-increasing if $n \leq m \implies a_n \succeq a_m$, and decreasing if $n < m \implies a_n > a_m$.

Examples

Let $A$ a non-empty set and $\seq{A}$ a sequence of sets in $\powerset{A}$. Partially order elements of $\powerset{A}$ by the relation contained in.
Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc About Show the old page view