WorksMathematics
On shared responsibility, fish, and the strong law of large numbers
Abstract
We give a new, short, and intuitive proof of the strong law of large numbers for i.i.d. random variables.
While probability theory is largely abstract, many of its fundamental results are easy to observe in real life, even without writing abstract formulas. A prominent example is the law of large numbers (LLN). While one draw of a random variable, or a result of one experiment may be arbitrarily far from the expected value, it is natural to expect that the empirical average of many draws converges to the expected value. The strong variant of LLN specifies the mode of this convergence, using one of the strongest notions of convergence in probability theory — convergence almost surely.
Theorem 1. Let be i.i.d. real valued random variables with . Let , and for every , let . Then, almost surely as .
The statement’s intuition can be easily grasped without an extensive mathematical training, and at the same time this law is one of the fundamental results in probability theory. This naturally led to several approaches to prove it: some of the classical treatments include Kolmogorov’s truncation argument [3 Chapter 7], backwards martingales [2 Chapter 4], and the duality of the random walk [1]. Here, we give an intuitive proof connecting foundational concepts that are usually already taught in a basic probability course. In fact, we claim that putting rigour aside for a moment, the proof idea is natural for this result.
To say that converges to almost surely is equivalent to saying that the event that does not converge to has zero measure. Let us look closely at this region , where (see Figure 1a). On one hand, an individual experiment has nothing to do with the limit value of behaving out of place, which mathematically corresponds to being independent of . Hence, on , it still behaves
(a) The orange region is the event .
(b) The orange slices indexed by are the events . If , there are infinitely many indices such that for a fixed .
Figure 1.
typically and its expected value remains at — in other words, is innocent. However, at the finite scale2 things change. If does not converge to , it means that there are infinitely many indices such that the finite average is above or below . Equivalently, in , there are infinitely many non-empty slices with, say, for a fixed , see Figure 1b (these slices may in fact overlap; we will address this slight inconvenience in the formal proof). On each such a slice, since all the experiments are identical and independent, we anticipate the typical value of each one of them — including — to be higher than . In other words, they are exchangeable with each other and so when they all look the same, they all share the blame. The only way to consolidate this contradiction is if this region has zero measure, or equivalently, were to converge almost surely to . Below, we give a proof formalising this intuition.
Proof of Theorem 1. Without loss of generality, let . For any , define events
Assume there is an such that . Then there exists such that for infinitely many indices , either or . Therefore, , and the statement follows if we show . Since the two cases are analogous, we show it for . Fix such , and abbreviate .
is innocent. Define . Since as , we have that almost surely. Thus,
where the penultimate equality follows since is independent of .
When they all look the same, shares the blame. In what remains, we show that . Together with (1), this will imply that . Note that , and thus increases to with . Since for every , and , by the dominated convergence theorem,
For every , define . Considering these disjoint events allows us to decompose into . This, in turn, gives
We will now bound separately each summand on the right hand side. (The motivation to decompose into the disjoint events is that we will bound each summand separately, however even if the expectation is bounded on two events, it is not necessarily that the same bound holds on the union of these events unless they are disjoint3.
Since are i.i.d. and since is symmetric with respect to , we have that for every ,
Summing over indices and dividing by gives us
Substituting the above in (3), we obtain . Therefore, taking , by (2) we obtain , as required.
Considering that is innocent as , this can only hold if , as in Figure 2.
Figure 2. No fish (of non-zero measure) in the pond.
Acknowledgements
The authors would like to thank Afonso S. Bandeira, Ron Peled, Benny Sudakov, Vincent Tassion, and Maksim Zhukovskii for valuable comments and suggestions.
Use of AI
AI tools were used to assist with transforming hand-drawn sketches into the tikz code for the figures; no real fish were hurt during the process of human generation of the rest.
References
- [1][Cur22] Nicolas Curien. “Yet another proof of the strong law of large numbers”. In: Amer. Math. Monthly 129.10 (2022), pp. 972–974. DOI: 10.1080/00029890.2022.2115820.DOI
- [2][Dur19] Rick Durrett. Probability—theory and examples. Fifth. Vol. 49. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge: Cambridge University Press, 2019. DOI: 10.1017/9781108591034.
- [3][Fel71] William Feller. An introduction to probability theory and its applications. Vol. II. Second. New York–London–Sydney: John Wiley & Sons, Inc., 1971.


