Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 164 remark — increasing differences in (x, t) imply the single crossing property

Proved
MonotoneCompStatics.LinearPerturb.increasingDifferences_singleCrossing

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

comparative-staticsincreasing-differenceslattice-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1single-crossing

Let XXX be a lattice, TTT a partially ordered set and f:X×T→Rf : X \times T \to \mathbb{R}f:X×T→R. Suppose fff has increasing differences in (x,t)(x, t)(x,t): for x′≥x′′x' \ge x''x′≥x′′ in XXX, the difference f(x′,t)−f(x′′,t)f(x', t) - f(x'', t)f(x′,t)−f(x′′,t) is monotone nondecreasing in ttt, that is,

f(x′,t′)−f(x′′,t′)≥f(x′,t′′)−f(x′′,t′′)whenever x′≥x′′ and t′>t′′.f(x', t') - f(x'', t') \ge f(x', t'') - f(x'', t'') \qquad \text{whenever } x' \ge x'' \text{ and } t' > t''.f(x′,t′)−f(x′′,t′)≥f(x′,t′′)−f(x′′,t′′)whenever x′≥x′′ and t′>t′′.

Then fff has the single crossing property in (x;t)(x; t)(x;t): for x′>x′′x' > x''x′>x′′ and t′>t′′t' > t''t′>t′′, f(x′,t′′)>f(x′′,t′′)f(x', t'') > f(x'', t'')f(x′,t′′)>f(x′′,t′′) implies f(x′,t′)>f(x′′,t′)f(x', t') > f(x'', t')f(x′,t′)>f(x′′,t′), and f(x′,t′′)≥f(x′′,t′′)f(x', t'') \ge f(x'', t'')f(x′,t′′)≥f(x′′,t′′) implies f(x′,t′)≥f(x′′,t′)f(x', t') \ge f(x'', t')f(x′,t′)≥f(x′′,t′).

This is the second half of the remark following Theorem 5 in Milgrom and Shannon. It shows that the cardinal complementarity condition of Topkis is a special case of the ordinal one used in the Monotonicity Theorem.

Formalization Note Increasing differences is the published Supermodularity.Monotonicity.IncreasingDifferencesOn f Set.univ: for t′′<t′t'' < t't′′<t′, the map x↦f(x,t′)−f(x,t′′)x \mapsto f(x, t') - f(x, t'')x↦f(x,t′)−f(x,t′′) is monotone on XXX. This is the page's condition.

Preamble
import Mathlib
import Definitions.Def_Supermodularity_Monotonicity_IncreasingDifferencesOn
import Definitions.Def_MonotoneCompStatics_Monotonicity_SingleCrossing
Formal statement
namespace MonotoneCompStatics.LinearPerturb

/-- Milgrom and Shannon (1994), p. 164, remark after Theorem 5: a function `f : X × T → ℝ` on a
lattice `X` and a partially ordered set `T` with increasing differences in `(x, t)` has the single
crossing property in `(x; t)`. -/
theorem increasingDifferences_singleCrossing {X T : Type*} [Lattice X] [PartialOrder T]
    (f : X → T → ℝ)
    (hf : Supermodularity.Monotonicity.IncreasingDifferencesOn f Set.univ) :
    MonotoneCompStatics.Monotonicity.SingleCrossing f := by sorry

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