Corollary 1: quasisupermodularity and monotonicity in the constraint set
ProvedMonotoneCompStatics.Monotonicity.corollary1comparative-staticsoptimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a lattice and . The function is quasisupermodular on if and only if its maximizer set is nondecreasing under the strong set order as the constraint set rises:
This isolates the choice-set part of Theorem 4 when there is no varying parameter.
Formalization Note The statement ranges over all constraint sets, including empty ones, and uses the paper's strong set order.
Preamble
import Mathlib import Definitions.Def_Supermodularity_Lattices_InducedSetOrder import Definitions.Def_MonotoneCompStatics_Monotonicity_argmaxOn import Definitions.Def_MonotoneCompStatics_Monotonicity_QuasiSupermodularOn
Formal statement
namespace MonotoneCompStatics.Monotonicity
theorem corollary1 {X : Type*} [Lattice X] (g : X → ℝ) :
QuasiSupermodularOn g Set.univ ↔
∀ ⦃S S' : Set X⦄, Supermodularity.Lattices.InducedSetOrder S S' →
Supermodularity.Lattices.InducedSetOrder (argmaxOn g S) (argmaxOn g S') := by sorry
end MonotoneCompStatics.Monotonicity
Source
Milgrom and Shannon, Monotone Comparative Statics, Econometrica 62 (1994), p. 163 (PDF 8), Corollary 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.