This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 public import Stafford38.Characteristic.AssociatedGradedModule 3 public import Stafford38.Characteristic.CanonicalAxisAvoidanceConsumer 4 public import Stafford38.Weyl.QuotientTransport 5 6 @[expose] public section 7 8 /-! 9 # Coordinate-cancellation criteria on the associated graded 10 11 For the canonical filtered Weyl quotient, this file identifies 12 `CoordinateCancellation` with injectivity of the distinguished coordinate on 13 every actual order-associated-graded piece. It also proves a sufficient 14 initial-ideal saturation criterion. The unconditional support exclusion used 15 by `FoundationClosure` is proved by 16 `CanonicalKoszulContradiction.canonical_support_avoidance`. 17 -/ 18 19 namespace Stafford38.CanonicalNoncharacteristicCancellation 20 21 open Stafford38.CanonicalAxisAvoidanceConsumer 22 open Stafford38.Characteristic 23 open Stafford38.CharacteristicAssociatedGradedModule 24 open Stafford38.CharacteristicFilteredQuotient 25 open Stafford38.CharacteristicFilteredQuotientGraded 26 open Stafford38.CharacteristicInitialIdeal 27 open Stafford38.CharacteristicInitialIdealHomogeneous 28 open Stafford38.EulerSurjectivity 29 open Stafford38.WeylAssociatedGraded 30 open Stafford38.WeylFiltration 31 open Stafford38.WeylIteratedEquivalence 32 open Stafford38.WeylLeadingSymbol 33 open Stafford38.WeylEulerResidue 34 open Stafford38.WeylPBWMonicBridge 35 open Stafford38.WeylQuotientTransport 36 37 noncomputable section 38 39 universe u 40 41 variable (k : Type u) [Field k] [Algebra ℚ k] 42 43 /-- The distinguished coordinate, regarded as a homogeneous order-zero 44 symbol. -/ 45 def coordinateOrderSymbol (n : ℕ) : 46 MvPolynomial.weightedHomogeneousSubmodule k 47 (@orderWeight (n + 1)) 0 := 48 principalComponentOnPiece k (@orderWeight (n + 1)) 0 49 ⟨presentedCoordinate k n, 50 presentedCoordinate_mem_orderPiece_zero k n⟩ 51 52 /-- Multiplication by the distinguished coordinate on the actual degree-`m` 53 associated-graded piece of the canonical filtered quotient. -/ 54 def canonicalGradedCoordinateAction (n N m : ℕ) 55 (d : PresentedWeyl k (n + 1)) : 56 QuotientOrderGradedPiece k (presentedCanonicalRightIdeal (k := k) n N d) m →ₗ[k] 57 QuotientOrderGradedPiece k (presentedCanonicalRightIdeal (k := k) n N d) m := by 58 simpa using 59 (quotientOrderHomogeneousAction (N := m) (M := 0) 60 k (presentedCanonicalRightIdeal (k := k) n N d) (coordinateOrderSymbol k n)) 61 62 @[simp] theorem canonicalGradedCoordinateAction_mk 63 (n N m : ℕ) (d : PresentedWeyl k (n + 1)) 64 (z : orderPiece k (n + 1) m) : 65 canonicalGradedCoordinateAction k n N m d 66 (orderPieceToQuotientGraded k (presentedCanonicalRightIdeal (k := k) n N d) m z) = 67 orderPieceToQuotientGraded k (presentedCanonicalRightIdeal (k := k) n N d) m 68 ⟨(z : PresentedWeyl k (n + 1)) * presentedCoordinate k n, 69 mul_mem_orderPiece k z.property 70 (presentedCoordinate_mem_orderPiece_zero k n)⟩ := by 71 change quotientOrderHomogeneousAction k (presentedCanonicalRightIdeal (k := k) n N d) 72 (coordinateOrderSymbol k n) 73 (orderPieceToQuotientGraded k (presentedCanonicalRightIdeal (k := k) n N d) m z) = _ 74 simpa [coordinateOrderSymbol] using 75 quotientOrderHomogeneousAction_mk_mul k (presentedCanonicalRightIdeal (k := k) n N d) z 76 ⟨presentedCoordinate k n, 77 presentedCoordinate_mem_orderPiece_zero k n⟩ 78 79 /-- Degreewise coordinate cancellation is exactly injectivity of coordinate 80 multiplication on every actual associated-graded quotient piece. Thus the 81 previously conditional consumer's hypothesis is the strictness part of the 82 noncharacteristic inverse-image theorem, expressed without any geometric 83 terminology. -/ 84 theorem coordinateCancellation_iff_forall_graded_injective 85 (n N : ℕ) (d : PresentedWeyl k (n + 1)) : 86 CoordinateCancellation k n N d ↔ 87 ∀ m, Function.Injective 88 (canonicalGradedCoordinateAction k n N m d) := by 89 let I := presentedCanonicalRightIdeal (k := k) n N d 90 let x := presentedCoordinate k n 91 constructor 92 · intro hcancel m 93 rw [← LinearMap.ker_eq_bot] 94 apply le_antisymm 95 · intro q hq 96 obtain ⟨z, rfl⟩ := 97 orderPieceToQuotientGraded_surjective k I m q 98 rw [LinearMap.mem_ker] at hq 99 have hproduct : 100 (z : PresentedWeyl k (n + 1)) * x ∈ 101 rightIdealKSubmodule k I ⊔ 102 presentedStrictLowerPiece k orderWeight m := by 103 have hproductKer : 104 ⟨(z : PresentedWeyl k (n + 1)) * x, 105 mul_mem_orderPiece k z.property 106 (presentedCoordinate_mem_orderPiece_zero k n)⟩ ∈ 107 LinearMap.ker (orderPieceToQuotientGraded k I m) := by 108 rw [LinearMap.mem_ker] 109 simpa [I, x] using hq 110 rw [ker_orderPieceToQuotientGraded] at hproductKer 111 exact hproductKer 112 have hz := hcancel m z z.property hproduct 113 rw [Submodule.mem_bot] 114 rw [← LinearMap.mem_ker, ker_orderPieceToQuotientGraded] 115 change (z : PresentedWeyl k (n + 1)) ∈ 116 rightIdealKSubmodule k I ⊔ 117 presentedStrictLowerPiece k orderWeight m 118 exact hz 119 · exact bot_le 120 · intro hinjective m z hz hzx 121 let zz : orderPiece k (n + 1) m := ⟨z, hz⟩ 122 have hproductZero : 123 orderPieceToQuotientGraded k (presentedCanonicalRightIdeal (k := k) n N d) m 124 ⟨z * presentedCoordinate k n, 125 mul_mem_orderPiece k hz 126 (presentedCoordinate_mem_orderPiece_zero k n)⟩ = 0 := by 127 rw [← LinearMap.mem_ker, ker_orderPieceToQuotientGraded] 128 exact hzx 129 have hzero : 130 orderPieceToQuotientGraded k (presentedCanonicalRightIdeal (k := k) n N d) m zz = 0 := by 131 apply hinjective m 132 rw [map_zero, canonicalGradedCoordinateAction_mk] 133 exact hproductZero 134 change z ∈ rightIdealKSubmodule k (presentedCanonicalRightIdeal (k := k) n N d) ⊔ 135 presentedStrictLowerPiece k orderWeight m 136 have hzker : zz ∈ LinearMap.ker 137 (orderPieceToQuotientGraded k (presentedCanonicalRightIdeal (k := k) n N d) m) := by 138 rw [LinearMap.mem_ker] 139 exact hzero 140 rw [ker_orderPieceToQuotientGraded] at hzker 141 exact hzker 142 143 /-- Saturation of the concrete order initial ideal by the coordinate implies 144 the exact degreewise cancellation needed by the canonical consumer. This is 145 a sufficient commutative-algebra formulation of strictness; it is not assumed 146 to follow from monicity in this file. -/ 147 theorem coordinateCancellation_of_initialIdeal_coordinate_saturated 148 (n N : ℕ) (d : PresentedWeyl k (n + 1)) 149 (hsaturated : 150 (orderInitialIdeal k (presentedCanonicalRightIdeal (k := k) n N d)).colon 151 ({MvPolynomial.X (Sum.inl (0 : Fin (n + 1)))} : 152 Set (SymbolRing k (n + 1))) = 153 orderInitialIdeal k (presentedCanonicalRightIdeal (k := k) n N d)) : 154 CoordinateCancellation k n N d := by 155 rw [coordinateCancellation_iff_forall_graded_injective] 156 intro m 157 let I := presentedCanonicalRightIdeal (k := k) n N d 158 let X := coordinateOrderSymbol k n 159 have hX : (X : SymbolRing k (n + 1)) = 160 MvPolynomial.X (.inl (0 : Fin (n + 1))) := 161 coe_coordinate_order_symbol k n 162 have hsymbol : Function.Injective 163 (homogeneousSymbolAction (N := m) (M := 0) k I X) := by 164 rw [← LinearMap.ker_eq_bot] 165 apply le_antisymm 166 · intro q hq 167 rw [LinearMap.mem_ker] at hq 168 rw [Submodule.mem_bot] 169 refine Submodule.Quotient.induction_on _ q ?_ hq 170 intro P hP 171 rw [homogeneousSymbolAction_mk, 172 Submodule.Quotient.mk_eq_zero] at hP 173 have hPX : (P : SymbolRing k (n + 1)) * 174 MvPolynomial.X (.inl (0 : Fin (n + 1))) ∈ 175 orderInitialIdeal k I := by 176 rw [← hX] 177 exact (mem_orderSymbolRelation_iff_coe_mem_orderInitialIdeal 178 k I m (homogeneousRightMul k X P)).mp hP 179 have hPcolon : (P : SymbolRing k (n + 1)) ∈ 180 (orderInitialIdeal k I).colon 181 ({MvPolynomial.X (Sum.inl (0 : Fin (n + 1)))} : 182 Set (SymbolRing k (n + 1))) := 183 Submodule.mem_colon_singleton.mpr hPX 184 have hPJ : (P : SymbolRing k (n + 1)) ∈ orderInitialIdeal k I := by 185 rw [hsaturated] at hPcolon 186 exact hPcolon 187 rw [Submodule.Quotient.mk_eq_zero] 188 exact (mem_orderSymbolRelation_iff_coe_mem_orderInitialIdeal 189 k I m P).mpr hPJ 190 · exact bot_le 191 intro q₁ q₂ hq 192 apply (quotientOrderGradedPieceEquivSymbols k I m).injective 193 apply hsymbol 194 rw [← quotientOrderHomogeneousAction_compatibility, 195 ← quotientOrderHomogeneousAction_compatibility] 196 exact congrArg (quotientOrderGradedPieceEquivSymbols k I m) hq 197 198 /-- A saturated canonical initial ideal therefore satisfies the already 199 formalized scheme-level coordinate-axis avoidance conclusion. -/ 200 theorem canonical_support_disjoint_coordinate_zeroLocus_of_saturated 201 (n N : ℕ) {d : PresentedWeyl k (n + 1)} 202 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 203 (hsaturated : 204 (orderInitialIdeal k (presentedCanonicalRightIdeal (k := k) n N d)).colon 205 ({MvPolynomial.X (Sum.inl (0 : Fin (n + 1)))} : 206 Set (SymbolRing k (n + 1))) = 207 orderInitialIdeal k (presentedCanonicalRightIdeal (k := k) n N d)) : 208 Disjoint 209 (orderCharacteristicSupport k (presentedCanonicalRightIdeal (k := k) n N d)) 210 (PrimeSpectrum.zeroLocus 211 ({MvPolynomial.X (.inl (0 : Fin (n + 1)))} : 212 Set (SymbolRing k (n + 1)))) := by 213 exact canonical_orderCharacteristicSupport_disjoint_coordinate_zeroLocus 214 k n N hd 215 (coordinateCancellation_of_initialIdeal_coordinate_saturated 216 k n N d hsaturated) 217 218 #print axioms coordinateOrderSymbol 219 #print axioms canonicalGradedCoordinateAction 220 #print axioms canonicalGradedCoordinateAction_mk 221 #print axioms coordinateCancellation_iff_forall_graded_injective 222 #print axioms coordinateCancellation_of_initialIdeal_coordinate_saturated 223 #print axioms canonical_support_disjoint_coordinate_zeroLocus_of_saturated 224 225 end 226 227 end Stafford38.CanonicalNoncharacteristicCancellation 228