Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.4, p. 543 — |S_bU_λh(w)| ≤ 4λ^{−1}‖h‖[(2 + 4|1 + b − λ|) min(b^{−½}, 1) + 3 min(λ^{−½}, 1)] for w ≥ 1

Proved
PoissonDepTrials.SecondOrder.lemma_5_4

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, b>0b>0b>0 and ∣h(k)∣≤M|h(k)|\le M∣h(k)∣≤M for all kkk. Let SbUλhS_bU_\lambda hSb​Uλ​h be the Stein solution with parameter bbb applied to the function UλhU_\lambda hUλ​h. Then for every w≥1w\ge1w≥1,

∣SbUλh(w)∣≤4λ−1M[(2+4∣1+b−λ∣)min⁡(b−1/2,1)+3min⁡(λ−1/2,1)].\bigl|S_bU_\lambda h(w)\bigr|\le4\lambda^{-1}M\Bigl[(2+4|1+b-\lambda|)\min(b^{-1/2},1)+3\min(\lambda^{-1/2},1)\Bigr].​Sb​Uλ​h(w)​≤4λ−1M[(2+4∣1+b−λ∣)min(b−1/2,1)+3min(λ−1/2,1)].

This is the analogue of Lemma 3.3 for the iterated operator and an input of Lemma 5.5.

Formalization Note b>0b>0b>0 is the standing range of §5; λ>0\lambda>0λ>0 is implicit. ∥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

/-- Lemma 5.4, (5.4), p. 543: for `w ≥ 1`,
`|S_bU_λh(w)| ≤ 4λ^{−1}‖h‖[(2 + 4|1 + b − λ|) min(b^{−1/2}, 1) + 3 min(λ^{−1/2}, 1)]`. -/
theorem lemma_5_4 (lam : ℝ) (hlam : 0 < lam) (b : ℝ) (hb : 0 < b) (h : ℕ → ℝ) (M : ℝ)
    (hM : ∀ k, |h k| ≤ M) :
    ∀ w : ℕ, 1 ≤ w → |stein b (stU lam h) w| ≤
      4 * lam⁻¹ * M * ((2 + 4 * |1 + b - lam|) * min (1 / Real.sqrt b) 1 +
        3 * min (1 / Real.sqrt lam) 1) := by sorry

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