Theorem 8 — for any γ, Λ₂(T) ≤ (max{b,h}ȳ/T){⌈(m/ρ′)²⌉ + E[K(ρ′, 2√2m²/ρ′)]} + 2hm E[|J₁(ρ′)|²]/√T
ProvedAIMInventory.UnknownRho.theorem_8Consider a lost-sales inventory system with i.i.d. nonnegative demands of finite positive mean, holding cost and penalty , and expected one-period cost . Excess inventory is non-perishable. The manager knows an upper bound on the newsvendor quantity, , and runs the AIM algorithm with an arbitrary step scale and any initial target , producing targets and implemented levels . Let
Let be the hitting time of by the random walk started at with increments , and let be the length of the first busy period of the queue , .
Then for every and every with ,
The cost of AIM splits as , where is controlled by stochastic subgradient descent for every . Theorem 8 controls the remaining term without the restriction of Theorem 2, so the manager does not need a lower bound on mean demand: whenever and are finite, the bound is .
Formalization Note. The right side is computed in : and are Lebesgue integrals that may be , in which case the bound is trivially true rather than vacuous through a junk value; the left side is a real Bochner integral of a bounded integrand, embedded with ENNReal.ofReal (a negative embeds as , consistent with the real inequality). The hypotheses , are implicit in the paper ("for any choice of the parameter " means any , as in (4)) and are added explicitly. The newsvendor bound is the theorem's standing hypothesis and is kept although the bound does not use it.
import Mathlib import Definitions.Def_AIMInventory_UnknownRho_Model noncomputable section open MeasureTheory open scoped ENNReal NNReal
namespace AIMInventory.UnknownRho
/-- Theorem 8, p. 13: the non-perishable AIM excess-cost bound for any
positive step scale `γ`. The right side is in `ℝ≥0∞`, so an infinite
hitting-time or busy-period expectation makes the bound infinite rather than
junk. `0 < ρ′` is added (the printed bound divides by `ρ′`). -/
theorem theorem_8 (P : DemandLaw) (c : Parameters) (ρ' : ℝ) (T : ℕ)
(hNV : LostSalesOrderUpTo.Asymptotic.newsvendorLevel P.law c.h c.b ≤
Real.toNNReal c.barY)
(hT : 1 ≤ T) (hρ : 0 < ρ') (hsmall : ρ' < m c)
(hmean : ρ' < CappedBaseStock.mean P) :
ENNReal.ofReal (lambdaTwo P c T) ≤
ENNReal.ofReal (max c.b c.h * c.barY / (T : ℝ)) *
((Nat.ceil ((m c / ρ') ^ 2) : ℝ≥0∞) + expectedK P ρ' (initialHeight c ρ')) +
ENNReal.ofReal (2 * c.h * m c / Real.sqrt (T : ℝ)) *
busySecondMoment P ρ' := by sorry
end AIMInventory.UnknownRho
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.