Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 4.3.3: exact optimal cost for a≤1a\le1a≤1 and for μ=0\mu=0μ=0

Proved
LostSalesRQ.exact_boundary_cases

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

approximation-guaranteeinventorylost-salesoperations-research
  1. If μ≥0\mu\ge0μ≥0 and 0≤a≤10\le a\le10≤a≤1, then no replenishment is optimal and
Lμ(a)=OPT0(μ,a)=Uμ(a)=a.\mathcal L_\mu(a)=\mathrm{OPT}_0(\mu,a)=U_\mu(a)=a .Lμ​(a)=OPT0​(μ,a)=Uμ​(a)=a.
  1. If μ=0\mu=0μ=0 (immediate replenishment) and a≥0a\ge0a≥0, then
L0(a)=U0(a)=OPT0(0,a)=min⁡{a,1}.\mathcal L_0(a)=U_0(a)=\mathrm{OPT}_0(0,a)=\min\{a,1\}.L0​(a)=U0​(a)=OPT0​(0,a)=min{a,1}.

These boundary cases reduce the 2\sqrt22​ comparison to μ>0\mu>0μ>0 and a>1a>1a>1, and the equality at a=1a=1a=1 starts the interval comparisons.

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

theorem exact_boundary_cases :
    (∀ μ a : ℝ, 0 ≤ μ → 0 ≤ a → a ≤ 1 →
      lowerCurve μ a = a ∧ OPTk μ a 0 = ENNReal.ofReal a ∧ minBaseStockCost μ a = a) ∧
    (∀ a : ℝ, 0 ≤ a →
      lowerCurve 0 a = min a 1 ∧ minBaseStockCost 0 a = min a 1 ∧
        OPTk 0 a 0 = ENNReal.ofReal (min a 1)) := 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 4.3.3, the two displays at the end of the subsection (p. 16).
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