Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3, p. 8 — OSP CMON: a tree admits OSP payments iff no OSP-graph has a negative-weight cycle

Proved
OSPMech.SqrtLB.theorem_3

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

cycle-monotonicityimplementation-treemechanism-designobvious-strategyproofnessp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let T\mathcal TT be an implementation tree for nnn agents with finite type domains DiD_iDi​, outcomes in a set S\mathcal SS, and costs a(X)a(X)a(X) for an agent of type aaa and outcome XXX. For each agent iii, let OiT\mathcal O_i^{\mathcal T}OiT​ be the OSP-graph: its nodes are the profiles of DDD, and there is an edge from a=(a,a−i)\mathbf a = (a, \mathbf a_{-i})a=(a,a−i​) to b=(b,b−i)\mathbf b = (b, \mathbf b_{-i})b=(b,b−i​) whenever both are compatible with a vertex labelled iii at which they diverge, with weight a(f(b))−a(f(a))a(f(\mathbf b)) - a(f(\mathbf a))a(f(b))−a(f(a)).

Then there is a payment function p\mathbf pp making (T,p)(\mathcal T, \mathbf p)(T,p) obviously strategyproof if and only if, for every agent iii,

OiT has no cycle of negative total weight.\mathcal O_i^{\mathcal T} \text{ has no cycle of negative total weight.}OiT​ has no cycle of negative total weight.

This is the extension of Rochet's cycle monotonicity from direct mechanisms to extensive-form mechanisms ("OSP CMON"). Its "only if" direction applied to cycles of length two gives the monotonicity constraints used in the lower bound of Theorem 12.

Formalization Note. "Is an OSP mechanism for fff" is read as "some payment function makes it OSP", as in the proof (p. 24). The edge weight is that of the proof (p. 24) and of Observation 1; Definition 2 prints the opponents' profiles swapped. A cycle is a closed walk w0→w1→⋯→wk→w0\mathbf w_0 \to \mathbf w_1 \to \dots \to \mathbf w_k \to \mathbf w_0w0​→w1​→⋯→wk​→w0​ along edges.

Preamble
import Mathlib
import Definitions.Def_OSPMech_SqrtLB_Model
Formal statement
namespace OSPMech.SqrtLB
theorem theorem_3 {n : ℕ} {X : Type} (D : Fin n → Finset ℝ) (cost : Fin n → ℝ → X → ℝ)
    (t : ImplTree n X) :
    (∃ p : (Fin n → ℝ) → Fin n → ℝ, IsOSP D cost t p) ↔ ∀ i, NoNegCycle D cost t i := by sorry
end OSPMech.SqrtLB
Source
Ferraioli, Meier, Penna, Ventre, On the approximation guarantee of obviously strategyproof mechanisms, arXiv:1805.04190v2, p. 8, Definition 2 and Theorem 3; proof p. 24 (App. A.1)
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 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