This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 public import Stafford38.MathlibCompat.MvPolynomialCoeff 3 public import Stafford38.Characteristic.CanonicalTotalGradedBridge 4 public import Stafford38.Characteristic.CanonicalTangentialTotalAction 5 public import Stafford38.Characteristic.CanonicalTangentialRingEquivalence 6 7 @[expose] public section 8 9 namespace Stafford38.Characteristic.CanonicalTotalGradedActionCompatibility 10 11 open Stafford38.Characteristic 12 open Stafford38.Characteristic.FilteredTwoTermPages 13 open Stafford38.Characteristic.CanonicalFilteredTwoTerm 14 open Stafford38.Characteristic.CanonicalFilteredGradedBridge 15 open Stafford38.Characteristic.CanonicalTotalGradedBridge 16 open Stafford38.Characteristic.CanonicalTangentialPageOperators 17 open Stafford38.Characteristic.CanonicalTangentialTotalAction 18 open Stafford38.CharacteristicAssociatedGradedModule 19 open Stafford38.CharacteristicFilteredQuotient 20 open Stafford38.CharacteristicFilteredQuotientGraded 21 open Stafford38.EulerSurjectivity 22 open Stafford38.WeylFiltration 23 open Stafford38.WeylAssociatedGraded 24 open Stafford38.WeylIteratedEquivalence 25 open Stafford38.WeylPBWMonicBridge 26 open Stafford38.WeylPBW 27 open Stafford38.WeylLeadingSymbol 28 open Stafford38.WeylQuotientTransport 29 open Stafford38.WeylSymplectic 30 open Stafford38.CanonicalAxisAvoidanceConsumer 31 32 noncomputable section 33 set_option maxHeartbeats 800000 34 35 universe u 36 variable (k : Type u) [Field k] [Algebra ℚ k] 37 38 abbrev CI (n N : ℕ) (d : PresentedWeyl k (n + 1)) := 39 presentedCanonicalRightIdeal (k := k) n N d 40 41 abbrev K (n N : ℕ) (d : PresentedWeyl k (n + 1)) 42 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) := 43 canonicalFilteredTwoTerm k n N d hd 44 45 def oldGeneratorOrderPiece (n : ℕ) (i : Fin n ⊕ Fin n) : 46 orderPiece k (n + 1) (tangentialDegree i) := by 47 refine ⟨oldGenerator k n i, ?_⟩ 48 cases i with 49 | inl i => 50 rw [oldGenerator, orderPiece, mem_presentedWeightPiece, 51 presentedNormalFormLinearEquiv_generator] 52 intro m hm 53 simp only [MvPolynomial.coeff_X'] at hm 54 split at hm 55 · subst m; simp [oldIndex, monomialWeight, orderWeight, fibreWeight, 56 tangentialDegree] 57 · contradiction 58 | inr i => 59 rw [oldGenerator, orderPiece, mem_presentedWeightPiece, 60 presentedNormalFormLinearEquiv_generator] 61 intro m hm 62 simp only [MvPolynomial.coeff_X'] at hm 63 split at hm 64 · subst m; simp [oldIndex, monomialWeight, orderWeight, fibreWeight, 65 tangentialDegree] 66 · contradiction 67 68 theorem principal_oldGenerator (n : ℕ) (i : Fin n ⊕ Fin n) : 69 (principalComponentOnPiece k (@orderWeight (n + 1)) (tangentialDegree i) 70 (oldGeneratorOrderPiece k n i) : SymbolRing k (n + 1)) = 71 MvPolynomial.X (oldIndex i) := by 72 cases i 73 · change MvPolynomial.weightedHomogeneousComponent orderWeight 0 74 (presentedNormalFormLinearEquiv k (n + 1) 75 (Stafford.freeWeylGenerator (standardForm k (n + 1)) (.inl _))) = _ 76 rw [presentedNormalFormLinearEquiv_generator] 77 change MvPolynomial.weightedHomogeneousComponent orderWeight 0 78 (MvPolynomial.monomial (Finsupp.single (Sum.inl _) 1) 1) = _ 79 rw [weightedHomogeneousComponent_monomial] 80 simp [monomialWeight, orderWeight, fibreWeight, oldIndex] 81 rw [MvPolynomial.monomial_eq] 82 simp 83 84 · change MvPolynomial.weightedHomogeneousComponent orderWeight 1 85 (presentedNormalFormLinearEquiv k (n + 1) 86 (Stafford.freeWeylGenerator (standardForm k (n + 1)) (.inr _))) = _ 87 rw [presentedNormalFormLinearEquiv_generator] 88 change MvPolynomial.weightedHomogeneousComponent orderWeight 1 89 (MvPolynomial.monomial (Finsupp.single (Sum.inr _) 1) 1) = _ 90 rw [weightedHomogeneousComponent_monomial] 91 simp [monomialWeight, orderWeight, fibreWeight, oldIndex] 92 rw [MvPolynomial.monomial_eq] 93 simp 94 95 def sourceRepresentative (n N : ℕ) (d : PresentedWeyl k (n + 1)) 96 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 97 (p : ℤ) (m : ℕ) (h : p = -(m : ℤ)) (a : orderPiece k (n + 1) m) : 98 (K k n N d hd).SourcePage 0 p := 99 Submodule.Quotient.mk ⟨Submodule.Quotient.mk (a : PresentedWeyl k (n + 1)), by 100 rw [h, zeroPage_source_cycles_eq_orderPiece k n N m d hd] 101 exact ⟨a, a.property, rfl⟩⟩ 102 103 def targetRepresentative (n N : ℕ) (d : PresentedWeyl k (n + 1)) 104 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 105 (p : ℤ) (m : ℕ) (h : p = -(m : ℤ)) (a : orderPiece k (n + 1) m) : 106 (K k n N d hd).TargetPage 0 p := 107 Submodule.Quotient.mk ⟨Submodule.Quotient.mk (a : PresentedWeyl k (n + 1)), by 108 rw [h, G_at_neg k n N m d hd] 109 exact ⟨a, a.property, rfl⟩⟩ 110 111 theorem sourceRepresentative_cast (n N : ℕ) (d : PresentedWeyl k (n + 1)) 112 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 113 {p q : ℤ} (m : ℕ) (hp : p = -(m : ℤ)) (hq : q = -(m : ℤ)) 114 (h : p = q) (a : orderPiece k (n + 1) m) : 115 LinearEquiv.cast (R := k) (M := fun p => (K k n N d hd).SourcePage 0 p) h 116 (sourceRepresentative k n N d hd p m hp a) = 117 sourceRepresentative k n N d hd q m hq a := by 118 cases h 119 rfl 120 121 theorem targetRepresentative_cast (n N : ℕ) (d : PresentedWeyl k (n + 1)) 122 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 123 {p q : ℤ} (m : ℕ) (hp : p = -(m : ℤ)) (hq : q = -(m : ℤ)) 124 (h : p = q) (a : orderPiece k (n + 1) m) : 125 LinearEquiv.cast (R := k) (M := fun p => (K k n N d hd).TargetPage 0 p) h 126 (targetRepresentative k n N d hd p m hp a) = 127 targetRepresentative k n N d hd q m hq a := by 128 cases h 129 rfl 130 131 theorem sourceRepresentative_lof_eq (n N : ℕ) (d : PresentedWeyl k (n + 1)) 132 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 133 {p q : ℤ} (m : ℕ) (hp : p = -(m : ℤ)) (hq : q = -(m : ℤ)) 134 (a : orderPiece k (n + 1) m) : 135 DirectSum.lof k ℤ _ p (sourceRepresentative k n N d hd p m hp a) = 136 DirectSum.lof k ℤ _ q (sourceRepresentative k n N d hd q m hq a) := by 137 have h : p = q := hp.trans hq.symm 138 cases h 139 rfl 140 141 theorem targetRepresentative_lof_eq (n N : ℕ) (d : PresentedWeyl k (n + 1)) 142 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 143 {p q : ℤ} (m : ℕ) (hp : p = -(m : ℤ)) (hq : q = -(m : ℤ)) 144 (a : orderPiece k (n + 1) m) : 145 DirectSum.lof k ℤ _ p (targetRepresentative k n N d hd p m hp a) = 146 DirectSum.lof k ℤ _ q (targetRepresentative k n N d hd q m hq a) := by 147 have h : p = q := hp.trans hq.symm 148 cases h 149 rfl 150 151 theorem sourceEquiv_representative (n N : ℕ) (d : PresentedWeyl k (n + 1)) 152 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 153 (p : ℤ) (m : ℕ) (h : p = -(m : ℤ)) (a : orderPiece k (n + 1) m) : 154 sourceTotal0LinearEquivOrderAssociatedGraded k n N d hd 155 (DirectSum.lof k ℤ (fun p => (K k n N d hd).SourcePage 0 p) p 156 (sourceRepresentative k n N d hd p m h a)) = 157 orderAssociatedGradedOf k (CI k n N d) m 158 (orderPieceToQuotientGraded k (CI k n N d) m a) := by 159 rw [sourceRepresentative_lof_eq k n N d hd m h (negIndex_eq m) a] 160 have H := sourceTotal0LinearEquiv_lof_negIndex k n N m d hd 161 (sourceRepresentative k n N d hd (negIndex m) m (negIndex_eq m) a) 162 rw [H, LinearEquiv.trans_apply, sourceRepresentative_cast] 163 congr 1 164 simp [zeroPageSourceLinearEquivOrderGradedPiece, sourceRepresentative, 165 orderPieceToQuotientGraded, orderPieceToQuotientPiece] 166 167 theorem targetEquiv_representative (n N : ℕ) (d : PresentedWeyl k (n + 1)) 168 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 169 (p : ℤ) (m : ℕ) (h : p = -(m : ℤ)) (a : orderPiece k (n + 1) m) : 170 targetTotal0LinearEquivOrderAssociatedGraded k n N d hd 171 (DirectSum.lof k ℤ (fun p => (K k n N d hd).TargetPage 0 p) p 172 (targetRepresentative k n N d hd p m h a)) = 173 orderAssociatedGradedOf k (CI k n N d) m 174 (orderPieceToQuotientGraded k (CI k n N d) m a) := by 175 rw [targetRepresentative_lof_eq k n N d hd m h (negIndex_eq m) a] 176 have H := targetTotal0LinearEquiv_lof_negIndex k n N m d hd 177 (targetRepresentative k n N d hd (negIndex m) m (negIndex_eq m) a) 178 rw [H, LinearEquiv.trans_apply, targetRepresentative_cast] 179 congr 1 180 simp [zeroPageTargetLinearEquivOrderGradedPiece, targetRepresentative, 181 orderPieceToQuotientGraded, orderPieceToQuotientPiece] 182 theorem sourceRepresentative_surjective (n N : ℕ) (d : PresentedWeyl k (n + 1)) 183 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 184 (p : ℤ) (m : ℕ) (h : p = -(m : ℤ)) : 185 Function.Surjective (sourceRepresentative k n N d hd p m h) := by 186 subst p 187 intro y 188 induction y using Submodule.Quotient.induction_on with 189 | _ y => 190 have hy := (le_of_eq (zeroPage_source_cycles_eq_orderPiece k n N m d hd)) y.property 191 obtain ⟨a, ha, hay⟩ := hy 192 refine ⟨⟨a, ha⟩, ?_⟩ 193 apply congrArg Submodule.Quotient.mk 194 apply Subtype.ext 195 exact hay 196 197 theorem targetRepresentative_surjective (n N : ℕ) (d : PresentedWeyl k (n + 1)) 198 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 199 (p : ℤ) (m : ℕ) (h : p = -(m : ℤ)) : 200 Function.Surjective (targetRepresentative k n N d hd p m h) := by 201 subst p 202 intro y 203 induction y using Submodule.Quotient.induction_on with 204 | _ y => 205 have hy := (le_of_eq (G_at_neg k n N m d hd)) y.property 206 obtain ⟨a, ha, hay⟩ := hy 207 refine ⟨⟨a, ha⟩, ?_⟩ 208 apply congrArg Submodule.Quotient.mk 209 apply Subtype.ext 210 exact hay 211 212 theorem sourceRepresentative_map (n N : ℕ) (d : PresentedWeyl k (n + 1)) 213 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 214 (e : ℕ) (a : orderPiece k (n + 1) e) 215 (P : (K k n N d hd).PageOperator (e : ℤ)) 216 (hP : P.g = rightMulLinearMap k (CI k n N d) a) 217 (p : ℤ) (m : ℕ) (h : p = -(m : ℤ)) (z : orderPiece k (n + 1) m) : 218 P.sourceMap 0 p (sourceRepresentative k n N d hd p m h z) = 219 sourceRepresentative k n N d hd (p - e) (m + e) (by omega) 220 ⟨(z : PresentedWeyl k (n + 1)) * a, 221 mul_mem_orderPiece k z.property a.property⟩ := by 222 rw [sourceRepresentative, P.sourceMap_mk] 223 apply congrArg Submodule.Quotient.mk 224 apply Subtype.ext 225 change P.g (Submodule.Quotient.mk (z : PresentedWeyl k (n + 1))) = _ 226 rw [hP, rightMulLinearMap_mk] 227 228 theorem targetRepresentative_map (n N : ℕ) (d : PresentedWeyl k (n + 1)) 229 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 230 (e : ℕ) (a : orderPiece k (n + 1) e) 231 (P : (K k n N d hd).PageOperator (e : ℤ)) 232 (hP : P.g = rightMulLinearMap k (CI k n N d) a) 233 (p : ℤ) (m : ℕ) (h : p = -(m : ℤ)) (z : orderPiece k (n + 1) m) : 234 P.targetMap 0 p (targetRepresentative k n N d hd p m h z) = 235 targetRepresentative k n N d hd (p - e) (m + e) (by omega) 236 ⟨(z : PresentedWeyl k (n + 1)) * a, 237 mul_mem_orderPiece k z.property a.property⟩ := by 238 rw [targetRepresentative, P.targetMap_mk] 239 apply congrArg Submodule.Quotient.mk 240 apply Subtype.ext 241 change P.g (Submodule.Quotient.mk (z : PresentedWeyl k (n + 1))) = _ 242 rw [hP, rightMulLinearMap_mk] 243 244 theorem sourceEquiv_intertwines_rightMul (n N : ℕ) (d : PresentedWeyl k (n + 1)) 245 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 246 (e : ℕ) (a : orderPiece k (n + 1) e) 247 (P : (K k n N d hd).PageOperator (e : ℤ)) 248 (hP : P.g = rightMulLinearMap k (CI k n N d) a) 249 (z : (K k n N d hd).SourceTotal 0) : 250 sourceTotal0LinearEquivOrderAssociatedGraded k n N d hd (P.sourceTotalMap 0 z) = 251 (principalComponentOnPiece k (@orderWeight (n + 1)) e a : SymbolRing k (n + 1)) • 252 sourceTotal0LinearEquivOrderAssociatedGraded k n N d hd z := by 253 induction z using DirectSum.induction_on with 254 | zero => simp 255 | of p y => 256 by_cases hp : 0 < p 257 · haveI := zeroPage_source_subsingleton_of_pos k n N p d hd hp 258 simp [Subsingleton.elim y 0] 259 · let m := (-p).toNat 260 have hm : p = -(m : ℤ) := by dsimp [m]; omega 261 obtain ⟨z, rfl⟩ := sourceRepresentative_surjective k n N d hd p m hm y 262 rw [show DirectSum.of ((K k n N d hd).SourcePage 0) p = 263 (DirectSum.lof k ℤ (fun p => (K k n N d hd).SourcePage 0 p) p).toAddMonoidHom from rfl] 264 simp only [LinearMap.toAddMonoidHom_coe] 265 change sourceTotal0LinearEquivOrderAssociatedGraded k n N d hd 266 (P.sourceTotalMap 0 (DirectSum.lof k ℤ _ p 267 (sourceRepresentative k n N d hd p m hm z))) = _ 268 rw [P.sourceTotalMap_lof, 269 sourceRepresentative_map k n N d hd e a P hP, 270 sourceEquiv_representative, sourceEquiv_representative, 271 smul_orderAssociatedGradedOf_mk_eq_of_mul] 272 | add x y hx hy => simpa [smul_add] using congrArg₂ (· + ·) hx hy 273 274 theorem targetEquiv_intertwines_rightMul (n N : ℕ) (d : PresentedWeyl k (n + 1)) 275 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 276 (e : ℕ) (a : orderPiece k (n + 1) e) 277 (P : (K k n N d hd).PageOperator (e : ℤ)) 278 (hP : P.g = rightMulLinearMap k (CI k n N d) a) 279 (z : (K k n N d hd).TargetTotal 0) : 280 targetTotal0LinearEquivOrderAssociatedGraded k n N d hd (P.targetTotalMap 0 z) = 281 (principalComponentOnPiece k (@orderWeight (n + 1)) e a : SymbolRing k (n + 1)) • 282 targetTotal0LinearEquivOrderAssociatedGraded k n N d hd z := by 283 induction z using DirectSum.induction_on with 284 | zero => simp 285 | of p y => 286 by_cases hp : 0 < p 287 · haveI := zeroPage_target_subsingleton_of_pos k n N p d hd hp 288 simp [Subsingleton.elim y 0] 289 · let m := (-p).toNat 290 have hm : p = -(m : ℤ) := by dsimp [m]; omega 291 obtain ⟨z, rfl⟩ := targetRepresentative_surjective k n N d hd p m hm y 292 rw [show DirectSum.of ((K k n N d hd).TargetPage 0) p = 293 (DirectSum.lof k ℤ (fun p => (K k n N d hd).TargetPage 0 p) p).toAddMonoidHom from rfl] 294 simp only [LinearMap.toAddMonoidHom_coe] 295 change targetTotal0LinearEquivOrderAssociatedGraded k n N d hd 296 (P.targetTotalMap 0 (DirectSum.lof k ℤ _ p 297 (targetRepresentative k n N d hd p m hm z))) = _ 298 rw [P.targetTotalMap_lof, 299 targetRepresentative_map k n N d hd e a P hP, 300 targetEquiv_representative, targetEquiv_representative, 301 smul_orderAssociatedGradedOf_mk_eq_of_mul] 302 | add x y hx hy => simpa [smul_add] using congrArg₂ (· + ·) hx hy 303 304 theorem sourceEquiv_intertwines_generator (n N : ℕ) (d : PresentedWeyl k (n + 1)) 305 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 306 (i : Fin n ⊕ Fin n) (z : (K k n N d hd).SourceTotal 0) : 307 sourceTotal0LinearEquivOrderAssociatedGraded k n N d hd 308 (sourceGenerator k n N d hd 0 i z) = 309 (MvPolynomial.X (oldIndex i) : SymbolRing k (n + 1)) • 310 sourceTotal0LinearEquivOrderAssociatedGraded k n N d hd z := by 311 have h := sourceEquiv_intertwines_rightMul k n N d hd (tangentialDegree i) 312 (oldGeneratorOrderPiece k n i) (generator k n N d hd i) (by cases i <;> rfl) z 313 rw [principal_oldGenerator] at h 314 exact h 315 316 theorem targetEquiv_intertwines_generator (n N : ℕ) (d : PresentedWeyl k (n + 1)) 317 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 318 (i : Fin n ⊕ Fin n) (z : (K k n N d hd).TargetTotal 0) : 319 targetTotal0LinearEquivOrderAssociatedGraded k n N d hd 320 (targetGenerator k n N d hd 0 i z) = 321 (MvPolynomial.X (oldIndex i) : SymbolRing k (n + 1)) • 322 targetTotal0LinearEquivOrderAssociatedGraded k n N d hd z := by 323 have h := targetEquiv_intertwines_rightMul k n N d hd (tangentialDegree i) 324 (oldGeneratorOrderPiece k n i) (generator k n N d hd i) (by cases i <;> rfl) z 325 rw [principal_oldGenerator] at h 326 exact h 327 328 def coordinateOrderPiece (n : ℕ) : orderPiece k (n + 1) 0 := 329 ⟨presentedCoordinate k n, presentedCoordinate_mem_orderPiece_zero k n⟩ 330 331 theorem principal_coordinate (n : ℕ) : 332 (principalComponentOnPiece k (@orderWeight (n + 1)) 0 333 (coordinateOrderPiece k n) : SymbolRing k (n + 1)) = 334 MvPolynomial.X (.inl (0 : Fin (n + 1))) := by 335 change MvPolynomial.weightedHomogeneousComponent orderWeight 0 336 (presentedNormalFormLinearEquiv k (n + 1) 337 (Stafford.freeWeylGenerator (standardForm k (n + 1)) (.inl 0))) = _ 338 rw [presentedNormalFormLinearEquiv_generator] 339 change MvPolynomial.weightedHomogeneousComponent orderWeight 0 340 (MvPolynomial.monomial (Finsupp.single (Sum.inl (0 : Fin (n + 1))) 1) 1) = _ 341 rw [weightedHomogeneousComponent_monomial] 342 simp [monomialWeight, orderWeight, fibreWeight] 343 rw [MvPolynomial.monomial_eq] 344 simp 345 346 theorem sourceRepresentative_drop (n N : ℕ) (d : PresentedWeyl k (n + 1)) 347 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 348 (p : ℤ) (m : ℕ) (h : p = -(m : ℤ)) (z : orderPiece k (n + 1) m) : 349 (K k n N d hd).drop 0 p (sourceRepresentative k n N d hd p m h z) = 350 targetRepresentative k n N d hd (p + 0) (m + 0) (by omega) 351 ⟨(z : PresentedWeyl k (n + 1)) * presentedCoordinate k n, 352 mul_mem_orderPiece k z.property (presentedCoordinate_mem_orderPiece_zero k n)⟩ := by 353 rw [sourceRepresentative, (K k n N d hd).drop_mk] 354 apply congrArg Submodule.Quotient.mk 355 apply Subtype.ext 356 rfl 357 358 theorem totalDrop_zero_intertwines_coordinate (n N : ℕ) (d : PresentedWeyl k (n + 1)) 359 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 360 (z : (K k n N d hd).SourceTotal 0) : 361 targetTotal0LinearEquivOrderAssociatedGraded k n N d hd 362 ((K k n N d hd).totalDrop 0 z) = 363 (MvPolynomial.X (.inl (0 : Fin (n + 1))) : SymbolRing k (n + 1)) • 364 sourceTotal0LinearEquivOrderAssociatedGraded k n N d hd z := by 365 induction z using DirectSum.induction_on with 366 | zero => simp 367 | of p y => 368 by_cases hp : 0 < p 369 · haveI := zeroPage_source_subsingleton_of_pos k n N p d hd hp 370 simp [Subsingleton.elim y 0] 371 · let m := (-p).toNat 372 have hm : p = -(m : ℤ) := by dsimp [m]; omega 373 obtain ⟨z, rfl⟩ := sourceRepresentative_surjective k n N d hd p m hm y 374 rw [show DirectSum.of ((K k n N d hd).SourcePage 0) p = 375 (DirectSum.lof k ℤ (fun p => (K k n N d hd).SourcePage 0 p) p).toAddMonoidHom from rfl] 376 simp only [LinearMap.toAddMonoidHom_coe] 377 change targetTotal0LinearEquivOrderAssociatedGraded k n N d hd 378 ((K k n N d hd).totalDrop 0 (DirectSum.lof k ℤ _ p 379 (sourceRepresentative k n N d hd p m hm z))) = _ 380 rw [(K k n N d hd).totalDrop_lof, 381 sourceRepresentative_drop] 382 trans orderAssociatedGradedOf k (CI k n N d) (m + 0) 383 (orderPieceToQuotientGraded k (CI k n N d) (m + 0) 384 ⟨(z : PresentedWeyl k (n + 1)) * presentedCoordinate k n, 385 mul_mem_orderPiece k z.property (presentedCoordinate_mem_orderPiece_zero k n)⟩) 386 · exact targetEquiv_representative k n N d hd (p + 0) (m + 0) (by omega) _ 387 · rw [sourceEquiv_representative, ← principal_coordinate k n, 388 smul_orderAssociatedGradedOf_mk_eq_of_mul] 389 rfl 390 | add x y hx hy => simpa [smul_add] using congrArg₂ (· + ·) hx hy 391 392 #print axioms sourceEquiv_intertwines_generator 393 #print axioms targetEquiv_intertwines_generator 394 #print axioms totalDrop_zero_intertwines_coordinate 395 396 end 397 end Stafford38.Characteristic.CanonicalTotalGradedActionCompatibility 398