Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Proved
PoissonDepTrials.MixSqrt.identity_2_6

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

bernoulli-trialsp2o-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), 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 λ>0\lambda>0λ>0, fix a nonnegative integer mmm, and let hhh be a bounded real function on the nonnegative integers with Stein solution SλhS_\lambda hSλ​h (2.5). 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∣≤mpi E[Xj ΔSλh(Yi,j−1+1)].\begin{aligned} 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]\\ &\quad-\sum\sum_{|i-j|\le m}p_i\,E\bigl[X_j\,\Delta S_\lambda h(Y_{i,j-1}+1)\bigr]. \end{aligned}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)].​

No assumption on the dependence between the trials is made.

The identity reduces the Poisson approximation problem to bounding the three error terms on the right, which is what §§3–4 do.

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. The hypothesis λ>0\lambda>0λ>0 is implicit on the page (SλhS_\lambda hSλ​h divides by λw\lambda^wλw). Boundedness of hhh is given as ∣h∣≤M|h|\le M∣h∣≤M.

Preamble
import Mathlib
import Definitions.Def_PoissonDepTrials_MixSqrt_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace PoissonDepTrials.MixSqrt

/-- Chen (1975), §2, p. 536, (2.6): substituting `f = S_λh` into (2.2),
`Eh(W) = 𝒫_λh + ΣΣ_{0<|i−j|≤m} E[X_iX_jΔS_λh(Y'_{i,j−1} + 1)]
  + Σ_i E[(X_i − p_i)S_λh(V^{(i)} + 1)] − ΣΣ_{|i−j|≤m} p_i E[X_jΔS_λh(Y_{i,j−1} + 1)]`,
for an arbitrary sequence of dependent Bernoulli trials with `λ > 0` and bounded `h`. -/
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.MixSqrt
Source
Chen, Poisson approximation for dependent trials, Ann. Probab. 3 (1975), p. 536, §2, (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