Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.6, p. 540 — |Σ_i E[(X_i − p_i)f(V^{(i)} + 1)]| ≤ 6‖f‖nφ(m + 1)

Proved
PoissonDepTrials.MixSqrt.lemma_4_6

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

bernoulli-trialsmixingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-approximation

Let X1,…,XnX_1,\dots,X_nX1​,…,Xn​ be Bernoulli random variables on a probability space (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P), possibly dependent, with pi=P(Xi=1)p_i=P(X_i=1)pi​=P(Xi​=1), and put W=∑i=1nXiW=\sum_{i=1}^n X_iW=∑i=1n​Xi​ and λ=∑i=1npi\lambda=\sum_{i=1}^n p_iλ=∑i=1n​pi​. As on p. 535, XiX_iXi​ is taken to be identically zero when i≤0i\le 0i≤0 or i≥n+1i\ge n+1i≥n+1. Assume that X1,…,XnX_1,\dots,X_nX1​,…,Xn​ satisfy Ibragimov's mixing condition (4.1) with a nonincreasing sequence φ(k)↓0\varphi(k)\downarrow 0φ(k)↓0. Fix m≥0m\ge0m≥0. Then for every function fff on the nonnegative integers with ∣f∣≤M|f|\le M∣f∣≤M,

∣∑i=1nE[(Xi−pi)f(V(i)+1)]∣≤6M n φ(m+1).\Bigl|\sum_{i=1}^nE\bigl[(X_i-p_i)f(V^{(i)}+1)\bigr]\Bigr|\le6M\,n\,\varphi(m+1).​i=1∑n​E[(Xi​−pi​)f(V(i)+1)]​≤6Mnφ(m+1).

Applied with f=Sλhf=S_\lambda hf=Sλ​h and Lemma 3.3, this bounds the middle error term of (2.6) by 24min⁡(λ−1/2,1) nφ(m+1)24\min(\lambda^{-1/2},1)\,n\varphi(m+1)24min(λ−1/2,1)nφ(m+1).

Formalization Note The trials are a sequence X:N→Ω→NX:\mathbb N\to\Omega\to\mathbb NX:N→Ω→N that is measurable, almost surely {0,1}\{0,1\}{0,1}-valued, and identically 000 at index 000 and above nnn (the paper's padding convention, which changes no σ\sigmaσ-algebra). pip_ipi​ is defined as P(Xi=1)P(X_i=1)P(Xi​=1), not a free parameter. ∥f∥\|f\|∥f∥ is an arbitrary bound MMM.

Preamble
import Mathlib
import Definitions.Def_PoissonDepTrials_MixSqrt_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace PoissonDepTrials.MixSqrt

/-- Chen (1975), Lemma 4.6, p. 540, (4.11). For Bernoulli trials satisfying (4.1) and every
function `f` on the nonnegative integers bounded by `M`,
`|Σ_{i=1}^n E[(X_i − p_i)f(V^{(i)} + 1)]| ≤ 6‖f‖nφ(m + 1)`. -/
theorem lemma_4_6 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (n : ℕ) (X : ℕ → Ω → ℕ) (hX : IsBernoulliTrials P n X) (φ : ℕ → ℝ)
    (hφ : IbragimovMixing P X φ) (m : ℕ) (f : ℕ → ℝ) (M : ℝ) (hM : ∀ k, |f k| ≤ M) :
    |∑ i ∈ Finset.Icc 1 n, ∫ ω, ((X i ω : ℝ) - prob P X i) * f (V n m X i ω + 1) ∂P|
      ≤ 6 * M * n * φ (m + 1) := by sorry

end PoissonDepTrials.MixSqrt
Source
Chen, Poisson approximation for dependent trials, Ann. Probab. 3 (1975), p. 540, Lemma 4.6, (4.11)
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