Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10, first sentence — f + p·x is quasisupermodular with single crossing for all p iff f is supermodular

Proved
MonotoneCompStatics.LinearPerturb.theorem10_first_sentence

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

comparative-staticslattice-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quasisupermodularitysingle-crossingsupermodularity

Let n≥0n \ge 0n≥0 and f:Rn×R→Rf : \mathbb{R}^n \times \mathbb{R} \to \mathbb{R}f:Rn×R→R, (x,t)↦f(x,t)(x, t) \mapsto f(x, t)(x,t)↦f(x,t). Order Rn\mathbb{R}^nRn componentwise and Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R by the product order, so that joins and meets are componentwise maxima and minima. Write p⋅x=∑ipixip \cdot x = \sum_i p_i x_ip⋅x=∑i​pi​xi​. Then the following are equivalent:

  1. for every p∈Rnp \in \mathbb{R}^np∈Rn, the function (x,t)↦f(x,t)+p⋅x(x, t) \mapsto f(x, t) + p \cdot x(x,t)↦f(x,t)+p⋅x is quasisupermodular in xxx (for each fixed ttt) and has the single crossing property in (x;t)(x; t)(x;t);
  2. fff is supermodular on the lattice Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R:
f(z)+f(z′)≤f(z∨z′)+f(z∧z′)for all z,z′∈Rn×R.f(z) + f(z') \le f(z \vee z') + f(z \wedge z') \qquad \text{for all } z, z' \in \mathbb{R}^n \times \mathbb{R}.f(z)+f(z′)≤f(z∨z′)+f(z∧z′)for all z,z′∈Rn×R.

The theorem says that supermodularity, although never necessary for monotone comparative statics, is exactly what is needed when the objective must behave well under every linear price perturbation p⋅xp \cdot xp⋅x of the choice variables.

Formalization Note fff is curried, f : (Fin n → ℝ) → ℝ → ℝ. "fff is supermodular" is read as supermodularity jointly in (x,t)(x, t)(x,t) on Rn×R\mathbb{R}^n \times \mathbb{R}Rn×R (the published SupermodularOn applied to (x,t)↦f(x,t)(x,t) \mapsto f(x,t)(x,t)↦f(x,t) with Set.univ), as the paper's proof confirms ("If fff is supermodular in (x,t)(x, t)(x,t) …"); supermodularity in xxx alone would not imply the single crossing property. "Quasisupermodular in xxx" means quasisupermodular on Rn\mathbb{R}^nRn for every fixed ttt. The quantifier over ppp covers both properties.

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

/-- Milgrom and Shannon (1994), p. 166, Theorem 10, first sentence: for `f : ℝⁿ × ℝ → ℝ`,
`f(x, t) + p · x` is quasisupermodular in `x` and has the single crossing property in `(x; t)`
for all `p ∈ ℝⁿ` if and only if `f` is supermodular (jointly in `(x, t)`, on the product lattice
`ℝⁿ × ℝ`). -/
theorem theorem10_first_sentence {n : ℕ} (f : (Fin n → ℝ) → ℝ → ℝ) :
    (∀ p : Fin n → ℝ, (∀ t, MonotoneCompStatics.Monotonicity.QuasiSupermodularOn (fun x => f x t + p ⬝ᵥ x) Set.univ) ∧
        MonotoneCompStatics.Monotonicity.SingleCrossing (fun x t => f x t + p ⬝ᵥ x)) ↔
      Supermodularity.Monotonicity.SupermodularOn
        (fun z : (Fin n → ℝ) × ℝ => f z.1 z.2) Set.univ := by sorry

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