Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5.8), p. 544 — for independent trials, Eh(W) = 𝒫_λh − Σ_i p_i² E U_λh(W^{(i)})

Proved
PoissonDepTrials.SecondOrder.identity_5_8

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

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

Let X1,…,XnX_1,\dots,X_nX1​,…,Xn​ be independent Bernoulli trials with pi=P(Xi=1)p_i=P(X_i=1)pi​=P(Xi​=1), λ=∑ipi>0\lambda=\sum_i p_i>0λ=∑i​pi​>0, W=∑iXiW=\sum_iX_iW=∑i​Xi​ and W(i)=∑k≠iXkW^{(i)}=\sum_{k\ne i}X_kW(i)=∑k=i​Xk​. For every bounded hhh on the nonnegative integers,

Eh(W)=Pλh−∑i=1npi2 E Uλh(W(i)).Eh(W)=\mathscr P_\lambda h-\sum_{i=1}^n p_i^2\,E\,U_\lambda h\bigl(W^{(i)}\bigr).Eh(W)=Pλ​h−i=1∑n​pi2​EUλ​h(W(i)).

This is the first-order identity (2.6) specialised to independent trials (m=0m=0m=0); applying it a second time to EUλh(W(i))EU_\lambda h(W^{(i)})EUλ​h(W(i)) produces the second-order term of Theorem 5.1.

Formalization Note The page writes nEpI2EIUλh(W∗)nEp_I^2E^IU_\lambda h(W^*)nEpI2​EIUλ​h(W∗) with a random index III uniform on {1,…,n}\{1,\dots,n\}{1,…,n} and independent of the trials, and W∗=∑i≠IXiW^*=\sum_{i\ne I}X_iW∗=∑i=I​Xi​; this equals ∑ipi2EUλh(W(i))\sum_ip_i^2EU_\lambda h(W^{(i)})∑i​pi2​EUλ​h(W(i)), the form stated here (the random indices are, in the paper's words, a device so that "the use of symbols may be simplified"). The trials are a sequence X:N→Ω→NX:\mathbb N\to\Omega\to\mathbb NX:N→Ω→N with Xi∈{0,1}X_i\in\{0,1\}Xi​∈{0,1} almost surely and Xi≡0X_i\equiv0Xi​≡0 for i=0i=0i=0 and i>ni>ni>n, the paper's own padding convention (p. 535); constants generate the trivial σ\sigmaσ-algebra, so independence of the padded family is independence of X1,…,XnX_1,\dots,X_nX1​,…,Xn​. λ>0\lambda>0λ>0 is added because UλU_\lambdaUλ​ divides by λ\lambdaλ. ∥h∥\|h\|∥h∥ is replaced by a bound MMM.

Preamble
import Mathlib
import Definitions.Def_PoissonDepTrials_SecondOrder_Setting

open MeasureTheory ProbabilityTheory Finset
Formal statement
namespace PoissonDepTrials.SecondOrder

/-- (5.8), proof of Theorem 5.1, p. 544, in index form: for independent Bernoulli trials,
`Eh(W) = 𝒫_λh − Σ_{i=1}^n p_i² E U_λh(W^{(i)})`. -/
theorem identity_5_8 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (n : ℕ) (X : ℕ → Ω → ℕ) (hX : IsBernoulliTrials P n X) (hind : iIndepFun (fun i => X i) P)
    (hlam : 0 < lam P n X) (h : ℕ → ℝ) (M : ℝ) (hM : ∀ k, |h k| ≤ M) :
    ∫ ω, h (W n X ω) ∂P = poissonExp (lam P n X) h -
      ∑ i ∈ Finset.Icc 1 n, prob P X i ^ 2 * ∫ ω, stU (lam P n X) h (Wi n X i ω) ∂P := by sorry

end PoissonDepTrials.SecondOrder
Source
Chen, Poisson approximation for dependent trials, Ann. Probab. 3 (1975), p. 544, proof of Theorem 5.1, (5.8)
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