Documentation

Atlas.TheoryOfProbability.code.CenteredConvergence

On a probability space, the norm is dominated by the norm: ‖f‖₁ ≤ ‖f‖₂.

If ∫ ‖f‖² dμ ≤ C for an function on a probability space, then ‖f‖₁ ≤ √C.

theorem KolmogorovThreeSeries.ae_tendsto_sum_of_indep_centered_L1bdd {Ω : Type u_1} [MeasurableSpace Ω] {μ : MeasureTheory.Measure Ω} [MeasureTheory.IsProbabilityMeasure μ] {Z : Ω} (hZ_sm : ∀ (n : ), MeasureTheory.StronglyMeasurable (Z n)) (hZ_indep : ProbabilityTheory.iIndepFun Z μ) (hZ_mean : ∀ (n : ), (ω : Ω), Z n ω μ = 0) (hZ_int : ∀ (n : ), MeasureTheory.Integrable (Z n) μ) {R : NNReal} (hZ_L1_bdd : ∀ (n : ), MeasureTheory.eLpNorm (fun (ω : Ω) => kFinset.range (n + 1), Z k ω) 1 μ R) :
∀ᵐ (ω : Ω) μ, ∃ (c : ), Filter.Tendsto (fun (n : ) => kFinset.range (n + 1), Z k ω) Filter.atTop (nhds c)

Key step toward the Kolmogorov three-series theorem: if the Zₙ are independent centered (mean zero) integrable random variables whose partial sums Sₙ = ∑_{k≤n} Zₖ are uniformly bounded in , then Sₙ converges almost surely. This is proved by realizing Sₙ as a martingale and applying the -bounded martingale convergence theorem.