Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, p. 764 (Lukács 1975, Thm 4.2.1) — Σ_n E|Y_n| < ∞ implies Σ_n |Y_n| < ∞ a.s.

Proved
AdaptiveProtection.Convergence.lemma1_summable_ae

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

almost-sure-convergencep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityseries

Let (Yn)n≥0(Y_n)_{n \ge 0}(Yn​)n≥0​ be a sequence of integrable real random variables on a probability space (Ω,F,P)(\Omega, \mathcal F, P)(Ω,F,P) with

∑nE∣Yn∣<+∞.\sum_n E|Y_n| < +\infty.n∑​E∣Yn​∣<+∞.

Then

∑n∣Yn∣<+∞almost surely.\sum_n |Y_n| < +\infty \quad \text{almost surely.}n∑​∣Yn​∣<+∞almost surely.

In the proof of Theorem 1 this turns the summability in mean of γn∣θin−θi∗∣\gamma_n|\theta^n_i - \theta^*_i|γn​∣θin​−θi∗​∣ into almost-sure summability.

Formalization Note The page's hypothesis "EYn<+∞EY_n < +\inftyEYn​<+∞ for all nnn" is read as integrability of each YnY_nYn​, which the summability of E∣Yn∣E|Y_n|E∣Yn​∣ already forces.

Preamble
import Mathlib
import Definitions.Def_NestedSeatAlloc_ProbCond_Model
import Definitions.Def_AdaptiveProtection_Convergence_Setting

open MeasureTheory Filter Topology
Formal statement
namespace AdaptiveProtection.Convergence

/-- Lemma 1 (p. 764; Lukács 1975, Theorem 4.2.1): if `∑_n E|Y_n| < ∞`, then `∑_n |Y_n| < ∞` a.s. -/
theorem lemma1_summable_ae
    {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
    (Y : ℕ → Ω → ℝ) (hY : ∀ n, Integrable (Y n) μ)
    (hsum : Summable fun n => ∫ ω, |Y n ω| ∂μ) :
    ∀ᵐ ω ∂μ, Summable fun n => |Y n ω| := by sorry

end AdaptiveProtection.Convergence
Source
van Ryzin & McGill, Management Science 46(6), 2000, p. 764, Lemma 1 (citing Lukács 1975, Theorem 4.2.1)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me