IndexedLOrder.isColorful
defimported Lean
(σ, C) is colorful under coloring c : T → I: it is a dominant cell and the coloring c maps σ bijectively onto C (i.e., σ.image c = C). A colorful room is the central object of Scarf's lemma: its existence is guaranteed for every coloring c.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open IndexedLOrder 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 variable [DecidableEq T] [DecidableEq I] in open Classical in variable (c : T → I) (σ : Finset T) (C : Finset I) in noncomputable def IndexedLOrder.isColorful : Prop
- Defined in
- EconCSLib, `IndexedLOrder.isColorful`
- 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.isColorful← IndexedLOrder.isColorful (EconCSLib/Math/FixedPoint/Scarf.lean:1237): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- IndexedLOrder.isCellAlias for
isDominant σ C: the cell predicate for the pair(σ, C). - IndexedLOrderA family of linear orders on
Tindexed byI. Eachi : Iprovides a linear orderIST i : LinearOrder Ton the typeT. This is the… - instFunLikeIndexedLOrderLinearOrderinstFunLikeIndexedLOrderLinearOrder
- IndexedLOrder.isCellAlias for
- Used by 3
- IndexedLOrder.not_colorful_of_TypedNCIndexedLOrder.not_colorful_of_TypedNC
- IndexedLOrder.NC_or_C_of_doorIndexedLOrder.NC_or_C_of_door
- IndexedLOrder.NC_of_NCdoorIndexedLOrder.NC_of_NCdoor
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open IndexedLOrder 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 variable [DecidableEq T] [DecidableEq I] in open Classical in variable (c : T → I) (σ : Finset T) (C : Finset I) in /-- `(σ, C)` is **colorful** under coloring `c : T → I`: it is a dominant cell and the coloring `c` maps `σ` **bijectively** onto `C` (i.e., `σ.image c = C`). A colorful room is the central object of Scarf's lemma: its existence is guaranteed for every coloring `c`. -/ noncomputable def IndexedLOrder.isColorful : Prop := IST.isCell σ C ∧ σ.image c = C