Motivation
If a sequence in fails to converge, we would like to be able to measure the extent of the failure. To do so, we will define LimSup and LimInf in the extended real numbers (allowing them to possibly be infinity) for every sequence of real numbers. These will always exist.
Preliminaries
To allow limits to be infinity, we must define what it means to converge to .
Definition 1.
We write if there exists an integer such that .
Ditto with a swap for .
It should be noted that we now use the symbol for certain types of divergent sequences, as well as for convergent sequences, but that the definitions of convergence and of limit, given here, are unchanged.
Definition
À la Kulkarni
Definition 2.
Given a sequence in , define
Both values may be infinite.
À la Rudin
Definition 3.
Let be a sequence of real numbers. Let be the set of numbers (in the extended real number system) such that for some subsequence . This set contains all subsequential limits of , plus possibly and . Define
The numbers and are called the upper and lower limits of . We use the notation
Reconciling the two
We have to show that, for a sequence ,
Proof
FTSOC, assume not. Let and let . Let be . We have two cases:
Case 1: .
Let . There exists such that for all , . Thus, for all , . However, this implies no subsequence of can converge to any point greater than . Thus, is an upper bound for . This contradicts our hypothesis that is the supremum of all subsequential limits.
Case 2: .
Let . Note that is a monotone decreasing sequence. Since , there exists such that , and since is the supremum of the tail , there exists , such that . Thus, we can construct a subsequence of which converges to . However, this contradicts our hypothesis that is an upper bound of all subsequential limits. ❏
Some observations and theorems
These will be using Kulkarni’s definitions.
- Note that form a monotone decreasing sequence. Thus, .
- Similarly, form a monotone increasing sequence. Thus, .
- Quick exercise: show that for all .
- Thus, we have .
- Note that means that every is .
Theorem 4.
Let be a sequence. Then, .
Proof
Pick any . for all . Thus, is an upper bound for the set of all infima. Thus, . Since was arbitrary, the preceding statement is valid for all . Thus, is a lower bound for the set of all suprema. Thus, . ❏
Theorem 5.
If for , where is fixed, then
The above result is rather intuitive once you internalize what limsup and liminf mean:
Important result
Important
Let . Then,
- for all , there exists such for all , we have .
- for all , for all , there exists such that .
Let . Then,
- for all , for all , there exists such that .
- for all , there exists such for all , we have .
Limsup = Liminf iff the sequence converges
Theorem 6.
Proof of
Suppose . Let . There exists an such that for all , , i.e, . Thus, and and must lie in which implies and must also lie in . If we consider a sequence of ‘s , it follows from the nested interval property that . ❏
Proof of
= = , i.e, (monotonically from above), and (monotonically from below). Let . Find such that for all , we have and . Now,
❏