Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§3, p. 5, example after (8) — the instance's cost is outcome monotonic and satisfies standing assumption (i)

Proved
StrategicPolicy.StochasticOpt.cost_outcome_monotonic

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

cost-functionoutcome-monotonicityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strategic-classification

In the three-value instance of §3 (x∈{1,2,3}x\in\{1,2,3\}x∈{1,2,3} with P(y=1∣x)=(1.0,0.7,0.4)P(y=1\mid x)=(1.0,0.7,0.4)P(y=1∣x)=(1.0,0.7,0.4) and the cost matrix of p. 5), the cost ccc is outcome monotonic: c(x,x)=0c(x,x)=0c(x,x)=0; for pairwise distinct i,j,ki,j,ki,j,k,

P(y=1∣xi)<P(y=1∣xj)<P(y=1∣xk)  ⟺  [c(xi,xj)<c(xi,xk)]∧[c(xj,xk)<c(xi,xk)];P(y=1\mid x_i)<P(y=1\mid x_j)<P(y=1\mid x_k)\iff \bigl[c(x_i,x_j)<c(x_i,x_k)\bigr]\wedge\bigl[c(x_j,x_k)<c(x_i,x_k)\bigr];P(y=1∣xi​)<P(y=1∣xj​)<P(y=1∣xk​)⟺[c(xi​,xj​)<c(xi​,xk​)]∧[c(xj​,xk​)<c(xi​,xk​)];

and for i≠ji\ne ji=j, P(y=1∣xi)>P(y=1∣xj)  ⟺  c(xi,xj)=0P(y=1\mid x_i)>P(y=1\mid x_j)\iff c(x_i,x_j)=0P(y=1∣xi​)>P(y=1∣xj​)⟺c(xi​,xj​)=0. Moreover it satisfies standing assumption (i): c(xi,xj)>0c(x_i,x_j)>0c(xi​,xj​)>0 whenever i≠ji\ne ji=j and P(y∣xj)≥P(y∣xi)P(y\mid x_j)\ge P(y\mid x_i)P(y∣xj​)≥P(y∣xi​).

This is the hypothesis "even under outcome monotonic costs" under which the example is posed, and it confirms that the instance belongs to the paper's model.

Preamble
import Mathlib
import Definitions.Def_StrategicPolicy_StochasticOpt_Setting
import Definitions.Def_StrategicPolicy_StochasticOpt_Example
Formal statement
namespace StrategicPolicy.StochasticOpt

theorem cost_outcome_monotonic : OMCost q0 c0 ∧ StandingI q0 c0 := by sorry

end StrategicPolicy.StochasticOpt
Source
Tsirtsis et al., Optimal Decision Making Under Strategic Behavior, arXiv:1905.09239v5, p. 5, §3, sentence before the example; outcome monotonic cost p. 6; standing assumption (i) p. 4
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me