Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 164 remark — every supermodular function is quasisupermodular

Proved
MonotoneCompStatics.LinearPerturb.supermodular_quasiSupermodular

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

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

Let XXX be a lattice and g:X→Rg : X \to \mathbb{R}g:X→R be supermodular, i.e.

g(x)+g(y)≤g(x∨y)+g(x∧y)for all x,y∈X.g(x) + g(y) \le g(x \vee y) + g(x \wedge y) \qquad \text{for all } x, y \in X.g(x)+g(y)≤g(x∨y)+g(x∧y)for all x,y∈X.

Then ggg is quasisupermodular: for all x,y∈Xx, y \in Xx,y∈X, g(x)≥g(x∧y)g(x) \ge g(x \wedge y)g(x)≥g(x∧y) implies g(x∨y)≥g(y)g(x \vee y) \ge g(y)g(x∨y)≥g(y), and g(x)>g(x∧y)g(x) > g(x \wedge y)g(x)>g(x∧y) implies g(x∨y)>g(y)g(x \vee y) > g(y)g(x∨y)>g(y).

This is the first half of the remark following Theorem 5 in Milgrom and Shannon. It places the cardinal theory of Topkis inside the ordinal theory of the paper, and it is the step of Theorem 10 that turns supermodularity of f(x,t)+p⋅xf(x,t) + p\cdot xf(x,t)+p⋅x into quasisupermodularity in xxx.

Preamble
import Mathlib
import Definitions.Def_Supermodularity_Monotonicity_SupermodularOn
import Definitions.Def_MonotoneCompStatics_Monotonicity_QuasiSupermodularOn
Formal statement
namespace MonotoneCompStatics.LinearPerturb

/-- Milgrom and Shannon (1994), p. 164, remark after Theorem 5: every supermodular function on a
lattice is quasisupermodular. -/
theorem supermodular_quasiSupermodular {X : Type*} [Lattice X] (g : X → ℝ)
    (hg : Supermodularity.Monotonicity.SupermodularOn g Set.univ) :
    MonotoneCompStatics.Monotonicity.QuasiSupermodularOn g Set.univ := by sorry

end MonotoneCompStatics.LinearPerturb
Source
Milgrom and Shannon, Monotone Comparative Statics, Econometrica 62 (1994), p. 164 (PDF p. 9), remark after Theorem 5
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