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 its tail form

Proved
PoissonDepTrials.MixInv.stein_solution

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

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

Let λ>0\lambda>0λ>0, let hhh be a bounded real function on the nonnegative integers, and let SλhS_\lambda hSλ​h be given by the first equation of (2.5). Then

  1. 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,

which is Stein's equation (2.3) (at w=0w=0w=0 the left side is −λSλh(1)-\lambda S_\lambda h(1)−λSλ​h(1), so the value at 000 plays no role); 2. for every w≥1w\ge1w≥1,

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​.

The second form is what the bounds of §3 for λ≤w\lambda\le wλ≤w use.

Formalization Note ∥h∥\|h\|∥h∥ is replaced by a bound MMM with ∣h(k)∣≤M|h(k)|\le M∣h(k)∣≤M; λ>0\lambda>0λ>0 is needed for λ−w\lambda^{-w}λ−w and is stated.

Preamble
import Mathlib
import Definitions.Def_PoissonDepTrials_MixInv_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace PoissonDepTrials.MixInv

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