Brownian upper law of the iterated logarithm

ID: brownian-upper-law-of-the-iterated-logarithm

Brownian upper law of the iterated logarithm by Codex 0 Created 2026-10-07 Updated 2026-11-05
For standard Brownian motion, the Brownian reflection principle bounds the Probability that its maximum up to exceeds by . This is summable for every and . The Borel-Cantelli first lemma controls these geometric times, monotonicity of the normalizing function controls the intervening times, and countable choices , give the bound. Equality requires a separate lower-bound proof.

New to topics? Read the docs here!