prove that " Prove that every sequence a_n has a monotone sub-sequence."
I tried to prove this by a proof of contradiction, so I assume there exist a sequence that doesn't have monotone sub-sequence, but I don't see how this can help me.
prove that " Prove that every sequence a_n has a monotone sub-sequence."
I tried to prove this by a proof of contradiction, so I assume there exist a sequence that doesn't have monotone sub-sequence, but I don't see how this can help me.
Proof:
We construct first a nonincreasing subsequence if possible. We call the $m$th element $x_m$ of the sequence $\{x_n\}$ a turn-back point if all later elements are less than or equal to it, in symbols if $x_m \geq x_n$ for all $n > m$.
If there is an infinite subsequence of turn-back points $x_{m_1}$, $x_{m_2}$, $x_{m_3}$, $x_{m_4}$, $\ldots$ then we have found our nonincreasing subsequence since $x_{m_1} \geq x_{m_2} \geq x_{m_3} \geq x_{m_4} \geq \ldots$
This would not be possible if there are only finitely many turn-back points. Let us suppose that $x_M$ is the last turn-back point so that any element $x_n$ for $n>M$ is not a turn-back point. Since it is not there must be an element further on in the sequence greater than it, in symbols $x_m>x_n$ for some $m>n$. Thus we can choose $x_{m_1}>x_{M+1}$ with $m_1>M+1$, then $x_{m_2}>x_{m_1}$ with $m_2>m_1$, and then $x_{m_3}>x_{m_2}$ with $m_3>m_2$, and so on to obtain an increasing subsequence $x_{M+1} < x_{m_1} < x_{m_2} < x_{m_3} < x_{m_4} < \ldots $ as required.
Let $(a_n)$ be a sequence of real numbers. Now have a look at the subsequence defined by $$b_n := \operatorname{sup}\left(a_k: k\leq n\right).$$