Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3, p. 6 — an outcome monotonic binary policy is optimal

Proved
StrategicPolicy.MonotoneBinary.theorem_3

by mikedeng1 · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

best-responsedecision-policyoutcome-monotonicityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strategic-classification

Let π∗\pi^*π∗ maximize utility over all policies with values in [0,1][0,1][0,1]. If the change cost is outcome monotonic and additive along outcome increasing chains, there is an outcome monotonic binary policy π\piπ with equal utility:

π∈[0,1]m,πi<πj⇒qi<qj,u(π,γ)=u(π∗,γ),\pi\in[0,1]^m,\qquad \pi_i<\pi_j\Rightarrow q_i<q_j,\qquad u(\pi,\gamma)=u(\pi^*,\gamma),π∈[0,1]m,πi​<πj​⇒qi​<qj​,u(π,γ)=u(π∗,γ),

where for each i>1i>1i>1 with qi>γq_i>\gammaqi​>γ the binary rule is

πi=πi−1orπi=max⁡{0,πi−1−ci,i−1}.\pi_i=\pi_{i-1}\quad\text{or}\quad\pi_i=\max\{0,\pi_{i-1}-c_{i,i-1}\}.πi​=πi−1​orπi​=max{0,πi−1​−ci,i−1​}.

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 π∗\pi^*π∗ 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 i−1i-1i−1 relation is represented without truncated subtraction in Lean.


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

Preamble
import Mathlib
import Definitions.Def_StrategicPolicy_MonotoneBinary_Setting
Formal statement
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
Source
Tsirtsis et al., Optimal Decision Making Under Strategic Behavior, arXiv:1905.09239v5, p. 6, Theorem 3; proof p. 18, Appendix A.3
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 16, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me