Example 1 (p. 165) — a quasisupermodular function that is not supermodularizable
ProvedMonotoneCompStatics.QSMChar.example1_qsm_not_supermodularizablecomparative-staticscounterexamplelattice-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be the function of Example 1 on the lattice with the componentwise order, given by and . Then
- is quasisupermodular on , and
- is not supermodularizable: there is no strictly increasing such that is supermodular on ,
The example shows that the converse of the supermodularizability criterion fails, and hence that in Theorem 8 the transformation must be allowed to depend on the sublattice .
Formalization Note "Strictly increasing" is StrictMono; with merely nondecreasing the second claim would be false (take constant).
Preamble
import Mathlib import Definitions.Def_Supermodularity_Monotonicity_SupermodularOn import Definitions.Def_MonotoneCompStatics_Monotonicity_QuasiSupermodularOn import Definitions.Def_MonotoneCompStatics_QSMChar_example1
Formal statement
namespace MonotoneCompStatics.QSMChar
/-- Example 1 (p. 165): the tabulated function on `{0, 1} × {0, 1, 2, 3}` (product order) is
quasisupermodular, but no strictly increasing `h : ℝ → ℝ` makes `h ∘ f` supermodular. -/
theorem example1_qsm_not_supermodularizable :
MonotoneCompStatics.Monotonicity.QuasiSupermodularOn example1 Set.univ ∧
¬ ∃ h : ℝ → ℝ, StrictMono h ∧
Supermodularity.Monotonicity.SupermodularOn (h ∘ example1) Set.univ := by sorry
end MonotoneCompStatics.QSMChar
Source
Milgrom and Shannon, Monotone Comparative Statics, Econometrica 62 (1994), p. 165 (PDF p. 10), Example 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.