Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.5, p. 537 — |ΔS_λh(w)| ≤ λ^{−1}‖h‖{2 + 4|w − λ| min(λ^{−1/2}, 1)} for w ≥ 1

Proved
PoissonDepTrials.MixInv.lemma_3_5

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 and let hhh be a bounded real function with ∣h∣≤M|h|\le M∣h∣≤M. For every w≥1w\ge1w≥1,

∣ΔSλh(w)∣≤λ−1M{2+4∣w−λ∣min⁡(λ−1/2,1)}.|\Delta S_\lambda h(w)|\le\lambda^{-1}M\bigl\{2+4|w-\lambda|\min(\lambda^{-1/2},1)\bigr\}.∣ΔSλ​h(w)∣≤λ−1M{2+4∣w−λ∣min(λ−1/2,1)}.

Unlike Lemma 3.4, this bound decays like λ−1\lambda^{-1}λ−1 when www is close to λ\lambdaλ; it is the source of the order-λ−1\lambda^{-1}λ−1 rate in Theorem 4.2.

Formalization Note The sup norm ∥h∥\|h\|∥h∥ is replaced by any bound MMM with ∣h(k)∣≤M|h(k)|\le M∣h(k)∣≤M for all kkk, which is equivalent since ∥h∥\|h\|∥h∥ is the least such MMM; ∥Sλh∥\|S_\lambda h\|∥Sλ​h∥ is a supremum over w≥1w\ge1w≥1, the domain of SλhS_\lambda hSλ​h, so the statement quantifies over w≥1w\ge 1w≥1. The paper's §3 divides by λ\lambdaλ, so λ>0\lambda>0λ>0 is an implicit hypothesis and is stated.

Preamble
import Mathlib
import Definitions.Def_PoissonDepTrials_MixInv_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace PoissonDepTrials.MixInv

theorem lemma_3_5 (lam : ℝ) (hlam : 0 < lam) (h : ℕ → ℝ) (M : ℝ) (hM : ∀ k, |h k| ≤ M) :
    ∀ w : ℕ, 1 ≤ w → |delta (stein lam h) w| ≤
      lam⁻¹ * M * (2 + 4 * |(w : ℝ) - lam| * min (1 / Real.sqrt lam) 1) := by sorry

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