Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 164 remark — a strictly increasing transformation of a quasisupermodular function is quasisupermodular

Proved
MonotoneCompStatics.QSMChar.qsm_comp_strictMono

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 let f:X→Rf : X \to \mathbb{R}f:X→R be quasisupermodular: for all x,y∈Xx, y \in Xx,y∈X, f(x)≥(>) f(x∧y)f(x) \ge (>)\, f(x \wedge y)f(x)≥(>)f(x∧y) implies f(x∨y)≥(>) f(y)f(x \vee y) \ge (>)\, f(y)f(x∨y)≥(>)f(y). Let g:R→Rg : \mathbb{R} \to \mathbb{R}g:R→R be strictly increasing. Then the composition

g∘f:X→R,x↦g(f(x)),g \circ f : X \to \mathbb{R}, \qquad x \mapsto g(f(x)),g∘f:X→R,x↦g(f(x)),

is also quasisupermodular.

The statement says that quasisupermodularity is an ordinal property: it is invariant under every strictly increasing change of the units of the objective. This is what separates it from supermodularity, which is not preserved by such transformations.

Formalization Note Quasisupermodularity on XXX is QuasiSupermodularOn f Set.univ; "strictly increasing" is StrictMono. The page states the remark for functions on the whole lattice, and so does the formal statement.

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

/-- p. 164 (remark after Theorem 7): a strictly increasing transformation of a quasisupermodular
function is quasisupermodular. -/
theorem qsm_comp_strictMono {X : Type*} [Lattice X] (f : X → ℝ) (g : ℝ → ℝ)
    (hf : MonotoneCompStatics.Monotonicity.QuasiSupermodularOn f Set.univ) (hg : StrictMono g) :
    MonotoneCompStatics.Monotonicity.QuasiSupermodularOn (g ∘ f) Set.univ := by sorry

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