Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2(i): a common starting penalty for small base-stock levels

Proved
LostSalesRQ.endpoint_low_price_anchor

by Ming Hu · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-guaranteeinventorylost-salesoperations-research

Fix μ>0\mu>0μ>0 and define

η∘=A1=1+μ−1,a∘=1+2−e−μμ,g∘=1+1−e−μμ.\eta^\circ=A_1=1+\mu^{-1},\qquad a^\circ=1+\frac{2-e^{-\mu}}{\mu},\qquad g^\circ=1+\frac{1-e^{-\mu}}{\mu}.η∘=A1​=1+μ−1,a∘=1+μ2−e−μ​,g∘=1+μ1−e−μ​.

Then a∘=αμ(η∘)a^\circ=\alpha_\mu(\eta^\circ)a∘=αμ​(η∘), Lμ(a∘)≥g∘\mathcal L_\mu(a^\circ)\ge g^\circLμ​(a∘)≥g∘, and

max⁡{L1(a∘),L2(a∘)}<54 g∘(μ>0),L3(a∘)<75 g∘(μ≥2).\max\{L_1(a^\circ),L_2(a^\circ)\}<\tfrac54\,g^\circ\quad(\mu>0),\qquad L_3(a^\circ)<\tfrac75\,g^\circ\quad(\mu\ge2).max{L1​(a∘),L2​(a∘)}<45​g∘(μ>0),L3​(a∘)<57​g∘(μ≥2).

Since 5/45/45/4 and 7/57/57/5 are below 2\sqrt22​, base stocks one and two (and three when μ≥2\mu\ge2μ≥2) all cost less than 2 Lμ(a∘)\sqrt2\,\mathcal L_\mu(a^\circ)2​Lμ​(a∘) at this single penalty.

Preamble
import Definitions.Def_LostSalesRQ_lower_curve
import Definitions.Def_LostSalesRQ_poisson_process
Formal statement
namespace LostSalesRQ

theorem endpoint_low_price_anchor (μ : ℝ) (hμ : 0 < μ) :
    erlangNormalizer μ 1 = 1 + μ⁻¹ ∧
    calibratedPenalty μ (1 + μ⁻¹) = 1 + (2 - Real.exp (-μ)) / μ ∧
    1 + (1 - Real.exp (-μ)) / μ ≤ lowerCurve μ (1 + (2 - Real.exp (-μ)) / μ) ∧
    max (baseStockCost μ (1 + (2 - Real.exp (-μ)) / μ) 1)
        (baseStockCost μ (1 + (2 - Real.exp (-μ)) / μ) 2) <
      5 / 4 * (1 + (1 - Real.exp (-μ)) / μ) ∧
    (2 ≤ μ → baseStockCost μ (1 + (2 - Real.exp (-μ)) / μ) 3 <
      7 / 5 * (1 + (1 - Real.exp (-μ)) / μ)) := by sorry

end LostSalesRQ
Source
M. Hu, "A 1.932 Guarantee for (r,Q) Policies in Continuous-Review Lost-Sales Inventory Systems", arXiv:2610.34576, 2026; Lemma 2(i), eq. (17) (p. 17); proof in Appendix E (pp. A9-A10).
Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Ming Hu · Nov 18, 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