Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma J.1: service credit (holding and setup cost bound for every policy)

Proved
LostSalesRQ.service_credit

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

approximation-guaranteeinventorylost-salesoperations-research

Fix μ≥0\mu\ge0μ≥0, k≥0k\ge0k≥0, 0≤θ≤10\le\theta\le10≤θ≤1 and a horizon T≥0T\ge0T≥0, and write b=2kθb=\sqrt{2k\theta}b=2kθ​. On every demand environment of rate one, every empty-start admissible policy (lead time μ\muμ) satisfies

θ E∫0TX(t) dt+k E O(T)≥b E A(T),\theta\,\mathbb E\int_0^TX(t)\,dt+k\,\mathbb E\,O(T)\ge b\,\mathbb E\,\mathcal A(T),θE∫0T​X(t)dt+kEO(T)≥bEA(T),

where XXX is on-hand inventory, O(T)O(T)O(T) the number of positive orders and A(T)\mathcal A(T)A(T) the number of demands served in [0,T][0,T][0,T].

Every policy, however it times and sizes its orders, pays this holding and setup cost per unit served; it is the lower half of the batching tradeoff.

Formalization Note The three expectations are in [0,∞][0,\infty][0,∞], so no finiteness hypothesis is needed. "Empty start" means no initial supply.

Preamble
import Definitions.Def_LostSalesRQ_model
Formal statement
namespace LostSalesRQ

theorem service_credit (μ k θ T : ℝ) (hμ : 0 ≤ μ) (hk : 0 ≤ k) (hθ0 : 0 ≤ θ) (hθ1 : θ ≤ 1)
    (hT : 0 ≤ T) (S : DemandSpace 1) (π : Policy S) (hπ : π.EmptyStart) :
    ENNReal.ofReal (Real.sqrt (2 * k * θ)) * π.expectedServed μ T ≤
      ENNReal.ofReal θ * π.expectedHolding μ T + ENNReal.ofReal k * π.expectedOrders T := 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 J.1, eq. (J.1) (p. A21); main-text statement eq. (25) (p. 22).
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