p. 955: a change of policy indicated by the test quantity strictly increases the gain rate,
ProvedJewellMRP.GainRate.strict_improvementaverage-rewardmarkov-renewalp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1policy-iteration
Let a Markov-renewal program be ergodic with positive mean sojourn times. Let be a stationary policy, a solution of its value-determination equations (13), and let be an improvement step of with respect to : in each state , maximizes the test quantity
over the alternatives , and when already attains the maximum. If , then for all stationary probability vectors , of the chains of and ,
Since there are finitely many stationary policies, this strict monotonicity is what forces the algorithm of Fig. 2 to terminate.
Preamble
import Mathlib import Definitions.Def_JewellMRP_GainRate_MRP import Definitions.Def_JewellMRP_GainRate_PolicyIteration
Formal statement
namespace JewellMRP.GainRate
theorem strict_improvement {N : ℕ} [NeZero N] {α : Type*} (M : MRP N α)
(hM : M.IsErgodic) (z₁ z₂ : Fin N → α) (g₁ : ℝ) (v₁ : Fin N → ℝ)
(h₁ : M.SolvesValueDetermination z₁ g₁ v₁) (hstep : M.IsImprovementStep z₁ v₁ z₂)
(hne : z₂ ≠ z₁) (π₁ π₂ : Fin N → ℝ)
(hπ₁ : IsStationaryDist (M.policyMatrix z₁) π₁)
(hπ₂ : IsStationaryDist (M.policyMatrix z₂) π₂) :
M.gainRate z₁ π₁ < M.gainRate z₂ π₂ := by sorry
end JewellMRP.GainRate
Source
Jewell, Markov-Renewal Programming. II: Infinite Return Models, Example, Oper. Res. 11 (1963), p. 955 ("one shows that g^{z_2} > g^{z_1}"), with Fig. 2 (p. 956)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.