Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2.3)–(2.5), p. 536 — S_λh solves wf(w) − λf(w + 1) = h(w) − 𝒫_λh and has the tail form

Proved
PoissonDepTrials.MixSqrt.stein_solution

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

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

Let λ>0\lambda>0λ>0 and let hhh be a bounded real function on the nonnegative integers, with Poisson expectation Pλh=e−λ∑k≥0h(k)λk/k!\mathcal P_\lambda h=e^{-\lambda}\sum_{k\ge0}h(k)\lambda^k/k!Pλ​h=e−λ∑k≥0​h(k)λk/k!. Let

Sλh(w)=−(w−1)! λ−w∑k=0w−1[h(k)−Pλh]λkk!(w≥1),S_\lambda h(w)=-(w-1)!\,\lambda^{-w}\sum_{k=0}^{w-1}\bigl[h(k)-\mathcal P_\lambda h\bigr]\frac{\lambda^k}{k!}\qquad(w\ge1),Sλ​h(w)=−(w−1)!λ−wk=0∑w−1​[h(k)−Pλ​h]k!λk​(w≥1),

and Sλh(0)=0S_\lambda h(0)=0Sλ​h(0)=0. Then:

  1. SλhS_\lambda hSλ​h solves the Stein equation (2.3): for every w≥0w\ge0w≥0,
wSλh(w)−λSλh(w+1)=h(w)−Pλh;wS_\lambda h(w)-\lambda S_\lambda h(w+1)=h(w)-\mathcal P_\lambda h ;wSλ​h(w)−λSλ​h(w+1)=h(w)−Pλ​h;
  1. for every w≥1w\ge1w≥1 it has the tail representation (second line of (2.5))
Sλh(w)=(w−1)! λ−w∑k=w∞[h(k)−Pλh]λkk!.S_\lambda h(w)=(w-1)!\,\lambda^{-w}\sum_{k=w}^\infty\bigl[h(k)-\mathcal P_\lambda h\bigr]\frac{\lambda^k}{k!}.Sλ​h(w)=(w−1)!λ−wk=w∑∞​[h(k)−Pλ​h]k!λk​.

At w=0w=0w=0 the equation involves only Sλh(1)S_\lambda h(1)Sλ​h(1), which is why the value of fff at 000 plays no role. Substituting SλhS_\lambda hSλ​h into the basic identity (2.2) gives the error representation (2.6); the two forms of SλhS_\lambda hSλ​h are what Lemmas 3.1–3.3 bound in the regimes λ≥w\lambda\ge wλ≥w and λ≤w\lambda\le wλ≤w.

Formalization Note The hypothesis λ>0\lambda>0λ>0 is implicit on the page, where (2.5)(2.5)(2.5) divides by λw\lambda^wλw. Boundedness of hhh is given as ∣h∣≤M|h|\le M∣h∣≤M for some MMM.

Preamble
import Mathlib
import Definitions.Def_PoissonDepTrials_MixSqrt_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace PoissonDepTrials.MixSqrt

/-- Chen (1975), §2, p. 536, (2.3)–(2.5). For `λ > 0` and bounded `h`, the function `S_λh` of
(2.5) (first line) solves the Stein equation `wf(w) − λf(w + 1) = h(w) − 𝒫_λh` for every `w ≥ 0`,
and for `w ≥ 1` it also has the tail form
`S_λh(w) = (w − 1)! λ^{−w} Σ_{k=w}^∞ [h(k) − 𝒫_λh] λ^k / k!` (second line of (2.5)). -/
theorem stein_solution (lam : ℝ) (hlam : 0 < lam) (h : ℕ → ℝ) (M : ℝ)
    (hM : ∀ k, |h k| ≤ M) :
    (∀ w : ℕ, (w : ℝ) * stein lam h w - lam * stein lam h (w + 1) = h w - poissonExp lam h) ∧
    (∀ w : ℕ, 1 ≤ w → stein lam h w = ((w - 1).factorial : ℝ) * (lam ^ w)⁻¹ *
      ∑' k : ℕ, (h (k + w) - poissonExp lam h) * lam ^ (k + w) / ((k + w).factorial : ℝ)) := by sorry

end PoissonDepTrials.MixSqrt
Source
Chen, Poisson approximation for dependent trials, Ann. Probab. 3 (1975), p. 536, §2, (2.3), (2.4), (2.5)
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