This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 3 public import Stafford38.Paper.Section2.Filtration 4 public import Stafford38.Characteristic.CommutingPolynomialAction 5 6 @[expose] public section 7 8 /-! 9 # The associated graded `k[x, ξ]`-module of a filtered right `A_n(K)`-module 10 11 For a right `A_n(K)`-module `M` with a compatible order filtration `M_•` 12 (Definition 2.4, `IsCompatibleFiltration`), `gr M = ⊕_i M_i/M_{i-1}` (`gr`) 13 is a module over `gr A_n = K[x, ξ]`: the variable `x_j` acts by right 14 multiplication with the generator `x_j ∈ F_0` and `ξ_j` by right 15 multiplication with `∂_j ∈ F_1`, each raising the degree by its order weight. 16 The two actions commute on `gr M` because the commutators of the generators 17 are scalars, of lower order. 18 -/ 19 20 namespace Stafford38.Paper.Support.Gabber 21 22 open Stafford38.Paper.Section2 23 open Stafford38.Characteristic 24 open Stafford38.CharacteristicAssociatedGradedModule 25 open Stafford38.WeylIteratedEquivalence 26 open Stafford38.WeylFiltration 27 open Stafford38.WeylPBW 28 open Stafford38.EulerSurjectivity 29 30 noncomputable section 31 32 universe u v w w' w₁ 33 34 section Generators 35 36 variable (K : Type u) [Field K] (n : ℕ) 37 38 /-- The generator `x_j` (`v = inl j`) or `∂_j` (`v = inr j`) of `A_n(K)`. -/ 39 abbrev gen (v : PhaseVar n) : PresentedWeyl K n := 40 Stafford38Challenge.generator K n v 41 42 variable {K n} 43 44 theorem gen_mem (v : PhaseVar n) : gen K n v ∈ orderFiltration K n (orderWeight v) := by 45 change Stafford.freeWeylGenerator (Matrix.J (Fin n) K) v ∈ orderPiece K n (orderWeight v) 46 rw [orderPiece, mem_presentedWeightPiece, presentedNormalFormLinearEquiv_generator] 47 intro m hm 48 simp only [MvPolynomial.coeff_X] at hm 49 split at hm 50 · subst m 51 simp [monomialWeight] 52 · exact absurd rfl hm 53 54 theorem gen_commutator (v w : PhaseVar n) : 55 gen K n v * gen K n w - gen K n w * gen K n v = 56 algebraMap K (PresentedWeyl K n) (Matrix.J (Fin n) K v w) := by 57 have h := RingQuot.mkAlgHom_rel K 58 (s := Stafford.freeWeylRelation (Matrix.J (Fin n) K)) ⟨v, w, rfl, rfl⟩ 59 rw [map_sub, map_mul, map_mul, AlgHom.commutes] at h 60 exact h 61 62 theorem algebraMap_mem_order (c : K) : 63 algebraMap K (PresentedWeyl K n) c ∈ orderFiltration K n 0 := by 64 rw [Algebra.algebraMap_eq_smul_one] 65 exact Submodule.smul_mem _ c (orderPieceOne (n := n) K).property 66 67 /-- The commutator of two generators lies in `F_{w(v)+w(w)-1}`; for two 68 coordinates it is zero. -/ 69 theorem gen_commutator_mem_lower (v w : PhaseVar n) : 70 gen K n v * gen K n w - gen K n w * gen K n v ∈ 71 lowerPiece (orderFiltration K n) (orderWeight v + orderWeight w) := by 72 rw [gen_commutator] 73 have hmono := (isFiltration_order K n).mono 74 rcases v with a | a <;> rcases w with b | b 75 · simp [Matrix.J, orderWeight, fibreWeight, lowerPiece] 76 · exact algebraMap_mem_order _ 77 · exact algebraMap_mem_order _ 78 · exact hmono (Nat.zero_le 1) (algebraMap_mem_order _) 79 80 end Generators 81 82 section Construction 83 84 variable {K : Type u} [Field K] {n : ℕ} 85 variable {M : Type w} [AddCommGroup M] [Module (PresentedWeyl K n)ᵐᵒᵖ M] [Module K M] 86 [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M] 87 88 /-- `gr M = ⊕_i M_i/M_{i-1}` with its `K[x, ξ]`-module structure (below). -/ 89 def GrModule (Γ : ℕ → Submodule K M) : Type w := gr Γ 90 91 instance (Γ : ℕ → Submodule K M) : AddCommGroup (GrModule Γ) := 92 inferInstanceAs (AddCommGroup (gr Γ)) 93 94 instance (Γ : ℕ → Submodule K M) : Module K (GrModule Γ) := 95 inferInstanceAs (Module K (gr Γ)) 96 97 open scoped Classical in 98 /-- The class of `x` in `M_i/M_{i-1}` (zero when `x ∉ M_i`). -/ 99 def cls (Γ : ℕ → Submodule K M) (i : ℕ) (x : M) : GrModule Γ := 100 if h : x ∈ Γ i then DirectSum.of (grPiece Γ) i (Submodule.Quotient.mk ⟨x, h⟩) else 0 101 102 variable {Γ : ℕ → Submodule K M} 103 104 theorem cls_of_mem {i : ℕ} {x : M} (h : x ∈ Γ i) : 105 cls Γ i x = DirectSum.of (grPiece Γ) i (Submodule.Quotient.mk ⟨x, h⟩) := by 106 unfold cls 107 exact dite_eq_left h 108 109 theorem cls_add {i : ℕ} {x y : M} (hx : x ∈ Γ i) (hy : y ∈ Γ i) : 110 cls Γ i (x + y) = cls Γ i x + cls Γ i y := by 111 rw [cls_of_mem hx, cls_of_mem hy, cls_of_mem (add_mem hx hy)] 112 change _ = DirectSum.of (grPiece Γ) i _ + DirectSum.of (grPiece Γ) i _ 113 rw [← map_add] 114 rfl 115 116 theorem cls_smul {i : ℕ} {x : M} (hx : x ∈ Γ i) (c : K) : 117 cls Γ i (c • x) = c • cls Γ i x := by 118 rw [cls_of_mem hx, cls_of_mem (Submodule.smul_mem _ c hx)] 119 change DirectSum.lof K ℕ (grPiece Γ) i _ = c • DirectSum.lof K ℕ (grPiece Γ) i _ 120 rw [← map_smul] 121 rfl 122 123 theorem cls_zero (i : ℕ) : cls Γ i (0 : M) = 0 := by 124 rw [cls_of_mem (zero_mem _)] 125 exact (DirectSum.of (grPiece Γ) i).map_zero 126 127 theorem cls_neg {i : ℕ} {x : M} (hx : x ∈ Γ i) : cls Γ i (-x) = -cls Γ i x := by 128 have h := cls_add hx (neg_mem hx) 129 rw [add_neg_cancel, cls_zero] at h 130 exact (neg_eq_of_add_eq_zero_right h.symm).symm 131 132 theorem cls_sub {i : ℕ} {x y : M} (hx : x ∈ Γ i) (hy : y ∈ Γ i) : 133 cls Γ i (x - y) = cls Γ i x - cls Γ i y := by 134 rw [sub_eq_add_neg, cls_add hx (neg_mem hy), cls_neg hy, ← sub_eq_add_neg] 135 136 theorem cls_eq_zero_of_mem_lower {i : ℕ} {x : M} (h : x ∈ lowerPiece Γ i) : 137 cls Γ i x = 0 := by 138 by_cases hx : x ∈ Γ i 139 · have h0 : (Submodule.Quotient.mk ⟨x, hx⟩ : grPiece Γ i) = 0 := 140 (Submodule.Quotient.mk_eq_zero _).mpr h 141 rw [cls_of_mem hx, h0, map_zero] 142 rfl 143 · unfold cls 144 exact dite_eq_right hx 145 146 /-- `gr M` is spanned by the classes `cls i x`, `x ∈ M_i`. -/ 147 theorem gr_induction {P : GrModule Γ → Prop} (z : GrModule Γ) (h0 : P 0) 148 (hcls : ∀ i x, x ∈ Γ i → P (cls Γ i x)) (hadd : ∀ a b, P a → P b → P (a + b)) : P z := by 149 change gr Γ at z 150 induction z using DirectSum.induction_on with 151 | zero => exact h0 152 | of i y => 153 induction y using Submodule.Quotient.induction_on with 154 | H y => 155 obtain ⟨x, hx⟩ := y 156 have := hcls i x hx 157 rwa [cls_of_mem hx] at this 158 | add a b ha hb => exact hadd a b ha hb 159 160 theorem gr_ext {X : Type*} [AddCommGroup X] [Module K X] {f g : GrModule Γ →ₗ[K] X} 161 (h : ∀ i x, x ∈ Γ i → f (cls Γ i x) = g (cls Γ i x)) : f = g := by 162 ext z 163 induction z using gr_induction with 164 | h0 => simp 165 | hcls i x hx => exact h i x hx 166 | hadd a b ha hb => rw [map_add, map_add, ha, hb] 167 168 /-- Evaluation at degree `j`: `gr M → M/M_{j-1}`, the `j`-th component. -/ 169 def ev (Γ : ℕ → Submodule K M) (j : ℕ) : GrModule Γ →ₗ[K] M ⧸ lowerPiece Γ j := 170 (Submodule.mapQ _ _ (Γ j).subtype le_rfl).comp (DirectSum.component K ℕ (grPiece Γ) j) 171 172 theorem ev_cls (j : ℕ) {i : ℕ} {x : M} (hx : x ∈ Γ i) : 173 ev Γ j (cls Γ i x) = if i = j then Submodule.Quotient.mk x else 0 := by 174 rw [cls_of_mem hx] 175 by_cases hij : i = j 176 · subst hij 177 rw [ite_eq_left rfl] 178 change Submodule.mapQ _ _ (Γ i).subtype le_rfl 179 (DirectSum.component K ℕ (grPiece Γ) i (DirectSum.lof K ℕ (grPiece Γ) i _)) = _ 180 rw [DirectSum.component.lof_self] 181 rfl 182 · rw [ite_eq_right hij] 183 change Submodule.mapQ _ _ (Γ j).subtype le_rfl 184 (DirectSum.component K ℕ (grPiece Γ) j (DirectSum.lof K ℕ (grPiece Γ) i _)) = _ 185 rw [DirectSum.component.of, dite_eq_right hij, map_zero] 186 187 theorem cls_congr {i j : ℕ} (h : i = j) (x : M) : cls Γ i x = cls Γ j x := by 188 subst h; rfl 189 190 /-- The degree-`i` component `gr M → M_i/M_{i-1}`. -/ 191 def comp (Γ : ℕ → Submodule K M) (i : ℕ) : GrModule Γ →ₗ[K] grPiece Γ i := 192 DirectSum.component K ℕ (grPiece Γ) i 193 194 /-- The inclusion `M_i/M_{i-1} → gr M`. -/ 195 def ofG (Γ : ℕ → Submodule K M) (i : ℕ) : grPiece Γ i →ₗ[K] GrModule Γ := 196 DirectSum.lof K ℕ (grPiece Γ) i 197 198 theorem ext_comp {z₁ z₂ : GrModule Γ} (h : ∀ i, comp Γ i z₁ = comp Γ i z₂) : z₁ = z₂ := 199 DirectSum.ext_component K h 200 201 open scoped Classical in 202 theorem sum_ofG_comp (z : GrModule Γ) : 203 ∃ s : Finset ℕ, z = ∑ i ∈ s, ofG Γ i (comp Γ i z) := 204 ⟨DFinsupp.support (show gr Γ from z), (DirectSum.sum_support_of (show gr Γ from z)).symm⟩ 205 206 variable (hΓ : IsCompatibleFiltration (orderFiltration K n) Γ) 207 include hΓ 208 209 omit [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M] in 210 theorem smul_mem_lowerPiece {i j : ℕ} {x : M} {a : PresentedWeyl K n} (hx : x ∈ Γ i) 211 (ha : a ∈ lowerPiece (orderFiltration K n) j) : 212 MulOpposite.op a • x ∈ lowerPiece Γ (i + j) := by 213 cases j with 214 | zero => 215 have : a = 0 := (Submodule.mem_bot K).mp ha 216 subst this 217 simp [MulOpposite.op_zero, zero_smul, zero_mem] 218 | succ j => exact hΓ.smul_mem hx ha 219 220 omit [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M] in 221 theorem lowerPiece_smul_mem {i j : ℕ} {x : M} {a : PresentedWeyl K n} 222 (hx : x ∈ lowerPiece Γ i) (ha : a ∈ orderFiltration K n j) : 223 MulOpposite.op a • x ∈ lowerPiece Γ (i + j) := by 224 cases i with 225 | zero => 226 have : x = 0 := (Submodule.mem_bot K).mp hx 227 subst this 228 simp [smul_zero, zero_mem] 229 | succ i => 230 rw [show i + 1 + j = (i + j) + 1 by omega] 231 exact hΓ.smul_mem hx ha 232 233 omit hΓ in 234 /-- Right multiplication by `a` as a `K`-linear map of `M`. -/ 235 def actL (a : PresentedWeyl K n) : M →ₗ[K] M where 236 toFun x := MulOpposite.op a • x 237 map_add' x y := smul_add _ x y 238 map_smul' c x := (smul_comm c (MulOpposite.op a) x).symm 239 240 /-- Right multiplication by `a ∈ F_j`, from `M_i/M_{i-1}` to `M_{i+j}/M_{i+j-1}`. -/ 241 def pieceShift {a : PresentedWeyl K n} {j : ℕ} (ha : a ∈ orderFiltration K n j) (i : ℕ) : 242 grPiece Γ i →ₗ[K] grPiece Γ (i + j) := 243 Submodule.mapQ _ _ ((actL a).restrict (p := Γ i) (q := Γ (i + j)) 244 fun _ hx => hΓ.smul_mem hx ha) (by 245 rintro ⟨x, hx⟩ hlow 246 exact lowerPiece_smul_mem hΓ hlow ha) 247 248 /-- Right multiplication by `a ∈ F_j` on `gr M`, raising degrees by `j`. -/ 249 def shiftOp {a : PresentedWeyl K n} {j : ℕ} (ha : a ∈ orderFiltration K n j) : 250 GrModule Γ →ₗ[K] GrModule Γ := 251 DirectSum.toModule K ℕ (gr Γ) fun i => 252 (DirectSum.lof K ℕ (grPiece Γ) (i + j)).comp (pieceShift hΓ ha i) 253 254 theorem shiftOp_cls {a : PresentedWeyl K n} {j : ℕ} (ha : a ∈ orderFiltration K n j) 255 {i : ℕ} {x : M} (hx : x ∈ Γ i) : 256 shiftOp hΓ ha (cls Γ i x) = cls Γ (i + j) (MulOpposite.op a • x) := by 257 rw [cls_of_mem hx, cls_of_mem (hΓ.smul_mem hx ha)] 258 change DirectSum.toModule K ℕ (gr Γ) _ (DirectSum.lof K ℕ (grPiece Γ) i _) = _ 259 rw [DirectSum.toModule_lof] 260 rfl 261 262 /-- `T_v`: right multiplication by the generator `v` on `gr M`. -/ 263 def genOp (v : PhaseVar n) : GrModule Γ →ₗ[K] GrModule Γ := 264 shiftOp hΓ (gen_mem v) 265 266 theorem genOp_cls (v : PhaseVar n) {i : ℕ} {x : M} (hx : x ∈ Γ i) : 267 genOp hΓ v (cls Γ i x) = 268 cls Γ (i + orderWeight v) (MulOpposite.op (gen K n v) • x) := 269 shiftOp_cls hΓ _ hx 270 271 /-- On `gr M` the generators commute: their commutators are scalars, which 272 lower the degree. -/ 273 theorem genOp_commute (v w : PhaseVar n) : Commute (genOp hΓ v) (genOp hΓ w) := by 274 change genOp hΓ v * genOp hΓ w = genOp hΓ w * genOp hΓ v 275 apply gr_ext 276 intro i x hx 277 have hw := hΓ.smul_mem hx (gen_mem w) 278 have hv := hΓ.smul_mem hx (gen_mem v) 279 have hvw := hΓ.smul_mem hw (gen_mem v) 280 have hwv := hΓ.smul_mem hv (gen_mem w) 281 rw [Module.End.mul_apply, Module.End.mul_apply, genOp_cls hΓ w hx, genOp_cls hΓ v hw, 282 genOp_cls hΓ v hx, genOp_cls hΓ w hv, 283 cls_congr (show i + orderWeight v + orderWeight w = i + orderWeight w + orderWeight v by 284 omega), ← sub_eq_zero, ← cls_sub hvw (by rwa [show i + orderWeight w + orderWeight v = 285 i + orderWeight v + orderWeight w by omega])] 286 apply cls_eq_zero_of_mem_lower 287 have hcomm := smul_mem_lowerPiece hΓ hx (gen_commutator_mem_lower w v) 288 rw [← add_assoc] at hcomm 289 convert hcomm using 1 290 rw [MulOpposite.op_sub, sub_smul, MulOpposite.op_mul, MulOpposite.op_mul, mul_smul, mul_smul] 291 292 end Construction 293 294 section Action 295 296 variable {K : Type u} [Field K] {n : ℕ} 297 variable {M : Type w} [AddCommGroup M] [Module (PresentedWeyl K n)ᵐᵒᵖ M] [Module K M] 298 [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M] 299 variable (Γ : ℕ → Submodule K M) 300 301 open scoped Classical in 302 /-- The action of the variable `v` on `gr M` (`T_v` for a compatible filtration). -/ 303 def genAct (v : PhaseVar n) : Module.End K (GrModule Γ) := 304 if hΓ : IsCompatibleFiltration (orderFiltration K n) Γ then genOp hΓ v else 0 305 306 theorem genAct_commute (v w : PhaseVar n) : Commute (genAct Γ v) (genAct Γ w) := by 307 unfold genAct 308 split_ifs with h 309 · exact genOp_commute h v w 310 · exact Commute.zero_left _ 311 312 /-- `K[x, ξ] → End_K(gr M)`, sending `x_j, ξ_j` to `T_{x_j}, T_{ξ_j}`. -/ 313 def symbolAction : SymbolRing K n →ₐ[K] Module.End K (GrModule Γ) := 314 commutingPolynomialAction (genAct Γ) (genAct_commute Γ) 315 316 /-- **Definition 2.4 (`gr M` as a `gr A_n = K[x, ξ]`-module).** -/ 317 instance : Module (SymbolRing K n) (GrModule Γ) := 318 Module.compHom (GrModule Γ) (symbolAction Γ).toRingHom 319 320 variable {Γ} 321 322 theorem smul_def (f : SymbolRing K n) (z : GrModule Γ) : f • z = symbolAction Γ f z := 323 rfl 324 325 instance : IsScalarTower K (SymbolRing K n) (GrModule Γ) := 326 ⟨fun c f z => by 327 rw [smul_def, smul_def, map_smul] 328 rfl⟩ 329 330 theorem X_smul_cls (hΓ : IsCompatibleFiltration (orderFiltration K n) Γ) (v : PhaseVar n) 331 {i : ℕ} {x : M} (hx : x ∈ Γ i) : 332 (MvPolynomial.X v : SymbolRing K n) • cls Γ i x = 333 cls Γ (i + orderWeight v) (MulOpposite.op (gen K n v) • x) := by 334 rw [smul_def, symbolAction, commutingPolynomialAction_apply_X, genAct, dite_eq_left hΓ, 335 genOp_cls hΓ v hx] 336 337 theorem C_smul (c : K) (z : GrModule Γ) : 338 (MvPolynomial.C c : SymbolRing K n) • z = c • z := by 339 rw [smul_def, symbolAction, commutingPolynomialAction_apply_C] 340 rfl 341 342 #print axioms X_smul_cls 343 344 end Action 345 346 section Functoriality 347 348 variable {K : Type u} [Field K] {n : ℕ} 349 variable {M : Type w} [AddCommGroup M] [Module (PresentedWeyl K n)ᵐᵒᵖ M] [Module K M] 350 [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M] 351 variable {M' : Type w'} [AddCommGroup M'] [Module (PresentedWeyl K n)ᵐᵒᵖ M'] [Module K M'] 352 [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M'] 353 variable {Γ : ℕ → Submodule K M} {Γ' : ℕ → Submodule K M'} 354 variable (φ : M →ₗ[(PresentedWeyl K n)ᵐᵒᵖ] M') (hφ : ∀ i, ∀ x ∈ Γ i, φ x ∈ Γ' i) 355 356 omit [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M] 357 [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M'] in 358 include hφ in 359 theorem map_mem_lowerPiece {i : ℕ} {x : M} (hx : x ∈ lowerPiece Γ i) : 360 φ x ∈ lowerPiece Γ' i := by 361 cases i with 362 | zero => 363 have : x = 0 := (Submodule.mem_bot K).mp hx 364 subst this 365 simp [zero_mem] 366 | succ i => exact hφ i x hx 367 368 /-- `M_i/M_{i-1} → M'_i/M'_{i-1}` induced by a filtered map. -/ 369 def pieceMap (i : ℕ) : grPiece Γ i →ₗ[K] grPiece Γ' i := 370 Submodule.mapQ _ _ ((φ.restrictScalars K).restrict (p := Γ i) (q := Γ' i) (hφ i)) (by 371 rintro ⟨x, hx⟩ hlow 372 exact map_mem_lowerPiece φ hφ hlow) 373 374 /-- `gr φ : gr M → gr M'`. -/ 375 def grMap : GrModule Γ →ₗ[K] GrModule Γ' := 376 DFinsupp.mapRange.linearMap (pieceMap φ hφ) 377 378 theorem grMap_apply (z : GrModule Γ) (i : ℕ) : 379 comp Γ' i (grMap φ hφ z) = pieceMap φ hφ i (comp Γ i z) := 380 DFinsupp.mapRange_apply _ (fun i => (pieceMap φ hφ i).map_zero) _ _ 381 382 theorem grMap_cls {i : ℕ} {x : M} (hx : x ∈ Γ i) : 383 grMap φ hφ (cls Γ i x) = cls Γ' i (φ x) := by 384 rw [cls_of_mem hx, cls_of_mem (hφ i x hx)] 385 change DFinsupp.mapRange (fun i => pieceMap φ hφ i) (fun i => (pieceMap φ hφ i).map_zero) 386 (DFinsupp.single i _) = DFinsupp.single i _ 387 rw [DFinsupp.mapRange_single] 388 rfl 389 390 theorem grMap_smul (hΓ : IsCompatibleFiltration (orderFiltration K n) Γ) 391 (hΓ' : IsCompatibleFiltration (orderFiltration K n) Γ') (f : SymbolRing K n) 392 (z : GrModule Γ) : grMap φ hφ (f • z) = f • grMap φ hφ z := by 393 have h := commutingPolynomialAction_intertwines (genAct Γ) (genAct Γ') (genAct_commute Γ) 394 (genAct_commute Γ') (grMap φ hφ) (fun v => by 395 apply gr_ext 396 intro i x hx 397 simp only [LinearMap.comp_apply, genAct, dite_eq_left hΓ, dite_eq_left hΓ'] 398 rw [genOp_cls hΓ v hx, grMap_cls φ hφ (hΓ.smul_mem hx (gen_mem v)), grMap_cls φ hφ hx, 399 genOp_cls hΓ' v (hφ i x hx), map_smul]) f 400 exact congrArg (fun g => g z) h 401 402 /-- `gr φ` as a `K[x, ξ]`-linear map. -/ 403 def grMapS (hΓ : IsCompatibleFiltration (orderFiltration K n) Γ) 404 (hΓ' : IsCompatibleFiltration (orderFiltration K n) Γ') : 405 GrModule Γ →ₗ[SymbolRing K n] GrModule Γ' where 406 toFun := grMap φ hφ 407 map_add' := map_add _ 408 map_smul' := grMap_smul φ hφ hΓ hΓ' 409 410 end Functoriality 411 412 section SubQuotient 413 414 variable {K : Type u} [Field K] {n : ℕ} 415 variable {M : Type w} [AddCommGroup M] [Module (PresentedWeyl K n)ᵐᵒᵖ M] [Module K M] 416 [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M] 417 variable {M₁ : Type w₁} [AddCommGroup M₁] [Module (PresentedWeyl K n)ᵐᵒᵖ M₁] [Module K M₁] 418 [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M₁] 419 variable (Γ : ℕ → Submodule K M) (ι : M₁ →ₗ[(PresentedWeyl K n)ᵐᵒᵖ] M) 420 421 /-- The filtration `ι⁻¹(M_i)` induced on a submodule `ι : M₁ ↪ M`. -/ 422 def subFilt (i : ℕ) : Submodule K M₁ := 423 (Γ i).comap (ι.restrictScalars K) 424 425 /-- The image filtration `(M_i + N)/N` on the quotient `M/N`, `N = ι(M₁)`. -/ 426 def quotFilt (i : ℕ) : Submodule K (M ⧸ LinearMap.range ι) := 427 (Γ i).map ((LinearMap.range ι).mkQ.restrictScalars K) 428 429 variable {Γ ι} 430 431 theorem subFilt_isCompatible (hΓ : IsCompatibleFiltration (orderFiltration K n) Γ) : 432 IsCompatibleFiltration (orderFiltration K n) (subFilt Γ ι) where 433 mono _ _ h _ hx := hΓ.mono h hx 434 smul_mem := by 435 intro i j x a hx ha 436 change ι (MulOpposite.op a • x) ∈ Γ (i + j) 437 rw [map_smul] 438 exact hΓ.smul_mem hx ha 439 exhaustive x := hΓ.exhaustive (ι x) 440 441 omit [Module K M₁] [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M₁] in 442 theorem quotFilt_isCompatible (hΓ : IsCompatibleFiltration (orderFiltration K n) Γ) : 443 IsCompatibleFiltration (orderFiltration K n) (quotFilt Γ ι) where 444 mono _ _ h := Submodule.map_mono (hΓ.mono h) 445 smul_mem := by 446 rintro i j _ a ⟨x, hx, rfl⟩ ha 447 exact ⟨MulOpposite.op a • x, hΓ.smul_mem hx ha, by simp⟩ 448 exhaustive y := by 449 obtain ⟨x, rfl⟩ := (LinearMap.range ι).mkQ_surjective y 450 obtain ⟨i, hi⟩ := hΓ.exhaustive x 451 exact ⟨i, x, hi, rfl⟩ 452 453 theorem subFilt_map : ∀ i, ∀ x ∈ subFilt Γ ι i, ι x ∈ Γ i := 454 fun _ _ h => h 455 456 omit [Module K M₁] [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M₁] in 457 theorem quotFilt_map : ∀ i, ∀ x ∈ Γ i, (LinearMap.range ι).mkQ x ∈ quotFilt Γ ι i := 458 fun _ x h => ⟨x, h, rfl⟩ 459 460 theorem mem_lowerPiece_subFilt (hι : Function.Injective ι) {i : ℕ} {x : M₁} : 461 x ∈ lowerPiece (subFilt Γ ι) i ↔ ι x ∈ lowerPiece Γ i := by 462 cases i with 463 | zero => 464 simp only [lowerPiece, Submodule.mem_bot] 465 exact ⟨fun h => by rw [h, map_zero], fun h => hι (by rw [h, map_zero])⟩ 466 | succ i => exact Iff.rfl 467 468 omit [Module K M₁] [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M₁] in 469 theorem mem_lowerPiece_quotFilt {i : ℕ} {y : M ⧸ LinearMap.range ι} : 470 y ∈ lowerPiece (quotFilt Γ ι) i ↔ 471 ∃ x ∈ lowerPiece Γ i, (LinearMap.range ι).mkQ x = y := by 472 cases i with 473 | zero => 474 simp only [lowerPiece, Submodule.mem_bot] 475 constructor 476 · rintro rfl; exact ⟨0, rfl, map_zero _⟩ 477 · rintro ⟨x, rfl, rfl⟩; exact map_zero _ 478 | succ i => exact Iff.rfl 479 480 omit [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M] in 481 theorem lowerPiece_le (hΓ : IsCompatibleFiltration (orderFiltration K n) Γ) (i : ℕ) : 482 lowerPiece Γ i ≤ Γ i := by 483 cases i with 484 | zero => exact bot_le 485 | succ i => exact hΓ.mono (Nat.le_succ i) 486 487 omit [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M₁] in 488 theorem grMap_of {M' : Type w'} [AddCommGroup M'] [Module (PresentedWeyl K n)ᵐᵒᵖ M'] 489 [Module K M'] [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M'] {Γ' : ℕ → Submodule K M'} 490 (φ : M →ₗ[(PresentedWeyl K n)ᵐᵒᵖ] M') (hφ : ∀ i, ∀ x ∈ Γ i, φ x ∈ Γ' i) (i : ℕ) 491 (y : grPiece Γ i) : 492 grMap φ hφ (ofG Γ i y) = ofG Γ' i (pieceMap φ hφ i y) := by 493 change DFinsupp.mapRange (fun i => pieceMap φ hφ i) (fun i => (pieceMap φ hφ i).map_zero) 494 (DFinsupp.single i _) = DFinsupp.single i _ 495 rw [DFinsupp.mapRange_single] 496 497 theorem pieceMap_sub_injective (hι : Function.Injective ι) (i : ℕ) : 498 Function.Injective (pieceMap ι (subFilt_map (Γ := Γ)) i) := by 499 rw [← LinearMap.ker_eq_bot, eq_bot_iff] 500 intro y hy 501 induction y using Submodule.Quotient.induction_on with 502 | H y => 503 obtain ⟨x, hx⟩ := y 504 rw [LinearMap.mem_ker, pieceMap, Submodule.mapQ_apply, Submodule.Quotient.mk_eq_zero] 505 at hy 506 rw [Submodule.mem_bot, Submodule.Quotient.mk_eq_zero] 507 exact (mem_lowerPiece_subFilt hι).mpr hy 508 509 theorem grSub_injective (hι : Function.Injective ι) : 510 Function.Injective (grMap ι (subFilt_map (Γ := Γ))) := by 511 intro z₁ z₂ hz 512 apply ext_comp 513 intro i 514 apply pieceMap_sub_injective (Γ := Γ) hι i 515 rw [← grMap_apply, ← grMap_apply, hz] 516 517 omit [Module K M₁] [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M₁] in 518 theorem grQuot_surjective : 519 Function.Surjective (grMap (LinearMap.range ι).mkQ (quotFilt_map (Γ := Γ))) := by 520 intro z 521 induction z using gr_induction with 522 | h0 => exact ⟨0, map_zero _⟩ 523 | hcls i y hy => 524 obtain ⟨x, hx, rfl⟩ := hy 525 exact ⟨cls Γ i x, grMap_cls _ _ hx⟩ 526 | hadd a b ha hb => 527 obtain ⟨a', rfl⟩ := ha 528 obtain ⟨b', rfl⟩ := hb 529 exact ⟨a' + b', map_add _ _ _⟩ 530 531 theorem pieceMap_quot_exact (hΓ : IsCompatibleFiltration (orderFiltration K n) Γ) (i : ℕ) 532 (q : grPiece Γ i) (hq : pieceMap (LinearMap.range ι).mkQ (quotFilt_map (Γ := Γ)) i q = 0) : 533 ∃ y, pieceMap ι (subFilt_map (Γ := Γ)) i y = q := by 534 induction q using Submodule.Quotient.induction_on with 535 | H q => 536 obtain ⟨x, hx⟩ := q 537 rw [pieceMap, Submodule.mapQ_apply, Submodule.Quotient.mk_eq_zero] at hq 538 obtain ⟨x', hx', hxx'⟩ := mem_lowerPiece_quotFilt.mp hq 539 have hN : x - x' ∈ LinearMap.range ι := by 540 rw [← Submodule.Quotient.eq] 541 exact hxx'.symm 542 obtain ⟨x₁, hx₁⟩ := hN 543 have hΓx : ι x₁ ∈ Γ i := hx₁ ▸ sub_mem hx (lowerPiece_le hΓ i hx') 544 refine ⟨Submodule.Quotient.mk ⟨x₁, hΓx⟩, ?_⟩ 545 rw [pieceMap, Submodule.mapQ_apply, Submodule.Quotient.eq] 546 change ι x₁ - x ∈ lowerPiece Γ i 547 rw [hx₁, sub_sub_cancel_left] 548 exact neg_mem hx' 549 550 theorem grQuot_exact (hΓ : IsCompatibleFiltration (orderFiltration K n) Γ) (z : GrModule Γ) 551 (hz : grMap (LinearMap.range ι).mkQ (quotFilt_map (Γ := Γ)) z = 0) : 552 ∃ y, grMap ι (subFilt_map (Γ := Γ)) y = z := by 553 classical 554 have hpiece : ∀ i, ∃ y, pieceMap ι (subFilt_map (Γ := Γ)) i y = comp Γ i z := by 555 intro i 556 refine pieceMap_quot_exact hΓ i _ ?_ 557 rw [← grMap_apply, hz, map_zero] 558 choose y hy using hpiece 559 obtain ⟨s, hs⟩ := sum_ofG_comp z 560 refine ⟨∑ i ∈ s, ofG (subFilt Γ ι) i (y i), ?_⟩ 561 rw [map_sum, hs] 562 refine Finset.sum_congr rfl fun i _ => ?_ 563 rw [grMap_of, hy] 564 565 variable (hΓ : IsCompatibleFiltration (orderFiltration K n) Γ) (hι : Function.Injective ι) 566 include hΓ 567 568 include hι in 569 theorem annihilator_le_sub : 570 Module.annihilator (SymbolRing K n) (GrModule Γ) ≤ 571 Module.annihilator (SymbolRing K n) (GrModule (subFilt Γ ι)) := 572 (grMapS ι subFilt_map (subFilt_isCompatible hΓ) hΓ).annihilator_le_of_injective 573 (grSub_injective hι) 574 575 omit [Module K M₁] [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M₁] in 576 theorem annihilator_le_quot : 577 Module.annihilator (SymbolRing K n) (GrModule Γ) ≤ 578 Module.annihilator (SymbolRing K n) (GrModule (quotFilt Γ ι)) := 579 (grMapS _ quotFilt_map hΓ (quotFilt_isCompatible hΓ)).annihilator_le_of_surjective 580 grQuot_surjective 581 582 theorem annihilator_mul_le : 583 Module.annihilator (SymbolRing K n) (GrModule (subFilt Γ ι)) * 584 Module.annihilator (SymbolRing K n) (GrModule (quotFilt Γ ι)) ≤ 585 Module.annihilator (SymbolRing K n) (GrModule Γ) := by 586 rw [Ideal.mul_le] 587 intro r hr s hs 588 rw [Module.mem_annihilator] at hr hs ⊢ 589 intro z 590 have hker : grMap (LinearMap.range ι).mkQ (quotFilt_map (Γ := Γ)) (s • z) = 0 := by 591 rw [grMap_smul _ _ hΓ (quotFilt_isCompatible hΓ), hs] 592 obtain ⟨y, hy⟩ := grQuot_exact hΓ _ hker 593 rw [mul_smul, ← hy, ← grMap_smul _ _ (subFilt_isCompatible hΓ) hΓ, hr, map_zero] 594 595 include hι in 596 /-- `√Ann gr M = √Ann gr N ∩ √Ann gr(M/N)` for the induced filtrations. -/ 597 theorem radical_annihilator_eq : 598 (Module.annihilator (SymbolRing K n) (GrModule Γ)).radical = 599 (Module.annihilator (SymbolRing K n) (GrModule (subFilt Γ ι))).radical ⊓ 600 (Module.annihilator (SymbolRing K n) (GrModule (quotFilt Γ ι))).radical := by 601 apply le_antisymm 602 · exact le_inf (Ideal.radical_mono (annihilator_le_sub hΓ hι)) 603 (Ideal.radical_mono (annihilator_le_quot hΓ)) 604 · rw [← Ideal.radical_mul] 605 exact Ideal.radical_mono (annihilator_mul_le hΓ) 606 607 omit hΓ in 608 include hι in 609 /-- The induced filtration on a submodule of a module with a good filtration is 610 good, `K[x, ξ]` being Noetherian. -/ 611 theorem subFilt_good (hΓ : IsCompatibleFiltration (orderFiltration K n) Γ) 612 [Module.Finite (SymbolRing K n) (GrModule Γ)] : 613 Module.Finite (SymbolRing K n) (GrModule (subFilt Γ ι)) := 614 Module.Finite.of_injective (grMapS ι subFilt_map (subFilt_isCompatible hΓ) hΓ) 615 (grSub_injective hι) 616 617 omit [Module K M₁] [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M₁] in 618 /-- The image filtration on a quotient of a module with a good filtration is 619 good. -/ 620 theorem quotFilt_good [Module.Finite (SymbolRing K n) (GrModule Γ)] : 621 Module.Finite (SymbolRing K n) (GrModule (quotFilt Γ ι)) := 622 Module.Finite.of_surjective (grMapS _ quotFilt_map hΓ (quotFilt_isCompatible hΓ)) 623 grQuot_surjective 624 625 #print axioms grMap_smul 626 #print axioms radical_annihilator_eq 627 #print axioms subFilt_good 628 #print axioms quotFilt_good 629 630 end SubQuotient 631 632 end 633 634 end Stafford38.Paper.Support.Gabber 635