Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4′ (Monotone Selection Theorem)

Proved
MonotoneCompStatics.Monotonicity.theorem4prime_selection

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, TTT a partially ordered set, S:T→2XS:T\to 2^XS:T→2X a nondecreasing feasible-set correspondence under the strong set order, and f:X×T→Rf:X\times T\to\mathbb Rf:X×T→R. If f(⋅,t)f(\cdot,t)f(⋅,t) is quasisupermodular on XXX for every ttt and fff has the strict single crossing property, then every selection from the maximizers is nondecreasing:

t≤t′⟹x∗(t)≤x∗(t′)whenever x∗(u)∈argmax⁡x∈S(u)f(x,u) for u=t,t′.t\le t'\quad\Longrightarrow\quad x^*(t)\le x^*(t')\qquad\text{whenever }x^*(u)\in\operatorname{argmax}_{x\in S(u)}f(x,u)\text{ for }u=t,t'.t≤t′⟹x∗(t)≤x∗(t′)whenever x∗(u)∈argmaxx∈S(u)​f(x,u) for u=t,t′.

Strict single crossing is needed because an arbitrary choice among tied maximizers need not be monotone under weak single crossing.

Formalization Note A selection is represented by a function on an arbitrary domain D⊆TD\subseteq TD⊆T where maximizers exist. No global existence of maximizers is assumed. The order on feasible sets includes empty sets; fff is curried in Lean.

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

theorem theorem4prime_selection {X T : Type*} [Lattice X] [PartialOrder T]
    (f : X → T → ℝ) (S : T → Set X)
    (hS : ∀ ⦃t t' : T⦄, t ≤ t' → Supermodularity.Lattices.InducedSetOrder (S t) (S t'))
    (hq : ∀ t, QuasiSupermodularOn (fun x => f x t) Set.univ)
    (hsc : StrictSingleCrossing f) :
    ∀ (D : Set T) (xs : T → X), (∀ t ∈ D, xs t ∈ argmaxOn (fun x => f x t) (S t)) →
      MonotoneOn xs D := by sorry

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