On Monotone Subsequences

From MaRDI portal





It is well known that every infinite sequence \((a_ n)_ n\) in \({\mathbb{R}}\) contains an infinite monotone subsequence. The author gives a very short proof for this which reads as follows: Let \(S=\{i|\) for all \(j>i\), \(a_ i<a_ j\}\). If S is infinite, with elements \(i_ 1<i_ 2<...\), then \(a_{i_ 1}<a_{i_ 2}<..\). is monotone strictly increasing. Otherwise, S is finite. In that case, there is a least index \(i_ 0\) such that for all \(i\geq i_ 0\) we have \(i\not\in S\). Since \(i_ 0\not\in S\), there exists \(i_ 1>i_ 0\) such that \(a_{i_ 0}\geq a_{i_ 1}\). And \(i_ 1\not\in S\) so there exists \(i_ 2>i_ 1\) such that \(a_{i_ 1}\geq a_{i_ 2}\), and so forth. Then \(a_{i_ 0}\geq a_{i_ 1}\geq a_{i_ 2}\geq..\). is monotone nonincreasing, completing the proof.











This page was built for publication: On Monotone Subsequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3808599)