Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2.6), p. 536 — Eh(W) = 𝒫_λh + the three error terms in S_λh

Proved
PoissonDepTrials.MixInv.identity_2_6

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-approximationstein-chen-method

Let X1,…,XnX_1,\dots,X_nX1​,…,Xn​ be Bernoulli random variables on a probability space (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P), with pi=P(Xi=1)=1−P(Xi=0)p_i=P(X_i=1)=1-P(X_i=0)pi​=P(Xi​=1)=1−P(Xi​=0), padded by Xi≡0X_i\equiv 0Xi​≡0 for i≤0i\le 0i≤0 and i≥n+1i\ge n+1i≥n+1. Write 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​. Assume λ>0\lambda>0λ>0, fix m≥0m\ge0m≥0 and a bounded hhh. Then

Eh(W)=Pλh+∑∑0<∣i−j∣≤mE[XiXj ΔSλh(Yi,j−1′+1)]+∑i=1nE[(Xi−pi)Sλh(V(i)+1)]−∑∑∣i−j∣≤mpiE[Xj ΔSλh(Yi,j−1+1)].Eh(W)=\mathcal P_\lambda h+\sum\sum_{0<|i-j|\le m}E\bigl[X_iX_j\,\Delta S_\lambda h(Y'_{i,j-1}+1)\bigr]+\sum_{i=1}^nE\bigl[(X_i-p_i)S_\lambda h(V^{(i)}+1)\bigr]-\sum\sum_{|i-j|\le m}p_iE\bigl[X_j\,\Delta S_\lambda h(Y_{i,j-1}+1)\bigr].Eh(W)=Pλ​h+∑0<∣i−j∣≤m∑​E[Xi​Xj​ΔSλ​h(Yi,j−1′​+1)]+i=1∑n​E[(Xi​−pi​)Sλ​h(V(i)+1)]−∑∣i−j∣≤m∑​pi​E[Xj​ΔSλ​h(Yi,j−1​+1)].

This is the basic identity (2.2) with f=Sλhf=S_\lambda hf=Sλ​h; bounding its three error terms proves Theorems 4.1 and 4.2.

Formalization Note The trials are X:N→Ω→NX:\mathbb N\to\Omega\to\mathbb NX:N→Ω→N with IsBernoulliTrials (measurable, zero outside [1,n][1,n][1,n], at most 111 almost surely); pip_ipi​ is the definition prob, so it cannot disagree with XXX. Constant padding variables generate the trivial σ\sigmaσ-algebra, so (4.1) for the padded sequence is (4.1) for X1,…,XnX_1,\dots,X_nX1​,…,Xn​. Double sums over ∣i−j∣|i-j|∣i−j∣ are computed in Z\mathbb ZZ. λ>0\lambda>0λ>0 is required for SλhS_\lambda hSλ​h to be defined and is stated; boundedness of hhh is a bound MMM.

Preamble
import Mathlib
import Definitions.Def_PoissonDepTrials_MixInv_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace PoissonDepTrials.MixInv

theorem identity_2_6 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (n : ℕ) (X : ℕ → Ω → ℕ) (hX : IsBernoulliTrials P n X) (hlam : 0 < lam P n X) (m : ℕ) (h : ℕ → ℝ) (M : ℝ)
    (hM : ∀ k, |h k| ≤ M) :
    ∫ ω, h (W n X ω) ∂P = poissonExp (lam P n X) h
      + (∑ i ∈ Finset.Icc 1 n, ∑ j ∈ Finset.Icc 1 n with 0 < |(i : ℤ) - ((j : ℕ) : ℤ)| ∧ |(i : ℤ) - ((j : ℕ) : ℤ)| ≤ m,
          ∫ ω, (X i ω : ℝ) * X j ω *
            delta (stein (lam P n X) h) (Y' n m X i ((j : ℤ) - 1) ω + 1) ∂P)
      + (∑ i ∈ Finset.Icc 1 n,
          ∫ ω, ((X i ω : ℝ) - prob P X i) * stein (lam P n X) h (V n m X i ω + 1) ∂P)
      - ∑ i ∈ Finset.Icc 1 n, ∑ j ∈ Finset.Icc 1 n with |(i : ℤ) - ((j : ℕ) : ℤ)| ≤ m,
          prob P X i * ∫ ω, (X j ω : ℝ) *
            delta (stein (lam P n X) h) (Y n m X i ((j : ℤ) - 1) ω + 1) ∂P := by sorry

end PoissonDepTrials.MixInv
Source
Chen, Poisson approximation for dependent trials, Ann. Probab. 3 (1975), p. 536, (2.6)
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