Download data/lean/OAI/Combinatorics/Chromatic/Model.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.03 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/Chromatic/Model.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/Chromatic/Model.lean
-
curl -L -o Model.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/Chromatic/Model.lean
2.03 kB
| import Mathlib | |
| namespace OAI | |
| namespace ElementaryPositivity | |
| structure NaturalUnitIntervalGraph (n : β) where | |
| h : Fin n β Fin n | |
| increasing : Monotone h | |
| extensive : β i, i β€ h i | |
| namespace NaturalUnitIntervalGraph | |
| variable {n : β} (G : NaturalUnitIntervalGraph n) | |
| def Edge (i j : Fin n) : Prop := | |
| (i < j β§ j β€ G.h i) β¨ (j < i β§ i β€ G.h j) | |
| instance (i j : Fin n) : Decidable (G.Edge i j) := | |
| inferInstanceAs (Decidable ((_ β§ _) β¨ (_ β§ _))) | |
| def Nondescent (Ο : Equiv.Perm (Fin n)) : Prop := | |
| β i j : Fin n, i.val + 1 = j.val β Ο j < Ο i β G.Edge (Ο i) (Ο j) | |
| instance (Ο : Equiv.Perm (Fin n)) : Decidable (G.Nondescent Ο) := | |
| inferInstanceAs (Decidable (β i j : Fin n, | |
| i.val + 1 = j.val β Ο j < Ο i β G.Edge (Ο i) (Ο j))) | |
| def graphInversions (Ο : Equiv.Perm (Fin n)) : β := | |
| (Finset.univ.filter fun ij : Fin n Γ Fin n => | |
| ij.1 < ij.2 β§ Ο ij.2 < Ο ij.1 β§ G.Edge (Ο ij.1) (Ο ij.2)).card | |
| def Proper {r : β} (f : Fin n β Fin r) : Prop := | |
| β i j : Fin n, G.Edge i j β f i β f j | |
| instance {r : β} (f : Fin n β Fin r) : Decidable (G.Proper f) := | |
| inferInstanceAs (Decidable (β i j : Fin n, G.Edge i j β f i β f j)) | |
| def coloringAscents {r : β} (f : Fin n β Fin r) : β := | |
| (Finset.univ.filter fun ij : Fin n Γ Fin n => | |
| ij.1 < ij.2 β§ G.Edge ij.1 ij.2 β§ f ij.1 < f ij.2).card | |
| noncomputable def chromatic (r : β) : MvPolynomial (Fin r) (Polynomial β) := | |
| β f β Finset.univ.filter (G.Proper (r := r)), | |
| MvPolynomial.C (Polynomial.X ^ G.coloringAscents f) * | |
| β i : Fin n, MvPolynomial.X (f i) | |
| structure PermutationWitness where | |
| theta : {Ο : Equiv.Perm (Fin n) // G.Nondescent Ο} β Nat.Partition n | |
| expansion : β r : β, G.chromatic r = | |
| β Ο : {Ο : Equiv.Perm (Fin n) // G.Nondescent Ο}, | |
| MvPolynomial.C (Polynomial.X ^ G.graphInversions Ο.val) * | |
| MvPolynomial.esymmPart (Fin r) (Polynomial β) (theta Ο) | |
| end NaturalUnitIntervalGraph | |
| end ElementaryPositivity | |
| end OAI | |