IndexedLOrder.isDominant
defimported Lean
σ is dominant with respect to C: for every y : T there exists i ∈ C such that every element of σ is ≥[i] y — i.e., σ contains, in the order at i, a minimum that dominates y. This is the key structural invariant of Scarf's lemma. It generalises the notion that a simplex vertex set "covers" a given point in its convex hull.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Classical in variable {T : Type*} [Inhabited T] in variable {I : Type*} in variable [IST : IndexedLOrder I T] in set_option quotPrecheck false in variable (σ : Finset T) (C : Finset I) in def IndexedLOrder.isDominant
- Defined in
- EconCSLib, `IndexedLOrder.isDominant`
- Lean proof
- By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.IndexedLOrder.isDominant← IndexedLOrder.isDominant (EconCSLib/Math/FixedPoint/Scarf.lean:179): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- IndexedLOrderA family of linear orders on
Tindexed byI. Eachi : Iprovides a linear orderIST i : LinearOrder Ton the typeT. This is the… - instFunLikeIndexedLOrderLinearOrderinstFunLikeIndexedLOrderLinearOrder
- IndexedLOrderA family of linear orders on
- Used by 7
- IndexedLOrder.empty_DominantIndexedLOrder.empty_Dominant
- IndexedLOrder.Nonempty_of_DominantIndexedLOrder.Nonempty_of_Dominant
- IndexedLOrder.NC_of_outsidedoorIndexedLOrder.NC_of_outsidedoor
- IndexedLOrder.Dominant_of_subsetIndexedLOrder.Dominant_of_subset
- IndexedLOrder.Dominant_of_supsetIndexedLOrder.Dominant_of_supset
- IndexedLOrder.outsidedoor_singletonIndexedLOrder.outsidedoor_singleton
- IndexedLOrder.isCellAlias for
isDominant σ C: the cell predicate for the pair(σ, C).
Lean source view module on GitHub
set_option quotPrecheck false set_option hygiene false local notation lhs "<[" i "]" rhs => (IST i).lt lhs rhs local notation lhs "≤[" i "]" rhs => (IST i).le lhs rhs set_option hygiene true set_option autoImplicit true in set_option relaxedAutoImplicit true in open Classical in variable {T : Type*} [Inhabited T] in variable {I : Type*} in variable [IST : IndexedLOrder I T] in set_option quotPrecheck false in variable (σ : Finset T) (C : Finset I) in /-- `σ` is **dominant** with respect to `C`: for every `y : T` there exists `i ∈ C` such that every element of `σ` is ≥[i] y — i.e., `σ` contains, in the order at `i`, a minimum that dominates `y`. This is the key structural invariant of Scarf's lemma. It generalises the notion that a simplex vertex set "covers" a given point in its convex hull. -/ def IndexedLOrder.isDominant := ∀ y, ∃ i ∈ C, ∀ x ∈ σ, y ≤[i] x