Processing math: 100%
Press "Enter" to skip to content

Month: January 2019

Law of large numbers

This post is devoted to a quick proof of a version of the law of large numbers for non-negative random variables in L2. It does not require independence or same distribution. It is a variant of the famous one for independent random variables bounded in L4.

The statement. If X1,X2, are non-negative L2 random variables on (Ω,A,P) such that limn1nE(Sn)=R, and Var(Sn)=O(n) where Sn:=X1++Xn, then limnSnn= almost surely.

A proof. We have E(n(Sn2E(Sn2)n2)2)=nVar(Sn2)n4=O(n1n2)<. It follows that n(Sn2E(Sn2)n2)2< almost surely, which implies that Sn2E(Sn2)n20 almost surely. This gives that 1n2Sn2 almost surely. It remains to use the sandwichSn2n2n2(n+1)2SkkS(n+1)2(n+1)2(n+1)2n2 valid if k is such that n2k(n+1)2 (here we use the non-negative nature of the X's).

Note and further reading. I have learnt this proof recently from my friend Arnaud Guyader who found it in a paper (Theorem 5) by Bernard Delyon and François Portier. It is probably a classic however. It is possible to drop the assumption of being non-negative by using X=X+X, but this would require to modify the remaining assumptions, increasing the complexity, see for instance Theorem 6.2 in Chapter 3 of Erhan Çinlar book (and the blog post comments below). The proof above has the advantage of being quick and beautiful.

9 Comments
Syntax · Style · .