Theorem 8 — f is quasisupermodular iff a strictly increasing transformation makes it supermodular on every sublattice {x₁, x₂, x₁ ∨ x₂, x₁ ∧ x₂}
ProvedMonotoneCompStatics.QSMChar.theorem8Let be a lattice and . Then is quasisupermodular if and only if there exists a function such that
- for every fixed , the map is strictly increasing, and
- for every , the function is supermodular on the sublattice :
Thus quasisupermodularity is exactly "local supermodularizability": on each sublattice generated by two points, some strictly increasing reparametrization of the values of is supermodular. The transformation may depend on the pair ; Example 1 shows that a single transformation for all of need not exist.
Formalization Note is curried as g : ℝ → X → X → ℝ. Quasisupermodularity of is QuasiSupermodularOn f Set.univ; supermodularity on the sublattice is the published SupermodularOn relativized to the set {x₁, x₂, x₁ ⊔ x₂, x₁ ⊓ x₂}, which is closed under join and meet; "strictly increasing" is StrictMono.
import Mathlib import Definitions.Def_Supermodularity_Monotonicity_SupermodularOn import Definitions.Def_MonotoneCompStatics_Monotonicity_QuasiSupermodularOn
namespace MonotoneCompStatics.QSMChar
/-- Theorem 8 (p. 165): `f` is quasisupermodular on the lattice `X` if and only if there is
`g : ℝ → X → X → ℝ`, strictly increasing in its first argument for every fixed `(x₁, x₂)`, such
that for every `x₁, x₂` the function `x ↦ g (f x) x₁ x₂` is supermodular on the sublattice
`{x₁, x₂, x₁ ⊔ x₂, x₁ ⊓ x₂}`. -/
theorem theorem8 {X : Type*} [Lattice X] (f : X → ℝ) :
MonotoneCompStatics.Monotonicity.QuasiSupermodularOn f Set.univ ↔
∃ g : ℝ → X → X → ℝ, (∀ x₁ x₂, StrictMono (fun r => g r x₁ x₂)) ∧
∀ x₁ x₂, Supermodularity.Monotonicity.SupermodularOn (fun x => g (f x) x₁ x₂)
{x₁, x₂, x₁ ⊔ x₂, x₁ ⊓ x₂} := by sorry
end MonotoneCompStatics.QSMChar
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.