This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 public import Stafford38.MathlibCompat.MvPolynomialCoeff 3 public import Stafford38.Characteristic.CanonicalNormalAxisSupport 4 public import Stafford38.Weyl.PBWMonicBridge 5 public import Mathlib.RingTheory.MvPolynomial.Homogeneous 6 7 @[expose] public section 8 9 namespace Stafford38.Characteristic.NormalSymbolPolynomial 10 11 open Stafford38.Characteristic 12 open Stafford38.WeylIteratedEquivalence 13 open Stafford38.WeylLeadingSymbol 14 open Stafford38.WeylFiltration 15 open Stafford38.WeylPBWMonicBridge 16 open Stafford38.CharacteristicInitialIdeal 17 open Stafford38.Geometry.ConormalAxisContradiction 18 19 noncomputable section 20 set_option maxHeartbeats 4000000 21 set_option backward.isDefEq.respectTransparency.types false 22 variable {k : Type*} [Field k] 23 24 def normalVariableEquiv (n : ℕ) : 25 Option {v : PhaseVar (n + 1) // v ≠ Sum.inr (0 : Fin (n + 1))} ≃ PhaseVar (n + 1) := 26 Equiv.optionSubtypeNe (Sum.inr (0 : Fin (n + 1))) 27 28 def normalSymbolAlgEquiv (n : ℕ) : 29 SymbolRing k (n + 1) ≃ₐ[k] 30 Polynomial (MvPolynomial 31 {v : PhaseVar (n + 1) // v ≠ Sum.inr (0 : Fin (n + 1))} k) := 32 (MvPolynomial.renameEquiv k (normalVariableEquiv n).symm).trans 33 (MvPolynomial.optionEquivLeft k 34 {v : PhaseVar (n + 1) // v ≠ Sum.inr (0 : Fin (n + 1))}) 35 36 def canonicalNormalPolynomial {n N : ℕ} (d : PresentedWeyl k (n + 1)) : 37 Polynomial (MvPolynomial 38 {v : PhaseVar (n + 1) // v ≠ Sum.inr (0 : Fin (n + 1))} k) := 39 normalSymbolAlgEquiv (k := k) n 40 (presentedPrincipalComponent k (@orderWeight (n + 1)) N d) 41 42 theorem normalSymbolAlgEquiv_normalVariable (n : ℕ) : 43 normalSymbolAlgEquiv (k := k) n 44 (MvPolynomial.X (.inr (0 : Fin (n + 1)))) = Polynomial.X := by 45 simp [normalSymbolAlgEquiv, normalVariableEquiv] 46 47 theorem normalSymbolAlgEquiv_otherVariable (n : ℕ) 48 (v : PhaseVar (n + 1)) (hv : v ≠ .inr (0 : Fin (n + 1))) : 49 normalSymbolAlgEquiv (k := k) n (MvPolynomial.X v) = 50 Polynomial.C (MvPolynomial.X ⟨v, hv⟩) := by 51 simp [normalSymbolAlgEquiv, normalVariableEquiv, hv] 52 53 theorem optionEquivLeft_monic_of_isHomogeneous 54 {S : Type*} [Finite S] (P : MvPolynomial (Option S) k) (N : ℕ) 55 (hP : P.IsHomogeneous N) 56 (hlead : MvPolynomial.coeff (Finsupp.single none N) P = 1) : 57 (MvPolynomial.optionEquivLeft k S P).Monic := by 58 classical 59 apply Polynomial.monic_of_natDegree_le_of_coeff_eq_one N 60 · rw [MvPolynomial.natDegree_optionEquivLeft] 61 exact (MvPolynomial.degreeOf_le_totalDegree P none).trans hP.totalDegree_le 62 · ext m 63 rw [MvPolynomial.optionEquivLeft_coeff_coeff] 64 by_cases hm : m = 0 65 · subst m 66 simpa using hlead 67 · have hzero : MvPolynomial.coeff (m.optionElim N) P = 0 := by 68 by_contra hcoeff 69 have hcoeffHomogeneous : 70 ((MvPolynomial.optionEquivLeft k S P).coeff N).IsHomogeneous 0 := by 71 intro e he 72 rw [MvPolynomial.optionEquivLeft_coeff_coeff] at he 73 have hdegree := hP he 74 have hzero : (Finsupp.weight (1 : S → ℕ)) e = 0 := by 75 by_contra hne 76 have hpos : 0 < (Finsupp.weight (1 : S → ℕ)) e := Nat.pos_of_ne_zero hne 77 have hall : N + (Finsupp.weight (1 : S → ℕ)) e = N := by 78 rw [Finsupp.weight_apply, Finsupp.sum_option_index_smul] at hdegree 79 simpa [Finsupp.weight_apply] using hdegree 80 omega 81 exact hzero 82 have hcoeff' : MvPolynomial.coeff m 83 ((MvPolynomial.optionEquivLeft k S P).coeff N) ≠ 0 := by 84 change AddMonoidAlgebra.coeff 85 ((MvPolynomial.optionEquivLeft k S P).coeff N) m ≠ 0 86 rw [MvPolynomial.optionEquivLeft_coeff_coeff] 87 exact hcoeff 88 have hdegree := hcoeffHomogeneous hcoeff' 89 rw [Finsupp.weight_apply] at hdegree 90 apply hm 91 ext x 92 by_cases hx : x ∈ m.support 93 · simpa using (Finset.sum_eq_zero_iff_of_nonneg 94 (fun _ _ ↦ Nat.zero_le _)).mp hdegree x hx 95 · exact Finsupp.notMem_support_iff.mp hx 96 have hzero' : AddMonoidAlgebra.coeff P (m.optionElim N) = 0 := by 97 change MvPolynomial.coeff (m.optionElim N) P = 0 98 exact hzero 99 change AddMonoidAlgebra.coeff P (m.optionElim N) = 100 AddMonoidAlgebra.coeff (1 : MvPolynomial S k) m 101 rw [hzero', MvPolynomial.coeff_one] 102 simp [Ne.symm hm] 103 104 theorem canonicalNormalPolynomial_monic {n N : ℕ} 105 {d : PresentedWeyl k (n + 1)} 106 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) : 107 (canonicalNormalPolynomial (k := k) (n := n) (N := N) d).Monic := by 108 apply optionEquivLeft_monic_of_isHomogeneous 109 · exact (canonical_orderPrincipalComponent_isHomogeneous n N hd).rename_isHomogeneous 110 · change AddMonoidAlgebra.coeff 111 (MvPolynomial.rename (normalVariableEquiv n).symm 112 (presentedPrincipalComponent k orderWeight N d)) 113 (Finsupp.single none N) = 1 114 have hsingle : (Finsupp.single (.inr (0 : Fin (n + 1))) N).mapDomain 115 (normalVariableEquiv n).symm = Finsupp.single none N := by 116 simp [normalVariableEquiv] 117 rw [← hsingle, MvPolynomial.coeff_rename_mapDomain 118 (normalVariableEquiv n).symm (normalVariableEquiv n).symm.injective] 119 have hlead : AddMonoidAlgebra.coeff 120 (presentedPrincipalComponent k orderWeight N d) 121 (Finsupp.single (.inr (0 : Fin (n + 1))) N) = 1 := by 122 change MvPolynomial.coeff 123 (Finsupp.single (.inr (0 : Fin (n + 1))) N) 124 (presentedPrincipalComponent k orderWeight N d) = 1 125 exact canonical_orderPrincipalComponent_pureMomentumCoefficient k n N hd 126 exact hlead 127 128 #print axioms normalSymbolAlgEquiv_normalVariable 129 #print axioms normalSymbolAlgEquiv_otherVariable 130 #print axioms optionEquivLeft_monic_of_isHomogeneous 131 #print axioms canonicalNormalPolynomial_monic 132 133 end 134 end Stafford38.Characteristic.NormalSymbolPolynomial 135