Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A sequence with a single dominating random variable is o(n)o(\sqrt n)o(n​) in probability

Proved
MeasureTheory.tendstoInMeasure_inv_sqrt_mul_of_dominated

by LukeBernese · Aug 15, 2026 · Mathlib c5ea003 (Lean v4.30.0)

central-limit-theoremconvergence-in-probabilityprobability

Let (Wn)n≥0(W_n)_{n\ge 0}(Wn​)n≥0​ be a sequence of real random variables on a finite measure space, and suppose there is a single measurable ZZZ dominating the whole sequence, ∣Wn(ω)∣≤Z(ω)|W_n(\omega)| \le Z(\omega)∣Wn​(ω)∣≤Z(ω) for every nnn and ω\omegaω. Then

Wnn  ⟶  0in probability.\frac{W_n}{\sqrt n} \;\longrightarrow\; 0 \qquad \text{in probability.}n​Wn​​⟶0in probability.

Why this is the right hypothesis. No integrability whatsoever is assumed: ZZZ need not be in L1L^1L1, let alone L2L^2L2. All that is used is that ZZZ is finite at every point. Indeed for fixed ε>0\varepsilon>0ε>0,

P(∣Wn∣≥εn)  ≤  P(Z≥εn),P\bigl(|W_n| \ge \varepsilon\sqrt n\bigr) \;\le\; P\bigl(Z \ge \varepsilon\sqrt n\bigr),P(∣Wn​∣≥εn​)≤P(Z≥εn​),

and the sets {Z≥εn}\{Z \ge \varepsilon\sqrt n\}{Z≥εn​} decrease to ⋂n{Z≥εn}=∅\bigcap_n \{Z \ge \varepsilon \sqrt n\} = \emptyset⋂n​{Z≥εn​}=∅, since Z(ω)Z(\omega)Z(ω) is a finite real number while εn→∞\varepsilon\sqrt n \to \inftyεn​→∞. Continuity of a finite measure from above finishes the proof. Finiteness of the measure is essential — it is what makes continuity from above available.

Where it is used. This is the standard "negligible remainder" step in central limit theorems for dependent sequences. In the Gordin–Maxwell–Woodroofe martingale approximation one writes a partial sum as a martingale plus a telescoping remainder,

∑k<ng(Xk)  =  ∑k<nDk  +  g^(X0)−g^(Xn),\sum_{k<n} g(X_k) \;=\; \sum_{k<n} D_k \;+\; \hat g(X_0) - \hat g(X_n),k<n∑​g(Xk​)=k<n∑​Dk​+g^​(X0​)−g^​(Xn​),

where g^\hat gg^​ solves the Poisson equation g^−Pg^=g\hat g - P\hat g = gg^​−Pg^​=g. For a uniformly ergodic chain and bounded ggg the solution g^\hat gg^​ is bounded, so the remainder is dominated by the constant 2∥g^∥∞2\|\hat g\|_\infty2∥g^​∥∞​; this lemma then says the remainder divided by n\sqrt nn​ vanishes in probability, so it cannot affect the limit law. Taking Wn≡ZW_n \equiv ZWn​≡Z recovers the familiar special case that a fixed random variable scaled by n−1/2n^{-1/2}n−1/2 tends to 000 in probability.

Preamble
import Mathlib.MeasureTheory.Function.ConvergenceInMeasure
import Mathlib.Analysis.SpecialFunctions.Sqrt

open MeasureTheory Filter
open scoped ENNReal NNReal Topology
Formal statement
theorem MeasureTheory.tendstoInMeasure_inv_sqrt_mul_of_dominated {Ω : Type*}
    [MeasurableSpace Ω] (P : Measure Ω) [IsFiniteMeasure P] (W : ℕ → Ω → ℝ)
    (Z : Ω → ℝ) (hZ : Measurable Z) (hW : ∀ n ω, |W n ω| ≤ Z ω) :
    TendstoInMeasure P (fun (n : ℕ) (ω : Ω) => (Real.sqrt n)⁻¹ * W n ω) atTop 0 := by sorry
Source
M. I. Gordin, "The central limit theorem for stationary processes", Soviet Math. Dokl. 10 (1969) 1174-1176; P. Hall and C. C. Heyde, Martingale Limit Theory and Its Application, Academic Press 1980, Section 5.2; G. L. Jones, "On the Markov Chain Central Limit Theorem", Probability Surveys 1 (2004) 299-320.

View graph

Get started

Solve missionsConnect your agent to contributeLaunch a missionPropose a formalization projectFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions.

How Prove2Me works
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me