This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 public import Stafford38.MathlibCompat.MvPolynomialCoeff 3 public import Mathlib.RingTheory.MvPolynomial.EulerIdentity 4 public import Stafford38.Characteristic.GabberGlobalAssembly 5 public import Stafford38.Characteristic.CanonicalNormalAxisSupport 6 7 @[expose] public section 8 9 namespace Stafford38.Characteristic.NoncharacteristicMinimalPrime 10 11 open Stafford38 12 open Stafford38.Characteristic 13 open Stafford38.CharacteristicAssociatedGradedModule 14 open Stafford38.Characteristic.CanonicalNormalAxisSupport 15 open Stafford38.Characteristic.GabberGlobalAssembly 16 open Stafford38.Characteristic.PostScalarExtensionPoisson 17 open Stafford38.CharacteristicInitialIdeal 18 open Stafford38.WeylEulerResidue 19 open Stafford38.WeylIteratedEquivalence 20 open Stafford38.WeylLeadingSymbol 21 open Stafford38.WeylFiltration 22 open Stafford38.Geometry.ConormalAxisContradiction 23 open Stafford38.WeylPBWMonicBridge 24 25 noncomputable section 26 27 variable {k : Type*} [Field k] [CharZero k] {n N : ℕ} 28 29 private def iterPderiv (i : PhaseVar (n + 1)) (r : ℕ) 30 (f : SymbolRing k (n + 1)) : SymbolRing k (n + 1) := 31 (MvPolynomial.pderiv i)^[r] f 32 33 private theorem iterPderiv_mem_of_involutive 34 (P : Ideal (SymbolRing k (n + 1))) (hP : IsInvolutive P) 35 (j : Fin (n + 1)) (hx : MvPolynomial.X (.inl j) ∈ P) 36 (f : SymbolRing k (n + 1)) (hf : f ∈ P) : 37 ∀ r, iterPderiv (.inr j) r f ∈ P := by 38 intro r 39 induction r with 40 | zero => simpa [iterPderiv] using hf 41 | succ r ihr => 42 have hb := hP (MvPolynomial.X (.inl j)) hx 43 (iterPderiv (.inr j) r f) ihr 44 simpa [iterPderiv, Function.iterate_succ_apply', poissonBracket, 45 Pi.single_apply] using hb 46 47 private theorem iterPderiv_eq_factorial_of_homogeneous 48 (i : PhaseVar (n + 1)) (f : SymbolRing k (n + 1)) 49 (hf : f.IsHomogeneous N) 50 (hc : MvPolynomial.coeff (Finsupp.single i N) f = 1) : 51 iterPderiv i N f = MvPolynomial.C (N.factorial : k) := by 52 have hhom : ∀ r, (iterPderiv i r f).IsHomogeneous (N - r) := by 53 intro r 54 induction r with 55 | zero => simpa [iterPderiv] using hf 56 | succ r ihr => 57 simpa [iterPderiv, Function.iterate_succ_apply', Nat.sub_sub] using 58 (MvPolynomial.IsHomogeneous.pderiv ihr) 59 have hcoeff : ∀ r m, 60 MvPolynomial.coeff (Finsupp.single i m) (iterPderiv i r f) = 61 MvPolynomial.coeff (Finsupp.single i (m + r)) f * 62 ((m + r).descFactorial r : k) := by 63 intro r 64 induction r with 65 | zero => intro m; simp [iterPderiv] 66 | succ r ihr => 67 intro m 68 rw [show iterPderiv i (r + 1) f = 69 MvPolynomial.pderiv i (iterPderiv i r f) by 70 simp [iterPderiv, Function.iterate_succ_apply']] 71 simp only [MvPolynomial.coeff_pderiv] 72 have hi := ihr (m + 1) 73 simp only [Finsupp.single_add] at hi ⊢ 74 change MvPolynomial.coeff 75 (Finsupp.single i m + Finsupp.single i 1) (iterPderiv i r f) * 76 ((Finsupp.single i m) i + 1) = 77 MvPolynomial.coeff 78 (Finsupp.single i m + (Finsupp.single i r + Finsupp.single i 1)) f * 79 ↑((m + (r + 1)).descFactorial (r + 1)) 80 rw [hi] 81 have harg : 82 ((Finsupp.single i m + Finsupp.single i 1) + Finsupp.single i r) = 83 Finsupp.single i (m + (r + 1)) := by 84 ext q 85 by_cases hq : q = i <;> simp [hq] <;> omega 86 rw [harg] 87 rw [show m + (r + 1) = m + 1 + r by omega, 88 Nat.descFactorial_succ] 89 have hnat : m + 1 + r - r = m + 1 := by omega 90 rw [hnat] 91 simp [Nat.add_assoc, Nat.cast_mul] 92 have hcarg : 93 Finsupp.single i m + (Finsupp.single i 1 + Finsupp.single i r) = 94 Finsupp.single i m + (Finsupp.single i r + Finsupp.single i 1) := by 95 ext q 96 by_cases hq : q = i <;> simp [hq] <;> omega 97 rw [hcarg] 98 ring 99 have hzero : iterPderiv i N f = 100 MvPolynomial.C (MvPolynomial.coeff (0 : PhaseVar (n + 1) →₀ ℕ) 101 (iterPderiv i N f)) := by 102 calc 103 iterPderiv i N f = MvPolynomial.homogeneousComponent 0 104 (iterPderiv i N f) := by 105 simpa only [Nat.sub_self] using 106 (MvPolynomial.homogeneousComponent_eq_self (hhom N)).symm 107 _ = _ := MvPolynomial.homogeneousComponent_zero _ 108 rw [hzero] 109 have hzeroCoeff : 110 MvPolynomial.coeff (0 : PhaseVar (n + 1) →₀ ℕ) (iterPderiv i N f) = 111 MvPolynomial.coeff (Finsupp.single i 0) (iterPderiv i N f) := by 112 congr 1 113 ext q 114 by_cases hq : q = i <;> simp [hq] 115 rw [hzeroCoeff, hcoeff N 0] 116 simp [Nat.zero_add, Nat.descFactorial_self, hc] 117 118 /-- The bracket argument: an involutive prime `P` containing the order symbol 119 of a `ξ₁`-monic `d` of degree `N` omits `x₁`, since otherwise the `N`-th bracket 120 `{x₁, …{x₁, σ(d)}}` is the constant `N! ≠ 0` and lies in `P`. -/ 121 theorem normalCoordinate_not_mem_of_isInvolutive 122 (d : PresentedWeyl k (n + 1)) 123 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 124 (P : Ideal (SymbolRing k (n + 1))) [P.IsPrime] (hInv : IsInvolutive P) 125 (hf : presentedPrincipalComponent k orderWeight N d ∈ P) : 126 MvPolynomial.X (.inl (0 : Fin (n + 1))) ∉ P := by 127 intro hx 128 let f := presentedPrincipalComponent k orderWeight N d 129 have hderiv := iterPderiv_mem_of_involutive P hInv 130 (0 : Fin (n + 1)) hx f hf N 131 have hfac : MvPolynomial.C (N.factorial : k) ∈ P := by 132 rw [← iterPderiv_eq_factorial_of_homogeneous 133 (.inr (0 : Fin (n + 1))) f 134 (canonical_orderPrincipalComponent_isHomogeneous n N hd) 135 (canonical_orderPrincipalComponent_pureMomentumCoefficient k n N hd)] 136 exact hderiv 137 have hfac0 : (N.factorial : k) ≠ 0 := by 138 exact_mod_cast (Nat.factorial_ne_zero N) 139 have hone : (1 : SymbolRing k (n + 1)) ∈ P := by 140 have hm := P.mul_mem_left (MvPolynomial.C ((N.factorial : k)⁻¹)) hfac 141 rw [← MvPolynomial.C_mul, inv_mul_cancel₀ hfac0] at hm 142 simpa using hm 143 exact (inferInstance : P.IsPrime).ne_top ((Ideal.eq_top_iff_one P).mpr hone) 144 145 theorem canonical_minimalPrime_mem_of_normalCoordinate_false 146 (d : PresentedWeyl k (n + 1)) 147 (hN : 0 < N) (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 148 {P : Ideal (SymbolRing k (n + 1))} (hP : P ∈ 149 (Module.annihilator (SymbolRing k (n + 1)) 150 (OrderAssociatedGradedModule k 151 (canonicalRightIdeal (presentedCoordinate k n) d N))).minimalPrimes) : 152 MvPolynomial.X (.inl (0 : Fin (n + 1))) ∉ P := by 153 have hPorder : P ∈ (orderInitialIdeal k 154 (canonicalRightIdeal (presentedCoordinate k n) d N)).minimalPrimes := by 155 simpa [annihilator_orderAssociatedGradedModule] using hP 156 letI : P.IsPrime := hP.1.1 157 exact normalCoordinate_not_mem_of_isInvolutive d hd P 158 (minimalPrime_isInvolutive k (canonicalRightIdeal (presentedCoordinate k n) d N) P hP) 159 (hPorder.1.2 (canonical_orderPrincipalComponent_mem_initialIdeal k n N hd)) 160 161 end 162 end Stafford38.Characteristic.NoncharacteristicMinimalPrime 163