Theorem 4, proof (⇒): monotonicity implies quasisupermodularity
ProvedMonotoneCompStatics.Monotonicity.theorem4_necessity_qsmcomparative-staticslattice-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a lattice, a partially ordered set, and . If its maximizers are nondecreasing in the parameter and in the constraint set under the strong set order, then for every , the function is quasisupermodular on :
The constraint-set part of monotonicity therefore forces the ordinal complementarity condition.
Formalization Note Monotonicity ranges over all subsets of , including the two-point sets used in the paper's necessity argument.
Preamble
import Mathlib import Definitions.Def_MonotoneCompStatics_Monotonicity_ArgmaxMonotone import Definitions.Def_MonotoneCompStatics_Monotonicity_QuasiSupermodularOn
Formal statement
namespace MonotoneCompStatics.Monotonicity
theorem theorem4_necessity_qsm {X T : Type*} [Lattice X] [PartialOrder T] (f : X → T → ℝ)
(hm : ArgmaxMonotone f) :
∀ t, QuasiSupermodularOn (fun x => f x t) Set.univ := by sorry
end MonotoneCompStatics.Monotonicity
Source
Milgrom and Shannon, Monotone Comparative Statics, Econometrica 62 (1994), p. 162 (PDF 7), Theorem 4, proof (⇒), quasisupermodularity
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.