This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 3 public import Stafford38.Paper.Support.GabberGood 4 public import Stafford38.Characteristic.GabberGlobalAssembly 5 6 @[expose] public section 7 8 /-! 9 # Theorem 2.11 (Gabber) for finitely generated modules with a good filtration 10 11 **Theorem 2.11.** Let `K` be a field of characteristic zero and `M` a finitely 12 generated right `A_n(K)`-module with a good order filtration `M_•`. Then 13 `J = √(Ann_{K[x,ξ]} gr M)` is involutive, `{J, J} ⊆ J`. 14 15 The theorem is cited from the literature [Gab81]; the proof here reduces it to 16 the cyclic case `M = A_n(K)/I` with the filtration `qF_m`, which the repository 17 proves (`GabberGlobalAssembly.associatedGraded_radical_isInvolutive`): 18 19 1. `√Ann gr M` does not depend on the good filtration (`GabberGood`), so for a 20 cyclic module any good filtration may be replaced by `qF_m`, whose `gr` is 21 the repository's `grCyclic` as a `K[x, ξ]`-module (`grCyclicEquivS`). 22 2. For `0 → N → M → M/N → 0` with induced filtrations, `gr N → gr M → gr(M/N)` 23 is exact, so `√Ann gr M = √Ann gr N ∩ √Ann gr(M/N)`; both induced filtrations 24 are good because `K[x, ξ]` is Noetherian. 25 3. Induction on the number of generators, splitting off a cyclic submodule; 26 an intersection of involutive ideals is involutive. 27 28 [Gab81] O. Gabber, *The integrability of the characteristic variety*, 29 Amer. J. Math. 103 (1981), 445–468. 30 -/ 31 32 namespace Stafford38.Paper.Support.Gabber 33 34 open Stafford38.Paper.Section2 35 open Stafford38.Characteristic 36 open Stafford38.Characteristic.PostScalarExtensionPoisson 37 open Stafford38.CharacteristicAssociatedGradedModule 38 open Stafford38.CharacteristicFilteredQuotient 39 open Stafford38.CharacteristicFilteredQuotientGraded 40 open Stafford38.WeylIteratedEquivalence 41 open Stafford38.WeylFiltration 42 open Stafford38.WeylAssociatedGraded 43 open Stafford38.WeylPBW 44 open Stafford38.EulerSurjectivity 45 46 noncomputable section 47 48 universe u w w' w₁ 49 50 section Cyclic 51 52 variable (K : Type u) [Field K] {n : ℕ} (I : RightIdeal (PresentedWeyl K n)) 53 54 /-- The filtration `Q_m = qF_m` of `Q = A_n/I`. -/ 55 abbrev qFilt : ℕ → Submodule K (RightQuotient I) := 56 cyclicFiltration (orderFiltration K n) (qClass K I) 57 58 /-- `grCyclicEquiv` with codomain `GrModule (qFilt K I)`. -/ 59 def grCyclicEquivG : grCyclic K I ≃ₗ[K] GrModule (qFilt K I) := 60 grCyclicEquiv K I 61 62 theorem principal_gen (v : PhaseVar n) : 63 (principalComponentOnPiece K (@orderWeight n) (orderWeight v) 64 ⟨gen K n v, gen_mem v⟩ : SymbolRing K n) = MvPolynomial.X v := by 65 classical 66 change MvPolynomial.weightedHomogeneousComponent orderWeight (orderWeight v) 67 (presentedNormalFormLinearEquiv K n 68 (Stafford.freeWeylGenerator (Matrix.J (Fin n) K) v)) = _ 69 rw [presentedNormalFormLinearEquiv_generator, 70 MvPolynomial.weightedHomogeneousComponent_of_mem 71 (MvPolynomial.isWeightedHomogeneous_X K orderWeight v), ite_eq_left rfl] 72 73 theorem grCyclicEquiv_of (N : ℕ) (z : orderPiece K n N) : 74 grCyclicEquivG K I 75 (orderAssociatedGradedOf K I N (orderPieceToQuotientGraded K I N z)) = 76 cls (qFilt K I) N (Submodule.Quotient.mk (z : PresentedWeyl K n)) := by 77 have hz : (Submodule.Quotient.mk (z : PresentedWeyl K n) : RightQuotient I) ∈ qFilt K I N := 78 ⟨z, z.property, orbitMap_qClass K I z⟩ 79 rw [cls_of_mem hz] 80 unfold grCyclicEquivG grCyclicEquiv orderAssociatedGradedOf 81 change (DFinsupp.mapRange.linearEquiv _ : (Π₀ i, QuotientOrderGradedPiece K I i) ≃ₗ[K] _) 82 (DFinsupp.single N _) = DFinsupp.single N _ 83 rw [DFinsupp.mapRange.linearEquiv_apply, DFinsupp.mapRange_single] 84 rfl 85 86 theorem grCyclic_induction {P : grCyclic K I → Prop} (y : grCyclic K I) (h0 : P 0) 87 (hof : ∀ N (z : orderPiece K n N), 88 P (orderAssociatedGradedOf K I N (orderPieceToQuotientGraded K I N z))) 89 (hadd : ∀ a b, P a → P b → P (a + b)) : P y := 90 DirectSum.induction_on (motive := fun y => P y) y h0 91 (fun N q => by 92 obtain ⟨z, rfl⟩ := orderPieceToQuotientGraded_surjective K I N q 93 exact hof N z) 94 (fun a b ha hb => hadd a b ha hb) 95 96 theorem grCyclicEquiv_X_smul (v : PhaseVar n) (y : grCyclic K I) : 97 grCyclicEquivG K I ((MvPolynomial.X v : SymbolRing K n) • y) = 98 (MvPolynomial.X v : SymbolRing K n) • grCyclicEquivG K I y := by 99 induction y using grCyclic_induction with 100 | h0 => rw [smul_zero, map_zero, smul_zero] 101 | hof N z => 102 have h := smul_orderAssociatedGradedOf_mk_eq_of_mul K I z ⟨gen K n v, gen_mem v⟩ 103 rw [principal_gen] at h 104 rw [h, grCyclicEquiv_of, grCyclicEquiv_of] 105 have hz : (Submodule.Quotient.mk (z : PresentedWeyl K n) : RightQuotient I) ∈ 106 qFilt K I N := ⟨z, z.property, orbitMap_qClass K I z⟩ 107 rw [X_smul_cls (cyclicFiltration_order_isCompatible K I) v hz] 108 rfl 109 | hadd a b ha hb => rw [smul_add, map_add, ha, hb, map_add, smul_add] 110 111 /-- `gr Q` for `Q_m = qF_m`, with the `K[x, ξ]`-structure of `GrModule`, is the 112 repository's `grCyclic` (`OrderAssociatedGradedModule`). -/ 113 def grCyclicEquivS : grCyclic K I ≃ₗ[SymbolRing K n] GrModule (qFilt K I) := 114 { grCyclicEquivG K I with 115 map_smul' := by 116 intro f y 117 change grCyclicEquivG K I (f • y) = f • grCyclicEquivG K I y 118 induction f using MvPolynomial.induction_on generalizing y with 119 | C c => 120 rw [C_smul, ← MvPolynomial.algebraMap_eq, algebraMap_smul, map_smul] 121 | add p q hp hq => rw [add_smul, map_add, hp, hq, add_smul] 122 | mul_X p v hp => rw [mul_smul, hp, grCyclicEquiv_X_smul, mul_smul] } 123 124 theorem annihilator_qFilt : 125 Module.annihilator (SymbolRing K n) (GrModule (qFilt K I)) = 126 Module.annihilator (SymbolRing K n) (grCyclic K I) := 127 (grCyclicEquivS K I).annihilator_eq.symm 128 129 /-- `Q_m = qF_m` is good: `gr Q` is generated by `q̄` (Definition 2.4). -/ 130 theorem qFilt_good : Module.Finite (SymbolRing K n) (GrModule (qFilt K I)) := by 131 have := grCyclic_good K I 132 exact Module.Finite.equiv (grCyclicEquivS K I) 133 134 variable [CharZero K] 135 136 /-- Theorem 2.11 for a cyclic module `A_n/I` with an arbitrary good filtration. -/ 137 theorem cyclic_isInvolutive {Γ : ℕ → Submodule K (RightQuotient I)} 138 (hΓ : IsCompatibleFiltration (orderFiltration K n) Γ) 139 (hgood : Module.Finite (SymbolRing K n) (GrModule Γ)) : 140 IsInvolutive (Module.annihilator (SymbolRing K n) (GrModule Γ)).radical := by 141 rw [radical_annihilator_eq_of_good hΓ (cyclicFiltration_order_isCompatible K I) hgood 142 (qFilt_good K I), annihilator_qFilt] 143 exact GabberGlobalAssembly.associatedGraded_radical_isInvolutive K I 144 145 #print axioms grCyclicEquivS 146 #print axioms cyclic_isInvolutive 147 148 end Cyclic 149 150 section General 151 152 variable {K : Type u} [Field K] {n : ℕ} 153 154 theorem isInvolutive_inf {J₁ J₂ : Ideal (SymbolRing K n)} (h₁ : IsInvolutive J₁) 155 (h₂ : IsInvolutive J₂) : IsInvolutive (J₁ ⊓ J₂) := 156 fun f hf g hg => ⟨h₁ f hf.1 g hg.1, h₂ f hf.2 g hg.2⟩ 157 158 variable {M : Type w} [AddCommGroup M] [Module (PresentedWeyl K n)ᵐᵒᵖ M] [Module K M] 159 [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M] 160 161 omit [Module K M] [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M] in 162 theorem subsingleton_of_span_eq_top_empty 163 (h : (⊥ : Submodule (PresentedWeyl K n)ᵐᵒᵖ M) = ⊤) : Subsingleton M := 164 ⟨fun a b => by 165 have ha : a ∈ (⊥ : Submodule (PresentedWeyl K n)ᵐᵒᵖ M) := h ▸ Submodule.mem_top 166 have hb : b ∈ (⊥ : Submodule (PresentedWeyl K n)ᵐᵒᵖ M) := h ▸ Submodule.mem_top 167 rw [(Submodule.mem_bot _).mp ha, (Submodule.mem_bot _).mp hb]⟩ 168 169 theorem isInvolutive_of_subsingleton [Subsingleton M] (Γ : ℕ → Submodule K M) : 170 IsInvolutive (Module.annihilator (SymbolRing K n) (GrModule Γ)).radical := by 171 have hsub : Subsingleton (GrModule Γ) := by 172 refine ⟨fun a b => ?_⟩ 173 have h0 : ∀ z : GrModule Γ, z = 0 := fun z => by 174 induction z using gr_induction with 175 | h0 => rfl 176 | hcls i x _ => rw [Subsingleton.elim x 0, cls_zero] 177 | hadd a b ha hb => rw [ha, hb, add_zero] 178 rw [h0 a, h0 b] 179 rw [Module.annihilator_eq_top_iff.mpr hsub, Ideal.radical_top] 180 exact fun _ _ _ _ => Submodule.mem_top 181 182 /-- `a ↦ m a`, the orbit map of `m` as a map of right modules. -/ 183 def orbitHom (m : M) : PresentedWeyl K n →ₗ[(PresentedWeyl K n)ᵐᵒᵖ] M where 184 toFun a := MulOpposite.op a • m 185 map_add' a b := by rw [MulOpposite.op_add, add_smul] 186 map_smul' c a := by 187 change MulOpposite.op (a * c.unop) • m = c • MulOpposite.op a • m 188 rw [MulOpposite.op_mul, MulOpposite.op_unop, mul_smul] 189 190 /-- `A_n/ann(m) ≅ mA ⊆ M`, `[a] ↦ m a`. -/ 191 def cyclicInclusion (m : M) : 192 RightQuotient (LinearMap.ker (orbitHom (K := K) (n := n) m)) →ₗ[(PresentedWeyl K n)ᵐᵒᵖ] M := 193 (LinearMap.ker (orbitHom m)).liftQ (orbitHom m) le_rfl 194 195 omit [Module K M] [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M] in 196 theorem cyclicInclusion_injective (m : M) : 197 Function.Injective (cyclicInclusion (K := K) (n := n) m) := by 198 rw [← LinearMap.ker_eq_bot] 199 exact Submodule.ker_liftQ_eq_bot _ _ _ le_rfl 200 201 omit [Module K M] [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M] in 202 theorem mem_range_cyclicInclusion (m : M) : 203 m ∈ LinearMap.range (cyclicInclusion (K := K) (n := n) m) := 204 ⟨Submodule.Quotient.mk 1, by 205 change MulOpposite.op (1 : PresentedWeyl K n) • m = m 206 rw [MulOpposite.op_one, one_smul]⟩ 207 208 variable [CharZero K] 209 210 theorem isInvolutive_of_card (r : ℕ) : 211 ∀ {M : Type w} [AddCommGroup M] [Module (PresentedWeyl K n)ᵐᵒᵖ M] [Module K M] 212 [IsScalarTower K (PresentedWeyl K n)ᵐᵒᵖ M] (s : Finset M), s.card ≤ r → 213 Submodule.span (PresentedWeyl K n)ᵐᵒᵖ (s : Set M) = ⊤ → 214 ∀ Γ : ℕ → Submodule K M, IsCompatibleFiltration (orderFiltration K n) Γ → 215 Module.Finite (SymbolRing K n) (GrModule Γ) → 216 IsInvolutive (Module.annihilator (SymbolRing K n) (GrModule Γ)).radical := by 217 classical 218 induction r with 219 | zero => 220 intro M _ _ _ _ s hs hspan Γ _ _ 221 have : s = ∅ := Finset.card_eq_zero.mp (Nat.le_zero.mp hs) 222 subst this 223 rw [Finset.coe_empty, Submodule.span_empty] at hspan 224 have : Subsingleton M := subsingleton_of_span_eq_top_empty hspan 225 exact isInvolutive_of_subsingleton Γ 226 | succ r ih => 227 intro M _ _ _ _ s hs hspan Γ hΓ hgood 228 by_cases hne : s = ∅ 229 · subst hne 230 rw [Finset.coe_empty, Submodule.span_empty] at hspan 231 have : Subsingleton M := subsingleton_of_span_eq_top_empty hspan 232 exact isInvolutive_of_subsingleton Γ 233 obtain ⟨m, hm⟩ := Finset.nonempty_iff_ne_empty.mpr hne 234 obtain ⟨ι, hι, hmι⟩ : ∃ ι : RightQuotient (LinearMap.ker (orbitHom (K := K) (n := n) m)) 235 →ₗ[(PresentedWeyl K n)ᵐᵒᵖ] M, Function.Injective ι ∧ m ∈ LinearMap.range ι := 236 ⟨_, cyclicInclusion_injective m, mem_range_cyclicInclusion m⟩ 237 rw [radical_annihilator_eq hΓ hι] 238 apply isInvolutive_inf 239 · exact cyclic_isInvolutive K _ (subFilt_isCompatible hΓ) (subFilt_good hι hΓ) 240 · have hgoodq : Module.Finite (SymbolRing K n) (GrModule (quotFilt Γ ι)) := 241 quotFilt_good hΓ 242 refine ih ((s.erase m).image (LinearMap.range ι).mkQ) ?_ ?_ _ 243 (quotFilt_isCompatible hΓ) hgoodq 244 · have := Finset.card_erase_of_mem hm 245 have := Finset.card_image_le (s := s.erase m) (f := (LinearMap.range ι).mkQ) 246 omega 247 · rw [Finset.coe_image, Submodule.span_image, eq_top_iff] 248 rintro y - 249 obtain ⟨x, rfl⟩ := (LinearMap.range ι).mkQ_surjective y 250 have hx : x ∈ Submodule.span (PresentedWeyl K n)ᵐᵒᵖ 251 (insert m ((s.erase m : Finset M) : Set M)) := by 252 rw [← Finset.coe_insert, Finset.insert_erase hm, hspan] 253 exact Submodule.mem_top 254 obtain ⟨a, z, hz, rfl⟩ := Submodule.mem_span_insert.mp hx 255 refine ⟨z, hz, ?_⟩ 256 have hm0 : (LinearMap.range ι).mkQ m = 0 := 257 (Submodule.Quotient.mk_eq_zero _).mpr hmι 258 rw [map_add, map_smul, hm0, smul_zero, zero_add] 259 260 #print axioms isInvolutive_of_card 261 262 end General 263 264 /-- **Theorem 2.11 (Gabber).** Let `K` be a field of characteristic zero and `M` 265 a finitely generated right `A_n(K)`-module with a good order filtration `M_•` 266 (Definition 2.4: compatible, exhaustive, `gr M` finitely generated over 267 `K[x, ξ]`). Then `J = √(Ann_{K[x,ξ]} gr M)` is involutive, `{J, J} ⊆ J`. 268 269 The proof reduces to the cyclic case proved in the repository 270 (`GabberGlobalAssembly.associatedGraded_radical_isInvolutive`); see the module 271 docstring. -/ 272 theorem theorem_2_11_general (K : Type u) [Field K] [CharZero K] (n : ℕ) 273 {M : Type w} [AddCommGroup M] [Module (Stafford38Challenge.WeylAlg K n)ᵐᵒᵖ M] [Module K M] 274 [IsScalarTower K (Stafford38Challenge.WeylAlg K n)ᵐᵒᵖ M] 275 [Module.Finite (Stafford38Challenge.WeylAlg K n)ᵐᵒᵖ M] 276 (Γ : ℕ → Submodule K M) (hΓ : IsCompatibleFiltration (orderFiltration K n) Γ) 277 (hgood : Module.Finite (SymbolRing K n) (GrModule Γ)) : 278 IsInvolutive (Module.annihilator (SymbolRing K n) (GrModule Γ)).radical := by 279 obtain ⟨s, hs⟩ := Module.Finite.fg_top (R := (PresentedWeyl K n)ᵐᵒᵖ) (M := M) 280 exact isInvolutive_of_card s.card s le_rfl hs Γ hΓ hgood 281 282 #print axioms theorem_2_11_general 283 284 theorem rightQuotient_finite {K : Type u} [Field K] {n : ℕ} (I : RightIdeal (PresentedWeyl K n)) : 285 Module.Finite (PresentedWeyl K n)ᵐᵒᵖ (RightQuotient I) := by 286 have : Module.Finite (PresentedWeyl K n)ᵐᵒᵖ (PresentedWeyl K n) := 287 Module.Finite.of_surjective (LinearMap.toSpanSingleton _ _ (1 : PresentedWeyl K n)) 288 fun a => ⟨MulOpposite.op a, by 289 rw [LinearMap.toSpanSingleton_apply, MulOpposite.smul_eq_mul_unop, MulOpposite.unop_op, 290 one_mul]⟩ 291 infer_instance 292 293 294 end 295 296 end Stafford38.Paper.Support.Gabber 297