Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.2 -- Rochet's theorem: a decision rule is implementable iff it is cyclically monotone

Proved
MechanismDesign.IncentiveCompat.rochet

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

cyclical-monotonicityincentive-compatibilitymechanism-designp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1

Let AAA be an arbitrary set of alternatives, Θ\ThetaΘ an arbitrary nonempty set of types and u:A×Θ→Ru : A \times \Theta \to \mathbb Ru:A×Θ→R an arbitrary utility function. A decision rule q:Θ→Aq : \Theta \to Aq:Θ→A is implementable (there is a transfer rule t:Θ→Rt : \Theta \to \mathbb Rt:Θ→R with u(q(θ),θ)−t(θ)≥u(q(θ′),θ)−t(θ′)u(q(\theta),\theta) - t(\theta) \ge u(q(\theta'),\theta) - t(\theta')u(q(θ),θ)−t(θ)≥u(q(θ′),θ)−t(θ′) for all θ,θ′\theta, \theta'θ,θ′) if and only if it is cyclically monotone: for every finite sequence (θ1,…,θk)(\theta^1,\dots,\theta^k)(θ1,…,θk) of types with θk=θ1\theta^k = \theta^1θk=θ1,

∑κ=1k−1(u(q(θκ),θκ+1)−u(q(θκ),θκ))≤0.\sum_{\kappa=1}^{k-1}\bigl(u(q(\theta^\kappa),\theta^{\kappa+1}) - u(q(\theta^\kappa),\theta^\kappa)\bigr) \le 0.κ=1∑k−1​(u(q(θκ),θκ+1)−u(q(θκ),θκ))≤0.

This is Rochet's (1987) characterization of implementability. No finiteness, topology or boundedness is assumed on AAA, Θ\ThetaΘ or uuu.

Formalization Note Both directions are stated. A sequence of length k=m+1k = m + 1k=m+1 is a map Fin (m+1) → Θ whose first and last entries coincide; Nonempty Θ is the standing assumption of §5.2.

Preamble
import Mathlib
import Definitions.Def_MechanismDesign_IncentiveCompat_Model
Formal statement
namespace MechanismDesign.IncentiveCompat

/-- Proposition 5.2 (Rochet 1987, p.100): a decision rule is implementable if and only if it is
cyclically monotone. No structure on the set `A` of alternatives or the nonempty set `Θ` of types
is assumed. -/
theorem rochet {A Θ : Type*} [Nonempty Θ] (u : A → Θ → ℝ) (q : Θ → A) :
    Implementable u q ↔ CyclicallyMonotone u q := by sorry

end MechanismDesign.IncentiveCompat
Source
Börgers, An Introduction to the Theory of Mechanism Design, Oxford University Press 2015, DOI 10.1093/acprof:oso/9780199734023.001.0001, p.100, Proposition 5.2 (Rochet 1987)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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