Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2: Poisson deviation bounds

Proved
BesbesZeevi.SingleParam.lemma2

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

concentrationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-process

Let M,η,β>0M,\eta,\beta>0M,η,β>0. There is a constant C>0C>0C>0 such that for every n≥1n\ge1n≥1, every μ∈[0,M]\mu\in[0,M]μ∈[0,M] and every rn≥nβr_n\ge n^\betarn​≥nβ, with

ϵn=2η1/2M1/2(log⁡n)1/2rn−1/2,\epsilon_n=2\eta^{1/2}M^{1/2}(\log n)^{1/2}r_n^{-1/2},ϵn​=2η1/2M1/2(logn)1/2rn−1/2​,

a Poisson random variable N(μrn)N(\mu r_n)N(μrn​) with mean μrn\mu r_nμrn​ satisfies

P(N(μrn)−μrn>rnϵn)≤Cnη,P(N(μrn)−μrn<−rnϵn)≤Cnη.\mathbb P\big(N(\mu r_n)-\mu r_n>r_n\epsilon_n\big)\le\frac{C}{n^\eta},\qquad \mathbb P\big(N(\mu r_n)-\mu r_n<-r_n\epsilon_n\big)\le\frac{C}{n^\eta}.P(N(μrn​)−μrn​>rn​ϵn​)≤nηC​,P(N(μrn​)−μrn​<−rn​ϵn​)≤nηC​.

This is the concentration estimate used to control every demand estimate of the algorithm.

Formalization Note The law of N(μrn)N(\mu r_n)N(μrn​) is Mathlib's poissonMeasure with mean μrn\mu r_nμrn​. The constant depends only on M,η,βM,\eta,\betaM,η,β and is uniform over μ∈[0,M]\mu\in[0,M]μ∈[0,M] and over rn≥nβr_n\ge n^\betarn​≥nβ.

Preamble
import Mathlib

open MeasureTheory ProbabilityTheory
Formal statement
namespace BesbesZeevi.SingleParam

/-- Lemma 2 (Besbes–Zeevi 2009, p. 27): Poisson deviation bounds. For `μ ∈ [0, M]`,
`r ≥ n^β` and `ε_n = 2 η^{1/2} M^{1/2} (log n)^{1/2} r^{-1/2}`, a Poisson variable `Z` with mean
`μ r` (the law of `N(μ r)`) satisfies `P(Z - μ r > r ε_n) ≤ C/n^η` and
`P(Z - μ r < -r ε_n) ≤ C/n^η` for all `n ≥ 1`, with `C` depending only on `M, η, β`. -/
theorem lemma2 (M η β : ℝ) (hM : 0 < M) (hη : 0 < η) (hβ : 0 < β) :
    ∃ C : ℝ, 0 < C ∧ ∀ n : ℕ, 1 ≤ n → ∀ μ ∈ Set.Icc (0 : ℝ) M, ∀ r : ℝ, (n : ℝ) ^ β ≤ r →
      (poissonMeasure (μ * r).toNNReal
          {k : ℕ | (k : ℝ) - μ * r >
            r * (2 * Real.sqrt η * Real.sqrt M * Real.sqrt (Real.log n) / Real.sqrt r)}).toReal
          ≤ C / (n : ℝ) ^ η ∧
      (poissonMeasure (μ * r).toNNReal
          {k : ℕ | (k : ℝ) - μ * r <
            -(r * (2 * Real.sqrt η * Real.sqrt M * Real.sqrt (Real.log n) / Real.sqrt r))}).toReal
          ≤ C / (n : ℝ) ^ η := by sorry

end BesbesZeevi.SingleParam
Source
Besbes & Zeevi, Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms, Operations Research 57(6), 2009, DOI 10.1287/opre.1080.0640 (authors' final manuscript, last revised December 16, 2007), p. 27 (PDF p. 29), Lemma 2
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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