TheoremBase

Monotone Sequences and Subsequences: Comparison of All Terms, Growth of the Indices, and Subsequences of Subsequences

A monotone sequence compares any two of its terms in the order of their indices; a strictly increasing sequence of natural numbers satisfies σ(k) ≥ k and preserves and reflects order; and a subsequence of a subsequence is a subsequence.

Statement

In the setting of The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion, let monotone sequences and subsequences be as in Monotone Sequences §monotone and Subsequences §subsequence, with N\mathbb{N} carrying its order ≤\le of The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion §order, a total order with strict relation << by Arithmetic and Order of the Natural Numbers §partial-order and Arithmetic and Order of the Natural Numbers §trichotomy.

Let (an)(a_{n}) be a sequence in a set XX with a partial order ≤\le and strict relation <<, and let m,n∈Nm,n\in\mathbb{N} with m≤nm\le n. If (an)(a_{n}) is nondecreasing, then am≤ana_{m}\le a_{n}; if it is nonincreasing, then an≤ama_{n}\le a_{m}. If moreover m<nm<n and (an)(a_{n}) is strictly increasing, respectively strictly decreasing, then am<ana_{m}<a_{n}, respectively an<ama_{n}<a_{m}.

Let σ,τ:N→N\sigma,\tau:\mathbb{N}\to\mathbb{N} be strictly increasing.

k≤σ(k)k\le\sigma(k) for every k∈Nk\in\mathbb{N}, and σ(j)<σ(k)\sigma(j)<\sigma(k) if and only if j<kj<k, for all j,k∈Nj,k\in\mathbb{N}.

σ∘τ\sigma\circ\tau is strictly increasing, and (a∘σ)∘τ=a∘(σ∘τ)(a\circ\sigma)\circ\tau=a\circ(\sigma\circ\tau) for every sequence aa in a set; hence a subsequence of a subsequence of a sequence is a subsequence of it.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…