Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim (14) — (h/T) E[Σ_{t=K̃+1}^T Z_t(m)] ≤ 2hm E[|J₁(ρ′)|²]/√T

Proved
AIMInventory.UnknownRho.claim_14

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

busy-periodinventoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1queueingstochastic-gradient

Let D1,D2,…D_1,D_2,\dotsD1​,D2​,… be i.i.d. nonnegative demands with finite positive mean, fix the non-perishable AIM parameters γ,yˉ,h,b>0\gamma,\bar y,h,b>0γ,yˉ​,h,b>0 and put m=hγyˉ/max⁡{b,h}m=h\gamma\bar y/\max\{b,h\}m=hγyˉ​/max{b,h}. Let Zt(m)Z_t(m)Zt​(m) be the queue Z1(m)=0Z_1(m)=0Z1​(m)=0, Zt+1(m)=[Zt(m)+m/t−Dt]+Z_{t+1}(m)=[Z_t(m)+m/\sqrt t-D_t]^+Zt+1​(m)=[Zt​(m)+m/t​−Dt​]+, let T~=⌈(m/ρ′)2⌉\tilde T=\lceil(m/\rho')^2\rceilT~=⌈(m/ρ′)2⌉ and K~=min⁡{t>T~:Zt(m)=0}\tilde K=\min\{t>\tilde T:Z_t(m)=0\}K~=min{t>T~:Zt​(m)=0} (possibly ∞\infty∞), and let ∣J1(ρ′)∣|J_1(\rho')|∣J1​(ρ′)∣ be the length of the first busy period of the fixed-inflow queue W1(ρ′)=0W_1(\rho')=0W1​(ρ′)=0, Wt+1(ρ′)=[Wt(ρ′)+ρ′−Dt]+W_{t+1}(\rho')=[W_t(\rho')+\rho'-D_t]^+Wt+1​(ρ′)=[Wt​(ρ′)+ρ′−Dt​]+, i.e. ∣J1(ρ′)∣=inf⁡{t>1:Wt(ρ′)=0}−1|J_1(\rho')|=\inf\{t>1:W_t(\rho')=0\}-1∣J1​(ρ′)∣=inf{t>1:Wt​(ρ′)=0}−1.

If 0<ρ′<min⁡{m,E[D1]}0<\rho'<\min\{m,E[D_1]\}0<ρ′<min{m,E[D1​]}, then for every T≥1T\ge1T≥1

hT E[∑t=K~+1TZt(m)]≤2hm E[∣J1(ρ′)∣2]T.(14)\frac hT\,E\Big[\sum_{t=\tilde K+1}^{T}Z_t(m)\Big]\le\frac{2hm\,E\big[|J_1(\rho')|^2\big]}{\sqrt T}. \tag{14}Th​E[t=K~+1∑T​Zt​(m)]≤T​2hmE[∣J1​(ρ′)∣2]​.(14)

Once the queue Z(m)Z(m)Z(m) has emptied after T~\tilde TT~, it is dominated by the stationary-increment queue with inflow ρ′\rho'ρ′, and the claim bounds the cost of the remaining periods by the second moment of a busy period. Together with the bound on E[K~]E[\tilde K]E[K~] it gives Theorem 8.

Formalization Note. The paper writes ∑t=K~+1TE[Zt(m)]\sum_{t=\tilde K+1}^T E[Z_t(m)]∑t=K~+1T​E[Zt​(m)] with the random index K~\tilde KK~ outside the expectation; as in (13) and Appendix E, the Lean statement reads it as E[∑t=1T1[K~<t] Zt(m)]E\big[\sum_{t=1}^T \mathbf 1[\tilde K<t]\,Z_t(m)\big]E[∑t=1T​1[K~<t]Zt​(m)]. The sum is empty when K~≥T\tilde K\ge TK~≥T or K~=∞\tilde K=\inftyK~=∞. Both sides are in [0,∞][0,\infty][0,∞], so an infinite E[∣J1(ρ′)∣2]E[|J_1(\rho')|^2]E[∣J1​(ρ′)∣2] makes the bound trivial rather than junk. The hypothesis ρ′>0\rho'>0ρ′>0 is implicit in the paper.

Preamble
import Mathlib
import Definitions.Def_AIMInventory_UnknownRho_Model

noncomputable section
open MeasureTheory
open scoped ENNReal NNReal BigOperators
Formal statement
namespace AIMInventory.UnknownRho

/-- Claim (14), p. 14, with the random lower summation limit inside the
expectation, as required by (13) and Appendix E. -/
theorem claim_14 (P : DemandLaw) (c : Parameters) (ρ' : ℝ) (T : ℕ)
    (hT : 1 ≤ T) (hρ : 0 < ρ') (hsmall : ρ' < m c)
    (hmean : ρ' < CappedBaseStock.mean P) :
    ENNReal.ofReal (c.h / (T : ℝ)) *
      (∫⁻ d, ∑ t ∈ Finset.Icc 1 T,
        if restartTime c ρ' d < (t : ℝ≥0∞) then
          ENNReal.ofReal (Z d (m c) t) else 0
        ∂CappedBaseStock.demandPathLaw P) ≤
      ENNReal.ofReal (2 * c.h * m c / Real.sqrt (T : ℝ)) *
        busySecondMoment P ρ' := by sorry

end AIMInventory.UnknownRho
Source
Huh & Rusmevichientong, A Non-Parametric Asymptotic Analysis of Inventory Planning with Censored Demand, Math. Oper. Res. (2009), author's manuscript, p. 14, proof of Theorem 8, Eq. (14); proved in Appendix E, pp. 20–21
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