Law of the iterated logarithm Created 2026-09-24 Updated 2026-11-05
Let be independent and identically distributed real random variables with and . Write . The iid law of the iterated logarithm states
Finite variance is sufficient in this iid theorem; the lower conclusion follows by applying the upper theorem to . The iterated logarithm is the slowly growing factor .[ref]
For a simple symmetric random walk, . Its scaled partial sums exceed every fixed multiple of along some times almost surely, even though the central limit theorem gives a tight normal limit for at each growing deterministic time. The iterated-logarithm law concerns the extremes encountered along one infinite realization, rather than only the distribution at one time.
It also implies , since , and therefore refines the strong law of large numbers. For the sample mean, the almost-sure envelope is . The upper law of the iterated logarithm and Brownian upper law of the iterated logarithm articles isolate one-sided parts of the argument; proving a summable upper-tail bound alone does not establish the matching lower excursions.
For the simple symmetric random walk, independence and the Rademacher distribution give the moment-generating function
The function is even; for its derivative is , since the derivative of is at most one and . Here and are the hyperbolic cosine and hyperbolic tangent. Hence the exponential-moment estimate is
The supplied exponential maximal bound for a symmetric random walk now gives . For , choose ; for , use the elementary bound by one. Thus
Fix , choose , and set . For large these form an increasing sequence. Apply the preceding exponential maximal bound for a symmetric random walk at with threshold . The resulting probability is at most
We have and . Choose strictly between and ; the displayed probabilities are . By the Borel-Cantelli first lemma, almost surely, eventually . For every , monotonicity of for large therefore gives
Intersect the probability-one events for to obtain the upper law of the iterated logarithm: