<< Chapter < Page Chapter >> Page >

Let { a n } be a bounded sequence of real numbers with

lim sup a n = L and lim inf a n = l . Prove that L and l satisfy the following properties.

  1. For each ϵ > 0 , there exists an N such that a n < L + ϵ for all n N . HINT: Use the fact that lim sup a n = L is the number x of the lemma following Theorem 2.8, and that x is the limit of a specific sequence { x n } .
  2. For each ϵ > 0 , and any natural number k , there exists a natural number j k such that a j > L - ϵ . Same hint as for part (a).
  3. For each ϵ > 0 , there exists an N such that a n > l - ϵ for all n N .
  4. For each ϵ > 0 , and any natural number k , there exists a natural number j > k such that a j < l + ϵ .
  5. Suppose L ' is a number that satisfies parts (a) and (b). Prove that L ' is the limsup of { a n } . HINT: Use part (a) to show that L ' is greater than or equal to every cluster point of { a n } . Then use part (b) to show that L ' is less than or equal to some cluster point.
  6. If l ' is any number that satisfies parts (c) and (d), show that l ' is the liminf of the sequence { a n } .
  1. Let { a n } and { b n } be two bounded sequences of real numbers, and write L = lim sup a n and M = lim sup b n . Prove that lim sup ( a n + b n ) lim sup a n + lim sup b n . HINT: Using part (a) of the preceding exercise, show that for every ϵ > 0 there exists a N such that a n + b n < L + M + ϵ for all n N , and conclude from this that every cluster point y of the sequence { a n + b n } is less than or equal to L + M . This will finish the proof, since lim sup ( a n + b n ) is a cluster point of that sequence.
  2. Again, let { a n } and { b n } be two bounded sequences of real numbers, and write l = lim inf a n and m = lim inf b n . Prove that lim inf ( a n + b n ) lim inf a n + lim inf b n . HINT: Use part (c) of the previous exercise.
  3. Find examples of sequences { a n } and { b n } for which lim sup a n = lim sup b n = 1 , but lim sup ( a n + b n ) = 0 .

We introduce next another property that a sequence can possess. It looks very like the definition of a convergent sequence, but it differs in a crucial way, and thatis that this definition only concerns the elements of the sequence { a n } and not the limit L .

A sequence { a n } of real or complex numbers is a Cauchy sequence if for every ϵ > 0 , there existsa natural number N such that if n N and m N then | a n - a m | < ϵ .

REMARK No doubt, this definition has something to do with limits. Any time there is a positive ϵ and an N , we must be near some kind of limit notion.The point of the definition of a Cauchy sequence is that there is no explicit mention of what the limit is. It isn't that theterms of the sequence are getting closer and closer to some number L , it's that the terms of the sequence are getting closer and closer to each other. This subtle difference is worth some thought.

Prove that a Cauchy sequence is bounded. (Try to adjust the proof of [link] to work for this situation.)

The next theorem, like the Bolzano-Weierstrass Theorem, seems to be quite abstract, but it also turns out to be a very useful tool for proving theorems about continity, differentiability, etc.In the proof, the completeness of the set of real numbers will be crucial. This theorem is not true in ordered fields that are not complete.

Cauchy criterion

A sequence { a n } of real or complex numbers is convergent if and only if it is a Cauchy sequence.

If l i m a n = a then given ϵ > 0 , choose N so that | a k - a | < ϵ / 2 if k N . From the triangle inequality, and by adding and subtracting a , we obtain that | a n - a m | < ϵ if n N and m N . Hence, if { a n } is convergent, then { a n } is a Cauchy sequence.

Conversely, if { a n } is a cauchy sequence, then { a n } is bounded by the previous exercise. Now we use the fact that { a n } is a sequence of real or complex numbers.Let x be a cluster point of { a n } . We know that one exists by the Bolzano-Weierstrass Theorem. Let us show that in fact this number x not only is a cluster point but that it is in fact the limit of the sequence { a n } . Given ϵ > 0 , choose N so that | a n - a m | < ϵ / 2 whenever both n and m N . Let { a n k } be a subsequence of { a n } that converges to x . Because { n k } is strictly increasing, we may choose a k so that n k > N and also so that | a n k - x | < ϵ / 2 . Then, if n N , then both n and this particular n k are larger than or equal to N . Therefore, | a n - x | | a n - a n k | + | a n k - x | < ϵ . this completes the proof that x = lim a n .

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Analysis of functions of a single variable. OpenStax CNX. Dec 11, 2010 Download for free at http://cnx.org/content/col11249/1.1
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Analysis of functions of a single variable' conversation and receive update notifications?

Ask