<< Chapter < Page Chapter >> Page >
A graph in quadrant 1 with the x and y axes labeled n and a_n, respectively. A dotted horizontal is drawn from the a_n axis into quadrant 1. Many points are plotted under the dotted line, increasing in a_n value and converging to the dotted line.
Since the sequence { a n } is increasing and bounded above, it must converge.

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.

  1. { 4 n n ! }
  2. { a n } defined recursively such that
    a 1 = 2 and a n + 1 = a n 2 + 1 2 a n for all n 2 .
  1. Writing out the first few terms, we see that
    { 4 n n ! } = { 4 , 8 , 32 3 , 32 3 , 128 15 ,… } .

    At first, the terms increase. However, after the third term, the terms decrease. In fact, the terms decrease for all n 3 . We can show this as follows.
    a n + 1 = 4 n + 1 ( n + 1 ) ! = 4 n + 1 · 4 n n ! = 4 n + 1 · a n a n i f n 3 .

    Therefore, the sequence is decreasing for all n 3 . Further, the sequence is bounded below by 0 because 4 n / n ! 0 for all positive integers n . Therefore, by the Monotone Convergence Theorem, the sequence converges.
    To find the limit, we use the fact that the sequence converges and let L = lim n a n . Now note this important observation. Consider lim n a n + 1 . Since
    { a n + 1 } = { a 2 , a 3 , a 4 ,… } ,
    the only difference between the sequences { a n + 1 } and { a n } is that { a n + 1 } omits the first term. Since a finite number of terms does not affect the convergence of a sequence,
    lim n a n + 1 = lim n a n = L .

    Combining this fact with the equation
    a n + 1 = 4 n + 1 a n

    and taking the limit of both sides of the equation
    lim n a n + 1 = lim n 4 n + 1 a n ,

    we can conclude that
    L = 0 · L = 0 .
  2. Writing out the first several terms,
    { 2 , 5 4 , 41 40 , 3281 3280 ,… } .

    we can conjecture that the sequence is decreasing and bounded below by 1 . To show that the sequence is bounded below by 1 , we can show that
    a n 2 + 1 2 a n 1 .

    To show this, first rewrite
    a n 2 + 1 2 a n = a n 2 + 1 2 a n .

    Since a 1 > 0 and a 2 is defined as a sum of positive terms, a 2 > 0 . Similarly, all terms a n > 0 . Therefore,
    a n 2 + 1 2 a n 1

    if and only if
    a n 2 + 1 2 a n .

    Rewriting the inequality a n 2 + 1 2 a n as a n 2 2 a n + 1 0 , and using the fact that
    a n 2 2 a n + 1 = ( a n 1 ) 2 0

    because the square of any real number is nonnegative, we can conclude that
    a n 2 + 1 2 a n 1 .

    To show that the sequence is decreasing, we must show that a n + 1 a n for all n 1 . Since 1 a n 2 , it follows that
    a n 2 + 1 2 a n 2 .

    Dividing both sides by 2 a n , we obtain
    a n 2 + 1 2 a n a n .

    Using the definition of a n + 1 , we conclude that
    a n + 1 = a n 2 + 1 2 a n a n .

    Since { a n } is bounded below and decreasing, by the Monotone Convergence Theorem, it converges.
    To find the limit, let L = lim n a n . Then using the recurrence relation and the fact that lim n a n = lim n a n + 1 , we have
    lim n a n + 1 = lim n ( a n 2 + 1 2 a n ) ,

    and therefore
    L = L 2 + 1 2 L .

    Multiplying both sides of this equation by 2 L , we arrive at the equation
    2 L 2 = L 2 + 1 .

    Solving this equation for L , we conclude that L 2 = 1 , which implies L = ± 1 . Since all the terms are positive, the limit L = 1 .
Got questions? Get instant answers now!

Consider the sequence { a n } defined recursively such that a 1 = 1 , a n = a n 1 / 2 . Use the Monotone Convergence Theorem to show that this sequence converges and find its limit.

0 .

Got questions? Get instant answers now!

Fibonacci numbers

The Fibonacci numbers are defined recursively by the sequence { F n } where F 0 = 0 , F 1 = 1 and for n 2 ,

F n = F n 1 + F n 2 .

Here we look at properties of the Fibonacci numbers.

  1. Write out the first twenty Fibonacci numbers.
  2. Find a closed formula for the Fibonacci sequence by using the following steps.
    1. Consider the recursively defined sequence { x n } where x o = c and x n + 1 = a x n . Show that this sequence can be described by the closed formula x n = c a n for all n 0 .
    2. Using the result from part a. as motivation, look for a solution of the equation
      F n = F n 1 + F n 2

      of the form F n = c λ n . Determine what two values for λ will allow F n to satisfy this equation.
    3. Consider the two solutions from part b.: λ 1 and λ 2 . Let F n = c 1 λ 1 n + c 2 λ 2 n . Use the initial conditions F 0 and F 1 to determine the values for the constants c 1 and c 2 and write the closed formula F n .
  3. Use the answer in 2 c. to show that
    lim n F n + 1 F n = 1 + 5 2 .

    The number ϕ = ( 1 + 5 ) / 2 is known as the golden ratio ( [link] and [link] ).
    This is a photo of a sunflower, particularly the curves of the seeds at its middle. The number of spirals in each direction is always a Fibonacci number.
    The seeds in a sunflower exhibit spiral patterns curving to the left and to the right. The number of spirals in each direction is always a Fibonacci number—always. (credit: modification of work by Esdras Calderan, Wikimedia Commons)

    This is a photo of the Parthenon, an ancient Greek temple that was designed with the proportions of the Golden Rule. The entire temple’s front side fits perfectly into a rectangle with those proportions, as do the columns, the level between the columns and the roof, and a portion of the trim below the roof.
    The proportion of the golden ratio appears in many famous examples of art and architecture. The ancient Greek temple known as the Parthenon was designed with these proportions, and the ratio appears again in many of the smaller details. (credit: modification of work by TravelingOtter, Flickr)

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Calculus volume 2. OpenStax CNX. Feb 05, 2016 Download for free at http://cnx.org/content/col11965/1.2
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Calculus volume 2' conversation and receive update notifications?

Ask