Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.4 — for 0 ≤ ŷ ≤ y, Q(y) − Q(ŷ) ≤ h·(y − ŷ)

Proved
AIMInventory.Known.cost_increment_le

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

inventorynewsvendorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let demand D≥0D \ge 0D≥0 have law PPP with finite mean, let h,b>0h,b > 0h,b>0, and let Q(y)=h E[y−D]++b E[D−y]+Q(y) = h\,E[y-D]^+ + b\,E[D-y]^+Q(y)=hE[y−D]++bE[D−y]+. For all levels 0≤y^≤y0 \le \hat y \le y0≤y^​≤y,

Q(y)−Q(y^)≤h (y−y^).Q(y) - Q(\hat y) \le h\,(y - \hat y).Q(y)−Q(y^​)≤h(y−y^​).

In the non-perishable case the AIM algorithm implements yt=max⁡{y^t,xt}≥y^ty_t = \max\{\hat y_t, x_t\} \ge \hat y_tyt​=max{y^​t​,xt​}≥y^​t​; this inequality turns the excess cost Q(yt)−Q(y^t)Q(y_t) - Q(\hat y_t)Q(yt​)−Q(y^​t​) into hhh times the excess inventory yt−y^ty_t - \hat y_tyt​−y^​t​, which Theorem 6 bounds by a queue.

Preamble
import Mathlib
import Definitions.Def_AIMInventory_Known_AIM
Formal statement
namespace AIMInventory.Known

/-- §2.4, p. 10: raising the order-up-to level from `ŷ` to `y ≥ ŷ ≥ 0` raises the expected
one-period cost by at most `h·(y − ŷ)`. -/
theorem cost_increment_le (P : CappedBaseStock.DemandLaw) (h b : ℝ) (hh : 0 < h) (hb : 0 < b)
    (yhat y : ℝ) (hyhat : 0 ≤ yhat) (hle : yhat ≤ y) :
    Q P h b y - Q P h b yhat ≤ h * (y - yhat) := by sorry

end AIMInventory.Known
Source
Huh & Rusmevichientong, A Non-Parametric Asymptotic Analysis of Inventory Planning with Censored Demand, Math. Oper. Res. (2009), author's manuscript, p. 10, §2.4 (display after 'Since y_t = max{ŷ_t, x_t}')
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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