Set of real numbers, bounds and sequences II

 In this post we carry on from where we got to in Part I. The aim in this part is to try to tie together what we know about infimum, supremum, epsilons and sequences. This will give us a lot of flexibility in how we approach problems later: we can choose which criterion will be easiest to work with for any given situation.

Although working with sequences instead of epsilon and delta can lead to some very clean proofs, you shouldn't forget about epsilon and delta! That approach is very important later throughout mathematics, and it is best to be fluent in all possible methods so that you have the most suitable method available when you need it.

Let's start by having another look at supremum. The results for infimum are almost identical: you just need to flip everything e.g. by reflecting across 0 in the number line using the map xx, which reverses all of the relevant inequalities.

Let AR be a non-empty set which is bounded above in R, and set S=supAR, the supremum or least upper bound for A. We don't know whether SA or not. If SA then S is the maximum element of A. If SA, then A does not have a maximum element.

(In general, you can easily check that whenever A does have a maximum element amaxA, we always have amax=supAA.)

Returning to the situation above, we have S=supA, but we don't know yet whether SA or not.

(Both can happen of course. You should look at all examples of sets you have seen before to see what happens. Some examples of non-empty sets which are bounded above that you could consider are the sets (,5], [2,7), {1/n:nN}, {(1)n/n:nN}.)

Anyway, we have S=supA. You can now check easily that the set of all upper bounds for A is precisely the set B=[S,). So the set B of upper bounds for A in R is bounded below by S, and the set B does have a minimum element, because SB. So we have S=infB=minB

Exercise: Sketch these sets A and B on a number line for some of the specific examples suggested above.

Of course this means that the interval (,S) is precisely the set of those real numbers which are NOT upper bounds for A. So for all y(,S), we have that y is NOT an upper bound for A, and so, negating the definition of upper bound, there exists aA with a>y.

Let's summarise the situation for a general point yR. We have:

  • y is an upper bound for A if and only if, for all aA, we have ay;
  • y is not an upper bound for A if and only if there exists aA such that a>y;
  • y is the least upper bound for A, supA, if and only if we have both that y is an upper bound for A and also, for all y<y, y is not an upper bound for A.
So where do ε and sequences come into the picture? Well another way of thinking about a real number that is (slightly) smaller than S is to call it Sε, where ε is a (usually small but) strictly positive real number. We only really care about the small εs, because for example if a>S1/10 then we also have a>S1: knowing that Sε is not an upper bound for A for small epsilons also takes care of the larger epsilons too!

In fact, it is enough to check the special cases where ε=1/n, for n=1,2,3, (or you can use any sequence of positive real numbers which tend to 0), because again the small εs take care of the large ones.

With A, B and S as above and nN, we know that S1/n is not an upper bound for A (because S is the least upper bound for A), so we can choose an anA with an>S1/n. However we also know that anS (because S is an upper bound for A). So in fact we have

S1n<anS,

and so it follows (e.g. by the Squeeze Rule/Squeeze Theorem/Sandwich Theorem, or directly from the definitions) that anS as n.

Conversely, let yB, i.e., yR and y is an upper bound for A. Of course we have yS. Suppose now that there exists a sequence (an) of points of A which converges to y. Since anS for all n, this is also true in the limit, and so we have yS. Combined with the above, we obtain y=S. Our conclusion is the following very useful lemma which helps once you have already established that a real number y is an upper bound for A.

Lemma 1 (characterisations of supremum among all upper bounds in terms of ε and in terms of sequences)

Let A be a nonempty subset of R and suppose that A is bounded above. Let yR be an upper bound for A. Then the following statements are equivalent.

(a) For all ε>0, we have that yε is not an upper bound for A.

(b) For all ε>0, there exists aA with a>yε.

(c) There exists a sequence (an) of elements of A which converges to y in R.

(d) We have y=supA, i.e., y is the supremum of A.

As mentioned earlier, the situation for infimum is exactly the same but flipped. You can check for yourselves the following characterisations of infimum.

Lemma 2 (characterisations of infimum among all lower bounds in terms of ε and in terms of sequences)

Let A be a nonempty subset of R and suppose that A is bounded below. Let yR be lower bound for A. Then the following statements are equivalent.

(a) For all ε>0, we have that y+ε is not a lower bound for A.

(b) For all ε>0, there exists aA with a<y+ε.

(c) There exists a sequence (an) of elements of A which converges to y in R.

(d) We have y=infA, i.e., y is the infimum of A.

These two lemmas are very helpful when proving results in analysis (e.g. for continuous functions) using a combination of sequences and supremum/infimum.

Warning! Unless you have already established that y is an upper bound for A, you can't apply Lemma 1. (Similarly for Lemma 2 and lower bounds.) For example consider one of the specific sets mentioned above, 

A={(1)nn:nN}={1,1/2,1/3,1/4,}.

In this case the (perhaps) most obvious sequence of elements of A converges to 0. But 0 is neither an upper bound nor a lower bound for A here! In this particular example, the sequences of elements of A that you need will have to have infinitely many repeated elements (and indeed will have to be 'eventually constant') in order to converge to either infA or supA.

Comments

Popular posts from this blog

A rule of thumb for when to use the Ratio Test

An introduction to the Hahn-Banach extension theorem: Part VI

An introduction to the Weierstrass M-test: Part I