Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Erlang loss rate of base stock (M/D/j/j)

Proved
LostSalesRQ.base_stock_served_rate

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

approximation-guaranteeinventorylost-salesoperations-research

Fix normalized lead-time demand μ≥0\mu\ge0μ≥0 and a demand environment of rate one. For every integer level j≥1j\ge1j≥1, every policy following the base-stock rule (r=j−1r=j-1r=j−1, Q=1Q=1Q=1) serves demand at long-run rate 1−ej1-e_j1−ej​: the expected number of demands served by time TTT, divided by TTT, converges to 1−ej1-e_j1−ej​, where ej=pj(μ)/Fj(μ)e_j=p_j(\mu)/F_j(\mu)ej​=pj​(μ)/Fj​(μ) is the Erlang loss fraction.

Under base stock jjj with lead time μ\muμ, units in replenishment form an M/D/j/jM/D/j/jM/D/j/j loss system, and eje_jej​ is Erlang's loss probability for it: the statement says that this is the long-run fraction of demand lost.

Formalization Note The statement concerns the expected served count from the stated initialization (jjj units on hand, empty pipeline), as a limit of time averages.

Preamble
import Definitions.Def_LostSalesRQ_model
Formal statement
namespace LostSalesRQ

theorem base_stock_served_rate (μ : ℝ) (hμ : 0 ≤ μ) (S : DemandSpace 1) (j : ℕ) (hj : 1 ≤ j)
    (π : Policy S) (hπ : IsRQPolicy μ (j - 1) 1 π) :
    Filter.Tendsto (fun T : ℝ => (π.expectedServed μ T).toReal / T) Filter.atTop
      (nhds (1 - lossFraction μ j)) := 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; Section 3.4 (p. 8) and Appendix A (p. A1), citing Zachary (2007), Theorem 1, p. 241, and Wolff (1982), Theorem 1, p. 225.
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