<< Chapter < Page | Chapter >> Page > |
Often, our goal is to show that a given sequence is convergent. However, as we study convergent sequences, we would liketo establish various properties that they have in common. The first theorem of this section is just such a result.
Suppose is a convergent sequence of real or complex numbers. Then the sequence forms a bounded set.
Write Let be the positive number Then, there exists a natural number such that for all By the backward triangle inequality, this implies that for all which implies that for all This shows that at least the tail of the sequence is bounded by the constant
Next, let be a number larger than the finitely many numbers Then, for any is either less than or Let be the larger of the two numbers and Then for all Hence, the sequence is bounded.
Note that the preceding theorem is a partial converse to [link] ; i.e., a convergent sequence is necessarily bounded. Of course, not every convergent sequence must beeither nondecreasing or nonincreasing, so that a full converse to [link] is not true. For instance, take in part (1) of [link] . It converges to 0 all right, but it is neither nondecreasing nor nonincreasing.
Suppose is a sequence of real numbers and that Let and be real numbers such that for all Prove that
HINT: Suppose, for instance, that Make use of the positive number to derive a contradiction.
We are often able to show that a sequence converges by comparing it to another sequence that we already know converges.The following exercise demonstrates some of these techniques.
Let be a sequence of complex numbers.
The next result is perhaps the most powerful techniquewe have for showing that a given sequence converges to a given number.
Suppose that is a sequence of real numbers and that and are two sequences ofreal numbers for which for all Suppose further that Then the sequence also converges to
We examine the quantity employ some add and subtract tricks, and make the following computations:
So, we can make by making and So, let be a positive integer such that if and let be a positive integer so that if Then set Clearly, if then both inequalities and and hence This finishes the proof.
The next result establishes what are frequently called the “limit theorems.” Basically, these results show how convergenceinteracts with algebraic operations.
Let and be two sequences of complex numbers with and Then
Part (1) is exactly the same as [link] . Let us prove part (2).
By [link] , both sequences and are bounded. Therefore, let be a number such that and for all Now, let be given. There exists an such that whenever and there exists an such that whenever Let be the maximum of and Here comes the add and subtract trick again.
if which shows that
To prove part (3), let be as in the previous paragraph, and let be given. There exists an such that whenever there also exists an such that whenever and there exists an such that whenever (See [link] .) Let be the maximum of the three numbers and Then:
if This completes the proof.
REMARK The proof of part (3) of the preceding theorem may look mysterious. Where, for instance, does this number come from? The answer is that one begins such a proof by examining the quantity to see if by some algebraic manipulation one can discover how to control its size by using the quantities and The assumption that and mean exactly that the quantities and can be controlled by requiring to be large enough. The algebraic computation in the proof above shows that
and one can then see exactly how small to make and so that Indeed, this is the way most limit proofs work.
Notification Switch
Would you like to follow the 'Analysis of functions of a single variable' conversation and receive update notifications?