<< Chapter < Page Chapter >> Page >

Definition

A sequence { a n } is bounded above    if there exists a real number M such that

a n M

for all positive integers n .

A sequence { a n } is bounded below    if there exists a real number M such that

M a n

for all positive integers n .

A sequence { a n } is a bounded sequence    if it is bounded above and bounded below.

If a sequence is not bounded, it is an unbounded sequence    .

For example, the sequence { 1 / n } is bounded above because 1 / n 1 for all positive integers n . It is also bounded below because 1 / n 0 for all positive integers n. Therefore, { 1 / n } is a bounded sequence. On the other hand, consider the sequence { 2 n } . Because 2 n 2 for all n 1 , the sequence is bounded below. However, the sequence is not bounded above. Therefore, { 2 n } is an unbounded sequence.

We now discuss the relationship between boundedness and convergence. Suppose a sequence { a n } is unbounded. Then it is not bounded above, or not bounded below, or both. In either case, there are terms a n that are arbitrarily large in magnitude as n gets larger. As a result, the sequence { a n } cannot converge. Therefore, being bounded is a necessary condition for a sequence to converge.

Convergent sequences are bounded

If a sequence { a n } converges, then it is bounded.

Note that a sequence being bounded is not a sufficient condition for a sequence to converge. For example, the sequence { ( −1 ) n } is bounded, but the sequence diverges because the sequence oscillates between 1 and −1 and never approaches a finite number. We now discuss a sufficient (but not necessary) condition for a bounded sequence to converge.

Consider a bounded sequence { a n } . Suppose the sequence { a n } is increasing. That is, a 1 a 2 a 3 . Since the sequence is increasing, the terms are not oscillating. Therefore, there are two possibilities. The sequence could diverge to infinity, or it could converge. However, since the sequence is bounded, it is bounded above and the sequence cannot diverge to infinity. We conclude that { a n } converges. For example, consider the sequence

{ 1 2 , 2 3 , 3 4 , 4 5 ,… } .

Since this sequence is increasing and bounded above, it converges. Next, consider the sequence

{ 2 , 0 , 3 , 0 , 4 , 0 , 1 , 1 2 , 1 3 , 1 4 ,… } .

Even though the sequence is not increasing for all values of n , we see that −1 / 2 < 1 / 3 < 1 / 4 < . Therefore, starting with the eighth term, a 8 = −1 / 2 , the sequence is increasing. In this case, we say the sequence is eventually increasing. Since the sequence is bounded above, it converges. It is also true that if a sequence is decreasing (or eventually decreasing) and bounded below, it also converges.

Definition

A sequence { a n } is increasing for all n n 0 if

a n a n + 1 for all n n 0 .

A sequence { a n } is decreasing for all n n 0 if

a n a n + 1 for all n n 0 .

A sequence { a n } is a monotone sequence    for all n n 0 if it is increasing for all n n 0 or decreasing for all n n 0 .

We now have the necessary definitions to state the Monotone Convergence Theorem, which gives a sufficient condition for convergence of a sequence.

Monotone convergence theorem

If { a n } is a bounded sequence and there exists a positive integer n 0 such that { a n } is monotone for all n n 0 , then { a n } converges.

The proof of this theorem is beyond the scope of this text. Instead, we provide a graph to show intuitively why this theorem makes sense ( [link] ).

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