Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — characterization of feasible direct mechanisms

Proved
MyersonAuction.Optimal.lemma_2

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

auctionsmechanism-designoptimal-auctionsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

A direct mechanism (p,x)(p,x)(p,x) is feasible if and only if its interim win probability is weakly increasing in each bidder’s report, the interim utility satisfies the envelope formula, every lowest type has nonnegative utility, and the allocation probabilities satisfy the single-object constraint:

s≤t⟹Qi(p,s)≤Qi(p,t),Ui(p,x,t)=Ui(p,x,ai)+∫aitQi(p,r) dr,Ui(p,x,ai)≥0.s\le t\Longrightarrow Q_i(p,s)\le Q_i(p,t),\qquad U_i(p,x,t)=U_i(p,x,a_i)+\int_{a_i}^{t}Q_i(p,r)\,dr,\qquad U_i(p,x,a_i)\ge0.s≤t⟹Qi​(p,s)≤Qi​(p,t),Ui​(p,x,t)=Ui​(p,x,ai​)+∫ai​t​Qi​(p,r)dr,Ui​(p,x,ai​)≥0.

This characterization replaces the incentive inequalities by monotonicity and an integral identity.

Formalization Note Both sides require integrability of the mechanism and its report sections. The type estimates s,ts,ts,t range only over [ai,bi][a_i,b_i][ai​,bi​].

Preamble
import Definitions.Def_MyersonAuction_Optimal_Mechanism

noncomputable section
Formal statement
namespace MyersonAuction.Optimal

theorem lemma_2 {ι : Type} [Fintype ι] [DecidableEq ι] [Nonempty ι]
    (E : Environment ι) (p x : Outcome ι) :
    Feasible E p x ↔
      WellDefined E p x ∧ ProbabilityCondition E p ∧
      MonotoneQ E p ∧ EnvelopeAndBaseIR E p x := by sorry

end MyersonAuction.Optimal
Source
Myerson, Optimal Auction Design, Math. Oper. Res. 6(1) (1981), p. 63, Lemma 2, eqs. (4.2)–(4.4)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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