p. 159 remark: reflexivity of the strong set order
ProvedMonotoneCompStatics.Monotonicity.strong_set_order_reflexivecomparative-staticslattice-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a lattice and . The strong set order is reflexive at exactly when is closed under meet and join:
This identifies the feasible sets for which comparing an optimization problem to itself by the strong set order is meaningful. The equivalence also holds for the empty set, since both conditions are vacuous there.
Preamble
import Mathlib import Definitions.Def_Supermodularity_Lattices_InducedSetOrder
Formal statement
namespace MonotoneCompStatics.Monotonicity
theorem strong_set_order_reflexive {X : Type*} [Lattice X] (S : Set X) :
Supermodularity.Lattices.InducedSetOrder S S ↔ IsSublattice S := by sorry
end MonotoneCompStatics.Monotonicity
Source
Milgrom and Shannon, Monotone Comparative Statics, Econometrica 62 (1994), p. 159 (PDF 4), remark on reflexivity of the strong set order
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.