Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1: committed-supply lower bound

Proved
LostSalesRQ.committed_supply_lower_bound

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

approximation-guaranteeinventorylost-salesoperations-research

For every lead-time demand mean μ≥0\mu\ge0μ≥0, every lost-sales penalty a≥0a\ge0a≥0 and every rank weight η≥1\eta\ge1η≥1, the zero-setup optimal cost satisfies

OPT0(μ,a)≥min⁡{Bμ(η), a−Dμ(η)}.\mathrm{OPT}_0(\mu,a)\ge\min\{B_\mu(\eta),\,a-D_\mu(\eta)\}.OPT0​(μ,a)≥min{Bμ​(η),a−Dμ​(η)}.

The bound holds against every admissible policy, including history-dependent and randomized ones, and makes Lμ(a)=sup⁡η≥1min⁡{Bμ(η),a−Dμ(η)}\mathcal L_\mu(a)=\sup_{\eta\ge1}\min\{B_\mu(\eta),a-D_\mu(\eta)\}Lμ​(a)=supη≥1​min{Bμ​(η),a−Dμ​(η)} a computable lower bound on the optimal cost.

Formalization Note The left side is in [0,∞][0,\infty][0,∞] and the right side is embedded by ENNReal.ofReal, so a negative right side gives the trivial bound 000, as in the paper.

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

theorem committed_supply_lower_bound (μ a η : ℝ) (hμ : 0 ≤ μ) (ha : 0 ≤ a) (hη : 1 ≤ η) :
    ENNReal.ofReal (min (rankBound μ η) (a - agingRateSup μ η)) ≤ OPTk μ a 0 := 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; Proposition 1, eq. (10) (p. 13); proof in Appendix B (pp. A4-A5).
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