Bounded convergence theorem for convergence in probability
ProvedMeasureTheory.tendsto_integral_of_tendstoInMeasure_of_boundedBounded convergence theorem, with convergence in probability in place of almost-everywhere convergence. If is a uniformly bounded sequence of real random variables, everywhere, and in probability, then
Why the usual dominated convergence theorem does not apply. Convergence in probability does not imply almost-everywhere convergence — the classical "typewriter" sequence of indicators of sliding intervals on converges in probability to while converging almost nowhere. One can always extract an a.e.-convergent subsequence, but recovering the full limit from that requires a sub-subsequence argument. The direct proof below avoids it entirely.
Proof. Fix and split the space according to the size of :
because on the first term already dominates, and on the second does. Integrating against the probability measure,
Convergence in probability makes the second term vanish as for each fixed , so ; since was arbitrary, the limit is . Taking and then large enough that turns this into the explicit – statement.
Where it is used. This is the standard device for discarding asymptotically negligible remainders inside expectations of bounded test functions. In central limit theorems for dependent sequences one compares with where in probability and is bounded and Lipschitz; then is bounded by and tends to in probability, and this lemma yields . No integrability of itself is needed anywhere.
import Mathlib.MeasureTheory.Function.ConvergenceInMeasure import Mathlib.MeasureTheory.Integral.Bochner.Set open MeasureTheory Filter open scoped ENNReal NNReal Topology
theorem MeasureTheory.tendsto_integral_of_tendstoInMeasure_of_bounded {Ω : Type*}
[MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ] (G : ℕ → Ω → ℝ)
(hG : ∀ n, Measurable (G n)) (B : ℝ) (hB : ∀ n ω, |G n ω| ≤ B)
(h0 : TendstoInMeasure μ G atTop 0) :
Tendsto (fun n => ∫ ω, G n ω ∂μ) atTop (𝓝 0) := by sorry