Look at the tails
For a bounded real sequence , define
The tail sets shrink as increases, so is decreasing and is increasing. Both are bounded, and therefore converge. Define
A finite set of early terms can change the first few tail bounds but not either limit. Extended values can be used for unbounded sequences, but this unit restricts to bounded sequences so every displayed quantity is real.
Worked example
Oscillation with a vanishing correction
Let . The even subsequence tends to and the odd subsequence to . Since every , the tail supremum is at most ; even terms arbitrarily far out approach , so it is at least . Thus . Similarly for arbitrarily large odd , giving . Therefore and .
Theorem
Subsequential characterization
For a bounded real sequence, the limit superior is the largest subsequential limit and the limit inferior is the smallest subsequential limit. The whole sequence converges if and only if its limit superior and limit inferior are equal; then their common value is the limit.
Proof
Construct subsequences and squeeze the whole sequence
Let and set . Choose increasing indices with ; this is possible by the supremum property of the relevant tail. Since its starting index tends to infinity, its supremum tends to , while after choosing . Thus . If any subsequence tends to , then for each fixed all sufficiently late subsequence terms lie in the th tail, so . Hence . Applying the argument to gives the corresponding infimum conclusion.
For every , . If both bounds tend to the same value, the squeeze principle proves converges to it. Conversely, convergence of the original sequence forces every subsequential limit to equal its limit, so the limsup and liminf agree.
Worked example
A convergent sequence with one large early term
Set and for . The supremum of the entire set of terms is , but . Limit superior concerns arbitrarily late behavior rather than the largest term ever observed.
Method comparison
For explicit alternating patterns, compute limits of their component subsequences and bound all terms. For a direct definition proof, work with tail suprema and infima. To prove ordinary convergence, equalize limsup and liminf; to disprove it, exhibit distinct subsequential limits. Do not equate a global supremum with a tail limit.
Practice
- Find limsup and liminf of .
- Find limsup and liminf of .
- Find limsup and liminf of .
- Explain why a single large initial term does not change limsup.
Full solutions
- Every tail contains both and . Its supremum is and infimum is , so limsup is and liminf is .
- Every tail has supremum and infimum , so both limits are .
- Since , . Both limsup and liminf equal .
- Deleting or changing finitely many terms leaves every sufficiently late tail unchanged. Thus the limits of tail suprema and infima are unchanged.
Synthesis
Limsup and liminf capture the largest and smallest limits accessible along subsequences. They coincide precisely when the whole bounded sequence converges.