Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 8.3 -- monotonicity implies set-monotonicity

Proved
MechanismDesign.SocialChoice.monotone_setMonotone

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

mechanism-designp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1social-choice

Let f:RN→Af:\mathcal R^N\to Af:RN→A be a direct mechanism on profiles of linear orders over a finite set AAA of alternatives. If fff is monotone (Definition 8.4), then fff is set-monotone: whenever f(R)∈Bf(R)\in Bf(R)∈B for some B⊆AB\subseteq AB⊆A and, for every agent iii,

a Ri′ a′  ⟺  a Ri a′for all a,a′∈A with a∉B or a′∉B,a\,R_i'\,a'\iff a\,R_i\,a'\qquad\text{for all } a,a'\in A \text{ with } a\notin B \text{ or } a'\notin B,aRi′​a′⟺aRi​a′for all a,a′∈A with a∈/B or a′∈/B,

then f(R′)∈Bf(R')\in Bf(R′)∈B.

Set-monotonicity says that reshuffling agents' rankings inside a set BBB cannot move the outcome out of BBB; it is used with B={a,b}B=\{a,b\}B={a,b} throughout the proof of Proposition 8.5.

Preamble
import Mathlib
import Definitions.Def_MechanismDesign_SocialChoice_Model
Formal statement
namespace MechanismDesign.SocialChoice

/-- **Proposition 8.3** (Börgers, p.145): if `f` is monotone, then `f` is set-monotone. -/
theorem monotone_setMonotone {ι A : Type*} [Fintype ι] [Fintype A]
    (f : DirectMechanism ι A) (hf : IsMonotone f) : IsSetMonotone f := by sorry

end MechanismDesign.SocialChoice
Source
Börgers, An Introduction to the Theory of Mechanism Design, Oxford University Press 2015, DOI 10.1093/acprof:oso/9780199734023.001.0001, p.145, Proposition 8.3 (Definition 8.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