Corollary 2 (p. 201) —
ProvedFedergruenZipkin.AvgCost.corollary2_cesaro_vanishIn the capacitated inventory model with storage capacity , where is the smallest global minimizer of , set . For a policy let be the transition operator . Let satisfy the assumptions of Lemma 3 (, ), and let be any sequence of -period policies with every (feasible and ordering to capacity at or below ). Then for all
This is the condition that lets the paper pass from the optimality equation to strong optimality in Theorem 1(b): the expected relative value at time grows sublinearly under any sequence of policies in .
Formalization Note The corollary leaves implicit; it is stated here for every satisfying the assumptions of Lemma 3, as in Corollary 1 (the proof of Theorem 1(b) uses ). The sequence of policies is a function , constrained only for . Values are in .
import Mathlib import Definitions.Def_FedergruenZipkin_AvgCost_Model
namespace FedergruenZipkin.AvgCost
open scoped ENNReal
open Filter Topology
theorem corollary2_cesaro_vanish (M : Model) (U yInf : ℤ)
(hyInf : IsLeast {y : ℤ | ∀ z, M.G y ≤ M.G z} yInf) (hU : yInf ≤ U)
(l u : ℤ) (hu0 : 0 ≤ u) (huU : u ≤ U) (hlu : l ≤ u - M.b)
(σ : ℕ → ℕ → ℤ → ℤ) (hσ : ∀ t s, s ≤ t → FeasibleL M U (yInf - M.b) (σ t s)) :
∀ x ≤ U, Tendsto (fun t : ℕ =>
Pcomp M (σ t) t (H M U l u (fun _ => (1 : ℝ≥0∞)) + H M U l u (fun y => ENNReal.ofReal (M.G y))) x /
((t : ℝ≥0∞) + 1)) atTop (𝓝 0) := by sorry
end FedergruenZipkin.AvgCost
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.