Theorem 4′ (Monotone Selection Theorem)
ProvedMonotoneCompStatics.Monotonicity.theorem4prime_selectioncomparative-staticsoptimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a lattice, a partially ordered set, a nondecreasing feasible-set correspondence under the strong set order, and . If is quasisupermodular on for every and has the strict single crossing property, then every selection from the maximizers is nondecreasing:
Strict single crossing is needed because an arbitrary choice among tied maximizers need not be monotone under weak single crossing.
Formalization Note A selection is represented by a function on an arbitrary domain where maximizers exist. No global existence of maximizers is assumed. The order on feasible sets includes empty sets; is curried in Lean.
Preamble
import Mathlib import Definitions.Def_Supermodularity_Lattices_InducedSetOrder import Definitions.Def_MonotoneCompStatics_Monotonicity_argmaxOn import Definitions.Def_MonotoneCompStatics_Monotonicity_QuasiSupermodularOn import Definitions.Def_MonotoneCompStatics_Monotonicity_StrictSingleCrossing
Formal statement
namespace MonotoneCompStatics.Monotonicity
theorem theorem4prime_selection {X T : Type*} [Lattice X] [PartialOrder T]
(f : X → T → ℝ) (S : T → Set X)
(hS : ∀ ⦃t t' : T⦄, t ≤ t' → Supermodularity.Lattices.InducedSetOrder (S t) (S t'))
(hq : ∀ t, QuasiSupermodularOn (fun x => f x t) Set.univ)
(hsc : StrictSingleCrossing f) :
∀ (D : Set T) (xs : T → X), (∀ t ∈ D, xs t ∈ argmaxOn (fun x => f x t) (S t)) →
MonotoneOn xs D := by sorry
end MonotoneCompStatics.Monotonicity
Source
Milgrom and Shannon, Monotone Comparative Statics, Econometrica 62 (1994), p. 163 (PDF 8), Theorem 4′ (Monotone Selection Theorem)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.