Contents
1. Definition
(!) Convergence and divergence both direct to this page.
Definition
Let be a sequence. If there exists an
such that
.
Then we write , and we say that
converges. If no such
exists, then we say that
diverges.
Theorem – Every convergent sequence is bounded.
Proof – Let be a sequence. We have from the definition of convergence that for every
, there exists an
such that
Where is the limit of
. Now,
can be rewritten as
However, this gives two inequalities, firstly , and
. These two inequalities prove that
is bounded above/below by
and
respectively.
Theorem – If is a convergent sequence with limit
, then every subsequence of
converges to
.
Theorem – Every convergent sequence, , has a convergent subsequence.
Proof – We have two separate proofs based on whether is finite or infinite. If
is finite, then we have that there is an infinite number of
such that
for some
. Thus,
converges to
because for all
,
.
Now, if is infinite, since it is bounded by assumption, there exists at least one accumulation point,
(often referred to as a limit point) of
. But then, we may construct consecutive neighborhoods
. But then
.
Theorem – Every unbounded sequence, , contains a monotone subsequence that has either
as its limit.
Proof – We already know that an unbounded increasing sequence has limit , and that an unbounded decreasing sequence has limit
, so it just remains to construct such a subsequence from
. We may do so as a consequence of the hypothesis. We may easily choose one element to be in the subsequence. Then, assume we already have taken
elements in the subsequence,
. Since
is infinite and unbounded, it follows that there exists another element, and if it were the highest element in
, then
would be bounded. It follows that another element
exists such that
. But this completes the proof, as we have shown that such a subsequence may be constructed.
A similar method may be used if we assume that is unbounded below.