Lemma 3.5 — exact finite-horizon Lipschitz bound
ProvedRossQC.AlwaysProduce.lemma_3_5dynamic-programminglipschitz-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quality-control
Let , , and . For any two beliefs and any finite horizon , the finite-horizon optimal costs obey
The factor retains the exact horizon dependence stated by Ross. It controls how changing the initial belief changes the finite-horizon value.
Formalization Note Ross begins with and . The defined iteration also has , for which the inequality is equality.
Preamble
import Mathlib import Definitions.Def_RossQC_AlwaysProduce_Model
Formal statement
namespace RossQC.AlwaysProduce
/-- Ross, *Quality Control under Markovian Deterioration*, Lemma 3.5, p. 592.
Formalization Note: the paper's `V_β¹ = min {CP,I,R}` equals `valueIter 1`.
At `n = 0` both sides vanish, so including it does not alter the result. -/
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₂ : ℝ),
P₁ ∈ Set.Icc (0 : ℝ) 1 → 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.AlwaysProduce
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.