Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1: quasisupermodularity and monotonicity in the constraint set

Proved
MonotoneCompStatics.Monotonicity.corollary1

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

comparative-staticsoptimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let XXX be a lattice and g:X→Rg:X\to\mathbb Rg:X→R. The function ggg is quasisupermodular on XXX if and only if its maximizer set is nondecreasing under the strong set order as the constraint set rises:

g is quasisupermodular⟺[S≤sS′⇒argmax⁡x∈Sg(x)≤sargmax⁡x∈S′g(x) for all S,S′⊆X].g\text{ is quasisupermodular}\quad\Longleftrightarrow\quad\bigl[S\le_s S'\Rightarrow\operatorname{argmax}_{x\in S}g(x)\le_s\operatorname{argmax}_{x\in S'}g(x)\text{ for all }S,S'\subseteq X\bigr].g is quasisupermodular⟺[S≤s​S′⇒argmaxx∈S​g(x)≤s​argmaxx∈S′​g(x) for all S,S′⊆X].

This isolates the choice-set part of Theorem 4 when there is no varying parameter.

Formalization Note The statement ranges over all constraint sets, including empty ones, and uses the paper's strong set order.

Preamble
import Mathlib
import Definitions.Def_Supermodularity_Lattices_InducedSetOrder
import Definitions.Def_MonotoneCompStatics_Monotonicity_argmaxOn
import Definitions.Def_MonotoneCompStatics_Monotonicity_QuasiSupermodularOn
Formal statement
namespace MonotoneCompStatics.Monotonicity

theorem corollary1 {X : Type*} [Lattice X] (g : X → ℝ) :
    QuasiSupermodularOn g Set.univ ↔
      ∀ ⦃S S' : Set X⦄, Supermodularity.Lattices.InducedSetOrder S S' →
        Supermodularity.Lattices.InducedSetOrder (argmaxOn g S) (argmaxOn g S') := by sorry

end MonotoneCompStatics.Monotonicity
Source
Milgrom and Shannon, Monotone Comparative Statics, Econometrica 62 (1994), p. 163 (PDF 8), Corollary 1
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