Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.5 -- on one-dimensional type spaces, weak monotonicity iff monotonicity with respect to R

Proved
MechanismDesign.IncentiveCompat.oneDimensional_weaklyMonotone_iff

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

incentive-compatibilitymechanism-designone-dimensionalp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1

Let RRR be a complete and transitive order of AAA such that the type set Θ\ThetaΘ is one-dimensional with respect to RRR: any two distinct types θ≠θ′\theta \ne \theta'θ=θ′ satisfy θ≻Rθ′\theta \succ_R \theta'θ≻R​θ′ or θ′≻Rθ\theta' \succ_R \thetaθ′≻R​θ. Then a decision rule qqq is weakly monotone if and only if it is monotone with respect to RRR, that is,

θ≻Rθ′  ⟹  q(θ) R q(θ′).\theta \succ_R \theta' \;\Longrightarrow\; q(\theta)\,R\,q(\theta').θ≻R​θ′⟹q(θ)Rq(θ′).

On one-dimensional domains weak monotonicity thus reduces to the familiar requirement that higher types receive higher alternatives.

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

/-- Proposition 5.5 (p.106): if `Θ` is one-dimensional with respect to a complete and transitive
order `R` of `A`, a decision rule is weakly monotone if and only if it is monotone with respect
to `R`. -/
theorem oneDimensional_weaklyMonotone_iff {A Θ : Type*} [Nonempty Θ] (u : A → Θ → ℝ)
    (R : A → A → Prop) (hR : IsCompleteTransitive R) (h1 : OneDimensional u R) (q : Θ → A) :
    WeaklyMonotone u q ↔ MonotoneWRT u R 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.106, Proposition 5.5
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