Theorem 3, p. 6 — an outcome monotonic binary policy is optimal
ProvedStrategicPolicy.MonotoneBinary.theorem_3Let maximize utility over all policies with values in . If the change cost is outcome monotonic and additive along outcome increasing chains, there is an outcome monotonic binary policy with equal utility:
where for each with the binary rule is
Thus the structured policy family contains an optimum whenever an optimal policy exists.
Formalization Note The source does not establish that a maximizer exists, so and its optimality are hypotheses. The model assumes distinct outcomes, free staying, and the paper's standing positive cost condition. Policy monotonicity means the implication compatible with (9), and additivity concerns strictly improving outcome chains. The relation is represented without truncated subtraction in Lean.
import Mathlib import Definitions.Def_StrategicPolicy_MonotoneBinary_Setting
namespace StrategicPolicy.MonotoneBinary
variable {m : ℕ}
theorem theorem_3 [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) :
∃ π ∈ Policies m, OMBinary q γ c π ∧ u p q γ c π = u p q γ c πstar := by sorry
end StrategicPolicy.MonotoneBinary
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.