Corollary 3.6 — Lipschitz bounds for discounted value
ProvedRossQC.Sufficient.corollary_3_6dynamic-programminglipschitz-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quality-control
Let , , and . For any beliefs ,
and, when , moreover .
The first inequality supplies the belief sensitivity estimate used in Theorem 3.7(b); the second gives a discount-independent upper bound when .
Formalization Note At the printed right-hand side is and the second inequality is trivial; Lean's convention would make it false, so the second inequality is stated under while the first is stated for every .
Preamble
import Definitions.Def_RossQC_Sufficient_Model
Formal statement
namespace RossQC.Sufficient
/-- Ross, Corollary 3.6, p. 592. The first bound is stated for every
`π ∈ [0,1]`. The second displayed bound divides by `π`; at `π = 0` the page's
right side is `+∞` and the inequality is trivial, while Lean's `x / 0 = 0`
would make it false, so the second bound is stated under `0 < π`. -/
theorem corollary_3_6 (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)
(P₁ P₂ : ℝ) (hP₁ : P₁ ∈ Set.Icc (0 : ℝ) 1)
(hP₂ : P₂ ∈ Set.Icc (0 : ℝ) 1) :
|M.value P₁ - M.value P₂| ≤
M.C * |P₁ - P₂| / (1 - M.β * (1 - M.π)) ∧
(0 < M.π → M.C * |P₁ - P₂| / (1 - M.β * (1 - M.π)) ≤
M.C * |P₁ - P₂| / 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, Corollary 3.6
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.