Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (14) and Section 4.3.3: properties of the concave lower curve Lμ\mathcal L_\muLμ​

Proved
LostSalesRQ.lower_curve_properties

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

approximation-guaranteeinventorylost-salesoperations-research

Fix μ≥0\mu\ge0μ≥0. The concave lower curve 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μ​(η)} satisfies:

  1. Lμ(a)≤OPT0(μ,a)\mathcal L_\mu(a)\le\mathrm{OPT}_0(\mu,a)Lμ​(a)≤OPT0​(μ,a) for every a≥0a\ge0a≥0;
  2. Lμ(αμ(η))≥Bμ(η)\mathcal L_\mu(\alpha_\mu(\eta))\ge B_\mu(\eta)Lμ​(αμ​(η))≥Bμ​(η) for every η≥1\eta\ge1η≥1;
  3. Lμ\mathcal L_\muLμ​ is concave on [0,∞)[0,\infty)[0,∞);
  4. Lμ\mathcal L_\muLμ​ is nondecreasing on [0,∞)[0,\infty)[0,∞);
  5. Lμ\mathcal L_\muLμ​ is 111-Lipschitz on [0,∞)[0,\infty)[0,∞);
  6. min⁡{1,a}≤Lμ(a)≤a\min\{1,a\}\le\mathcal L_\mu(a)\le amin{1,a}≤Lμ​(a)≤a for every a≥0a\ge0a≥0.

Items 1 and 2 are eq. (14); concavity is what allows a base-stock comparison at two penalties to extend to the whole interval between them.

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

theorem lower_curve_properties (μ : ℝ) (hμ : 0 ≤ μ) :
    (∀ a : ℝ, 0 ≤ a → ENNReal.ofReal (lowerCurve μ a) ≤ OPTk μ a 0) ∧
    (∀ η : ℝ, 1 ≤ η → rankBound μ η ≤ lowerCurve μ (calibratedPenalty μ η)) ∧
    ConcaveOn ℝ (Set.Ici 0) (lowerCurve μ) ∧
    MonotoneOn (lowerCurve μ) (Set.Ici 0) ∧
    (∀ a b : ℝ, 0 ≤ a → 0 ≤ b → |lowerCurve μ a - lowerCurve μ b| ≤ |a - b|) ∧
    (∀ a : ℝ, 0 ≤ a → min 1 a ≤ lowerCurve μ a ∧ lowerCurve μ a ≤ a) := 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, eq. (14) and the following paragraph (pp. 14-15).
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