This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 public import Stafford38.Characteristic.CanonicalFilteredGradedBridge 3 public import Stafford38.Characteristic.AssociatedGradedModule 4 public import Stafford38.Characteristic.FilteredTwoTermTotalPages 5 6 @[expose] public section 7 8 namespace Stafford38.Characteristic.CanonicalTotalGradedBridge 9 10 open Stafford38.Characteristic 11 open Stafford38.Characteristic.FilteredTwoTermPages 12 open Stafford38.Characteristic.CanonicalFilteredTwoTerm 13 open Stafford38.Characteristic.CanonicalFilteredGradedBridge 14 open Stafford38.CharacteristicFilteredQuotient 15 open Stafford38.CharacteristicFilteredQuotientGraded 16 open Stafford38.CharacteristicAssociatedGradedModule 17 open Stafford38.CanonicalAxisAvoidanceConsumer 18 open Stafford38.EulerSurjectivity 19 open Stafford38.WeylFiltration 20 open Stafford38.WeylAssociatedGraded 21 open Stafford38.WeylIteratedEquivalence 22 open Stafford38.WeylPBWMonicBridge 23 open Stafford38.WeylQuotientTransport 24 25 noncomputable section 26 27 universe u 28 29 variable (k : Type u) [Field k] [Algebra ℚ k] 30 31 section ReindexNonpositive 32 33 variable {A : ℤ → Type u} {B : ℕ → Type u} 34 variable [∀ p, AddCommMonoid (A p)] [∀ p, Module k (A p)] 35 variable [∀ m, AddCommMonoid (B m)] [∀ m, Module k (B m)] 36 37 def negIndex : ℕ → ℤ 38 | 0 => 0 39 | n + 1 => Int.negSucc n 40 41 theorem negIndex_eq (m : ℕ) : negIndex m = -(m : ℤ) := by 42 cases m <;> simp [negIndex, Int.negSucc_eq] 43 44 noncomputable def nonpositiveDirectSumToNat 45 (e : ∀ m : ℕ, A (negIndex m) ≃ₗ[k] B m) : 46 DirectSum ℤ A →ₗ[k] DirectSum ℕ B := 47 DirectSum.toModule k ℤ (DirectSum ℕ B) (fun p => 48 match p with 49 | Int.ofNat 0 => (DirectSum.lof k ℕ B 0).comp (e 0).toLinearMap 50 | Int.ofNat (n + 1) => 0 51 | Int.negSucc n => 52 (DirectSum.lof k ℕ B (n + 1)).comp (e (n + 1)).toLinearMap) 53 54 noncomputable def natDirectSumToNonpositive 55 (e : ∀ m : ℕ, A (negIndex m) ≃ₗ[k] B m) : 56 DirectSum ℕ B →ₗ[k] DirectSum ℤ A := 57 DirectSum.toModule k ℕ (DirectSum ℤ A) (fun m => 58 (DirectSum.lof k ℤ A (negIndex m)).comp (e m).symm.toLinearMap) 59 60 @[simp] theorem natDirectSumToNonpositive_lof 61 (e : ∀ m : ℕ, A (negIndex m) ≃ₗ[k] B m) (m : ℕ) (x : B m) : 62 natDirectSumToNonpositive k e (DirectSum.lof k ℕ B m x) = 63 DirectSum.lof k ℤ A (negIndex m) ((e m).symm x) := by 64 rw [natDirectSumToNonpositive, DirectSum.toModule_lof] 65 rfl 66 67 noncomputable def nonpositiveDirectSumLinearEquiv 68 (e : ∀ m : ℕ, A (negIndex m) ≃ₗ[k] B m) 69 (hpos : ∀ p, 0 < p → Subsingleton (A p)) : 70 DirectSum ℤ A ≃ₗ[k] DirectSum ℕ B := by 71 refine LinearEquiv.ofLinearMap (nonpositiveDirectSumToNat k e) 72 (natDirectSumToNonpositive k e) ?_ ?_ 73 · apply DirectSum.linearMap_ext k 74 intro m 75 apply LinearMap.ext 76 intro x 77 change nonpositiveDirectSumToNat k e 78 (natDirectSumToNonpositive k e (DirectSum.lof k ℕ B m x)) = 79 DirectSum.lof k ℕ B m x 80 rw [natDirectSumToNonpositive_lof] 81 cases m with 82 | zero => 83 rw [nonpositiveDirectSumToNat, DirectSum.toModule_lof] 84 change DirectSum.lof k ℕ B 0 (e 0 ((e 0).symm x)) = _ 85 rw [(e 0).apply_symm_apply] 86 | succ m => 87 rw [nonpositiveDirectSumToNat, DirectSum.toModule_lof] 88 change DirectSum.lof k ℕ B (m + 1) 89 (e (m + 1) ((e (m + 1)).symm x)) = _ 90 rw [(e (m + 1)).apply_symm_apply] 91 · apply DirectSum.linearMap_ext k 92 intro p 93 apply LinearMap.ext 94 intro x 95 change natDirectSumToNonpositive k e 96 (nonpositiveDirectSumToNat k e (DirectSum.lof k ℤ A p x)) = 97 DirectSum.lof k ℤ A p x 98 cases p with 99 | ofNat n => 100 cases n with 101 | zero => 102 rw [nonpositiveDirectSumToNat, DirectSum.toModule_lof] 103 change natDirectSumToNonpositive k e 104 (DirectSum.lof k ℕ B 0 (e 0 x)) = DirectSum.lof k ℤ A 0 x 105 rw [natDirectSumToNonpositive_lof] 106 congr 1 107 exact (e 0).symm_apply_apply (show A (negIndex 0) from x) 108 | succ n => 109 haveI := hpos (Int.ofNat (n + 1)) (by simp) 110 simp [nonpositiveDirectSumToNat, Subsingleton.elim x 0] 111 | negSucc n => 112 rw [nonpositiveDirectSumToNat, DirectSum.toModule_lof] 113 change natDirectSumToNonpositive k e 114 (DirectSum.lof k ℕ B (n + 1) (e (n + 1) x)) = 115 DirectSum.lof k ℤ A (Int.negSucc n) x 116 rw [natDirectSumToNonpositive_lof] 117 congr 1 118 exact (e (n + 1)).symm_apply_apply 119 (show A (negIndex (n + 1)) from x) 120 121 @[simp] private theorem nonpositiveDirectSumLinearEquiv_lof 122 (e : ∀ m : ℕ, A (negIndex m) ≃ₗ[k] B m) 123 (hpos : ∀ p, 0 < p → Subsingleton (A p)) (m : ℕ) (x : A (negIndex m)) : 124 nonpositiveDirectSumLinearEquiv k e hpos 125 (DirectSum.lof k ℤ A (negIndex m) x) = 126 DirectSum.lof k ℕ B m (e m x) := by 127 cases m with 128 | zero => 129 change nonpositiveDirectSumToNat k e 130 (DirectSum.lof k ℤ A (negIndex 0) x) = _ 131 rw [nonpositiveDirectSumToNat, DirectSum.toModule_lof] 132 rfl 133 | succ m => 134 change nonpositiveDirectSumToNat k e 135 (DirectSum.lof k ℤ A (negIndex (m + 1)) x) = _ 136 rw [nonpositiveDirectSumToNat, DirectSum.toModule_lof] 137 rfl 138 139 end ReindexNonpositive 140 141 abbrev CI (n N : ℕ) (d : PresentedWeyl k (n + 1)) := 142 presentedCanonicalRightIdeal (k := k) n N d 143 144 abbrev K (n N : ℕ) (d : PresentedWeyl k (n + 1)) 145 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) := 146 canonicalFilteredTwoTerm k n N d hd 147 148 abbrev SourceTotal0 (n N : ℕ) (d : PresentedWeyl k (n + 1)) 149 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) := 150 (K k n N d hd).SourceTotal 0 151 152 abbrev TargetTotal0 (n N : ℕ) (d : PresentedWeyl k (n + 1)) 153 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) := 154 (K k n N d hd).TargetTotal 0 155 156 theorem sourceComponentType_eq 157 (n N m : ℕ) (d : PresentedWeyl k (n + 1)) 158 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) : 159 (K k n N d hd).SourcePage 0 (-(m : ℤ)) = 160 QuotientOrderGradedPiece k (CI k n N d) m := 161 zeroPage_source_is_actual_graded_piece k n N m d hd 162 163 theorem targetComponentType_eq 164 (n N m : ℕ) (d : PresentedWeyl k (n + 1)) 165 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) : 166 (K k n N d hd).TargetPage 0 (-(m : ℤ)) = 167 QuotientOrderGradedPiece k (CI k n N d) m := 168 zeroPage_target_is_actual_graded_piece k n N m d hd 169 170 /-- The total degree-zero source page is the actual order-associated graded module. -/ 171 noncomputable def sourceTotal0LinearEquivOrderAssociatedGraded 172 (n N : ℕ) (d : PresentedWeyl k (n + 1)) 173 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) : 174 SourceTotal0 k n N d hd ≃ₗ[k] 175 OrderAssociatedGradedModule k (CI k n N d) := 176 nonpositiveDirectSumLinearEquiv k 177 (fun m => 178 (LinearEquiv.cast (M := fun p : ℤ => (K k n N d hd).SourcePage 0 p) 179 (negIndex_eq m)) ≪≫ₗ 180 zeroPageSourceLinearEquivOrderGradedPiece k n N m d hd) 181 (zeroPage_source_subsingleton_of_pos k n N · d hd) 182 183 /-- The total degree-zero target page is the actual order-associated graded module. -/ 184 noncomputable def targetTotal0LinearEquivOrderAssociatedGraded 185 (n N : ℕ) (d : PresentedWeyl k (n + 1)) 186 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) : 187 TargetTotal0 k n N d hd ≃ₗ[k] 188 OrderAssociatedGradedModule k (CI k n N d) := 189 nonpositiveDirectSumLinearEquiv k 190 (fun m => 191 (LinearEquiv.cast (M := fun p : ℤ => (K k n N d hd).TargetPage 0 p) 192 (negIndex_eq m)) ≪≫ₗ 193 zeroPageTargetLinearEquivOrderGradedPiece k n N m d hd) 194 (zeroPage_target_subsingleton_of_pos k n N · d hd) 195 196 @[simp] theorem sourceTotal0LinearEquiv_lof_negIndex 197 (n N m : ℕ) (d : PresentedWeyl k (n + 1)) 198 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 199 (x : (K k n N d hd).SourcePage 0 (negIndex m)) : 200 sourceTotal0LinearEquivOrderAssociatedGraded k n N d hd 201 (DirectSum.lof k ℤ (fun p => (K k n N d hd).SourcePage 0 p) 202 (negIndex m) x) = 203 orderAssociatedGradedOf k (CI k n N d) m 204 (((LinearEquiv.cast 205 (M := fun p : ℤ => (K k n N d hd).SourcePage 0 p) (negIndex_eq m)) ≪≫ₗ 206 zeroPageSourceLinearEquivOrderGradedPiece k n N m d hd) x) := by 207 exact nonpositiveDirectSumLinearEquiv_lof k _ _ m x 208 209 @[simp] theorem targetTotal0LinearEquiv_lof_negIndex 210 (n N m : ℕ) (d : PresentedWeyl k (n + 1)) 211 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 212 (x : (K k n N d hd).TargetPage 0 (negIndex m)) : 213 targetTotal0LinearEquivOrderAssociatedGraded k n N d hd 214 (DirectSum.lof k ℤ (fun p => (K k n N d hd).TargetPage 0 p) 215 (negIndex m) x) = 216 orderAssociatedGradedOf k (CI k n N d) m 217 (((LinearEquiv.cast 218 (M := fun p : ℤ => (K k n N d hd).TargetPage 0 p) (negIndex_eq m)) ≪≫ₗ 219 zeroPageTargetLinearEquivOrderGradedPiece k n N m d hd) x) := by 220 exact nonpositiveDirectSumLinearEquiv_lof k _ _ m x 221 222 #print axioms sourceTotal0LinearEquivOrderAssociatedGraded 223 #print axioms targetTotal0LinearEquivOrderAssociatedGraded 224 225 end 226 end Stafford38.Characteristic.CanonicalTotalGradedBridge 227