Lemma 3.5 — finite-horizon Lipschitz bound
ProvedRossQC.Sufficient.lemma_3_5dynamic-programminglipschitz-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quality-control
Let , , and . For any and beliefs , finite-horizon value iteration obeys
The estimate controls how a change in the initial belief changes finite-horizon cost and yields the limiting estimate of Corollary 3.6.
Formalization Note Stage zero is and satisfies the displayed bound. The paper's beliefs range over even though the lemma says “all .”
Preamble
import Definitions.Def_RossQC_Sufficient_Model
Formal statement
namespace RossQC.Sufficient
/-- Ross, Lemma 3.5, p. 592. The finite-horizon value has the stated
Lipschitz bound for beliefs `P₁`, `P₂` in `[0,1]` and every `n`, including
the zero-stage value. -/
theorem lemma_3_5 (M : Model)
(hβ0 : 0 < M.β) (hβ1 : M.β < 1)
(hπ0 : 0 ≤ M.π) (hπ1 : M.π ≤ 1)
(hC0 : 0 < M.C) (hCI : M.C < M.I) (hIR : M.I < M.R)
(n : ℕ) (P₁ P₂ : ℝ) (hP₁ : P₁ ∈ Set.Icc (0 : ℝ) 1)
(hP₂ : P₂ ∈ Set.Icc (0 : ℝ) 1) :
|M.valueIter n P₁ - M.valueIter n P₂| ≤
M.C * |P₁ - P₂| *
(1 - (M.β * (1 - M.π)) ^ n) / (1 - M.β * (1 - M.π)) := by sorry
end RossQC.Sufficient
Source
Ross, Quality Control under Markovian Deterioration, Management Science 17(9):587–596 (1971), DOI 10.1287/mnsc.17.9.587, p. 592, Lemma 3.5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.