Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10, proof (converse step) — quasisupermodularity of g + p·x for every p forces supermodularity of g

Proved
MonotoneCompStatics.LinearPerturb.theorem10_converse_step

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

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

Let n≥0n \ge 0n≥0 and give Rn\mathbb{R}^nRn the componentwise order, so that x∨yx \vee yx∨y and x∧yx \wedge yx∧y are the componentwise maximum and minimum. Let g:Rn→Rg : \mathbb{R}^n \to \mathbb{R}g:Rn→R, and for a price vector p∈Rnp \in \mathbb{R}^np∈Rn write p⋅x=∑ipixip \cdot x = \sum_i p_i x_ip⋅x=∑i​pi​xi​. If for every p∈Rnp \in \mathbb{R}^np∈Rn the function

x⟼g(x)+p⋅xx \longmapsto g(x) + p \cdot xx⟼g(x)+p⋅x

is quasisupermodular on Rn\mathbb{R}^nRn, then ggg is supermodular on Rn\mathbb{R}^nRn:

g(x)+g(y)≤g(x∨y)+g(x∧y)for all x,y∈Rn.g(x) + g(y) \le g(x \vee y) + g(x \wedge y) \qquad \text{for all } x, y \in \mathbb{R}^n.g(x)+g(y)≤g(x∨y)+g(x∧y)for all x,y∈Rn.

This is the step of the proof of Theorem 10 that recovers supermodularity in xxx (for a fixed value of the parameter ttt, which the paper suppresses) from quasisupermodularity of all linear perturbations. It shows that quasisupermodularity, although an ordinal property, pins down the cardinal property supermodularity once it is required robustly against all linear price terms.

Formalization Note Rn\mathbb{R}^nRn is Fin n → ℝ with Mathlib's pointwise order and lattice operations, and p⋅xp \cdot xp⋅x is p ⬝ᵥ x (dotProduct). The hypothesis quantifies over all ppp, not over some ppp.

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. 166, proof of Theorem 10 (the step for `x`, with `t`
suppressed): if `g + p · x` is quasisupermodular on `ℝⁿ` for every price vector `p ∈ ℝⁿ`, then
`g` is supermodular on `ℝⁿ` (componentwise order, meet and join). -/
theorem theorem10_converse_step {n : ℕ} (g : (Fin n → ℝ) → ℝ)
    (h : ∀ p : Fin n → ℝ, MonotoneCompStatics.Monotonicity.QuasiSupermodularOn (fun x => g x + p ⬝ᵥ x) Set.univ) :
    Supermodularity.Monotonicity.SupermodularOn g Set.univ := by sorry

end MonotoneCompStatics.LinearPerturb
Source
Milgrom and Shannon, Monotone Comparative Statics, Econometrica 62 (1994), p. 166 (PDF p. 11), Theorem 10, proof (converse step)
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