Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (5.52): S2=S3=1−σ′Q[G(R−μ′σ′)−G(R+Q−μ′σ′)]S_2 = S_3 = 1 - \frac{\sigma'}{Q}\left[G\left(\frac{R-\mu'}{\sigma'}\right) - G\left(\frac{R+Q-\mu'}{\sigma'}\right)\right]S2​=S3​=1−Qσ′​[G(σ′R−μ′​)−G(σ′R+Q−μ′​)]

Proved
InventoryControl.rq_ready_rate

by naimengye · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

inventory-controloperations-researchreorder-pointservice-level

For continuous normally distributed demand the fill rate S2S_2S2​ (fraction of demand met from stock on hand) and the ready rate S3S_3S3​ (fraction of time with positive stock) coincide, and both equal the probability of positive stock, 1−F(0)1 - F(0)1−F(0). Under a continuous review (R,Q)(R,Q)(R,Q) policy with Q>0Q > 0Q>0, mean lead-time demand μ′\mu'μ′ and standard deviation σ′>0\sigma' > 0σ′>0,

S2  =  S3  =  Pr⁡[IL>0]  =  1−σ′Q[G ⁣(R−μ′σ′)−G ⁣(R+Q−μ′σ′)].S_2 \;=\; S_3 \;=\; \Pr[IL > 0] \;=\; 1 - \frac{\sigma'}{Q}\left[G\!\left(\frac{R - \mu'}{\sigma'}\right) - G\!\left(\frac{R + Q - \mu'}{\sigma'}\right)\right].S2​=S3​=Pr[IL>0]=1−Qσ′​[G(σ′R−μ′​)−G(σ′R+Q−μ′​)].

This is the formula a planner inverts to find the smallest reorder point meeting a prescribed fill rate (the book's bisection search), and it is the quantity that Eq. (5.67) later ties to the cost parameters: at the cost-optimal reorder point it equals b1/(h+b1)b_1/(h + b_1)b1​/(h+b1​).

Formalization Note The ready rate is defined directly as the rqLevel-measure of (0,∞)(0, \infty)(0,∞); that it is 1−F(0)1 - F(0)1−F(0) is part of the claim.

Preamble
import Definitions.Def_InventoryControl_rq
Formal statement
namespace InventoryControl

theorem rq_ready_rate (R Q m s : ℝ) (hQ : 0 < Q) (hs : 0 < s) :
    rqReadyRate R Q m s
      = 1 - s / Q * (normalLoss ((R - m) / s) - normalLoss ((R + Q - m) / s)) := by sorry

end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 82, Sect. 5.7.2, Eq. (5.52)
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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