This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 public import AlgebraicAnalysis.Ore.Associativity 3 public import Stafford38.Ore.IteratedPairStage 4 public import Stafford38.Ore.PairUniversal 5 public import Stafford38.Weyl.Universal 6 public import Stafford38.ChallengeDefinitions 7 8 @[expose] public section 9 10 /-! 11 # The presented Weyl algebra maps to the iterated Ore construction 12 13 This file constructs mutually inverse algebra maps between the quotient 14 presentation and the recursively iterated `PairStage`. The proof uses only 15 the two checked universal properties; it does not assume a PBW theorem for 16 the quotient presentation. 17 -/ 18 19 namespace Stafford38.WeylIteratedEquivalence 20 21 open Stafford 22 open AlgebraicAnalysis 23 open Stafford38.OrePairStage 24 open Stafford38.OrePairUniversal 25 open Stafford38.OreIteratedPairStage 26 open Stafford38.WeylUniversal 27 28 noncomputable section 29 30 universe u 31 32 variable (k : Type u) [Field k] 33 34 /-- The scalar algebra structure inherited recursively by the iterated Ore 35 tower. -/ 36 def iteratedPairStageAlgebra : 37 (n : Nat) → Algebra k (IteratedPairStage k n) 38 | 0 => by 39 change Algebra k k 40 infer_instance 41 | n + 1 => by 42 letI : Algebra k (IteratedPairStage k n) := 43 iteratedPairStageAlgebra n 44 change Algebra k (PairStage (B := IteratedPairStage k n)) 45 exact pairStageAlgebra 46 47 instance (n : Nat) : Algebra k (IteratedPairStage k n) := 48 iteratedPairStageAlgebra k n 49 50 /-- The canonical successor embedding as a scalar-preserving algebra map. -/ 51 def stageAlgHom (n : Nat) : 52 IteratedPairStage k n →ₐ[k] IteratedPairStage k (n + 1) where 53 toRingHom := stageEmbedding k n 54 commutes' c := by 55 change pairCoefficient (algebraMap k (IteratedPairStage k n) c) = 56 @algebraMap k (PairStage (B := IteratedPairStage k n)) _ _ 57 (pairStageAlgebra (k := k) (B := IteratedPairStage k n)) c 58 rw [pairStageAlgebra_algebraMap 59 (k := k) (B := IteratedPairStage k n)] 60 rfl 61 62 /-- Coordinates in the final stage, ordered from newest to oldest. -/ 63 def iteratedCoordinate : 64 (n : Nat) → Fin n → IteratedPairStage k n 65 | 0, i => Fin.elim0 i 66 | n + 1, i => 67 Fin.cases (stageCoordinate k n) 68 (fun j => stageAlgHom k n (iteratedCoordinate n j)) i 69 70 /-- Momenta in the final stage, ordered from newest to oldest. -/ 71 def iteratedMomentum : 72 (n : Nat) → Fin n → IteratedPairStage k n 73 | 0, i => Fin.elim0 i 74 | n + 1, i => 75 Fin.cases (stageMomentum k n) 76 (fun j => stageAlgHom k n (iteratedMomentum n j)) i 77 78 /-- The combined coordinate-momentum generator family. -/ 79 def iteratedGenerator (n : Nat) : 80 (Fin n ⊕ Fin n) → IteratedPairStage k n := 81 Sum.elim (iteratedCoordinate k n) (iteratedMomentum k n) 82 83 @[simp] theorem iteratedCoordinate_zero (n : Nat) : 84 iteratedCoordinate k (n + 1) 0 = stageCoordinate k n := rfl 85 86 @[simp] theorem iteratedCoordinate_succ (n : Nat) (i : Fin n) : 87 iteratedCoordinate k (n + 1) i.succ = 88 stageAlgHom k n (iteratedCoordinate k n i) := rfl 89 90 @[simp] theorem iteratedMomentum_zero (n : Nat) : 91 iteratedMomentum k (n + 1) 0 = stageMomentum k n := rfl 92 93 @[simp] theorem iteratedMomentum_succ (n : Nat) (i : Fin n) : 94 iteratedMomentum k (n + 1) i.succ = 95 stageAlgHom k n (iteratedMomentum k n i) := rfl 96 97 theorem map_commutator {A C : Type*} [Ring A] [Ring C] 98 (f : A →+* C) (a b : A) : 99 f (commutator a b) = commutator (f a) (f b) := by 100 simp [AlgebraicAnalysis.ringCommutator] 101 102 theorem commutator_swap {A : Type*} [Ring A] (a b : A) : 103 commutator b a = -commutator a b := by 104 simp [AlgebraicAnalysis.ringCommutator] 105 106 /-- An element commuting with the image of every presented Weyl generator 107 commutes with the image of the whole presented algebra. -/ 108 theorem commutes_freeWeyl_image_of_generators 109 {ι A : Type*} [Ring A] [Algebra k A] 110 (omega : Matrix ι ι k) 111 (f : FreeWeyl k ι omega →ₐ[k] A) (a : A) 112 (h : ∀ i, a * f (freeWeylGenerator omega i) = 113 f (freeWeylGenerator omega i) * a) : 114 ∀ w, a * f w = f w * a := by 115 intro w 116 rcases RingQuot.mkAlgHom_surjective k (freeWeylRelation omega) w with 117 ⟨q, rfl⟩ 118 let g : FreeAlgebra k ι →ₐ[k] A := 119 f.comp (RingQuot.mkAlgHom k (freeWeylRelation omega)) 120 change a * g q = g q * a 121 induction q using FreeAlgebra.induction k ι with 122 | grade0 c => 123 rw [g.commutes] 124 exact (Algebra.commutes c a).symm 125 | grade1 i => 126 change a * f (freeWeylGenerator omega i) = 127 f (freeWeylGenerator omega i) * a 128 exact h i 129 | mul u v hu hv => 130 rw [map_mul] 131 calc 132 a * (g u * g v) = (a * g u) * g v := by rw [mul_assoc] 133 _ = (g u * a) * g v := by rw [hu] 134 _ = g u * (a * g v) := by rw [mul_assoc] 135 _ = g u * (g v * a) := by rw [hv] 136 _ = (g u * g v) * a := by rw [mul_assoc] 137 | add u v hu hv => 138 rw [map_add, mul_add, add_mul, hu, hv] 139 140 /-- All recursively adjoined coordinates commute. -/ 141 theorem iteratedCoordinate_commutator (n : Nat) : 142 ∀ i j : Fin n, 143 commutator (iteratedCoordinate k n i) (iteratedCoordinate k n j) = 0 := by 144 induction n with 145 | zero => 146 intro i 147 exact Fin.elim0 i 148 | succ n ih => 149 intro i j 150 refine Fin.cases ?_ (fun i => ?_) i 151 · refine Fin.cases ?_ (fun j => ?_) j 152 · simp [AlgebraicAnalysis.ringCommutator] 153 · simp only [iteratedCoordinate_zero, iteratedCoordinate_succ] 154 exact sub_eq_zero.mpr (stageCoordinate_mul_embedding k n _) 155 · refine Fin.cases ?_ (fun j => ?_) j 156 · simp only [iteratedCoordinate_zero, iteratedCoordinate_succ] 157 exact sub_eq_zero.mpr (stageCoordinate_mul_embedding k n _).symm 158 · simp only [iteratedCoordinate_succ] 159 calc 160 commutator 161 (stageAlgHom k n (iteratedCoordinate k n i)) 162 (stageAlgHom k n (iteratedCoordinate k n j)) = 163 stageAlgHom k n 164 (commutator (iteratedCoordinate k n i) 165 (iteratedCoordinate k n j)) := 166 (map_commutator (stageAlgHom k n).toRingHom _ _).symm 167 _ = 0 := by rw [ih i j, map_zero] 168 169 /-- All recursively adjoined momenta commute. -/ 170 theorem iteratedMomentum_commutator (n : Nat) : 171 ∀ i j : Fin n, 172 commutator (iteratedMomentum k n i) (iteratedMomentum k n j) = 0 := by 173 induction n with 174 | zero => 175 intro i 176 exact Fin.elim0 i 177 | succ n ih => 178 intro i j 179 refine Fin.cases ?_ (fun i => ?_) i 180 · refine Fin.cases ?_ (fun j => ?_) j 181 · simp [AlgebraicAnalysis.ringCommutator] 182 · simp only [iteratedMomentum_zero, iteratedMomentum_succ] 183 exact sub_eq_zero.mpr (stageMomentum_mul_embedding k n _) 184 · refine Fin.cases ?_ (fun j => ?_) j 185 · simp only [iteratedMomentum_zero, iteratedMomentum_succ] 186 exact sub_eq_zero.mpr (stageMomentum_mul_embedding k n _).symm 187 · simp only [iteratedMomentum_succ] 188 calc 189 commutator 190 (stageAlgHom k n (iteratedMomentum k n i)) 191 (stageAlgHom k n (iteratedMomentum k n j)) = 192 stageAlgHom k n 193 (commutator (iteratedMomentum k n i) 194 (iteratedMomentum k n j)) := 195 (map_commutator (stageAlgHom k n).toRingHom _ _).symm 196 _ = 0 := by rw [ih i j, map_zero] 197 198 /-- Coordinate-momentum commutators are the negative Kronecker delta, in 199 the convention used by `Matrix.J`. -/ 200 theorem iteratedCoordinate_momentum_commutator (n : Nat) : 201 ∀ i j : Fin n, 202 commutator (iteratedCoordinate k n i) (iteratedMomentum k n j) = 203 if i = j then -1 else 0 := by 204 induction n with 205 | zero => 206 intro i 207 exact Fin.elim0 i 208 | succ n ih => 209 intro i j 210 refine Fin.cases ?_ (fun i => ?_) i 211 · refine Fin.cases ?_ (fun j => ?_) j 212 · change stageCoordinate k n * stageMomentum k n - 213 stageMomentum k n * stageCoordinate k n = -1 214 rw [stageMomentum_mul_coordinate] 215 noncomm_ring 216 · simp only [iteratedCoordinate_zero, iteratedMomentum_succ] 217 exact sub_eq_zero.mpr (stageCoordinate_mul_embedding k n _) 218 · refine Fin.cases ?_ (fun j => ?_) j 219 · simp only [iteratedCoordinate_succ, iteratedMomentum_zero] 220 simp only [Fin.succ_ne_zero, ↓reduceIte] 221 exact sub_eq_zero.mpr (stageMomentum_mul_embedding k n _).symm 222 · simp only [iteratedCoordinate_succ, iteratedMomentum_succ] 223 calc 224 commutator 225 (stageAlgHom k n (iteratedCoordinate k n i)) 226 (stageAlgHom k n (iteratedMomentum k n j)) = 227 stageAlgHom k n 228 (commutator (iteratedCoordinate k n i) 229 (iteratedMomentum k n j)) := 230 (map_commutator (stageAlgHom k n).toRingHom _ _).symm 231 _ = if i.succ = j.succ then -1 else 0 := by 232 rw [ih i j] 233 by_cases h : i = j <;> simp [h] 234 235 /-- The combined generator family realizes the standard symplectic 236 commutator matrix. -/ 237 theorem iteratedGenerator_commutator (n : Nat) : 238 ∀ a b : Fin n ⊕ Fin n, 239 commutator (iteratedGenerator k n a) (iteratedGenerator k n b) = 240 algebraMap k (IteratedPairStage k n) (Matrix.J (Fin n) k a b) := by 241 intro a b 242 cases a with 243 | inl i => 244 cases b with 245 | inl j => 246 change commutator (iteratedCoordinate k n i) 247 (iteratedCoordinate k n j) = _ 248 rw [iteratedCoordinate_commutator] 249 simp [Matrix.J] 250 | inr j => 251 change commutator (iteratedCoordinate k n i) 252 (iteratedMomentum k n j) = _ 253 rw [iteratedCoordinate_momentum_commutator] 254 by_cases h : i = j <;> simp [Matrix.J, h] 255 | inr i => 256 cases b with 257 | inl j => 258 change commutator (iteratedMomentum k n i) 259 (iteratedCoordinate k n j) = _ 260 rw [commutator_swap, 261 iteratedCoordinate_momentum_commutator] 262 by_cases h : j = i 263 · simp [Matrix.J, h] 264 · have hij : i ≠ j := fun e => h e.symm 265 simp [Matrix.J, h, hij] 266 | inr j => 267 change commutator (iteratedMomentum k n i) 268 (iteratedMomentum k n j) = _ 269 rw [iteratedMomentum_commutator] 270 simp [Matrix.J] 271 272 /-- The canonical map from the presented rank-`n` Weyl algebra to the 273 recursively iterated Ore construction. -/ 274 def presentedToIterated (n : Nat) : 275 FreeWeyl k (Fin n ⊕ Fin n) (Matrix.J (Fin n) k) →ₐ[k] 276 IteratedPairStage k n := 277 freeWeylLift (Matrix.J (Fin n) k) (iteratedGenerator k n) 278 (iteratedGenerator_commutator k n) 279 280 @[simp] theorem presentedToIterated_generator (n : Nat) 281 (i : Fin n ⊕ Fin n) : 282 presentedToIterated k n 283 (freeWeylGenerator (Matrix.J (Fin n) k) i) = 284 iteratedGenerator k n i := by 285 exact freeWeylLift_generator (Matrix.J (Fin n) k) 286 (iteratedGenerator k n) (iteratedGenerator_commutator k n) i 287 288 /-- The quotient presentation of the rank-`n` Weyl algebra. -/ 289 abbrev PresentedWeyl (n : Nat) := Stafford38Challenge.WeylAlg k n 290 291 /-- Insert an old index after the newly adjoined coordinate or momentum. -/ 292 abbrev oldIndex {n : Nat} : 293 (Fin n ⊕ Fin n) → (Fin (n + 1) ⊕ Fin (n + 1)) := 294 Stafford38FixedSourceChallenge.oldIndex 295 296 /-- The old rank-`n` generators inside the rank-`n+1` presentation. -/ 297 def oldGenerator (n : Nat) (i : Fin n ⊕ Fin n) : PresentedWeyl k (n + 1) := 298 freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (oldIndex i) 299 300 private theorem oldIndex_preserves_symplecticForm (n : Nat) 301 (i j : Fin n ⊕ Fin n) : 302 Matrix.J (Fin (n + 1)) k (oldIndex i) (oldIndex j) = 303 Matrix.J (Fin n) k i j := by 304 cases i with 305 | inl i => cases j with 306 | inl j => simp [oldIndex, Stafford38FixedSourceChallenge.oldIndex, Matrix.J] 307 | inr j => simp [oldIndex, Stafford38FixedSourceChallenge.oldIndex, Matrix.J, 308 Matrix.one_apply] 309 | inr i => cases j with 310 | inl j => simp [oldIndex, Stafford38FixedSourceChallenge.oldIndex, Matrix.J, 311 Matrix.one_apply] 312 | inr j => simp [oldIndex, Stafford38FixedSourceChallenge.oldIndex, Matrix.J] 313 314 theorem oldGenerator_commutator (n : Nat) (i j : Fin n ⊕ Fin n) : 315 commutator (oldGenerator k n i) (oldGenerator k n j) = 316 algebraMap k (PresentedWeyl k (n + 1)) (Matrix.J (Fin n) k i j) := by 317 rw [oldGenerator, oldGenerator, freeWeylGenerator_commutator] 318 exact congrArg (algebraMap k (PresentedWeyl k (n + 1))) 319 (oldIndex_preserves_symplecticForm k n i j) 320 321 /-- The canonical rank-shift embedding preserving the old generators. -/ 322 def previousWeylEmbedding (n : Nat) : 323 PresentedWeyl k n →ₐ[k] PresentedWeyl k (n + 1) := 324 freeWeylLift (Matrix.J (Fin n) k) (oldGenerator k n) 325 (oldGenerator_commutator k n) 326 327 @[simp] theorem previousWeylEmbedding_generator (n : Nat) 328 (i : Fin n ⊕ Fin n) : 329 previousWeylEmbedding k n 330 (freeWeylGenerator (Matrix.J (Fin n) k) i) = oldGenerator k n i := by 331 exact freeWeylLift_generator (Matrix.J (Fin n) k) (oldGenerator k n) 332 (oldGenerator_commutator k n) i 333 334 /-- The newest coordinate in the rank-`n+1` presentation. -/ 335 def presentedCoordinate (n : Nat) : PresentedWeyl k (n + 1) := 336 freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inl 0) 337 338 /-- The newest momentum in the rank-`n+1` presentation. -/ 339 def presentedMomentum (n : Nat) : PresentedWeyl k (n + 1) := 340 freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inr 0) 341 342 theorem presentedCoordinate_commutes_oldGenerator (n : Nat) 343 (i : Fin n ⊕ Fin n) : 344 presentedCoordinate k n * oldGenerator k n i = 345 oldGenerator k n i * presentedCoordinate k n := by 346 apply sub_eq_zero.mp 347 have h := freeWeylGenerator_commutator 348 (k := k) (Matrix.J (Fin (n + 1)) k) 349 (.inl (0 : Fin (n + 1))) (oldIndex i) 350 cases i with 351 | inl i => 352 change Stafford.commutator 353 (freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inl 0)) 354 (freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inl i.succ)) = 355 algebraMap k (PresentedWeyl k (n + 1)) 0 at h 356 change Stafford.commutator 357 (freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inl 0)) 358 (freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inl i.succ)) = 0 359 rw [map_zero] at h 360 exact h 361 | inr i => 362 have hi : (0 : Fin (n + 1)) ≠ i.succ := i.succ_ne_zero.symm 363 simp only [oldIndex, Stafford38FixedSourceChallenge.oldIndex] at h 364 have hJ : Matrix.J (Fin (n + 1)) k (.inl 0) (.inr i.succ) = 0 := by 365 simp [Matrix.J, hi] 366 rw [hJ] at h 367 change Stafford.commutator 368 (freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inl 0)) 369 (freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inr i.succ)) = 0 370 rw [map_zero] at h 371 exact h 372 373 theorem presentedMomentum_commutes_oldGenerator (n : Nat) 374 (i : Fin n ⊕ Fin n) : 375 presentedMomentum k n * oldGenerator k n i = 376 oldGenerator k n i * presentedMomentum k n := by 377 apply sub_eq_zero.mp 378 have h := freeWeylGenerator_commutator 379 (k := k) (Matrix.J (Fin (n + 1)) k) 380 (.inr (0 : Fin (n + 1))) (oldIndex i) 381 cases i with 382 | inl i => 383 have hi : (0 : Fin (n + 1)) ≠ i.succ := i.succ_ne_zero.symm 384 change Stafford.commutator 385 (freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inr 0)) 386 (freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inl i.succ)) = 387 algebraMap k (PresentedWeyl k (n + 1)) 0 at h 388 change Stafford.commutator 389 (freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inr 0)) 390 (freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inl i.succ)) = 0 391 rw [map_zero] at h 392 exact h 393 | inr i => 394 change Stafford.commutator 395 (freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inr 0)) 396 (freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inr i.succ)) = 397 algebraMap k (PresentedWeyl k (n + 1)) 0 at h 398 change Stafford.commutator 399 (freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inr 0)) 400 (freeWeylGenerator (Matrix.J (Fin (n + 1)) k) (.inr i.succ)) = 0 401 rw [map_zero] at h 402 exact h 403 404 theorem presentedCoordinate_commutes_previous (n : Nat) : 405 ∀ w : PresentedWeyl k n, 406 presentedCoordinate k n * previousWeylEmbedding k n w = 407 previousWeylEmbedding k n w * presentedCoordinate k n := 408 commutes_freeWeyl_image_of_generators k (Matrix.J (Fin n) k) 409 (previousWeylEmbedding k n) (presentedCoordinate k n) (by 410 intro i 411 simpa using presentedCoordinate_commutes_oldGenerator k n i) 412 413 theorem presentedMomentum_commutes_previous (n : Nat) : 414 ∀ w : PresentedWeyl k n, 415 presentedMomentum k n * previousWeylEmbedding k n w = 416 previousWeylEmbedding k n w * presentedMomentum k n := 417 commutes_freeWeyl_image_of_generators k (Matrix.J (Fin n) k) 418 (previousWeylEmbedding k n) (presentedMomentum k n) (by 419 intro i 420 simpa using presentedMomentum_commutes_oldGenerator k n i) 421 422 theorem presentedMomentum_mul_coordinate (n : Nat) : 423 presentedMomentum k n * presentedCoordinate k n = 424 presentedCoordinate k n * presentedMomentum k n + 1 := by 425 have h := freeWeylGenerator_commutator 426 (k := k) (Matrix.J (Fin (n + 1)) k) 427 (.inr (0 : Fin (n + 1))) (.inl (0 : Fin (n + 1))) 428 change Stafford.commutator (presentedMomentum k n) 429 (presentedCoordinate k n) = algebraMap k (PresentedWeyl k (n + 1)) 1 at h 430 rw [map_one] at h 431 change presentedMomentum k n * presentedCoordinate k n - 432 presentedCoordinate k n * presentedMomentum k n = 1 at h 433 calc 434 presentedMomentum k n * presentedCoordinate k n = 435 (presentedMomentum k n * presentedCoordinate k n - 436 presentedCoordinate k n * presentedMomentum k n) + 437 presentedCoordinate k n * presentedMomentum k n := by noncomm_ring 438 _ = 1 + presentedCoordinate k n * presentedMomentum k n := by rw [h] 439 _ = presentedCoordinate k n * presentedMomentum k n + 1 := add_comm _ _ 440 441 /-- The recursive map from the Ore tower back to the quotient presentation. -/ 442 def iteratedToPresented : 443 (n : Nat) → IteratedPairStage k n →ₐ[k] PresentedWeyl k n 444 | 0 => Algebra.ofId k (PresentedWeyl k 0) 445 | n + 1 => by 446 letI : Algebra k (IteratedPairStage k n) := 447 iteratedPairStageAlgebra k n 448 letI : Algebra k (PairStage (B := IteratedPairStage k n)) := 449 pairStageAlgebra 450 change PairStage (B := IteratedPairStage k n) →ₐ[k] 451 PresentedWeyl k (n + 1) 452 let f : IteratedPairStage k n →ₐ[k] PresentedWeyl k (n + 1) := 453 (previousWeylEmbedding k n).comp (iteratedToPresented n) 454 exact pairLiftAlgHom f (presentedCoordinate k n) (presentedMomentum k n) 455 (fun b => presentedCoordinate_commutes_previous k n 456 (iteratedToPresented n b)) 457 (fun b => presentedMomentum_commutes_previous k n 458 (iteratedToPresented n b)) 459 (presentedMomentum_mul_coordinate k n) 460 461 @[simp] theorem iteratedToPresented_coefficient (n : Nat) 462 (b : IteratedPairStage k n) : 463 iteratedToPresented k (n + 1) (stageEmbedding k n b) = 464 previousWeylEmbedding k n (iteratedToPresented k n b) := by 465 letI : Algebra k (IteratedPairStage k n) := iteratedPairStageAlgebra k n 466 letI : Algebra k (PairStage (B := IteratedPairStage k n)) := pairStageAlgebra 467 change pairLiftAlgHom _ _ _ _ _ _ (pairCoefficient b) = _ 468 exact pairLiftAlgHom_coefficient _ _ _ _ _ _ b 469 470 @[simp] theorem iteratedToPresented_coordinate (n : Nat) : 471 iteratedToPresented k (n + 1) (stageCoordinate k n) = 472 presentedCoordinate k n := by 473 letI : Algebra k (IteratedPairStage k n) := iteratedPairStageAlgebra k n 474 letI : Algebra k (PairStage (B := IteratedPairStage k n)) := pairStageAlgebra 475 change pairLiftAlgHom _ _ _ _ _ _ pairCoordinate = _ 476 exact pairLiftAlgHom_coordinate _ _ _ _ _ _ 477 478 @[simp] theorem iteratedToPresented_momentum (n : Nat) : 479 iteratedToPresented k (n + 1) (stageMomentum k n) = 480 presentedMomentum k n := by 481 letI : Algebra k (IteratedPairStage k n) := iteratedPairStageAlgebra k n 482 letI : Algebra k (PairStage (B := IteratedPairStage k n)) := pairStageAlgebra 483 change pairLiftAlgHom _ _ _ _ _ _ pairMomentum = _ 484 exact pairLiftAlgHom_momentum _ _ _ _ _ _ 485 486 theorem presentedToIterated_previous (n : Nat) : 487 (presentedToIterated k (n + 1)).comp (previousWeylEmbedding k n) = 488 (stageAlgHom k n).comp (presentedToIterated k n) := by 489 apply freeWeyl_algHom_ext 490 intro i 491 simp only [AlgHom.comp_apply, previousWeylEmbedding_generator, 492 presentedToIterated_generator] 493 cases i <;> unfold oldGenerator oldIndex Stafford38FixedSourceChallenge.oldIndex <;> 494 rw [presentedToIterated_generator] <;> rfl 495 496 @[simp] theorem presentedToIterated_coordinate (n : Nat) : 497 presentedToIterated k (n + 1) (presentedCoordinate k n) = 498 stageCoordinate k n := by 499 unfold presentedCoordinate 500 rw [presentedToIterated_generator] 501 rfl 502 503 @[simp] theorem presentedToIterated_momentum (n : Nat) : 504 presentedToIterated k (n + 1) (presentedMomentum k n) = 505 stageMomentum k n := by 506 unfold presentedMomentum 507 rw [presentedToIterated_generator] 508 rfl 509 510 /-- Mapping from the Ore tower to the presentation and back is the identity. -/ 511 theorem presentedToIterated_comp_iteratedToPresented : 512 ∀ n : Nat, 513 (presentedToIterated k n).comp (iteratedToPresented k n) = 514 AlgHom.id k (IteratedPairStage k n) := by 515 intro n 516 induction n with 517 | zero => 518 apply AlgHom.ext 519 intro c 520 change k at c 521 change presentedToIterated k 0 522 (algebraMap k (PresentedWeyl k 0) c) = c 523 rw [(presentedToIterated k 0).commutes] 524 rfl 525 | succ n ih => 526 letI : Algebra k (IteratedPairStage k n) := 527 iteratedPairStageAlgebra k n 528 letI : Algebra k (PairStage (B := IteratedPairStage k n)) := 529 pairStageAlgebra 530 let f : IteratedPairStage k n →ₐ[k] IteratedPairStage k (n + 1) := 531 stageAlgHom k n 532 let X : IteratedPairStage k (n + 1) := stageCoordinate k n 533 let P : IteratedPairStage k (n + 1) := stageMomentum k n 534 let g : IteratedPairStage k (n + 1) →ₐ[k] 535 IteratedPairStage k (n + 1) := 536 (presentedToIterated k (n + 1)).comp 537 (iteratedToPresented k (n + 1)) 538 have hgCoefficient : ∀ b, g (stageEmbedding k n b) = f b := by 539 intro b 540 dsimp [g, f] 541 rw [iteratedToPresented_coefficient] 542 have hp := DFunLike.congr_fun (presentedToIterated_previous k n) 543 (iteratedToPresented k n b) 544 calc 545 presentedToIterated k (n + 1) 546 (previousWeylEmbedding k n (iteratedToPresented k n b)) = 547 stageAlgHom k n 548 (presentedToIterated k n (iteratedToPresented k n b)) := hp 549 _ = stageAlgHom k n b := by 550 have hib : presentedToIterated k n (iteratedToPresented k n b) = b := by 551 change ((presentedToIterated k n).comp 552 (iteratedToPresented k n)) b = b 553 rw [ih] 554 rfl 555 rw [hib] 556 have hgCoordinate : g (stageCoordinate k n) = X := by 557 dsimp [g, X] 558 rw [iteratedToPresented_coordinate, presentedToIterated_coordinate] 559 have hgMomentum : g (stageMomentum k n) = P := by 560 dsimp [g, P] 561 rw [iteratedToPresented_momentum, presentedToIterated_momentum] 562 have hg : g = pairLiftAlgHom f X P 563 (stageCoordinate_mul_embedding k n) 564 (stageMomentum_mul_embedding k n) 565 (stageMomentum_mul_coordinate k n) := 566 pairLiftAlgHom_unique f X P 567 (stageCoordinate_mul_embedding k n) 568 (stageMomentum_mul_embedding k n) 569 (stageMomentum_mul_coordinate k n) g 570 hgCoefficient hgCoordinate hgMomentum 571 have hid : AlgHom.id k (IteratedPairStage k (n + 1)) = 572 pairLiftAlgHom f X P 573 (stageCoordinate_mul_embedding k n) 574 (stageMomentum_mul_embedding k n) 575 (stageMomentum_mul_coordinate k n) := 576 pairLiftAlgHom_unique f X P 577 (stageCoordinate_mul_embedding k n) 578 (stageMomentum_mul_embedding k n) 579 (stageMomentum_mul_coordinate k n) 580 (AlgHom.id k (IteratedPairStage k (n + 1))) 581 (fun _ => rfl) rfl rfl 582 exact hg.trans hid.symm 583 584 /-- The recursive inverse sends every iterated generator back to its named 585 generator in the quotient presentation. -/ 586 theorem iteratedToPresented_generator : 587 ∀ (n : Nat) (i : Fin n ⊕ Fin n), 588 iteratedToPresented k n (iteratedGenerator k n i) = 589 freeWeylGenerator (Matrix.J (Fin n) k) i := by 590 intro n 591 induction n with 592 | zero => 593 intro i 594 exact Sum.elim Fin.elim0 Fin.elim0 i 595 | succ n ih => 596 intro i 597 cases i with 598 | inl i => 599 refine Fin.cases ?_ (fun j => ?_) i 600 · change iteratedToPresented k (n + 1) (stageCoordinate k n) = _ 601 rw [iteratedToPresented_coordinate] 602 rfl 603 · change iteratedToPresented k (n + 1) 604 (stageEmbedding k n (iteratedCoordinate k n j)) = _ 605 rw [iteratedToPresented_coefficient] 606 change previousWeylEmbedding k n 607 (iteratedToPresented k n (iteratedGenerator k n (.inl j))) = _ 608 rw [ih (.inl j), previousWeylEmbedding_generator] 609 rfl 610 | inr i => 611 refine Fin.cases ?_ (fun j => ?_) i 612 · change iteratedToPresented k (n + 1) (stageMomentum k n) = _ 613 rw [iteratedToPresented_momentum] 614 rfl 615 · change iteratedToPresented k (n + 1) 616 (stageEmbedding k n (iteratedMomentum k n j)) = _ 617 rw [iteratedToPresented_coefficient] 618 change previousWeylEmbedding k n 619 (iteratedToPresented k n (iteratedGenerator k n (.inr j))) = _ 620 rw [ih (.inr j), previousWeylEmbedding_generator] 621 rfl 622 623 /-- Mapping from the quotient presentation to the Ore tower and back is the 624 identity. -/ 625 theorem iteratedToPresented_comp_presentedToIterated (n : Nat) : 626 (iteratedToPresented k n).comp (presentedToIterated k n) = 627 AlgHom.id k (PresentedWeyl k n) := by 628 apply freeWeyl_algHom_ext 629 intro i 630 rw [AlgHom.comp_apply, presentedToIterated_generator, 631 iteratedToPresented_generator] 632 rfl 633 634 /-- The quotient presentation is canonically equivalent to the recursive 635 Ore construction, without using PBW independence for the quotient. -/ 636 def presentedIteratedEquiv (n : Nat) : 637 PresentedWeyl k n ≃ₐ[k] IteratedPairStage k n := 638 AlgEquiv.ofAlgHom (presentedToIterated k n) (iteratedToPresented k n) 639 (presentedToIterated_comp_iteratedToPresented k n) 640 (iteratedToPresented_comp_presentedToIterated k n) 641 642 @[simp] theorem presentedIteratedEquiv_generator (n : Nat) 643 (i : Fin n ⊕ Fin n) : 644 presentedIteratedEquiv k n 645 (freeWeylGenerator (Matrix.J (Fin n) k) i) = 646 iteratedGenerator k n i := by 647 exact presentedToIterated_generator k n i 648 649 #print axioms iteratedPairStageAlgebra 650 #print axioms stageAlgHom 651 #print axioms iteratedCoordinate_commutator 652 #print axioms iteratedMomentum_commutator 653 #print axioms iteratedCoordinate_momentum_commutator 654 #print axioms iteratedGenerator_commutator 655 #print axioms presentedToIterated 656 #print axioms presentedToIterated_generator 657 #print axioms iteratedToPresented 658 #print axioms presentedToIterated_comp_iteratedToPresented 659 #print axioms iteratedToPresented_comp_presentedToIterated 660 #print axioms presentedIteratedEquiv 661 #print axioms presentedIteratedEquiv_generator 662 663 end 664 665 end Stafford38.WeylIteratedEquivalence 666