This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 public import Stafford38.Characteristic.CanonicalTotalGradedActionCompatibility 3 public import Stafford38.Characteristic.CanonicalOldTangentialFiniteness 4 public import Stafford38.Characteristic.CanonicalTangentialSuccessors 5 6 @[expose] public section 7 8 namespace Stafford38.Characteristic.CanonicalGradedTangentialEquivalences 9 10 open Stafford38.Characteristic 11 open Stafford38.Characteristic.CanonicalFilteredTwoTerm 12 open Stafford38.Characteristic.CanonicalTotalGradedBridge 13 open Stafford38.Characteristic.CanonicalTotalGradedActionCompatibility 14 open Stafford38.Characteristic.CanonicalTangentialTotalAction 15 open Stafford38.Characteristic.CanonicalOldTangentialFiniteness 16 open Stafford38.Characteristic.CanonicalTangentialSymbolFiniteness 17 open Stafford38.Characteristic.CanonicalTangentialRingEquivalence 18 open Stafford38.Characteristic.CanonicalNormalSymbolFiniteness 19 open Stafford38.Characteristic.NormalSymbolPolynomial 20 open Stafford38.CharacteristicAssociatedGradedModule 21 open Stafford38.WeylIteratedEquivalence 22 open Stafford38.WeylPBWMonicBridge 23 open Stafford38.WeylQuotientTransport 24 25 noncomputable section 26 set_option maxHeartbeats 800000 27 28 variable (k : Type*) [Field k] [Algebra ℚ k] 29 variable (n N : ℕ) (d : PresentedWeyl k (n + 1)) 30 variable (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 31 32 abbrev Graded := OrderAssociatedGradedModule k (presentedCanonicalRightIdeal (k := k) n N d) 33 abbrev T := MvPolynomial (Fin n ⊕ Fin n) k 34 35 local instance gradedModule : Module (T k n) (Graded k n N d) := 36 oldCoeffModule n (Graded k n N d) 37 38 attribute [local instance] sourceModule targetModule 39 40 theorem graded_C_smul (c : k) (z : Graded k n N d) : 41 (MvPolynomial.C c : T k n) • z = c • z := by 42 change (((tangentialPolynomialActionHom (k := k) n).comp Polynomial.C).comp 43 (oldSymbolTangentialAlgEquiv (k := k) n).toRingHom) (MvPolynomial.C c) • z = _ 44 have hC : (((tangentialPolynomialActionHom (k := k) n).comp Polynomial.C).comp 45 (oldSymbolTangentialAlgEquiv (k := k) n).toRingHom) (MvPolynomial.C c) = 46 (MvPolynomial.C c : SymbolRing k (n + 1)) := by 47 simp [tangentialPolynomialActionHom, normalPolynomialActionHom, 48 normalCoeffTangentialAlgEquiv, normalSymbolAlgEquiv, 49 oldSymbolTangentialAlgEquiv] 50 rw [hC] 51 exact algebraMap_smul (SymbolRing k (n + 1)) c z 52 53 theorem sourceEquiv_map_smul (P : T k n) 54 (z : (complex k n N d hd).SourceTotal 0) : 55 sourceTotal0LinearEquivOrderAssociatedGraded k n N d hd (P • z) = 56 P • sourceTotal0LinearEquivOrderAssociatedGraded k n N d hd z := by 57 induction P using MvPolynomial.induction_on generalizing z with 58 | C c => 59 rw [graded_C_smul] 60 change sourceTotal0LinearEquivOrderAssociatedGraded k n N d hd 61 (sourceAction k n N d hd 0 (MvPolynomial.C c) z) = _ 62 rw [sourceAction, commutingPolynomialAction_apply_C] 63 exact (sourceTotal0LinearEquivOrderAssociatedGraded k n N d hd).map_smul c z 64 | add P Q hP hQ => simp only [add_smul, map_add, hP, hQ] 65 | mul_X P i hP => 66 rw [mul_smul, mul_smul, hP] 67 congr 1 68 change sourceTotal0LinearEquivOrderAssociatedGraded k n N d hd 69 (sourceAction k n N d hd 0 (MvPolynomial.X i) z) = _ 70 rw [sourceAction, commutingPolynomialAction_apply_X, 71 sourceEquiv_intertwines_generator] 72 exact (oldCoeffModule_oldSymbol_X_action n (Graded k n N d) i _).symm 73 74 theorem targetEquiv_map_smul (P : T k n) 75 (z : (complex k n N d hd).TargetTotal 0) : 76 targetTotal0LinearEquivOrderAssociatedGraded k n N d hd (P • z) = 77 P • targetTotal0LinearEquivOrderAssociatedGraded k n N d hd z := by 78 induction P using MvPolynomial.induction_on generalizing z with 79 | C c => 80 rw [graded_C_smul] 81 change targetTotal0LinearEquivOrderAssociatedGraded k n N d hd 82 (targetAction k n N d hd 0 (MvPolynomial.C c) z) = _ 83 rw [targetAction, commutingPolynomialAction_apply_C] 84 exact (targetTotal0LinearEquivOrderAssociatedGraded k n N d hd).map_smul c z 85 | add P Q hP hQ => simp only [add_smul, map_add, hP, hQ] 86 | mul_X P i hP => 87 rw [mul_smul, mul_smul, hP] 88 congr 1 89 change targetTotal0LinearEquivOrderAssociatedGraded k n N d hd 90 (targetAction k n N d hd 0 (MvPolynomial.X i) z) = _ 91 rw [targetAction, commutingPolynomialAction_apply_X, 92 targetEquiv_intertwines_generator] 93 exact (oldCoeffModule_oldSymbol_X_action n (Graded k n N d) i _).symm 94 95 def sourceGradedEquiv : 96 (complex k n N d hd).SourceTotal 0 ≃ₗ[T k n] Graded k n N d := 97 { (sourceTotal0LinearEquivOrderAssociatedGraded k n N d hd).toAddEquiv with 98 map_smul' := sourceEquiv_map_smul k n N d hd } 99 100 def targetGradedEquiv : 101 (complex k n N d hd).TargetTotal 0 ≃ₗ[T k n] Graded k n N d := 102 { (targetTotal0LinearEquivOrderAssociatedGraded k n N d hd).toAddEquiv with 103 map_smul' := targetEquiv_map_smul k n N d hd } 104 105 #print axioms sourceGradedEquiv 106 #print axioms targetGradedEquiv 107 108 theorem gradedEquiv_drop (z : (complex k n N d hd).SourceTotal 0) : 109 targetGradedEquiv k n N d hd (tangentialDrop k n N d hd 0 z) = 110 oldCoordinateMap (k := k) n (Graded k n N d) (sourceGradedEquiv k n N d hd z) := 111 totalDrop_zero_intertwines_coordinate k n N d hd z 112 113 def zeroDropKernelEquiv : 114 (tangentialDrop k n N d hd 0).ker ≃ₗ[T k n] 115 (oldCoordinateMap (k := k) n (Graded k n N d)).ker := 116 LinearEquiv.ofBijective 117 ((sourceGradedEquiv k n N d hd).toLinearMap.domRestrict 118 (tangentialDrop k n N d hd 0).ker |>.codRestrict 119 (oldCoordinateMap (k := k) n (Graded k n N d)).ker (fun z => by 120 exact LinearMap.mem_ker.mpr (by 121 change oldCoordinateMap (k := k) n (Graded k n N d) 122 (sourceGradedEquiv k n N d hd z.val) = 0 123 rw [← gradedEquiv_drop] 124 simp only [LinearMap.mem_ker.mp z.property, map_zero]))) 125 (by 126 constructor 127 · intro a b hab 128 exact Subtype.ext ((sourceGradedEquiv k n N d hd).injective 129 (congrArg Subtype.val hab)) 130 · intro z 131 refine ⟨⟨(sourceGradedEquiv k n N d hd).symm z, ?_⟩, 132 Subtype.ext ((sourceGradedEquiv k n N d hd).apply_symm_apply z)⟩ 133 apply LinearMap.mem_ker.mpr 134 apply (targetGradedEquiv k n N d hd).injective 135 rw [gradedEquiv_drop, LinearEquiv.apply_symm_apply, map_zero] 136 exact LinearMap.mem_ker.mp z.property) 137 138 theorem targetGradedEquiv_range : 139 Submodule.map (targetGradedEquiv k n N d hd).toLinearMap 140 (tangentialDrop k n N d hd 0).range = 141 (oldCoordinateMap (k := k) n (Graded k n N d)).range := by 142 ext z 143 constructor 144 · rintro ⟨_, ⟨a, rfl⟩, rfl⟩ 145 exact ⟨sourceGradedEquiv k n N d hd a, (gradedEquiv_drop k n N d hd a).symm⟩ 146 · rintro ⟨a, rfl⟩ 147 refine ⟨tangentialDrop k n N d hd 0 ((sourceGradedEquiv k n N d hd).symm a), 148 ⟨(sourceGradedEquiv k n N d hd).symm a, rfl⟩, ?_⟩ 149 simpa only [LinearEquiv.coe_toLinearMap, gradedEquiv_drop, 150 LinearEquiv.apply_symm_apply] 151 152 def zeroDropCokernelEquiv : 153 ((complex k n N d hd).TargetTotal 0 ⧸ (tangentialDrop k n N d hd 0).range) 154 ≃ₗ[T k n] (Graded k n N d ⧸ (oldCoordinateMap (k := k) n (Graded k n N d)).range) := 155 Submodule.Quotient.equiv _ _ (targetGradedEquiv k n N d hd) 156 (targetGradedEquiv_range k n N d hd) 157 158 def firstSourceGradedKernelEquiv : 159 (complex k n N d hd).SourceTotal 1 ≃ₗ[T k n] 160 (oldCoordinateMap (k := k) n (Graded k n N d)).ker := 161 tangentialSourceSuccEquiv k n N d hd 0 ≪≫ₗ zeroDropKernelEquiv k n N d hd 162 163 def firstTargetGradedCokernelEquiv : 164 (complex k n N d hd).TargetTotal 1 ≃ₗ[T k n] 165 (Graded k n N d ⧸ (oldCoordinateMap (k := k) n (Graded k n N d)).range) := 166 tangentialTargetSuccEquiv k n N d hd 0 ≪≫ₗ zeroDropCokernelEquiv k n N d hd 167 168 theorem first_pages_finite : 169 Module.Finite (T k n) ((complex k n N d hd).SourceTotal 1) ∧ 170 Module.Finite (T k n) ((complex k n N d hd).TargetTotal 1) := by 171 have hf := canonical_finite_old_coordinate_kernel_cokernel hd 172 haveI : Module.Finite (T k n) 173 (oldCoordinateMap (k := k) n (Graded k n N d)).ker := hf.1 174 haveI : Module.Finite (T k n) 175 (Graded k n N d ⧸ (oldCoordinateMap (k := k) n (Graded k n N d)).range) := hf.2 176 exact ⟨Module.Finite.equiv (firstSourceGradedKernelEquiv k n N d hd).symm, 177 Module.Finite.equiv (firstTargetGradedCokernelEquiv k n N d hd).symm⟩ 178 179 #print axioms firstSourceGradedKernelEquiv 180 #print axioms firstTargetGradedCokernelEquiv 181 #print axioms first_pages_finite 182 183 end 184 end Stafford38.Characteristic.CanonicalGradedTangentialEquivalences 185