Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.2, p. 539 — |E^Y f(Y, Z) − E^Y f(Y, Z′)| ≤ 2‖f‖φ(m) for Y ∈ ℳ_{1k}, Z ∈ ℳ_{k+m,∞}

Proved
PoissonDepTrials.MixInv.lemma_4_2

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

covariance-inequalitymixingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let X1,X2,…X_1,X_2,\dotsX1​,X2​,… be an arbitrary sequence of real random variables satisfying the mixing condition (4.1) with coefficients φ\varphiφ. Let Y=(Y1,…,Yr)Y=(Y_1,\dots,Y_r)Y=(Y1​,…,Yr​) be measurable with respect to M1k\mathcal M_{1k}M1k​ and Z=(Z1,…,Zs)Z=(Z_1,\dots,Z_s)Z=(Z1​,…,Zs​) measurable with respect to Mk+m,∞\mathcal M_{k+m,\infty}Mk+m,∞​, m≥1m\ge1m≥1. Then for every bounded Borel function f:Rr+s→Rf:\mathbb R^{r+s}\to\mathbb Rf:Rr+s→R,

∣EYf(Y,Z)−EYf(Y,Z′)∣≤2∥f∥φ(m)a.s.,|E^Yf(Y,Z)-E^Yf(Y,Z')|\le2\|f\|\varphi(m)\quad\text{a.s.},∣EYf(Y,Z)−EYf(Y,Z′)∣≤2∥f∥φ(m)a.s.,

where Z′Z'Z′ has the law of ZZZ and is independent of the sequence. It is the decoupling inequality used in Lemmas 4.3 and 4.4.

Formalization Note The sequence is real valued and measurable (needed for Ma,b\mathcal M_{a,b}Ma,b​ to be a sub-σ\sigmaσ-algebra). Rr+s\mathbb R^{r+s}Rr+s is written Rr×Rs\mathbb R^r\times\mathbb R^sRr×Rs. EYf(Y,Z′)E^Yf(Y,Z')EYf(Y,Z′) is written, almost surely, as ∫f(Y,z) PZ(dz)\int f(Y,z)\,P_Z(dz)∫f(Y,z)PZ​(dz), which avoids enlarging Ω\OmegaΩ to carry Z′Z'Z′. ∥f∥\|f\|∥f∥ is a bound MMM; the lag satisfies m≥1m\ge1m≥1, as in (4.1).

Preamble
import Mathlib
import Definitions.Def_PoissonDepTrials_MixInv_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace PoissonDepTrials.MixInv

theorem lemma_4_2 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (X : ℕ → Ω → ℝ) (hXm : ∀ i, Measurable (X i)) (φ : ℕ → ℝ) (hφ : IbragimovMixing P X φ)
    (r s k m : ℕ) (hm : 1 ≤ m)
    (Y : Ω → (Fin r → ℝ)) (hY : Measurable[sigmaIcc X 1 k] Y)
    (Z : Ω → (Fin s → ℝ)) (hZ : Measurable[sigmaIci X (k + m)] Z)
    (f : (Fin r → ℝ) × (Fin s → ℝ) → ℝ) (hf : Measurable f) (M : ℝ) (hM : ∀ x, |f x| ≤ M) :
    ∀ᵐ ω ∂P, |(P[fun ω => f (Y ω, Z ω) | MeasurableSpace.comap Y inferInstance]) ω
      - ∫ z, f (Y ω, z) ∂(P.map Z)| ≤ 2 * M * φ m := by sorry

end PoissonDepTrials.MixInv
Source
Chen, Poisson approximation for dependent trials, Ann. Probab. 3 (1975), p. 539, Lemma 4.2, (4.4)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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