A sequence with a single dominating random variable is in probability
ProvedMeasureTheory.tendstoInMeasure_inv_sqrt_mul_of_dominatedLet be a sequence of real random variables on a finite measure space, and suppose there is a single measurable dominating the whole sequence, for every and . Then
Why this is the right hypothesis. No integrability whatsoever is assumed: need not be in , let alone . All that is used is that is finite at every point. Indeed for fixed ,
and the sets decrease to , since is a finite real number while . 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,
where solves the Poisson equation . For a uniformly ergodic chain and bounded the solution is bounded, so the remainder is dominated by the constant ; this lemma then says the remainder divided by vanishes in probability, so it cannot affect the limit law. Taking recovers the familiar special case that a fixed random variable scaled by tends to in probability.
import Mathlib.MeasureTheory.Function.ConvergenceInMeasure import Mathlib.Analysis.SpecialFunctions.Sqrt open MeasureTheory Filter open scoped ENNReal NNReal Topology
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