This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 public import AlgebraicAnalysis.Ore.Associativity 3 public import Stafford38.Weyl.PBWMonicBridge 4 5 @[expose] public section 6 7 /-! 8 # PBW monicity as concrete outer-Ore monicity 9 10 The successor-rank iterated Weyl tower is an outer Ore extension in the newest 11 momentum. This file exposes its concrete coefficient-left polynomial, proves 12 the exact coefficient formula relating the nested PBW normal form to that 13 polynomial, and turns the checked PBW coefficient-one bound into 14 `Polynomial.Monic`. 15 -/ 16 17 namespace Stafford38.WeylOuterOreMonic 18 19 open AlgebraicAnalysis.OreDivision 20 open Stafford38.Characteristic 21 open AlgebraicAnalysis.OreAssociativity 22 open Stafford38.OreCoordinateStage 23 open Stafford38.OreIteratedPairStage 24 open Stafford38.OrePairStage 25 open Stafford38.OreLinearNormalForm 26 open Stafford38.OreScalarAlgebra 27 open Stafford38.WeylIteratedEquivalence 28 open Stafford38.WeylPBW 29 open Stafford38.WeylPBWMonicBridge 30 open Stafford38.WeylFiltration 31 32 noncomputable section 33 universe u 34 variable (k : Type u) [Field k] 35 36 local instance (n : ℕ) : Algebra k (IteratedPairStage k n) := 37 iteratedPairStageAlgebra k n 38 39 local instance (n : ℕ) : 40 Algebra k (CoordinateStage (B := IteratedPairStage k n)) := 41 coordinateStageAlgebra 42 43 local instance (n : ℕ) : 44 Algebra k (PairStage (B := IteratedPairStage k n)) := 45 pairStageAlgebra 46 47 def presentedOuterPolynomial (n : ℕ) (d : PresentedWeyl k (n + 1)) : 48 Polynomial (CoordinateStage (B := IteratedPairStage k n)) := 49 (normalFormAddEquiv 50 (coordinateDerivation : 51 AlgebraicAnalysis.OreDivisionDerivation 52 (CoordinateStage (B := IteratedPairStage k n)))).symm 53 (presentedToIterated k (n + 1) d) 54 55 def coordinateCoefficientNormalForm (n : ℕ) : 56 CoordinateStage (B := IteratedPairStage k n) ≃ₗ[k] 57 Polynomial (SymbolRing k n) := by 58 letI : Algebra k (IteratedPairStage k n) := iteratedPairStageAlgebra k n 59 letI : Algebra k (CoordinateStage (B := IteratedPairStage k n)) := 60 coordinateStageAlgebra 61 exact (normalFormLinearEquiv zeroDerivation 62 (normalOreAlgebra_algebraMap zeroDerivation (fun c => by 63 exact zeroDerivation_apply (algebraMap k (IteratedPairStage k n) c)))).symm.trans 64 (polynomialMapRangeLinearEquiv (iteratedNormalFormLinearEquiv k n)) 65 66 def presentedNestedNormalForm (n : ℕ) (d : PresentedWeyl k (n + 1)) : 67 Polynomial (Polynomial (SymbolRing k n)) := by 68 letI : Algebra k (IteratedPairStage k n) := iteratedPairStageAlgebra k n 69 letI : Algebra k (CoordinateStage (B := IteratedPairStage k n)) := 70 coordinateStageAlgebra 71 letI : Algebra k (PairStage (B := IteratedPairStage k n)) := 72 pairStageAlgebra 73 exact pairNormalFormLinearEquiv 74 (normalOreAlgebra_algebraMap zeroDerivation (fun c => by 75 exact zeroDerivation_apply (algebraMap k (IteratedPairStage k n) c))) 76 (normalOreAlgebra_algebraMap coordinateDerivation 77 coordinateDerivation_algebraMap) 78 (iteratedNormalFormLinearEquiv k n) 79 (presentedToIterated k (n + 1) d) 80 81 theorem flatten_presentedNestedNormalForm (n : ℕ) 82 (d : PresentedWeyl k (n + 1)) : 83 flattenPairSymbols k n (presentedNestedNormalForm k n d) = 84 presentedNormalFormLinearEquiv k (n + 1) d := by 85 rfl 86 87 theorem presentedNestedNormalForm_eq_mapRange (n : ℕ) 88 (d : PresentedWeyl k (n + 1)) : 89 presentedNestedNormalForm k n d = 90 polynomialMapRangeLinearEquiv (coordinateCoefficientNormalForm k n) 91 (presentedOuterPolynomial k n d) := by 92 rfl 93 94 def pairExponent (n a p : ℕ) (m : PhaseVar n →₀ ℕ) : 95 PhaseVar (n + 1) →₀ ℕ := 96 Finsupp.single (.inr (0 : Fin (n + 1))) p + 97 Finsupp.single (.inl (0 : Fin (n + 1))) a + 98 Finsupp.mapDomain oldIndex m 99 100 @[simp] theorem mapDomain_oldIndex_newCoordinate (n : ℕ) 101 (m : PhaseVar n →₀ ℕ) : 102 Finsupp.mapDomain oldIndex m (.inl (0 : Fin (n + 1))) = 0 := by 103 rw [Finsupp.mapDomain_of_notMem_range] 104 rintro ⟨i, hi⟩ 105 cases i with 106 | inl j => exact Fin.succ_ne_zero j (Sum.inl.inj hi) 107 | inr j => simp [oldIndex] at hi 108 109 @[simp] theorem mapDomain_oldIndex_newMomentum (n : ℕ) 110 (m : PhaseVar n →₀ ℕ) : 111 Finsupp.mapDomain oldIndex m (.inr (0 : Fin (n + 1))) = 0 := by 112 rw [Finsupp.mapDomain_of_notMem_range] 113 rintro ⟨i, hi⟩ 114 cases i with 115 | inl j => simp [oldIndex] at hi 116 | inr j => exact Fin.succ_ne_zero j (Sum.inr.inj hi) 117 118 theorem coeff_flattenPairSymbols_monomial (n a p a' p' : ℕ) 119 (m : PhaseVar n →₀ ℕ) (r : SymbolRing k n) : 120 AddMonoidAlgebra.coeff 121 (flattenPairSymbols k n 122 (Polynomial.monomial p' (Polynomial.monomial a' r))) 123 (pairExponent n a p m) = 124 if p' = p ∧ a' = a then AddMonoidAlgebra.coeff r m else 0 := by 125 rw [flattenPairSymbols_monomial] 126 rw [MvPolynomial.X_pow_eq_monomial, MvPolynomial.X_pow_eq_monomial, 127 MvPolynomial.monomial_mul, mul_one] 128 have hcoeff := MvPolynomial.coeff_monomial_mul' 129 (pairExponent n a p m) 130 (Finsupp.single (.inr (0 : Fin (n + 1))) p' + 131 Finsupp.single (.inl (0 : Fin (n + 1))) a') 132 (1 : k) (MvPolynomial.rename oldIndex r) 133 rw [hcoeff] 134 classical 135 by_cases hp : p' = p 136 · subst p' 137 by_cases ha : a' = a 138 · subst a' 139 have hle : 140 (Finsupp.single (.inr (0 : Fin (n + 1))) p + 141 Finsupp.single (.inl (0 : Fin (n + 1))) a) ≤ 142 pairExponent n a p m := by 143 intro i 144 simp only [pairExponent, Finsupp.add_apply] 145 omega 146 rw [if_pos hle] 147 have hsub : 148 (pairExponent n a p m - 149 (Finsupp.single (.inr (0 : Fin (n + 1))) p + 150 Finsupp.single (.inl (0 : Fin (n + 1))) a)) = 151 Finsupp.mapDomain oldIndex m := by 152 rw [pairExponent] 153 exact add_tsub_cancel_left _ _ 154 rw [hsub, MvPolynomial.coeff_rename_mapDomain oldIndex oldIndex_injective] 155 simp 156 · by_cases hle : 157 ((Finsupp.single (.inr (0 : Fin (n + 1))) p + 158 Finsupp.single (.inl (0 : Fin (n + 1))) a') ≤ 159 pairExponent n a p m) 160 · rw [if_pos hle] 161 have haa : a' ≤ a := by 162 simpa [pairExponent, Finsupp.single_apply] using 163 hle (.inl (0 : Fin (n + 1))) 164 have hz : (MvPolynomial.rename oldIndex r).coeff 165 ((pairExponent n a p m) - 166 (Finsupp.single (.inr (0 : Fin (n + 1))) p + 167 Finsupp.single (.inl (0 : Fin (n + 1))) a')) = 0 := by 168 apply MvPolynomial.coeff_rename_eq_zero 169 intro u hu 170 have hnew := DFunLike.congr_fun hu (.inl (0 : Fin (n + 1))) 171 simp [pairExponent] at hnew 172 omega 173 change MvPolynomial.coeff 174 (pairExponent n a p m - 175 (Finsupp.single (.inr (0 : Fin (n + 1))) p + 176 Finsupp.single (.inl (0 : Fin (n + 1))) a')) 177 (MvPolynomial.rename oldIndex r) = 0 at hz 178 change 1 * MvPolynomial.coeff 179 (pairExponent n a p m - 180 (Finsupp.single (.inr (0 : Fin (n + 1))) p + 181 Finsupp.single (.inl (0 : Fin (n + 1))) a')) 182 (MvPolynomial.rename oldIndex r) = _ 183 rw [hz] 184 simp [ha] 185 · rw [if_neg hle] 186 simp [ha] 187 · by_cases hle : 188 ((Finsupp.single (.inr (0 : Fin (n + 1))) p' + 189 Finsupp.single (.inl (0 : Fin (n + 1))) a') ≤ 190 pairExponent n a p m) 191 · rw [if_pos hle] 192 have hpp : p' ≤ p := by 193 simpa [pairExponent, Finsupp.single_apply] using 194 hle (.inr (0 : Fin (n + 1))) 195 have hz : (MvPolynomial.rename oldIndex r).coeff 196 ((pairExponent n a p m) - 197 (Finsupp.single (.inr (0 : Fin (n + 1))) p' + 198 Finsupp.single (.inl (0 : Fin (n + 1))) a')) = 0 := by 199 apply MvPolynomial.coeff_rename_eq_zero 200 intro u hu 201 have hnew := DFunLike.congr_fun hu (.inr (0 : Fin (n + 1))) 202 simp [pairExponent] at hnew 203 omega 204 change MvPolynomial.coeff 205 (pairExponent n a p m - 206 (Finsupp.single (.inr (0 : Fin (n + 1))) p' + 207 Finsupp.single (.inl (0 : Fin (n + 1))) a')) 208 (MvPolynomial.rename oldIndex r) = 0 at hz 209 change 1 * MvPolynomial.coeff 210 (pairExponent n a p m - 211 (Finsupp.single (.inr (0 : Fin (n + 1))) p' + 212 Finsupp.single (.inl (0 : Fin (n + 1))) a')) 213 (MvPolynomial.rename oldIndex r) = _ 214 rw [hz] 215 simp [hp] 216 · rw [if_neg hle] 217 simp [hp] 218 219 theorem coeff_flattenPairSymbols (n a p : ℕ) 220 (m : PhaseVar n →₀ ℕ) 221 (q : Polynomial (Polynomial (SymbolRing k n))) : 222 AddMonoidAlgebra.coeff (flattenPairSymbols k n q) 223 (pairExponent n a p m) = 224 AddMonoidAlgebra.coeff ((q.coeff p).coeff a) m := by 225 induction q using Polynomial.induction_on' with 226 | add q₁ q₂ h₁ h₂ => 227 change AddMonoidAlgebra.coeff (flattenPairSymbols k n q₁) 228 (pairExponent n a p m) = 229 AddMonoidAlgebra.coeff ((q₁.coeff p).coeff a) m at h₁ 230 change AddMonoidAlgebra.coeff (flattenPairSymbols k n q₂) 231 (pairExponent n a p m) = 232 AddMonoidAlgebra.coeff ((q₂.coeff p).coeff a) m at h₂ 233 calc 234 AddMonoidAlgebra.coeff (flattenPairSymbols k n (q₁ + q₂)) 235 (pairExponent n a p m) = 236 AddMonoidAlgebra.coeff (flattenPairSymbols k n q₁) 237 (pairExponent n a p m) + 238 AddMonoidAlgebra.coeff (flattenPairSymbols k n q₂) 239 (pairExponent n a p m) := by 240 rw [map_add, AddMonoidAlgebra.coeff_add, Finsupp.add_apply] 241 _ = AddMonoidAlgebra.coeff ((q₁.coeff p).coeff a) m + 242 AddMonoidAlgebra.coeff ((q₂.coeff p).coeff a) m := by rw [h₁, h₂] 243 _ = AddMonoidAlgebra.coeff (((q₁ + q₂).coeff p).coeff a) m := by 244 rw [Polynomial.coeff_add, Polynomial.coeff_add] 245 exact (Finsupp.add_apply 246 (AddMonoidAlgebra.coeff ((q₁.coeff p).coeff a)) 247 (AddMonoidAlgebra.coeff ((q₂.coeff p).coeff a)) m).symm 248 | monomial p' r => 249 induction r using Polynomial.induction_on' with 250 | add r₁ r₂ h₁ h₂ => 251 change AddMonoidAlgebra.coeff 252 (flattenPairSymbols k n (Polynomial.monomial p' r₁)) 253 (pairExponent n a p m) = 254 AddMonoidAlgebra.coeff 255 (((Polynomial.monomial p' r₁).coeff p).coeff a) m at h₁ 256 change AddMonoidAlgebra.coeff 257 (flattenPairSymbols k n (Polynomial.monomial p' r₂)) 258 (pairExponent n a p m) = 259 AddMonoidAlgebra.coeff 260 (((Polynomial.monomial p' r₂).coeff p).coeff a) m at h₂ 261 rw [map_add (Polynomial.monomial p') r₁ r₂] 262 simp only [map_add, AddMonoidAlgebra.coeff_add, 263 Finsupp.add_apply, Polynomial.coeff_monomial, Polynomial.coeff_add] 264 by_cases hp : p' = p 265 · subst p' 266 simp [h₁, h₂] 267 · rw [h₁, h₂] 268 simp [Polynomial.coeff_monomial, hp] 269 | monomial a' s => 270 rw [coeff_flattenPairSymbols_monomial] 271 simp only [Polynomial.coeff_monomial] 272 by_cases hp : p' = p 273 · subst p' 274 by_cases ha : a' = a 275 · subst a' 276 simp 277 · simp [Polynomial.coeff_monomial, ha] 278 · simp [hp] 279 280 theorem coeff_polynomialMapRangeLinearEquiv 281 {R S : Type*} [Semiring R] [Semiring S] 282 [Algebra k R] [Algebra k S] (e : R ≃ₗ[k] S) 283 (q : Polynomial R) (p : ℕ) : 284 (polynomialMapRangeLinearEquiv e q).coeff p = e (q.coeff p) := by 285 induction q using Polynomial.induction_on' with 286 | add q₁ q₂ h₁ h₂ => simp [map_add, h₁, h₂] 287 | monomial n r => 288 rw [polynomialMapRangeLinearEquiv_monomial] 289 by_cases h : n = p <;> simp [Polynomial.coeff_monomial, h] 290 291 @[simp] theorem degree_pairExponent (n a p : ℕ) 292 (m : PhaseVar n →₀ ℕ) : 293 (pairExponent n a p m).degree = 294 p + a + (Finsupp.mapDomain oldIndex m).degree := by 295 simp [pairExponent] 296 297 @[simp] theorem pairExponent_newMomentum (n a p : ℕ) 298 (m : PhaseVar n →₀ ℕ) : 299 pairExponent n a p m (.inr (0 : Fin (n + 1))) = p := by 300 simp [pairExponent] 301 302 theorem nested_coeff_eq_zero_of_outer_exponent_gt (n N : ℕ) 303 {d : PresentedWeyl k (n + 1)} 304 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 305 {p : ℕ} (hp : N < p) : 306 (presentedNestedNormalForm k n d).coeff p = 0 := by 307 ext a m 308 simp only [Polynomial.coeff_zero] 309 change AddMonoidAlgebra.coeff 310 (((presentedNestedNormalForm k n d).coeff p).coeff a) m = 0 311 rw [← coeff_flattenPairSymbols k n a p m] 312 rw [flatten_presentedNestedNormalForm] 313 exact coeff_normalForm_eq_zero_of_exponent_gt k 314 (t := .inr (0 : Fin (n + 1))) (m := pairExponent n a p m) 315 hd.1 (by simpa using hp) 316 317 theorem nested_coeff_eq_one_at_bound (n N : ℕ) 318 {d : PresentedWeyl k (n + 1)} 319 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) : 320 (presentedNestedNormalForm k n d).coeff N = 1 := by 321 ext a m 322 change AddMonoidAlgebra.coeff 323 (((presentedNestedNormalForm k n d).coeff N).coeff a) m = 324 AddMonoidAlgebra.coeff ((1 : Polynomial (SymbolRing k n)).coeff a) m 325 rw [← coeff_flattenPairSymbols k n a N m] 326 rw [flatten_presentedNestedNormalForm] 327 by_cases ha : a = 0 328 · subst a 329 by_cases hm : m = 0 330 · subst m 331 simpa [pairExponent] using hd.2 332 · have hmap : Finsupp.mapDomain oldIndex m ≠ 0 := by 333 exact (Finsupp.mapDomain_injective oldIndex_injective).ne hm 334 have hdegree : N < (pairExponent n 0 N m).degree := by 335 rw [degree_pairExponent] 336 have hpos : 0 < (Finsupp.mapDomain oldIndex m).degree := by 337 exact Nat.pos_of_ne_zero 338 ((Finsupp.degree_eq_zero_iff _).not.mpr hmap) 339 omega 340 have hz : (presentedNormalFormLinearEquiv k (n + 1) d).coeff 341 (pairExponent n 0 N m) = 0 := by 342 by_contra hc 343 have hle := (mem_presentedWeightPiece k (@bernsteinWeight (n + 1)) N d).mp 344 hd.1 (pairExponent n 0 N m) hc 345 have : (pairExponent n 0 N m).degree ≤ N := by 346 change (pairExponent n 0 N m).sum (fun _ e => e) ≤ N 347 simpa [monomialWeight, bernsteinWeight] using hle 348 omega 349 change MvPolynomial.coeff (pairExponent n 0 N m) 350 (presentedNormalFormLinearEquiv k (n + 1) d) = _ 351 rw [hz] 352 simp [Polynomial.coeff_one, MvPolynomial.coeff_one, Ne.symm hm] 353 · have hdegree : N < (pairExponent n a N m).degree := by 354 rw [degree_pairExponent] 355 omega 356 have hz : (presentedNormalFormLinearEquiv k (n + 1) d).coeff 357 (pairExponent n a N m) = 0 := by 358 by_contra hc 359 have hle := (mem_presentedWeightPiece k (@bernsteinWeight (n + 1)) N d).mp 360 hd.1 (pairExponent n a N m) hc 361 have : (pairExponent n a N m).degree ≤ N := by 362 change (pairExponent n a N m).sum (fun _ e => e) ≤ N 363 simpa [monomialWeight, bernsteinWeight] using hle 364 omega 365 change MvPolynomial.coeff (pairExponent n a N m) 366 (presentedNormalFormLinearEquiv k (n + 1) d) = _ 367 rw [hz] 368 simp [Polynomial.coeff_one, ha] 369 370 theorem presentedNestedNormalForm_coeff (n p : ℕ) 371 (d : PresentedWeyl k (n + 1)) : 372 (presentedNestedNormalForm k n d).coeff p = 373 coordinateCoefficientNormalForm k n 374 ((presentedOuterPolynomial k n d).coeff p) := by 375 rw [presentedNestedNormalForm_eq_mapRange, 376 coeff_polynomialMapRangeLinearEquiv] 377 378 theorem coordinateCoefficientNormalForm_one (n : ℕ) : 379 coordinateCoefficientNormalForm k n 1 = 1 := by 380 change polynomialMapRangeLinearEquiv (iteratedNormalFormLinearEquiv k n) 381 ((normalFormLinearEquiv zeroDerivation _).symm 1) = 1 382 rw [normalFormLinearEquiv_symm_one] 383 exact polynomialMapRangeLinearEquiv_one _ (iteratedNormalFormLinearEquiv_one k n) 384 385 theorem outer_coeff_eq_one_at_bound (n N : ℕ) 386 {d : PresentedWeyl k (n + 1)} 387 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) : 388 (presentedOuterPolynomial k n d).coeff N = 1 := by 389 have h := nested_coeff_eq_one_at_bound k n N hd 390 rw [presentedNestedNormalForm_coeff] at h 391 apply (coordinateCoefficientNormalForm k n).injective 392 rw [h, coordinateCoefficientNormalForm_one] 393 394 theorem outer_coeff_eq_zero_of_exponent_gt (n N : ℕ) 395 {d : PresentedWeyl k (n + 1)} 396 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) 397 {p : ℕ} (hp : N < p) : 398 (presentedOuterPolynomial k n d).coeff p = 0 := by 399 have h := nested_coeff_eq_zero_of_outer_exponent_gt k n N hd hp 400 rw [presentedNestedNormalForm_coeff] at h 401 apply (coordinateCoefficientNormalForm k n).injective 402 exact h.trans (LinearMap.map_zero (coordinateCoefficientNormalForm k n).toLinearMap).symm 403 404 theorem presentedOuterPolynomial_monic (n N : ℕ) 405 {d : PresentedWeyl k (n + 1)} 406 (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) : 407 (presentedOuterPolynomial k n d).Monic := by 408 apply Polynomial.monic_of_degree_le N 409 · rw [Polynomial.degree_le_iff_coeff_zero] 410 intro p hp 411 exact outer_coeff_eq_zero_of_exponent_gt k n N hd (by simpa using hp) 412 · exact outer_coeff_eq_one_at_bound k n N hd 413 414 /- Exact declaration and trust-boundary report. -/ 415 #print axioms presentedOuterPolynomial 416 #print axioms coordinateCoefficientNormalForm 417 #print axioms presentedNestedNormalForm 418 #print axioms flatten_presentedNestedNormalForm 419 #print axioms coeff_flattenPairSymbols 420 #print axioms nested_coeff_eq_zero_of_outer_exponent_gt 421 #print axioms nested_coeff_eq_one_at_bound 422 #print axioms outer_coeff_eq_one_at_bound 423 #print axioms outer_coeff_eq_zero_of_exponent_gt 424 #print axioms presentedOuterPolynomial_monic 425 426 end 427 end Stafford38.WeylOuterOreMonic 428