Jump to content

Superior and inferior limit – "Math for Non-Geeks"

From Wikibooks, open books for an open world

By limes superior and limes inferior, mathematicians denote the largest and the smallest accumulation point of a sequence. They are useful, if there are multiple limits and intuitively say what the "greatest limit" (limes superior) and the "smallest limit" (limes inferior) of that sequence are.

Motivation

[edit | edit source]

We already learned about limits of a sequence. A limit is that unique number, to which a sequence tends. In every neighbourhood of the sequence, there are almost all elements, meaning only a finite number is allowed to be on the outside:

There are only finitely many elements outside the neighbourhood.
There are only finitely many elements outside the neighbourhood.

Sometimes, it seems like a sequence tends towards multiple numbers (like "multiple limits"). We also discussed that case: these numbers are then called "accumulation points" instead of "limits", since a limit must always be unique.

The set of accumulation points may be bounded or unbounded. In case it is bounded, there is a best upper and a best lower limit for the accumulation points, which we will call limes superior and limes inferior. Both are real numbers. Mathematically, for a sequence (an)n∈ℕ we will denote the limes superior as lim supn→∞an and the limes inferior as lim infn→∞an.

The closed interval [lim infn→∞an,lim supn→∞an] then includes all accumulation points. We can even show that in any neighbourhood of this interval (i.e. a slightly bigger interval), there are almost all elements inside this neighbourhood. The following figure illustrates this situation for some ϵ-neighbourhood [lim infn→∞an−ϵ,lim supn→∞an+ϵ] around the original interval:

Any interval that is slightly bigger than the grey one (both above and below) contains almost all sequence elements
Any interval that is slightly bigger than the grey one (both above and below) contains almost all sequence elements

Definition

[edit | edit source]

Now, let us turn to a mathematical description of "greatest and smallest accumulation point". We can directly define:

Definition (limes superior)

For a sequence (an)n∈ℕ bounded from above, the limes superior denotes the greatest accumulation point and is denoted by lim sup⁡an . If the sequence is unbounded from above or there are no accumulation points, we write lim supn→∞an=∞.

Definition (limes inferior)

For a sequence (an)n∈ℕ bounded from below, the limes inferior denotes the smallest accumulation point and is denoted by lim inf⁡an . If the sequence is unbounded from below or there are no accumulation points, we write lim infn→∞an=−∞.

But: Does this definition even make sense? The accumulation points form a set. Those sets need not have a maximum (greatest value) or minimum (smallest value), but might instead just have a supremum or infimum. Mathematicians wondered, when this is the case and soon found a surprising answer: The "awkward case" that there is no greatest/smallest limit does never occur! This statement ca actually be proven

Theorem (greatest and smallest accumulation point exist)

If the accumulation points of a sequence (an)n∈ℕ are bounded from above, then it has a greatest accumulation point. If the accumulation points of a sequence (an)n∈ℕ are bounded from below, then it has a smallest accumulation point.

Proof (greatest and smallest accumulation point exist)

Suppose first that the accumulation points of (an)n∈ℕ are bounded from above. Then, there must be a supremum S (smallest upper bound) for the accumulation points. If S is an accumulation point, it is also the greatest one, and we get no contradiction to the above statement.

So let us assume that S is not an accumulation itself. In that case, each interval (S−ϵ,S] for ϵ must contain an accumulation point Sϵ. Otherwise, S−ϵ would be an upper bound for the accumulation points which is smaller than S (which cannot be). But since each Sϵ subsequence element anϵ with |anϵ−Sϵ|<ϵ. By the triangle inequality, |anϵ−S|≤|anϵ−Sϵ|+|Sϵ−S|<2ϵ. This holds true for any 2ϵ>0, so S is an accumulation point of (an)n∈ℕ itself, and we get a contradiction to S not being an accumulation point.

This theorem establishes that the two definitions above actually make sense, so limes superior and limes inferior are well-defined.

Examples

[edit | edit source]
Example

Consider the sequence (an)n∈ℕ=(−1)nn . we can decompose it into the products (bn)n∈ℕ=(−1)n and (cn)n∈ℕ=n.

The sequence bn diverges, but has two accumulation points limk→∞b2k−1=−1 and limk→∞b2k=1.

The sequence cn is improperly convergent (which is a special kind of divergence): it goes to infinity limn→∞cn=∞.

We multiply the limits/accumulation points of bn=(−1)n and cn=n. Since there is limk→∞b2k−1=−1 , we obtain a subsequence of (an)n∈ℕ, unbounded from below: limk→∞a2k−1=limk→∞−2k+1=−∞. And since limk→∞b2k=1 there is also a subsequence unbounded from above: limk→∞a2k=limk→∞2k=∞.

So (an)n∈ℕ does not converge improperly to ∞ or −∞, but we can say that lim supn→∞an=∞ and lim infn→∞an=−∞.

Example

In case (an)n∈ℕ=(−1)nn, there is limn→∞an=0. Since (an) converges, it has the unique accumulation point 0. This must be the greatest and smallest accumulation point at the same time and we have

lim supn→∞an=lim infn→∞an=0

Example

For (an)n∈ℕ=n, there is limn→∞an=∞. So (an) is unbounded from above and lim supn→∞an=∞. Further, (an) is bounded from below by 1. But it has no accumulation points, as ∀S∈ℝ there is an≥S . So we also have lim infn→∞an=∞.

limsup, liminf and limit

[edit | edit source]

If limes superior and limes inferior of a sequence (an)n∈ℕ exist and coincide, then the greatest and smallest accumulation point are identical, so there can only be one accumulation point. And the sequence cannot be unbounded, so it should converge to this one accumulation point. But does it actually do that? And does the converse hold true? I.e., if the sequence (an)n∈ℕ converges, are limes superior and inferior identical? The answer turns out to be yes:

Theorem (limes superior/inferior and convergence)

A sequence (an)n∈ℕ converges if and only if

−∞<lim supn→∞an=lim infn→∞an<∞

How to get to the proof? (limes superior/inferior and convergence)

We need to prove equivalence limn→∞an=a∈ℝ⟺−∞<lim supn→∞an=a=lim infn→∞an<∞ which are two directions:

"⇒" is easy: if a sequence (an)n∈ℕ converges, then there is exactly one accumulation point (namely the limit a). This must be the greatest and smallest accumulation point at the same time, so lim sup⁡=lim inf⁡=a.

"⇐" needs some technical work, where we will use the definition of a limit and accumulation point via neighbourhoods. We recall:

  • A point a∈ℝ is the limit of (an) , if and only if ∀ϵ>0 there are almost all an∈(a−ϵ,a+ϵ)
  • A point a∈ℝ is an accumulation point of (an) , if and only if ∀ϵ>0 there are infinitely many an∈(a−ϵ,a+ϵ).
Proof (limes superior/inferior and convergence)

Step 1: "⇒"

If limn→∞an=a , then the sequence (an)n∈ℕ is bounded and a is its only accumulation point. By definition of limsup and liminf: lim supn→∞an=greatest accumulation point of (an)=a=smallest accumulation point of (an)=lim infn→∞an

Step 2: "⇐"

Let lim supn→∞an=a=lim infn→∞an.

Since a=lim supn→∞an is the greatest accumulation point of (an)n∈ℕ , we know that for all ϵ>0 , there are infinitely many sequence elements in (a−ϵ,a+ϵ) and almost all in (−∞,a+ϵ) (i.e. only finitely many on the outside).

Since a=lim infn→∞an is the smallest accumulation point of (an)n∈ℕ , for any ϵ>0 , there are infinitely many sequence elements in (a−ϵ,a+ϵ)and almost all of them in (a−ϵ,∞) (i.e. only finitely many on the outside).

So if we fix ϵ>0 , then only "finite + finite = finite"-ly many sequence elements can be outside (a−ϵ,a+ϵ). So almost all are on the inside, which is equivalent to saying that (an)n∈ℕ converges to a.

Hint

This theorem can be extended to improperly converging sequences: limn→∞an=±∞⟺lim infn→∞an=lim supn→∞an=±∞

Exercise (limes superior/inferior and improper convergence)

Prove that the statement in the above hint holds for +∞. (The case −∞ is proven analogously)

How to get to the proof? (limes superior/inferior and improper convergence)

Again, we need to show two directions: ⇒" is by definition of limsup and liminf and ⇐" needs some technical work.

Proof (limes superior/inferior and improper convergence)

Step 1: ⇒. Let limn→∞an=∞. Then, (an)n∈ℕ is unbounded from above, but bounded from below. So by definition, lim supn→∞an=∞ (and lim infn→∞an≠−∞). Further, (an) has no accumulation point (otherwise it would not converge improperly to infinity), which implies by definition that lim infn→∞an=∞.

Step 2: ⇐. Let lim infn→∞an=lim supn→∞an=∞. Then, (an)n∈ℕ is unbounded from above, but bounded from below. Since lim infn→∞an≠a∈ℝ we know that (an)n∈ℕ has no accumulation points. We will show that this implies limn→∞an=∞:

Let (an)n∈ℕ be any real sequence bounded from below, without an accumulation point in ℝ . Then, (an)n∈ℕ converges improperly to ∞.

This is shown by contradiction: Assume that (an)n∈ℕ is bounded from below, but it does not converge improperly to ∞, which means ⇒¬(∀S>0 ∃N∈ℕ ∀n≥N:an≥S)⇒∃S>0 ∀N∈ℕ ¬(∀n≥N:an≥S)⇒∃S>0 ∀N∈ℕ ∃n′≥N:an′<S This means, there are infinitely many n′∈ℕ with an′<S. By means of the Bolzano-Weierstrass theorem, one can find a subsequence (an′k)k∈ℕ of (an′)n′∈ℕ which converges to some a∈ℝ. This means, a is an accumulation point of (an)n∈ℕ, which contradicts (an)n∈ℕ not having any accumulation points. So any (an)n∈ℕ bounded from below without accumulation points must diverge improperly to ∞. This also holds true for our (an)n∈ℕ above and by definition, limn→∞an=∞, which is what we wanted to show.

Alternative characterization

[edit | edit source]

In the literature, lim supn→∞an and lim infn→∞an are often defined in a different but equivalent way: Suppose, (an)n∈ℕ is bounded. Then we have:

Theorem (alternative definition of limsup and liminf)

If (an)n∈ℕ is a bounded sequence, then
lim supn→∞an=limk→∞sup⁡{an:n≥k}=infk∈ℕsup⁡{an:n≥k}lim infn→∞an=limk→∞inf⁡{an:n≥k}=supk∈ℕinf⁡{an:n≥k}

Intuitively, the limes superior is the "smallest upper" and the limes inferior the "greatest lower bound" of (an)n∈ℕ, as n→∞. Or in other words: The bound is allowed to be violated by finitely many elements.

Examples

[edit | edit source]
Example

Let (an)n∈ℕ=((−1)n)n∈ℕ=(−1,1,−1,1,−1,1,…). This sequence has two accumulation points: 1 and −1. So by the original definition, lim supn→∞an=1 and lim infn→∞an=−1. In order to apply the alternative definition above, we have to determine (bk)k∈ℕ=(sup⁡{an:n≥k})k∈ℕ and (b~k)k∈ℕ=(inf⁡{an:n≥k})k∈ℕ , as well as their limits. This is an easy task here: since (an)n∈ℕ only attains the values ±1 and both infinitely many, there is just bk=sup⁡{an:n≥k}=1 and b~k=inf⁡{an:n≥k}=−1 for all k∈ℕ. So we have two constant sequences with limits lim supn→∞an=limk→∞bk=limk→∞1=1 and lim infn→∞an=limk→∞b~k=limk→∞−1=−1 and both definitions coincide.

Example

Consider (an)n∈ℕ=((−1)nn)n∈ℕ=(−1,12,−13,14,−15,16,…). This is a null sequence, so by the original definition, lim supn→∞=lim infn→∞=0 For the new definition of limsup, we determine (bk)k∈ℕ=(sup⁡{an:n≥k})k∈ℕ=(12,12,14,14,16,16,…) which implies lim supn→∞an=limk→∞bk=0 and both definitions of the limsup coincide.

Question: Analogously, determine lim infn→∞an by the new definition.

There is (b~k)k∈ℕ=(inf⁡{an:n≥k})k∈ℕ=(−1,−13,−13,−15,−15,−17,−17,…) so lim infn→∞an=limk→∞b~k=0 which also coincides with the original definition.

Proof of the theorem

[edit | edit source]
How to get to the proof? (alternative definition of limsup and liminf)

At first, we focus on the "limsup-case" and prove that (bk)k∈ℕ=(sup⁡{an:n≥k})k∈ℕ indeed converges. Since (bk)k∈ℕ This sequence is monotonically decreasing and bounded, so it converges by the monotonicity criterion. Then, we need to show that (bk) indeed converges to lim supn→∞an, i.e. the greatest accumulation point of (an)n∈ℕ. This is done by establishing the two inequalities limk→∞bk≥lim supn→∞an and limk→∞bk≤lim supn→∞an.

The "liminf-case" works analogously. We use that (b~k)k∈ℕ=(inf⁡{an:n≥k})k∈ℕ in monotonically increasing and bounded, so it converges. And we show that the limit is indeed lim infn→∞an, meaning the smallest accumulation point of (an).

Proof (alternative definition of limsup and liminf)

Since (an) is bounded (by assumption), so is (bk)=(sup⁡{an:n≥k}) . In addition, {an:n≥k+1}⊆{an:n≥k}⇒bk+1=sup⁡{an:n≥k+1}≤sup⁡{an:n≥k}=bk So (bk) is monotonically decreasing. By the monotonicity criterion, (bk) converges to some limit which we call b∗.

Let us denote the greatest accumulation point of (an) by lim supn→∞an=h∗ . Our aim is to show b∗=h∗. This is done by proving b∗≥h∗ and b∗≤h∗:

Since h∗ is an accumulation point of (an) , we know that for each N∈ℕ there is some n∈ℕ with n≥N and an≥h∗−ϵ for any ϵ>0 . This especially implies bk=sup⁡{an:n≥k}≥h∗ for all k∈ℕ. Taking the limit, we obtain b∗=limk→∞bk≥h∗.

On the other hand, as (bk) is monotonically decreasing, there is also b∗≤bk<h∗+ϵ. This holds for all ϵ>0. Taking the limit ϵ→0 , we get b∗≤h∗, which finishes the proof.

Rules for computing with limsup and liminf

[edit | edit source]
Theorem (monotonicity rule)

Let (an)n∈ℕ and (bn)n∈ℕ be bounded real sequences with an≤bn for all n∈ℕ. Then lim infn→∞an≤lim infn→∞bn

and lim supn→∞an≤lim supn→∞bn
Proof (monotonicity rule)

Let lim supn→∞an=ha∗ be the greatest accumulation point of (an) and lim supn→∞bn=hb∗ the greatest accumulation point of (bn). Those accumulation points exist by the Bolzano-Weierstrass theorem and by boundedness of the sequences. Let ϵ>0 be given. Since hb∗ is the greatest accumulation point of (bn) , there must be an N∈ℕ, such that for all n≥N: hb∗+ϵ>bn. But since an≤bn , there is also ha∗+ϵ>an. Therefore ha∗≤hb∗+ϵ holds. Taking the limit ϵ→0 , we obtain ha∗≤hb∗.

Exercise (v)

Analogously, prove that lim infn→∞an≤lim infn→∞bn.

Theorem (Relation between limsup and liminf - mirroring along the x-axis)

Let (an)n∈ℕ be a bounded real sequence. Then, −lim supn→∞an=lim infn→∞(−an)

Proof (Relation between limsup and liminf - mirroring along the x-axis)

Let h∗=lim supn→∞an be the greatest accumulation point of (an). We need to show that −h∗=lim infn→∞(−an) , i.e. −h∗ is the smallest accumulation point of (−an) . This is done in two steps:

  1. We prove that −h∗ is an accumulation point of (−an)
  2. We prove that −h∗ is the smallest accumulation point of (−an)

Step 1: Since h∗=lim supn→∞an , there is a subsequence (ank)k∈ℕ of (an)n∈ℕ with limk→∞ank=h∗. By the limit theorems, we have limk→∞−ank=−limk→∞ank=−h∗. So the subsequence (−ank) of (−an) converges to −h∗, i.e. −h∗ is an accumulation point of (−an).

Step 2: Let h be any accumulation point of (−an). Then, there is a subsequence (−ank) of (−an) with limk→∞−ank=h. By the limit theorems, limk→∞ank=limk→∞−(−ank)=−limk→∞(−ank)=−h. Hence, −h is an accumulation point of (an). Since h∗ was the greatest accumulation point of (an) , we know that −h≤h∗, or equivalently h≥−h∗.

As h was any accumulation point of (−an) , we know that any accumulation point is greater or equal −h∗ . So −h∗ is the smallest one and −h∗=lim infn→∞(−an).

Theorem (Sum rule)

Let (an)n∈ℕ and (bn)n∈ℕ be real sequences. Then, lim supn→∞an+lim infn→∞bn≤lim supn→∞(an+bn)≤lim supn→∞an+lim supn→∞bn

Proof (Sum rule)

Step 1: We start with the second inequality lim supn→∞(an+bn)≤lim supn→∞an+lim supn→∞bn:

Let ha∗=lim supn→∞an, hb∗=lim supn→∞bn and let ha+b be an accumulation point of (an+bn). Then, there is a subsequence (ank+bnk) of (an+bn) with limk→∞ank+bnk=ha+b.

Let further ϵ>0 be arbitrary. Since ha∗ is the greatest accumulation point of (an) and hb∗ is the greatest accumulation point of (bn) , there must be a K∈ℕ, such that for all k≥K there is: ank<ha∗+ϵ2 and bnk<hb∗+ϵ2. So, for k≥K we also have ank+bnk<ha∗+hb∗+ϵ. By monotonicity of the limits, we know that ha+b=limk→∞ank+bnk≤ha∗+hb∗+ϵ, so the ha+b can be at most ϵ above our desired threshold ha∗+hb∗. But now, ϵ>0 can be chosen arbitrarily close to 0, so we get ha+b≤ha∗+hb∗. Since this inequality holds for all accumulation points ha+b of (an+bn) , it also holds for the greatest one and ha+b∗=lim supn→∞(an+bn)≤ha∗+hb∗=lim supn→∞an+lim supn→∞bn

Step 2: Now, we prove lim supn→∞an+lim infn→∞bn≤lim supn→∞(an+bn). This can be done by using the second inequality which we just have proven and the rule−lim supn→∞an=lim infn→∞(−an) above. There is lim supn→∞an=lim supn→∞(an+bn)+(−bn)≤2nd inequalitylim supn→∞(an+bn)+lim supn→∞(−bn)=limsup/liminf-rulelim supn→∞(an+bn)−lim infn→∞(−(−bn))=lim supn→∞(an+bn)−lim infn→∞bn This is exactly equivalent to lim supn→∞an+lim infn→∞bn≤lim supn→∞(an+bn).

Exercise (Example for the sum rule)

Find explicit sequences (an) and (bn) with strict bounds lim supn→∞an+lim infn→∞bn<lim supn→∞(an+bn)<lim supn→∞an+lim supn→∞bn

Solution (Example for the sum rule)

The trick is to let sequence elements cancel against each other. One needs to play a bit around with alternating sequences to get to a solution. One example is an={(−1)k if n=2k12if n=2k+1 and bn={(−1)k+1 if n=2k12if n=2k+1 The first sequence elements are (an)=(12,−1,12,1,12,−1,12,1,…) and (bn)=(12,1,12,−1,12,1,12,−1,…) So both (an) and (bn) have the three accumulation points −1,12 and 1. The sum of both sequences is an+bn={0 falls n=2k1falls n=2k+1 And has the accumulation points 0 and 1. Therefore, lim supn→∞an+lim infn→∞bn⏟=1+(−1)=0<lim supn→∞(an+bn)⏟=1<lim supn→∞an+lim supn→∞bn⏟=1+1=2