TheoremBase

Every Sequence in a Totally Ordered Set Has a Monotone Subsequence

Every sequence in a totally ordered set has a nondecreasing subsequence or a strictly decreasing subsequence, and in particular a monotone subsequence.

Statement

In the setting of The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion, let ≤\le be a total order on a set XX, and let (an)(a_{n}) be a sequence in XX, with monotone sequences as in Monotone Sequences §monotone and subsequences as in Subsequences §subsequence.

(an)(a_{n}) has a subsequence that is nondecreasing or a subsequence that is strictly decreasing.

(an)(a_{n}) has a monotone subsequence.

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…