Tricki

## To prove convergence, find a rapidly converging subsequence

### Quick description

Any subsequence of a convergent sequence also converges to the limit of the original sequence. One can reverse this idea and study first the convergence of a special subsequence of the original sequence. This study will be simpler than studying the original sequence because one is allowed to choose as well behaving a subsequence as one wishes. If the chosen subsequence converges, this can be useful in several ways. First, if there is no apriori candidate for limit, the limit of the subsequence identifies a unique candidate for the limit of the whole sequence 2) if the chosen subsequence approximates the whole sequence well then this can be used to show that the whole sequence converges to the limit of the subsequence.

### Example 1

The proof of the strong law of large numbers. Richard Durrett, Probability: Theory and Examples, Second edition, Chapter 1. This theorem concerns a sequence , ,..., of pairwise independent, identically distributed random variables on a probability space with . The strong law of large numbers states that

almost surely. That is, there is a measurable subset with and (1) holds for every .

The proof involves several ideas, one of which is passing to a simple convergent subsequence.

The argument begins with a truncation (see also replace your sequence with a simpler one): we replace the random variables with . (See the truncation article on why truncation makes sense and for thoughts on where to truncate).

We give the details of this replacement as it demonstrates well several interesting ideas. Let . and can differ only on a subset of for infinitely many or infinitely often as this type of statements are commonly made in probability theory. (A link to an article on zero one laws, Borel Cantelli lemma).

By Borel Cantelli Lemma we know that if . In the current problem this sum is intimately related to the assumptions of our problem. We see this with an integration using control level sets:

Rest of the steps:

• Replace with (Durrett cites Etemadi as the source of this idea)

• Choose a subsequence of for which simple Borel Cantelli and Chebyshev inequality works (here the expression naturally comes up and one needs to bound this sum; once again control level sets are used). One also uses Fubini's theorem to change the order of a double sum. The choice of the subsequence: i think the key idea here is to choose a partition of the time index so that the intervals are getting large enough with to make Chebyshev's inequality sufficiently precise to imply the desired convergence. Durrett uses and in the final argument is sent to .

• Use monotonicity (which the first item brought) to show that the chosen subsequence approximates the whole sequence well.