Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9 (corrected) — E[K(θ,z)] ≤ 1 + 2z/(E[D₁]−θ) + 8π² E[(D₁−E[D₁])⁴]/(E[D₁]−θ)⁴

Proved
AIMInventory.UnknownRho.lemma_9_corrected

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

hitting-timemoment-boundp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1random-walk

Let D1,D2,…D_1,D_2,\dotsD1​,D2​,… be i.i.d. nonnegative demands with finite positive mean and finite fourth moment, E[D14]<∞E[D_1^4]<\inftyE[D14​]<∞. For real θ\thetaθ and zzz let

K(θ,z)=min⁡{t≥0:z+∑s=1t(θ−Ds)≤0}∈{0,1,2,… }∪{∞}K(\theta,z)=\min\Big\{t\ge0 : z+\sum_{s=1}^t(\theta-D_s)\le0\Big\}\in\{0,1,2,\dots\}\cup\{\infty\}K(θ,z)=min{t≥0:z+s=1∑t​(θ−Ds​)≤0}∈{0,1,2,…}∪{∞}

be the first time the random walk started at zzz with increments θ−Ds\theta-D_sθ−Ds​ enters (−∞,0](-\infty,0](−∞,0]. If θ<E[D1]\theta<E[D_1]θ<E[D1​], then for every z>0z>0z>0

E[K(θ,z)]≤1+2zE[D1]−θ+8π2E[(D1−E[D1])4](E[D1]−θ)4.E[K(\theta,z)]\le 1+\frac{2z}{E[D_1]-\theta}+\frac{8\pi^2E\big[(D_1-E[D_1])^4\big]}{(E[D_1]-\theta)^4}.E[K(θ,z)]≤1+E[D1​]−θ2z​+(E[D1​]−θ)48π2E[(D1​−E[D1​])4]​.

The paper prints this lemma without the leading 111:

E[K(θ,z)]≤2zE[D1]−θ+8π2E[D1−E[D1]]4(E[D1]−θ)4,E[K(\theta,z)]\le\frac{2z}{E[D_1]-\theta}+\frac{8\pi^2E[D_1-E[D_1]]^4}{(E[D_1]-\theta)^4},E[K(θ,z)]≤E[D1​]−θ2z​+(E[D1​]−θ)48π2E[D1​−E[D1​]]4​,

where E[D1−E[D1]]4E[D_1-E[D_1]]^4E[D1​−E[D1​]]4 denotes the fourth central moment. As printed it is false: for deterministic demand Ds≡1D_s\equiv1Ds​≡1, θ=0\theta=0θ=0 and z=1/4z=1/4z=1/4 the walk is positive at time 000 and equals −3/4-3/4−3/4 at time 111, so K(0,1/4)=1K(0,1/4)=1K(0,1/4)=1, while the printed right side is 1/21/21/2. The printed proof counts the integers s≥0s\ge0s≥0 with s<2z/(E[D1]−θ)s<2z/(E[D_1]-\theta)s<2z/(E[D1​]−θ) as at most 2z/(E[D1]−θ)2z/(E[D_1]-\theta)2z/(E[D1​]−θ); the correct count is at most 2z/(E[D1]−θ)+12z/(E[D_1]-\theta)+12z/(E[D1​]−θ)+1, which gives the statement above.

The lemma makes the first term of Theorem 8 explicit: with a finite fourth moment, the expected hitting time there is finite and depends only on b,h,γb,h,\gammab,h,γ and the moments of demand, so that term is O(1/T)O(1/T)O(1/T).

Formalization Note. E[K(θ,z)]E[K(\theta,z)]E[K(θ,z)] is a Lebesgue integral in [0,∞][0,\infty][0,∞] and the right side is embedded with ENNReal.ofReal; the right side is positive under the hypotheses. The fourth central moment is a Bochner integral, which is honest because E[D14]<∞E[D_1^4]<\inftyE[D14​]<∞ is a hypothesis.

Preamble
import Mathlib
import Definitions.Def_AIMInventory_UnknownRho_Model

open MeasureTheory
open scoped ENNReal NNReal
Formal statement
namespace AIMInventory.UnknownRho

/-- Lemma 9, p. 13, corrected by the `+1` needed to count the integer
times below `2z/(E[D]-θ)`. The printed bound fails for deterministic demand
and a sufficiently small positive `z`. -/
theorem lemma_9_corrected (P : DemandLaw) (θ z : ℝ)
    (hθ : θ < CappedBaseStock.mean P) (hz : 0 < z)
    (hfourth : Integrable (fun d : ℝ≥0 => (d : ℝ) ^ 4) P.law) :
    expectedK P θ z ≤ ENNReal.ofReal
      (1 + 2 * z / (CappedBaseStock.mean P - θ) +
        8 * Real.pi ^ 2 * centralFourth P /
          (CappedBaseStock.mean P - θ) ^ 4) := 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. 13, Lemma 9 (proof in Appendix D, p. 20); corrected by an additive 1
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