Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7, p. 40 — lower bound for the third-phase Poisson event

Proved
ResolvingNRM.FRLower.q3_probability

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

concentrationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1poisson

Let T′≥1T'\ge1T′≥1 be an integer and let NNN have the Poisson distribution with mean T′T'T′. With Φ\PhiΦ denoting the standard normal cumulative distribution function, the third-phase event Q3Q_3Q3​ obeys

P(T′+6T′≤N≤T′+7T′)≥Φ(7)−Φ(6)−0.9496T′.\mathbb P\bigl(T'+6\sqrt{T'}\le N\le T'+7\sqrt{T'}\bigr) \ge \Phi(7)-\Phi(6)-\frac{0.9496}{\sqrt{T'}}.P(T′+6T′​≤N≤T′+7T′​)≥Φ(7)−Φ(6)−T′​0.9496​.

This is the second separated Poisson event used to establish a positive-probability loss scenario.

Formalization Note Equation (52) proves the displayed unrounded Gaussian-tail constant. Equation (53) and the Lemma 7 headline round Φ(7)−Φ(6)≈9.85308×10−10\Phi(7)-\Phi(6)\approx9.85308\times10^{-10}Φ(7)−Φ(6)≈9.85308×10−10 upward to 9.8531×10−109.8531\times10^{-10}9.8531×10−10; the formal statement retains the proved value. The phase length is integral as in the proof.

Preamble
import Mathlib

open MeasureTheory ProbabilityTheory
Formal statement
namespace ResolvingNRM.FRLower

/-- The Q₃ component of Lemma 7 in its proved, unrounded form (52). -/
theorem q3_probability (T' : ℕ) (hT : 1 ≤ T') :
    (∑' k : ℕ, if (T' : ℝ) + 6 * Real.sqrt (T' : ℝ) ≤ (k : ℝ) ∧
        (k : ℝ) ≤ (T' : ℝ) + 7 * Real.sqrt (T' : ℝ) then
        ProbabilityTheory.poissonPMFReal (T' : ℝ).toNNReal k else (0 : ℝ)) ≥
      cdf (gaussianReal 0 1) 7 - cdf (gaussianReal 0 1) 6 -
        0.9496 / Real.sqrt (T' : ℝ) := by sorry

end ResolvingNRM.FRLower
Source
Bumpensanti, Wang, A Re-solving Heuristic with Uniformly Bounded Loss for Network Revenue Management, arXiv:1802.06192v3, Lemma 7, p. 40, Q3 clause and (52)–(53)
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