Theorem 4 (Monotonicity Theorem)
ProvedMonotoneCompStatics.Monotonicity.theorem4_monotonicitycomparative-staticslattice-theoryoptimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a lattice, a partially ordered set, and . For every constraint set , write . Then is monotone nondecreasing jointly in the parameter and constraint set if and only if is quasisupermodular on for every and has the single crossing property in :
This equivalence characterizes monotone comparative statics without requiring cardinal supermodularity or increasing differences.
Formalization Note is curried in Lean. The strong set order is the published lattice relation, and all constraint sets, including empty ones, are quantified. Quasisupermodularity and single crossing each include a weak and a strict implication; the latter compares strictly ordered choices and parameters.
Preamble
import Mathlib import Definitions.Def_MonotoneCompStatics_Monotonicity_ArgmaxMonotone import Definitions.Def_MonotoneCompStatics_Monotonicity_QuasiSupermodularOn import Definitions.Def_MonotoneCompStatics_Monotonicity_SingleCrossing
Formal statement
namespace MonotoneCompStatics.Monotonicity
theorem theorem4_monotonicity {X T : Type*} [Lattice X] [PartialOrder T] (f : X → T → ℝ) :
ArgmaxMonotone f ↔ (∀ t, QuasiSupermodularOn (fun x => f x t) Set.univ) ∧ SingleCrossing f := by sorry
end MonotoneCompStatics.Monotonicity
Source
Milgrom and Shannon, Monotone Comparative Statics, Econometrica 62 (1994), p. 162 (PDF 7), Theorem 4 (Monotonicity Theorem)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.