Proof of Theorem 7, Eq. (10): cost before the projection reaches the newsvendor level
ProvedAIMInventory.UnknownBound.eq_10censored-demandinventoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-gradient
For a horizon , sum over the rounds satisfying . The modified AIM target has expected cumulative newsvendor cost gap bounded by
This is the finite contribution from the early rounds, before the projection interval grows large enough to contain the newsvendor level.
Formalization Note The page suppresses the horizon restriction in the displayed sum; the theorem states it explicitly. The initial target lies in . At the index set is empty and both sides are zero.
Preamble
import Definitions.Def_AIMInventory_UnknownBound_AIM open MeasureTheory
Formal statement
namespace AIMInventory.UnknownBound
/-- Equation (10) in the proof of Theorem 7, over the rounds before the
expanding interval reaches the newsvendor quantity. -/
theorem eq_10 (P : CappedBaseStock.DemandLaw) (δ b h y₁ : ℝ) (T : ℕ)
(hδ : δ ∈ Set.Ioo (0 : ℝ) (1 / 2)) (hb : 0 < b) (hh : 0 < h)
(hy₁ : y₁ ∈ Set.Icc (0 : ℝ) 1) (hT : 1 ≤ T) :
(∫ d : CappedBaseStock.DemandPath,
(∑ t ∈ earlyRounds δ (newsvendor P h b) T,
(cost P h b (modAimTarget δ b h y₁ d t) - cost P h b (newsvendor P h b)))
∂CappedBaseStock.demandPathLaw P) ≤
max b h * Real.rpow (newsvendor P h b) (1 + 2 / δ) := by sorry
end AIMInventory.UnknownBound
Source
Huh & Rusmevichientong, A Non-Parametric Asymptotic Analysis of Inventory Planning with Censored Demand, Math. Oper. Res. (2009), author's manuscript, p. 12, proof of Theorem 7, Eq. (10); https://doi.org/10.1287/moor.1080.0355
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.