Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6 — non-perishable AIM: if γ ≤ ρ max{b,h}/(hȳ), the excess y_t − ŷ_t is at most the queue Z_t(ρ)

Proved
AIMInventory.Known.theorem_6

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

inventoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1queueingstochastic-gradient

Consider the AIM algorithm with non-perishable inventory, cost parameters h,b>0h, b > 0h,b>0, upper bound yˉ>0\bar y > 0yˉ​>0, scale γ>0\gamma > 0γ>0 and starting level y^1∈[0,yˉ]\hat y_1 \in [0,\bar y]y^​1​∈[0,yˉ​], and let ρ>0\rho > 0ρ>0. If

γ≤ρmax⁡{b,h}h yˉ,\gamma \le \frac{\rho \max\{b,h\}}{h\,\bar y},γ≤hyˉ​ρmax{b,h}​,

then for every demand path D1,D2,⋯≥0D_1, D_2, \dots \ge 0D1​,D2​,⋯≥0 and every t≥1t \ge 1t≥1,

yt−y^t≤Zt(ρ),y_t - \hat y_t \le Z_t(\rho),yt​−y^​t​≤Zt​(ρ),

where Z1(ρ)=0Z_1(\rho) = 0Z1​(ρ)=0 and Zt+1(ρ)=[Zt(ρ)+ρ/t−Dt]+Z_{t+1}(\rho) = [Z_t(\rho) + \rho/\sqrt t - D_t]^+Zt+1​(ρ)=[Zt​(ρ)+ρ/t​−Dt​]+.

The excess of the implemented level over the target is the price of carrying inventory over; this theorem dominates it by the waiting time of a single-server queue whose service times shrink like ρ/t\rho/\sqrt tρ/t​. It is the paper's link between stochastic gradient descent and queueing.

Formalization Note The paper says "with probability one"; the inequality holds along every demand path and is stated that way. Of Assumption 1, only the constants yˉ\bar yyˉ​ and ρ\rhoρ enter: the inequality does not use yNV≤yˉy^{NV} \le \bar yyNV≤yˉ​ or ρ<E[D1]\rho < E[D_1]ρ<E[D1​], so those are not hypotheses. The paper's proof writes Ht(yt)H_t(y_t)Ht​(yt​) for Ht(y^t)H_t(\hat y_t)Ht​(y^​t​). h,b>0h, b > 0h,b>0 and yˉ>0\bar y > 0yˉ​>0 are implicit in the paper (they appear in denominators).

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

/-- Theorem 6, p. 9: in the non-perishable case, if `γ ≤ ρ max{b, h}/(hȳ)`, then along every
demand path and for every `t ≥ 1` the excess `y_t − ŷ_t` of the AIM run is at most `Z_t(ρ)`. -/
theorem theorem_6 (h b γ ybar ρ yhat1 : ℝ) (hh : 0 < h) (hb : 0 < b) (hγ : 0 < γ)
    (hybar : 0 < ybar) (hρ : 0 < ρ) (hyhat1 : yhat1 ∈ Set.Icc 0 ybar)
    (hγρ : γ ≤ ρ * max b h / (h * ybar))
    (d : CappedBaseStock.DemandPath) (t : ℕ) (ht : 1 ≤ t) :
    aimLevel .nonPerishable ybar γ b h yhat1 d t - aimTarget .nonPerishable ybar γ b h yhat1 d t
      ≤ auxQueue ρ d t := 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. 9, Theorem 6
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