In the following example, we show how the Monotone Convergence Theorem can be used to prove convergence of a sequence.
Using the monotone convergence theorem
For each of the following sequences, use the Monotone Convergence Theorem to show the sequence converges and find its limit.
defined recursively such that
Writing out the first few terms, we see that
At first, the terms increase. However, after the third term, the terms decrease. In fact, the terms decrease for all
We can show this as follows.
Therefore, the sequence is decreasing for all
Further, the sequence is bounded below by
because
for all positive integers
Therefore, by the Monotone Convergence Theorem, the sequence converges.
To find the limit, we use the fact that the sequence converges and let
Now note this important observation. Consider
Since
the only difference between the sequences
and
is that
omits the first term. Since a finite number of terms does not affect the convergence of a sequence,
Combining this fact with the equation
and taking the limit of both sides of the equation
we can conclude that
Writing out the first several terms,
we can conjecture that the sequence is decreasing and bounded below by
To show that the sequence is bounded below by
we can show that
To show this, first rewrite
Since
and
is defined as a sum of positive terms,
Similarly, all terms
Therefore,
if and only if
Rewriting the inequality
as
and using the fact that
because the square of any real number is nonnegative, we can conclude that
To show that the sequence is decreasing, we must show that
for all
Since
it follows that
Dividing both sides by
we obtain
Using the definition of
we conclude that
Since
is bounded below and decreasing, by the Monotone Convergence Theorem, it converges.
To find the limit, let
Then using the recurrence relation and the fact that
we have
and therefore
Multiplying both sides of this equation by
we arrive at the equation
Solving this equation for
we conclude that
which implies
Since all the terms are positive, the limit
The
Fibonacci numbers are defined recursively by the sequence
where
and for
Here we look at properties of the Fibonacci numbers.
Write out the first twenty Fibonacci numbers.
Find a closed formula for the Fibonacci sequence by using the following steps.
Consider the recursively defined sequence
where
and
Show that this sequence can be described by the closed formula
for all
Using the result from part a. as motivation, look for a solution of the equation
of the form
Determine what two values for
will allow
to satisfy this equation.
Consider the two solutions from part b.:
and
Let
Use the initial conditions
and
to determine the values for the constants
and
and write the closed formula
Use the answer in 2 c. to show that
The number
is known as the
golden ratio (
[link] and
[link] ).