Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8 — f is quasisupermodular iff a strictly increasing transformation makes it supermodular on every sublattice {x₁, x₂, x₁ ∨ x₂, x₁ ∧ x₂}

Proved
MonotoneCompStatics.QSMChar.theorem8

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

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

Let XXX be a lattice and f:X→Rf : X \to \mathbb{R}f:X→R. Then fff is quasisupermodular if and only if there exists a function g:R×X×X→Rg : \mathbb{R} \times X \times X \to \mathbb{R}g:R×X×X→R such that

  1. for every fixed (x1,x2)∈X2(x_1, x_2) \in X^2(x1​,x2​)∈X2, the map r↦g(r,x1,x2)r \mapsto g(r, x_1, x_2)r↦g(r,x1​,x2​) is strictly increasing, and
  2. for every x1,x2∈Xx_1, x_2 \in Xx1​,x2​∈X, the function x↦g(f(x),x1,x2)x \mapsto g(f(x), x_1, x_2)x↦g(f(x),x1​,x2​) is supermodular on the sublattice {x1,x2,x1∨x2,x1∧x2}\{x_1, x_2, x_1 \vee x_2, x_1 \wedge x_2\}{x1​,x2​,x1​∨x2​,x1​∧x2​}:
g(f(u),x1,x2)+g(f(v),x1,x2)≤g(f(u∨v),x1,x2)+g(f(u∧v),x1,x2)for all u,v∈{x1,x2,x1∨x2,x1∧x2}.g(f(u), x_1, x_2) + g(f(v), x_1, x_2) \le g(f(u \vee v), x_1, x_2) + g(f(u \wedge v), x_1, x_2) \quad \text{for all } u, v \in \{x_1, x_2, x_1 \vee x_2, x_1 \wedge x_2\}.g(f(u),x1​,x2​)+g(f(v),x1​,x2​)≤g(f(u∨v),x1​,x2​)+g(f(u∧v),x1​,x2​)for all u,v∈{x1​,x2​,x1​∨x2​,x1​∧x2​}.

Thus quasisupermodularity is exactly "local supermodularizability": on each sublattice generated by two points, some strictly increasing reparametrization of the values of fff is supermodular. The transformation may depend on the pair (x1,x2)(x_1, x_2)(x1​,x2​); Example 1 shows that a single transformation for all of XXX need not exist.

Formalization Note g:R×X×X→Rg : \mathbb{R} \times X \times X \to \mathbb{R}g:R×X×X→R is curried as g : ℝ → X → X → ℝ. Quasisupermodularity of fff is QuasiSupermodularOn f Set.univ; supermodularity on the sublattice is the published SupermodularOn relativized to the set {x₁, x₂, x₁ ⊔ x₂, x₁ ⊓ x₂}, which is closed under join and meet; "strictly increasing" is StrictMono.

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

/-- Theorem 8 (p. 165): `f` is quasisupermodular on the lattice `X` if and only if there is
`g : ℝ → X → X → ℝ`, strictly increasing in its first argument for every fixed `(x₁, x₂)`, such
that for every `x₁, x₂` the function `x ↦ g (f x) x₁ x₂` is supermodular on the sublattice
`{x₁, x₂, x₁ ⊔ x₂, x₁ ⊓ x₂}`. -/
theorem theorem8 {X : Type*} [Lattice X] (f : X → ℝ) :
    MonotoneCompStatics.Monotonicity.QuasiSupermodularOn f Set.univ ↔
      ∃ g : ℝ → X → X → ℝ, (∀ x₁ x₂, StrictMono (fun r => g r x₁ x₂)) ∧
        ∀ x₁ x₂, Supermodularity.Monotonicity.SupermodularOn (fun x => g (f x) x₁ x₂)
          {x₁, x₂, x₁ ⊔ x₂, x₁ ⊓ x₂} := by sorry

end MonotoneCompStatics.QSMChar
Source
Milgrom and Shannon, Monotone Comparative Statics, Econometrica 62 (1994), p. 165 (PDF p. 10), Theorem 8; proof on p. 166 (PDF p. 11)
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