Download data/lean/OAI/Combinatorics/Chromatic/Shuffle/CrossDifference.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6.53 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/Chromatic/Shuffle/CrossDifference.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/Chromatic/Shuffle/CrossDifference.lean
-
curl -L -o CrossDifference.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/Chromatic/Shuffle/CrossDifference.lean
6.53 kB
| import Mathlib | |
| import OAI.Combinatorics.Chromatic.Shuffle.QuotientAlg | |
| namespace OAI | |
| section | |
| namespace ElementaryPositivity.RawShuffle | |
| open MvPolynomial | |
| open ElementaryPositivity.ShufflePolynomiality ElementaryPositivity.SeparatedSymmetry | |
| open ElementaryPositivity.CommonTranslation | |
| open scoped TensorProduct | |
| variable {I : Type*} [Fintype I] [DecidableEq I] | |
| noncomputable def crossDifference (d e : I β β) : | |
| MvPolynomial ((Ξ£i,Fin (d i)) β (Ξ£i,Fin (e i))) β := | |
| β i, β x : Fin (d i), β y : Fin (e i), | |
| (X (Sum.inl β¨i,xβ©) - X (Sum.inr β¨i,yβ©)) | |
| lemma prod_sub_perm {Ξ± Ξ² R : Type*} [Fintype Ξ±] [Fintype Ξ²] [CommRing R] | |
| (Ο : Equiv.Perm Ξ±) (Ο : Equiv.Perm Ξ²) (l : Ξ± β R) (r : Ξ² β R) : | |
| (β x : Ξ±, (β y : Ξ², (l (Ο x) - r (Ο y)))) = β x : Ξ±, (β y : Ξ², (l x - r y)) := by | |
| calc | |
| _ = β x : Ξ±, (β y : Ξ², (l (Ο x) - r y)) := by | |
| apply Finset.prod_congr rfl | |
| intro x hx | |
| exact Equiv.prod_comp Ο (fun y => l (Ο x) - r y) | |
| _ = _ := Equiv.prod_comp Ο (fun x => β y : Ξ², (l x - r y)) | |
| omit [DecidableEq I] in | |
| lemma rename_crossDifference (d e : I β β) | |
| (h : ((Ξ£i,Fin (d i)) β (Ξ£i,Fin (e i))) β ((Ξ£i,Fin (d i)) β (Ξ£i,Fin (e i)))) : | |
| rename h (crossDifference d e) = | |
| β i,β x : Fin (d i),β y : Fin (e i), (X (h (Sum.inl β¨i,xβ©))-X (h (Sum.inr β¨i,yβ©))) := by | |
| simp only [crossDifference,map_prod,map_sub,rename_X] | |
| omit [DecidableEq I] in | |
| lemma crossDifference_symmetric (d e : I β β) (Ο : (β i,Equiv.Perm (Fin (d i))) Γ | |
| (β i,Equiv.Perm (Fin (e i)))) : | |
| rename (sumAction (packAction (fun i=>Fin (d i))) (packAction (fun i=>Fin (e i))) Ο) | |
| (crossDifference d e) = crossDifference d e := by | |
| refine (rename_crossDifference d e _).trans ?_ | |
| exact Finset.prod_congr rfl (fun i hi => | |
| prod_sub_perm (R := MvPolynomial ((Ξ£i,Fin (d i)) β (Ξ£i,Fin (e i))) β) | |
| (Ο.1 i) (Ο.2 i) (fun x => X (Sum.inl β¨i,xβ©)) (fun y => X (Sum.inr β¨i,yβ©))) | |
| noncomputable def crossTensor (d e : I β β) : S d β[β] S e := | |
| separateTensor d e (crossDifference d e) | |
| @[simp] lemma tensorValue_crossTensor (d e : I β β) : | |
| tensorValue d e (crossTensor d e) = crossDifference d e := | |
| tensorValue_separateTensor d e _ (crossDifference_symmetric d e) | |
| noncomputable def relativeRaw (d e : I β β) : | |
| MvPolynomial ((Ξ£i,Fin (d i)) β (Ξ£i,Fin (e i))) β ββ[β] | |
| Polynomial (MvPolynomial ((Ξ£i,Fin (d i)) β (Ξ£i,Fin (e i))) β) := | |
| aeval (Sum.elim (fun x => Polynomial.C (X (Sum.inl x)) + Polynomial.X) | |
| (fun y => Polynomial.C (X (Sum.inr y)))) | |
| omit [Fintype I] [DecidableEq I] in | |
| lemma relativeRaw_left (d e : I β β) (f : MvPolynomial (Ξ£i,Fin (d i)) β) : | |
| relativeRaw d e (rename Sum.inl f) = | |
| Polynomial.map (rename (R:=β) Sum.inl).toRingHom (taylor f) := by | |
| induction f using MvPolynomial.induction_on with | |
| | C r => simp [relativeRaw] | |
| | add f g hf hg => simp only [map_add,Polynomial.map_add,hf,hg] | |
| | mul_X f i hf => | |
| simp only [map_mul,rename_X,taylor_X,Polynomial.map_mul,hf] | |
| congr 1 | |
| simp [relativeRaw] | |
| omit [Fintype I] [DecidableEq I] in | |
| lemma relativeRaw_right (d e : I β β) (f : MvPolynomial (Ξ£i,Fin (e i)) β) : | |
| relativeRaw d e (rename Sum.inr f) = Polynomial.C (rename Sum.inr f) := by | |
| induction f using MvPolynomial.induction_on with | |
| | C r => simp [relativeRaw] | |
| | add f g hf hg => simp only [map_add,hf,hg] | |
| | mul_X f i hf => | |
| simp only [map_mul,rename_X,hf] | |
| congr 1 | |
| simp [relativeRaw] | |
| omit [Fintype I] [DecidableEq I] in | |
| lemma map_taylorS_left (d e : I β β) (f : S d) : | |
| Polynomial.map (tensorValueAlg d e).toRingHom | |
| (Polynomial.map (Algebra.TensorProduct.includeLeft : S d ββ[β] S d β[β] S e).toRingHom | |
| (taylorS d f)) = | |
| Polynomial.map (rename (R:=β) Sum.inl).toRingHom (taylor f.val) := by | |
| rw [β map_taylorS d f,Polynomial.map_map,Polynomial.map_map] | |
| congr 1 | |
| apply RingHom.ext | |
| intro g | |
| change tensorValue d e (g ββ[β] 1) = rename Sum.inl g.val | |
| simp | |
| omit [Fintype I] [DecidableEq I] in | |
| lemma map_relativeTaylor (d e : I β β) (f : S d β[β] S e) : | |
| Polynomial.map (tensorValueAlg d e).toRingHom (relativeTaylor d e f) = | |
| relativeRaw d e (tensorValue d e f) := by | |
| induction f using TensorProduct.inductionOn with | |
| | tmul f g => | |
| rw [relativeTaylor_tmul,Polynomial.map_mul,map_taylorS_left, | |
| Polynomial.map_C,tensorValue_tmul,map_mul,relativeRaw_left,relativeRaw_right] | |
| congr 1 | |
| change Polynomial.C (tensorValue d e (1 ββ[β] g)) = _ | |
| simp | |
| | add f g hf hg => simp only [map_add,Polynomial.map_add,hf,hg] | |
| omit [DecidableEq I] in | |
| lemma relativeRaw_crossDifference (d e : I β β) : | |
| relativeRaw d e (crossDifference d e) = | |
| β i, β x : Fin (d i), β y : Fin (e i), | |
| (Polynomial.X + Polynomial.C (X (Sum.inl β¨i,xβ©) - X (Sum.inr β¨i,yβ©))) := by | |
| simp only [crossDifference,map_prod,map_sub] | |
| apply Finset.prod_congr rfl | |
| intro i hi | |
| apply Finset.prod_congr rfl | |
| intro x hx | |
| apply Finset.prod_congr rfl | |
| intro y hy | |
| simp [relativeRaw] | |
| ring | |
| omit [DecidableEq I] in | |
| lemma relativeRaw_crossDifference_monic (d e : I β β) : | |
| (relativeRaw d e (crossDifference d e)).Monic := by | |
| rw [relativeRaw_crossDifference] | |
| apply Polynomial.monic_prod_of_monic | |
| intro i hi | |
| apply Polynomial.monic_prod_of_monic | |
| intro x hx | |
| apply Polynomial.monic_prod_of_monic | |
| intro y hy | |
| exact Polynomial.monic_X_add_C _ | |
| lemma relativeTaylor_crossTensor_monic (d e : I β β) : | |
| (relativeTaylor d e (crossTensor d e)).Monic := by | |
| apply Polynomial.monic_of_injective (f := (tensorValueAlg d e).toRingHom) (tensorValue_injective d e) | |
| rw [map_relativeTaylor,tensorValue_crossTensor] | |
| exact relativeRaw_crossDifference_monic d e | |
| noncomputable def crossClearing (a : I β I β β) (ΞΌ : (I β β) β β) (d e : I β β) : | |
| Polynomial (B a ΞΌ d β[β] B a ΞΌ e) := | |
| Polynomial.map (quotientTensor a ΞΌ d e).toRingHom (relativeTaylor d e (crossTensor d e)) | |
| lemma crossClearing_monic (a : I β I β β) (ΞΌ : (I β β) β β) (d e : I β β) : | |
| (crossClearing a ΞΌ d e).Monic := | |
| (relativeTaylor_crossTensor_monic d e).map _ | |
| lemma crossClearing_cancel (a : I β I β β) (ΞΌ : (I β β) β β) (d e : I β β) | |
| (f : Polynomial (B a ΞΌ d β[β] B a ΞΌ e)) : | |
| crossClearing a ΞΌ d e * f = 0 β f = 0 := | |
| (crossClearing_monic a ΞΌ d e).mul_right_eq_zero_iff | |
| end ElementaryPositivity.RawShuffle | |
| end | |
| end OAI | |