Theorem 4, proof (⇐): ordinal conditions imply monotonicity
ProvedMonotoneCompStatics.Monotonicity.theorem4_sufficiencycomparative-staticslattice-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a lattice, a partially ordered set, and . Suppose is quasisupermodular on for every and has the single crossing property in . Then its maximizer correspondence obeys
for all parameter pairs and all constraint sets. This is the sufficient direction of the paper's Monotonicity Theorem.
Formalization Note The definition of allows empty maximizer sets. Quasisupermodularity is on all of , and single crossing includes both weak and strict implications.
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_sufficiency {X T : Type*} [Lattice X] [PartialOrder T] (f : X → T → ℝ)
(hq : ∀ t, QuasiSupermodularOn (fun x => f x t) Set.univ) (hsc : SingleCrossing f) :
ArgmaxMonotone f := by sorry
end MonotoneCompStatics.Monotonicity
Source
Milgrom and Shannon, Monotone Comparative Statics, Econometrica 62 (1994), p. 162 (PDF 7), Theorem 4, proof (⇐)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.