Appendix A.3, p. 18 — raising a policy value to its predecessor
ProvedStrategicPolicy.MonotoneBinary.appendix_a3_first_caseLet be an optimal outcome monotonic policy under an additive, outcome monotonic cost. Choose an index with that is the highest-outcome index violating the binary rule (9); write . Suppose
Define by replacing only with . Then
This is the first improvement case used in Appendix A.3 to reach a binary policy.
Formalization Note The first relevant violator condition is stated as no lower Lean index violating either case of (9) above . The paper's setup chooses the highest-outcome violator; restricting to follows (9). The standing model assumes distinct outcomes and the disclosed readings of (1) and additivity. The theorem asserts the utility comparison; the updated policy is the paper's .
import Mathlib import Definitions.Def_StrategicPolicy_MonotoneBinary_Setting
namespace StrategicPolicy.MonotoneBinary
variable {m : ℕ}
theorem appendix_a3_first_case [NeZero m]
(p q : Fin m → ℝ) (γ : ℝ) (c : Fin m → Fin m → ℝ)
(hstanding : Standing p q γ c) (hcost : OMCost q c)
(hadd : AdditiveCost q c)
(πstar : Fin m → ℝ) (hopt : Optimal p q γ c πstar)
(hmono : OMPolicy q πstar)
(i j : Fin m) (hprev : j.val + 1 = i.val) (hgain : γ < q i)
(hhighest : HighestViolator γ c q πstar i)
(hcase : πstar j - c i j < πstar i ∧ πstar i < πstar j) :
u p q γ c πstar ≤ u p q γ c (Function.update πstar i (πstar j)) := by sorry
end StrategicPolicy.MonotoneBinary
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.