Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Newsvendor bound: E[Ctπ]≥g\mathbb E[C^\pi_t]\ge gE[Ctπ​]≥g for every policy and period

Proved
LostSalesConstantOrder.LargeLeadTime.newsvendor_lower_bound

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

inventorylost-salesnewsvendorp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In the lost-sales system with costs h,c>0h,c>0h,c>0 and demand law D\mathcal DD (finite third moment, not deterministic), let QQQ be the c/(c+h)c/(c+h)c/(c+h) quantile of D\mathcal DD and g=hE[(Q−D)+]+cE[(D−Q)+]g=h\mathbb E[(Q-D)^+]+c\mathbb E[(D-Q)^+]g=hE[(Q−D)+]+cE[(D−Q)+] the optimal single-period newsvendor cost. For any admissible policy π\piπ and any period ttt,

E[Ctπ] ≥ g.\mathbb E[C^\pi_t]\ \ge\ g.E[Ctπ​] ≥ g.

It is the per-period lower bound that gives OPT(L,T)≥Tg>0\mathrm{OPT}(L,T)\ge Tg>0OPT(L,T)≥Tg>0 and turns the additive bound of Corollary 12 into the ratio bound of Theorem 1.

Formalization Note The period is any Lean period ttt (the paper's t+1t+1t+1).

Preamble
import Definitions.Def_LostSalesConstantOrder_LargeLeadTime_Model

open MeasureTheory ProbabilityTheory Filter
open scoped ENNReal NNReal BigOperators
Formal statement
namespace LostSalesConstantOrder.LargeLeadTime

/-- §3.1, p. 5 (unnumbered): for any policy `π` and any period `t`, `E[C_t^π] ≥ g`, where
`g = hE[(Q − D)^+] + cE[(D − Q)^+]` is the newsvendor cost at the `c/(c+h)` quantile `Q`. -/
theorem newsvendor_lower_bound (P : CappedBaseStock.DemandLaw) (prm : CappedBaseStock.Parameters)
    (h3 : FiniteThirdMoment P) (hnd : NonDeterministic P)
    (π : CappedBaseStock.AdmissiblePolicy) (t : ℕ) :
    ENNReal.ofReal (gConst P prm) ≤ periodExpectedCost P prm π t := by sorry

end LostSalesConstantOrder.LargeLeadTime
Source
Goldberg, Katz-Rogozhnikov, Lu, Sharma & Squillante, Asymptotic Optimality of Constant-Order Policies for Lost Sales Inventory Models with Large Lead Times, arXiv:1211.4063v2, p. 5, §3.1 (unnumbered display defining g)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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