Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.8 -- revenue equivalence on convex type spaces: transfers are unique up to a constant

Proved
MechanismDesign.IncentiveCompat.revenue_equivalence

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

incentive-compatibilitymechanism-designp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1revenue-equivalence

Let the type set Θ\ThetaΘ be a nonempty convex subset of Rn\mathbb R^nRn, let AAA be a set of alternatives, and suppose that for every a∈Aa \in Aa∈A the utility u(a,θ)u(a,\theta)u(a,θ) is a convex function of θ\thetaθ on Θ\ThetaΘ that is also continuous on Θ\ThetaΘ. Let (q,t)(q,t)(q,t) be an incentive-compatible direct mechanism. Then a direct mechanism (q,t′)(q,t')(q,t′) with the same decision rule is incentive-compatible if and only if there is τ∈R\tau \in \mathbb Rτ∈R with

t′(θ)=t(θ)+τfor all θ∈Θ.t'(\theta) = t(\theta) + \tau \qquad \text{for all } \theta \in \Theta.t′(θ)=t(θ)+τfor all θ∈Θ.

For a given implementable decision rule, the set of transfer rules that implement it is one function and all its parallel translations (Krishna and Maenner 2001).

Formalization Note Continuity of u(a,⋅)u(a,\cdot)u(a,⋅) on Θ\ThetaΘ is added to the book's hypotheses; a convex function on a convex set is automatically continuous only on its relative interior, and without continuity at the boundary the statement is false. Example: Θ=[0,1]\Theta = [0,1]Θ=[0,1], A={a,b}A = \{a,b\}A={a,b}, u(a,0)=5u(a,0) = 5u(a,0)=5, u(a,θ)=0u(a,\theta) = 0u(a,θ)=0 for θ>0\theta > 0θ>0, u(b,⋅)=0u(b,\cdot) = 0u(b,⋅)=0, q(0)=aq(0) = aq(0)=a and q(θ)=bq(\theta) = bq(θ)=b for θ>0\theta > 0θ>0; both t≡0t \equiv 0t≡0 and t′=−1(0,1]t' = -\mathbf 1_{(0,1]}t′=−1(0,1]​ make qqq incentive-compatible. Every utility convex on an open convex set containing Θ\ThetaΘ (for instance, the linear expected utility of lotteries) satisfies the added hypothesis.

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

/-- Proposition 5.8 (Krishna–Maenner 2001; p.109), in the corrected form. Types form a nonempty
convex set `S ⊆ ℝⁿ`; for each alternative `a` the utility `w a` is convex on `S` and, in addition
to the book's hypotheses, continuous on `S` (without continuity at the relative boundary the
statement is false). If `(q, t)` is incentive-compatible, then `(q, t')` is incentive-compatible
if and only if `t' = t + τ` on `S` for some constant `τ`. -/
theorem revenue_equivalence {A : Type*} {n : ℕ} (S : Set (Fin n → ℝ)) (hS : Convex ℝ S)
    (hSne : S.Nonempty) (w : A → (Fin n → ℝ) → ℝ) (hconv : ∀ a, ConvexOn ℝ S (w a))
    (hcont : ∀ a, ContinuousOn (w a) S) (q : S → A) (t : S → ℝ)
    (hIC : IsIC (fun (a : A) (θ : S) => w a (θ : Fin n → ℝ)) ⟨q, t⟩) (t' : S → ℝ) :
    IsIC (fun (a : A) (θ : S) => w a (θ : Fin n → ℝ)) ⟨q, t'⟩ ↔
      ∃ τ : ℝ, ∀ θ : S, t' θ = t θ + τ := 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.109, Proposition 5.8 (Krishna and Maenner 2001)
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