# Homework Help: Limit superior & limit inferior of a sequence

1. Jan 14, 2010

### kingwinner

1. The problem statement, all variables and given/known data
Fact:
Let a=lim sup an.
Then for all ε>0, there exists N such that if n≥N, then an<a+ε

Theorem 1:
If lim an = a exists, then lim sup an = lim inf an = a.
n->∞

Theorem 2:
If lim sup an = lim inf an = a, then
lim an exists and equals a.
n->∞

2. Relevant equations
N/A

3. The attempt at a solution
I was trying to see why theorems 1 & 2 are true.
How can we prove these rigorously?

I wrote down all the definitions, but still I don't know how to prove theorems 1 and 2.

Let an be a sequence of real numbers. Then by definition, an->a iff
for all ε>0, there exists an integer N such that n≥N => |an - a|< ε.

Also, lim sup an is defined as
lim sup{an: n≥N}
N->∞
(similarly for lim inf)

Any help is much appreciated! :)

2. Jan 15, 2010

### HallsofIvy

For Theorem 2 you also need:
Let a= lim inf an.
Then for all ε> 0 there exists N such that if n≥N, then an> a-ε
If the sequence converges to a, the every subsequence converges to a so the set of all "subsequential limits" is simply {a}.

Since a= lim sup an and lim inf an, you have both of the above so that, for any ε> 0 there exist N such that if n≥ N then a-ε< an< a+ε.

3. Jan 16, 2010

### kingwinner

1) About theorem 1, I haven't seen the version of the definition that you gave for lim sup and lim inf. My version of the definition is sipmly:
lim sup an is defined as
lim [sup{an: n≥N}]
N->∞

lim inf an is defined as
lim [inf{an: n≥N}]
N->∞

How can we prove theorem 1 directly by using these definitions (and the definition of "limit")?

2) Suppose a=lim sup an= lim inf an.
Then for all ε>0, there exists N1 such that if n≥N1, then an<a+ε
and for all ε> 0 there exists N2 such that if n≥N2, then an> a-ε
Should I take N=max{N1,N2}? so that n≥N => an<a+ε and an> a-ε, i.e. |an -a|< ε, and therefore an->a.
I think in general we should assume that N1 and N2 may be different (i.e. not necessarily the same N). Is this the correct way to prove theorem 2?

Any help is much appreciated! :)

Last edited: Jan 16, 2010
4. Jan 16, 2010

### Petek

Here are some hints for proving Theorem 1:

1. I'll assume that you're working over the real numbers, not the extended reals where values of + or - infinity are allowed.

2. Show (or simply observe, since it's easy) that lim inf $a_n \leq$ lim sup $a_n$.

3. Show that |$a_n$ - a| < $\epsilon$ implies that $a_n$ < a + $\epsilon$.

4. What, then, can you say about lim sup $a_n$ in terms of a and $\epsilon$?

5. What does the relation in #4 imply about lim sup $a_n$ and a?

6. Using similar arguments, derive an analogous relation between lim inf $a_n$ and a.

7. Use the observation in #2 above to finish the proof.

HTH

Petek

5. Jan 17, 2010

### kingwinner

Thanks for your hints, but still I don't know how to prove theorem 1 (I have no idea how to prove 2,4,5).

Here is a proof of theorem 1 from my notes:
an->a
=> for all ε>0, there exists N such that if n≥N => |an-a|<ε
So n≥N => a-ε < an < a+ε
=> for all N' ≥N, a-ε ≤ sup{an: n ≥ N' } ≤ a+ ε
Thus, sup{an: n≥N} -> a as N->∞

==============================

But I really have absolutely no idea why the last two lines (highlighted in blue) are true. What is the point of introducing N' ? And why is it true that for all N' ≥N, a-ε ≤ sup{an: n ≥ N' } ≤ a+ ε?

6. Jan 18, 2010

### kingwinner

for all n≥N, a-ε < an < a+ε
=> for all N' ≥N, a-ε ≤ sup{an: n ≥ N' } ≤ a+ ε

Why is this implication true? (particularly the lower bound)

Help...I am totally confused. Could someone kindly explain?
Any help is much appreciated! [I'm dying on this proof :( ]

7. Jan 18, 2010

### Petek

I'll try to explain this. To simplify the notation, define

$V_{N'}$ = {$a_n$: n $\geq$ N'}

and

$v_{N'}$ = sup {$V_{N'}$}

Then $V_1 \supseteq V_2 \supseteq V_3 \supseteq ...$, and
$v_1 \geq v_2 \geq v_3 \geq ...$

(The second string of inequalities follows from the rule that if S and T are subsets of the reals and S $\supseteq$T, then sup S $\geq$ sup T, which you should have already covered in your class.)

Now, using the above notation, we have to show that

$a - \epsilon \leq v_{N'} \leq a + \epsilon$

For the right inequality, we have that $a_n < a + \epsilon$, so $a + \epsilon$ is an upper bound for $V_{N'}$. Since $v_{N'}$ is the least upper bound for these sets, it follows that [tex]v_{N'} \leq a + \epsilon[/itex], as required.

To get the left inequality, argue as above, but use inf instead of sup. Define $u_{N'}$ = inf {$a_{N'}: N' \geq N$}. Show that $a - \epsilon \leq u_{N'}$ similar to the above. Finally, observe that inf $u_{N'} \leq$sup $v_{N'}$ and you get the left inequality.

HTH

Petek