This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 public import Mathlib.Algebra.Algebra.Opposite 3 public import Mathlib.Algebra.Module.RingHom 4 public import Stafford38.Weyl.IteratedEquivalence 5 6 @[expose] public section 7 8 /-! 9 # Transposition of the presented Weyl algebra 10 11 This file constructs the scalar-preserving Weyl transposition as an algebra 12 equivalence with the opposite algebra. Coordinates are fixed and momenta 13 change sign. The construction uses only the checked universal property of 14 the quotient presentation. 15 -/ 16 17 namespace Stafford38.WeylTransposition 18 19 open MulOpposite 20 open Stafford 21 open AlgebraicAnalysis 22 open Stafford38.WeylUniversal 23 open Stafford38.WeylIteratedEquivalence 24 25 noncomputable section 26 27 universe u v 28 29 variable (k : Type u) [Field k] 30 31 /-- The coordinate generator with index `i`. -/ 32 def coordinate (n : Nat) (i : Fin n) : PresentedWeyl k n := 33 freeWeylGenerator (Matrix.J (Fin n) k) (.inl i) 34 35 /-- The momentum generator with index `i`. -/ 36 def momentum (n : Nat) (i : Fin n) : PresentedWeyl k n := 37 freeWeylGenerator (Matrix.J (Fin n) k) (.inr i) 38 39 /-- Generator images for the Weyl transposition. -/ 40 def transposedGenerator (n : Nat) : 41 (Fin n ⊕ Fin n) → (PresentedWeyl k n)ᵐᵒᵖ 42 | .inl i => op (coordinate k n i) 43 | .inr i => op (-momentum k n i) 44 45 private theorem neg_commutator_right_neg {A : Type*} [Ring A] (a b : A) : 46 -Stafford.commutator a (-b) = Stafford.commutator a b := by 47 simp [Stafford.commutator] 48 abel 49 50 private theorem neg_commutator_left_neg {A : Type*} [Ring A] (a b : A) : 51 -Stafford.commutator (-a) b = Stafford.commutator a b := by 52 simp [Stafford.commutator] 53 abel 54 55 private theorem neg_commutator_both_neg {A : Type*} [Ring A] (a b : A) : 56 -Stafford.commutator (-a) (-b) = -Stafford.commutator a b := by 57 simp [Stafford.commutator] 58 59 theorem underlying_transposedGenerator_commutator (n : Nat) : 60 ∀ i j, 61 -Stafford.commutator (unop (transposedGenerator k n i)) 62 (unop (transposedGenerator k n j)) = 63 algebraMap k (PresentedWeyl k n) (Matrix.J (Fin n) k i j) := by 64 intro i j 65 cases i with 66 | inl i => 67 cases j with 68 | inl j => 69 change -Stafford.commutator (coordinate k n i) (coordinate k n j) = _ 70 rw [show Stafford.commutator (coordinate k n i) (coordinate k n j) = 71 algebraMap k (PresentedWeyl k n) 72 (Matrix.J (Fin n) k (.inl i) (.inl j)) from 73 freeWeylGenerator_commutator 74 (k := k) (Matrix.J (Fin n) k) (.inl i) (.inl j)] 75 simp [Matrix.J] 76 | inr j => 77 change -Stafford.commutator (coordinate k n i) (-momentum k n j) = _ 78 have h := freeWeylGenerator_commutator 79 (k := k) (Matrix.J (Fin n) k) (.inl i) (.inr j) 80 rw [neg_commutator_right_neg] 81 exact h 82 | inr i => 83 cases j with 84 | inl j => 85 change -Stafford.commutator (-momentum k n i) (coordinate k n j) = _ 86 have h := freeWeylGenerator_commutator 87 (k := k) (Matrix.J (Fin n) k) (.inr i) (.inl j) 88 rw [neg_commutator_left_neg] 89 exact h 90 | inr j => 91 change -Stafford.commutator (-momentum k n i) (-momentum k n j) = _ 92 have h := freeWeylGenerator_commutator 93 (k := k) (Matrix.J (Fin n) k) (.inr i) (.inr j) 94 have hJ : Matrix.J (Fin n) k (.inr i) (.inr j) = 0 := by 95 simp [Matrix.J] 96 rw [hJ] at h ⊢ 97 rw [neg_commutator_both_neg] 98 change 99 -Stafford.commutator 100 (freeWeylGenerator (Matrix.J (Fin n) k) (.inr i)) 101 (freeWeylGenerator (Matrix.J (Fin n) k) (.inr j)) = _ 102 rw [h, map_zero, neg_zero] 103 104 theorem transposedGenerator_commutator (n : Nat) : 105 ∀ i j, 106 Stafford.commutator (transposedGenerator k n i) (transposedGenerator k n j) = 107 algebraMap k (PresentedWeyl k n)ᵐᵒᵖ (Matrix.J (Fin n) k i j) := by 108 intro i j 109 apply unop_injective 110 simpa [Stafford.commutator] using 111 underlying_transposedGenerator_commutator k n i j 112 113 /-- The scalar-preserving anti-homomorphism `x_i ↦ x_i`, `p_i ↦ -p_i`, 114 represented as an algebra homomorphism to the opposite algebra. -/ 115 def transpositionHom (n : Nat) : 116 PresentedWeyl k n →ₐ[k] (PresentedWeyl k n)ᵐᵒᵖ := 117 freeWeylLift (Matrix.J (Fin n) k) (transposedGenerator k n) 118 (transposedGenerator_commutator k n) 119 120 @[simp] theorem transpositionHom_coordinate (n : Nat) (i : Fin n) : 121 transpositionHom k n (coordinate k n i) = op (coordinate k n i) := by 122 simpa [transpositionHom, transposedGenerator, coordinate] using 123 freeWeylLift_generator (k := k) (Matrix.J (Fin n) k) 124 (transposedGenerator k n) (transposedGenerator_commutator k n) (.inl i) 125 126 @[simp] theorem transpositionHom_momentum (n : Nat) (i : Fin n) : 127 transpositionHom k n (momentum k n i) = op (-momentum k n i) := by 128 simpa [transpositionHom, transposedGenerator, momentum] using 129 freeWeylLift_generator (k := k) (Matrix.J (Fin n) k) 130 (transposedGenerator k n) (transposedGenerator_commutator k n) (.inr i) 131 132 /-- Applying transposition once on each side of the opposite equivalence is 133 the identity. -/ 134 theorem opComm_transpositionHom_comp_transpositionHom (n : Nat) : 135 (AlgHom.opComm (transpositionHom k n)).comp (transpositionHom k n) = 136 AlgHom.id k (PresentedWeyl k n) := by 137 apply freeWeyl_algHom_ext 138 intro i 139 cases i with 140 | inl i => 141 simp only [AlgHom.comp_apply, AlgHom.id_apply] 142 rw [show freeWeylGenerator (Matrix.J (Fin n) k) (.inl i) = 143 coordinate k n i from rfl, transpositionHom_coordinate] 144 change unop (transpositionHom k n (coordinate k n i)) = coordinate k n i 145 rw [transpositionHom_coordinate] 146 exact unop_op _ 147 | inr i => 148 simp only [AlgHom.comp_apply, AlgHom.id_apply] 149 rw [show freeWeylGenerator (Matrix.J (Fin n) k) (.inr i) = 150 momentum k n i from rfl, transpositionHom_momentum] 151 change unop (transpositionHom k n (-momentum k n i)) = momentum k n i 152 rw [map_neg, transpositionHom_momentum] 153 simp 154 155 theorem transpositionHom_comp_opComm_transpositionHom (n : Nat) : 156 (transpositionHom k n).comp (AlgHom.opComm (transpositionHom k n)) = 157 AlgHom.id k (PresentedWeyl k n)ᵐᵒᵖ := by 158 apply AlgHom.ext 159 intro a 160 rcases a with ⟨a⟩ 161 apply unop_injective 162 have h := congrArg (fun f : PresentedWeyl k n →ₐ[k] PresentedWeyl k n => f a) 163 (opComm_transpositionHom_comp_transpositionHom k n) 164 exact h 165 166 /-- Transposition is a scalar-preserving equivalence with the opposite Weyl 167 algebra. -/ 168 def transpositionEquiv (n : Nat) : 169 PresentedWeyl k n ≃ₐ[k] (PresentedWeyl k n)ᵐᵒᵖ := 170 AlgEquiv.ofAlgHom (transpositionHom k n) (AlgHom.opComm (transpositionHom k n)) 171 (transpositionHom_comp_opComm_transpositionHom k n) 172 (opComm_transpositionHom_comp_transpositionHom k n) 173 174 @[simp] theorem transpositionEquiv_apply (n : Nat) (a : PresentedWeyl k n) : 175 transpositionEquiv k n a = transpositionHom k n a := rfl 176 177 @[simp] theorem transpositionEquiv_coordinate (n : Nat) (i : Fin n) : 178 transpositionEquiv k n (coordinate k n i) = op (coordinate k n i) := by 179 simp [transpositionEquiv] 180 181 @[simp] theorem transpositionEquiv_momentum (n : Nat) (i : Fin n) : 182 transpositionEquiv k n (momentum k n i) = op (-momentum k n i) := by 183 simp [transpositionEquiv] 184 185 theorem transpositionEquiv_injective (n : Nat) : 186 Function.Injective (transpositionEquiv k n) := 187 (transpositionEquiv k n).injective 188 189 theorem transpositionEquiv_surjective (n : Nat) : 190 Function.Surjective (transpositionEquiv k n) := 191 (transpositionEquiv k n).surjective 192 193 /-- The usual unbundled anti-automorphism underlying `transpositionEquiv`. -/ 194 def transpose (n : Nat) (a : PresentedWeyl k n) : PresentedWeyl k n := 195 unop (transpositionEquiv k n a) 196 197 @[simp] theorem transpose_coordinate (n : Nat) (i : Fin n) : 198 transpose k n (coordinate k n i) = coordinate k n i := by 199 simp [transpose] 200 201 @[simp] theorem transpose_momentum (n : Nat) (i : Fin n) : 202 transpose k n (momentum k n i) = -momentum k n i := by 203 simp [transpose] 204 205 @[simp] theorem transpose_algebraMap (n : Nat) (c : k) : 206 transpose k n (algebraMap k (PresentedWeyl k n) c) = 207 algebraMap k (PresentedWeyl k n) c := by 208 simp [transpose] 209 210 theorem transpose_mul (n : Nat) (a b : PresentedWeyl k n) : 211 transpose k n (a * b) = transpose k n b * transpose k n a := by 212 simp [transpose] 213 214 @[simp] theorem transpose_transpose (n : Nat) (a : PresentedWeyl k n) : 215 transpose k n (transpose k n a) = a := by 216 have h := congrArg (fun f : PresentedWeyl k n →ₐ[k] PresentedWeyl k n => f a) 217 (opComm_transpositionHom_comp_transpositionHom k n) 218 exact h 219 220 theorem transpose_injective (n : Nat) : Function.Injective (transpose k n) := by 221 intro a b h 222 simpa only [transpose_transpose] using congrArg (transpose k n) h 223 224 /-- A right `PresentedWeyl`-module becomes a left module by restriction of 225 scalars along transposition. -/ 226 def transposedLeftModule (n : Nat) (M : Type v) [AddCommMonoid M] 227 [Module (PresentedWeyl k n)ᵐᵒᵖ M] : Module (PresentedWeyl k n) M := 228 Module.compHom M (transpositionEquiv k n).toRingEquiv.toRingHom 229 230 theorem transposedLeftModule_smul (n : Nat) (M : Type v) [AddCommMonoid M] 231 [Module (PresentedWeyl k n)ᵐᵒᵖ M] 232 (a : PresentedWeyl k n) (m : M) : 233 @SMul.smul (PresentedWeyl k n) M 234 (transposedLeftModule k n M).toSMul a m = 235 transpositionEquiv k n a • m := rfl 236 237 theorem transposedLeftModule_coordinate_smul (n : Nat) (M : Type v) 238 [AddCommMonoid M] [Module (PresentedWeyl k n)ᵐᵒᵖ M] 239 (i : Fin n) (m : M) : 240 @SMul.smul (PresentedWeyl k n) M 241 (transposedLeftModule k n M).toSMul (coordinate k n i) m = 242 op (coordinate k n i) • m := by 243 rw [transposedLeftModule_smul, transpositionEquiv_coordinate] 244 245 theorem transposedLeftModule_momentum_smul (n : Nat) (M : Type v) 246 [AddCommMonoid M] [Module (PresentedWeyl k n)ᵐᵒᵖ M] 247 (i : Fin n) (m : M) : 248 @SMul.smul (PresentedWeyl k n) M 249 (transposedLeftModule k n M).toSMul (momentum k n i) m = 250 op (-momentum k n i) • m := by 251 rw [transposedLeftModule_smul, transpositionEquiv_momentum] 252 253 #print axioms transpositionEquiv 254 #print axioms opComm_transpositionHom_comp_transpositionHom 255 #print axioms transpose_mul 256 #print axioms transpose_transpose 257 #print axioms transpose_injective 258 #print axioms transposedLeftModule_coordinate_smul 259 #print axioms transposedLeftModule_momentum_smul 260 261 end 262 end Stafford38.WeylTransposition 263