pp. 164–165 remark — supermodularizable functions are quasisupermodular
ProvedMonotoneCompStatics.QSMChar.qsm_of_supermodularizableLet be a lattice and . Suppose there is a strictly increasing such that is supermodular on :
Then is quasisupermodular. Functions admitting such an are called supermodularizable (Li Calzi, 1991).
This gives the easy sufficient condition for quasisupermodularity: a function becomes eligible for the paper's monotone comparative statics as soon as some reparametrization of its values is supermodular. Theorem 8 sharpens it to a characterization by allowing the transformation to depend on the four-point sublattice.
Formalization Note Supermodularity on is the published Supermodularity.Monotonicity.SupermodularOn (h ∘ f) Set.univ; quasisupermodularity on is QuasiSupermodularOn f Set.univ; "strictly increasing" is StrictMono.
import Mathlib import Definitions.Def_Supermodularity_Monotonicity_SupermodularOn import Definitions.Def_MonotoneCompStatics_Monotonicity_QuasiSupermodularOn
namespace MonotoneCompStatics.QSMChar
/-- pp. 164–165 (remark after Theorem 7): if some strictly increasing `h : ℝ → ℝ` makes `h ∘ f`
supermodular on the lattice `X` (`f` is supermodularizable), then `f` is quasisupermodular. -/
theorem qsm_of_supermodularizable {X : Type*} [Lattice X] (f : X → ℝ)
(h : ℝ → ℝ) (hh : StrictMono h)
(hsm : Supermodularity.Monotonicity.SupermodularOn (h ∘ f) Set.univ) :
MonotoneCompStatics.Monotonicity.QuasiSupermodularOn f Set.univ := by sorry
end MonotoneCompStatics.QSMChar
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.