Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4, proof (⇐): ordinal conditions imply monotonicity

Proved
MonotoneCompStatics.Monotonicity.theorem4_sufficiency

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

comparative-staticslattice-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let XXX be a lattice, TTT a partially ordered set, and f:X×T→Rf:X\times T\to\mathbb Rf:X×T→R. Suppose f(⋅,t)f(\cdot,t)f(⋅,t) is quasisupermodular on XXX for every t∈Tt\in Tt∈T and fff has the single crossing property in (x;t)(x;t)(x;t). Then its maximizer correspondence M(t,S)=argmax⁡x∈Sf(x,t)M(t,S)=\operatorname{argmax}_{x\in S}f(x,t)M(t,S)=argmaxx∈S​f(x,t) obeys

t≤t′,S≤sS′⟹M(t,S)≤sM(t′,S′)t\le t',\quad S\le_s S'\quad\Longrightarrow\quad M(t,S)\le_s M(t',S')t≤t′,S≤s​S′⟹M(t,S)≤s​M(t′,S′)

for all parameter pairs and all constraint sets. This is the sufficient direction of the paper's Monotonicity Theorem.

Formalization Note The definition of MMM allows empty maximizer sets. Quasisupermodularity is on all of XXX, and single crossing includes both weak and strict implications.

Preamble
import Mathlib
import Definitions.Def_MonotoneCompStatics_Monotonicity_ArgmaxMonotone
import Definitions.Def_MonotoneCompStatics_Monotonicity_QuasiSupermodularOn
import Definitions.Def_MonotoneCompStatics_Monotonicity_SingleCrossing
Formal statement
namespace MonotoneCompStatics.Monotonicity

theorem theorem4_sufficiency {X T : Type*} [Lattice X] [PartialOrder T] (f : X → T → ℝ)
    (hq : ∀ t, QuasiSupermodularOn (fun x => f x t) Set.univ) (hsc : SingleCrossing f) :
    ArgmaxMonotone f := by sorry

end MonotoneCompStatics.Monotonicity
Source
Milgrom and Shannon, Monotone Comparative Statics, Econometrica 62 (1994), p. 162 (PDF 7), Theorem 4, proof (⇐)
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