Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 1 (p. 165) — a quasisupermodular function that is not supermodularizable

Proved
MonotoneCompStatics.QSMChar.example1_qsm_not_supermodularizable

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

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

Let fff be the function of Example 1 on the lattice X={0,1}×{0,1,2,3}X = \{0,1\} \times \{0,1,2,3\}X={0,1}×{0,1,2,3} with the componentwise order, given by f(0,⋅)=(1,2,2,1)f(0,\cdot) = (1,2,2,1)f(0,⋅)=(1,2,2,1) and f(1,⋅)=(3,4,5,3)f(1,\cdot) = (3,4,5,3)f(1,⋅)=(3,4,5,3). Then

  1. fff is quasisupermodular on XXX, and
  2. fff is not supermodularizable: there is no strictly increasing h:R→Rh : \mathbb{R} \to \mathbb{R}h:R→R such that h∘fh \circ fh∘f is supermodular on XXX,
¬ ∃ h strictly increasing: h(f(u))+h(f(v))≤h(f(u∨v))+h(f(u∧v))  ∀u,v∈X.\neg\, \exists\, h \text{ strictly increasing}: \ h(f(u)) + h(f(v)) \le h(f(u \vee v)) + h(f(u \wedge v)) \ \ \forall u, v \in X.¬∃h strictly increasing: h(f(u))+h(f(v))≤h(f(u∨v))+h(f(u∧v))  ∀u,v∈X.

The example shows that the converse of the supermodularizability criterion fails, and hence that in Theorem 8 the transformation must be allowed to depend 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​}.

Formalization Note "Strictly increasing" is StrictMono; with merely nondecreasing hhh the second claim would be false (take hhh constant).

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

/-- Example 1 (p. 165): the tabulated function on `{0, 1} × {0, 1, 2, 3}` (product order) is
quasisupermodular, but no strictly increasing `h : ℝ → ℝ` makes `h ∘ f` supermodular. -/
theorem example1_qsm_not_supermodularizable :
    MonotoneCompStatics.Monotonicity.QuasiSupermodularOn example1 Set.univ ∧
      ¬ ∃ h : ℝ → ℝ, StrictMono h ∧
        Supermodularity.Monotonicity.SupermodularOn (h ∘ example1) Set.univ := by sorry

end MonotoneCompStatics.QSMChar
Source
Milgrom and Shannon, Monotone Comparative Statics, Econometrica 62 (1994), p. 165 (PDF p. 10), Example 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