Home page for accesible maths 3 Limitpoints of sequences and closed sets

Style control - access keys in brackets

Font (2 3) - + Letter spacing (4 5) - + Word spacing (6 7) - + Line spacing (8 9) - +

3.2 The Limsup and the Liminf

We have already seen that if {xn}n=1 is a bounded sequence then the limitpoints of the sequence are in between the supremum and the infinum of the sequence. We actually have a much more precise picture.

Definition 3.2.1

Let x¯={xn}n=1 be a bounded sequence of real numbers.
Then lim supnxn (the Limsup or the Limit Superior of x¯) is defined as the Least Upper Bound of the limitpoint set 𝐿𝐼𝑀(x¯). Similarly, lim infnxn (the Liminf or the Limit Inferior of x¯) is defined as the Largest Lower Bound of the limitpoint set 𝐿𝐼𝑀(x¯).

Question 3.2.1

How much is lim supn1n?

Solution: The supremum of the sequence is of course 1, but somewhat surprisingly, lim supn1n=0. Indeed, the set of limitpoints of the sequence {1n}n=1 consists of one single element the zero. So the 0 is both the limsup and the liminf of this sequence. In general, if a sequence convergent then its limsup and liminf is nothing but the limit of the sequence.

Proposition 3.2.1 (Limsups are limitpoints)

Let x¯={xn}n=1 be a bounded sequence of real numbers. Then lim supnxn𝐿𝐼𝑀(x¯) and lim infnxn𝐿𝐼𝑀(x¯).

Remember, the supremum of an infinite set S is not necessarily an element of S. So, the statement of the proposition is not at all trivial. Since lim supnxnLIM(x¯) is the Least Upper Bound of the set of limitpoints, there exists a sequence of limitpoints {lk}k=1LIM(x¯) such that lklim supnxn. Now we will do the same trick as in the solution of Question 3.1.4. Although the numbers lm are not elements of our sequence but they are limitpoints of our sequence so we can get as close to them as we want. That is, there exist numbers n1<n2<n3 such that |xnk-lk|1k. Then by the Sum Rule, limkxnk=lim supnxn. The same goes for the liminf as well.

Proposition 3.2.2 (How to imagine the Limsup)

Let x¯={xn}n=1 be a bounded sequence. Let L=lim supnxn. Then:

  1. 1.

    There exists a subsequence {xnk}k=1 tending to L.

  2. 2.

    For any ε>0 there exists an N>0 such that if nN, then xnL+ε.

On the other hand, if a certain real number satisfies the two conditions above, then it equals to the Limsup of the sequence.

Proof:  First note that the first condition means that L is a limitpoint and we just proved that the Limsup is a limitpoint. Now, if the second condition is not satisfied, then there exists a subsequence {xnk}k=1 such that for any k1 xnk>ε+L. By the Bolzano-Weierstrass Theorem this subsequence contains a convergent subsequence, and its limit would be strictly larger than L, in contradiction with the fact that L is the largest limitpoint. Finally, suppose that a certain number T satisfies the two conditions. Then, T is a limit point of x¯. On the other hand, by the second condition any limitpoint of x¯ must be less or equal than T. Hence T is the Limsup of the sequence.

Remark 3.2.1 (Fun fact)

When we prove the Bolzano-Weierstrass Theorem from the Least Upper Bound Principle and the Largest Lower Bound Principle, we actually found the limsup and the liminf as limit points.

Observation 3.2.1

Let x¯={xn}n=1 be a bounded sequence of real numbers. Then for any limitpoint l of x¯:

inf(x¯)lim inf(x¯)llim sup(x¯)supx¯.
Example 3.2.1

Let xn=(-1)n+1n. Then lim supxn=1, lim infxn=-1.

When we added two convergent sequences then their limits were added as well. The Limsup is a bit trickier.

Proposition 3.2.3

Let x¯={xn}n=1 and y¯={yn}n=1 be bounded sequences of real numbers. Then lim supn(xn+yn)lim supnxn+lim supnyn .
Similarly, lim infnxn+lim infnynlim infn(xn+yn).

Proof:  We prove only the first inequality. Let L be a limitpoint of {xn+yn}n=1. It is enough to prove that

Llim supnxn+lim supnyn. (3.1)

Indeed, (3.1) means that lim supnxn+lim supnyn is an upper bound for the set of limitpoints of {xn+yn}n=1. Hence it is greater or equal than the least upper bound. The least upper bound is exactly lim supn(xn+yn).

L is a limitpoint, so L=limk(xnk+ynk) for a certain subsequence. The problem is that even if {xnk+ynk} is convergent it is possible that neither {xnk} nor {ynk} are convergent. Yes indeed, if {xnk} is any non-convergent sequence and ynk=1-xnk then {xnk+ynk} is the most obviously convergent (constant) sequence of the world. The simple looking Proposition 3.2.2 comes to the rescue. This proposition explains what limsup is. By this proposition, the limsup EVENTUALLY looks more and more like a supremum even it is actually an infimum. For any ε>0 there exists N>0 such that if kN, then xnklim supnxnk+ε and ynklim supnynk+ε. Hence, if kN then xnk+ynklim supnxnk+lim supnynk+2ε. Therefore

Llim supnxnk+lim supnynk+2ε. (3.2)

OK, (3.2) is not as good as the inequality (3.1) because of the ε in the formula. However, (3.2) holds for ANY ε>0 so it must hold for the zero as well, that is (3.1) holds.

Example 3.2.2

Let xn=12+1n if n is in the form of 3k. Let xn=5-1n if n is in the form of 3k+1. Let xn=3+21n2 if n is in the form of 3k+2. Then eventually xn is very close to 12 or 5 or 3. Hence, the limitpoints of {xn}n=1 are 12,5,3. That is, lim supnxn=12, lim infnxn=3.