Stafford38/Weyl/CommutatorSymbol.lean

This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a

1 module
2 public import Stafford38.Weyl.GradedAlgebra
3 public import Stafford38.Characteristic.Polynomial
4 
5 @[expose] public section
6 
7 /-!
8 # Coordinate commutators and order symbols
9 
10 This file proves the newest-coordinate generator case of the filtered
11 commutator--Poisson correspondence.  It uses the exact PBW block normal form;
12 no characteristic-ideal, radical, or Gabber statement is assumed.
13 -/
14 
15 namespace Stafford38.WeylCommutatorSymbol
16 
17 open Stafford38.Characteristic
18 open Stafford38.WeylIteratedEquivalence
19 open Stafford38.WeylPBW
20 open Stafford38.WeylFiltration
21 open Stafford38.WeylLeadingSymbol
22 
23 noncomputable section
24 
25 universe u
26 
27 variable (k : Type u) [Field k]
28 
29 /-- Commutation with the newest coordinate differentiates the momentum power
30 in an exact ordered PBW block, with the sign dictated by `[x,p] = -1`. -/
31 theorem presentedCoordinate_commutator_coefficientOrdered
32     (n a p : ℕ) (z : PresentedWeyl k n) :
33     Stafford.commutator (presentedCoordinate k n)
34         (presentedCoefficientOrdered k n a p z) =
35       -((p : k) • presentedCoefficientOrdered k n a (p - 1) z) := by
36   let X := presentedCoordinate k n
37   let P := presentedMomentum k n
38   let Z := previousWeylEmbedding k n z
39   have hXZ : X * Z = Z * X :=
40     presentedCoordinate_commutes_previous k n z
41   have hPX : P * X = X * P + 1 := presentedMomentum_mul_coordinate k n
42   have hpowSucc : ∀ r : ℕ,
43       X * P ^ (r + 1) - P ^ (r + 1) * X = -((r + 1) • P ^ r) := by
44     intro r
45     let Xop : (PresentedWeyl k (n + 1))ᵐᵒᵖ := MulOpposite.op X
46     let Pop : (PresentedWeyl k (n + 1))ᵐᵒᵖ := MulOpposite.op P
47     have hop : Xop * Pop - Pop * Xop = 1 := by
48       have hopEq := congrArg MulOpposite.op hPX
49       change MulOpposite.op X * MulOpposite.op P -
50         MulOpposite.op P * MulOpposite.op X = 1
51       rw [show MulOpposite.op X * MulOpposite.op P =
52           MulOpposite.op P * MulOpposite.op X + 1 by simpa using hopEq]
53       abel
54     have ht := AlgebraicAnalysis.OreDivision.OreAmbient.commutator_pow_succ
55       Xop Pop hop r
56     have hu := congrArg MulOpposite.unop ht
57     change P ^ (r + 1) * X - X * P ^ (r + 1) = (r + 1) • P ^ r at hu
58     rw [← hu]
59     abel
60   have hpow : ∀ q : ℕ,
61       X * P ^ q - P ^ q * X = -((q : k) • P ^ (q - 1)) := by
62     intro q
63     cases q with
64     | zero => simp
65     | succ r =>
66         rw [Nat.cast_smul_eq_nsmul k]
67         exact hpowSucc r
68   rw [presentedCoefficientOrdered]
69   change X * (Z * X ^ a * P ^ p) - (Z * X ^ a * P ^ p) * X = _
70   let Q := Z * X ^ a
71   have hXpow : X * X ^ a = X ^ a * X := (Commute.refl X).pow_right a
72   have hQ : Stafford.commutator X Q = 0 := by
73     change X * (Z * X ^ a) - (Z * X ^ a) * X = 0
74     rw [show X * (Z * X ^ a) = (Z * X ^ a) * X by
75       calc
76         X * (Z * X ^ a) = (X * Z) * X ^ a := by rw [mul_assoc]
77         _ = (Z * X) * X ^ a := by rw [hXZ]
78         _ = Z * (X * X ^ a) := by rw [mul_assoc]
79         _ = Z * (X ^ a * X) := by rw [hXpow]
80         _ = (Z * X ^ a) * X := by rw [mul_assoc]]
81     exact sub_self _
82   change Stafford.commutator X (Q * P ^ p) = _
83   calc
84     Stafford.commutator X (Q * P ^ p) =
85         Stafford.commutator X Q * P ^ p +
86           Q * Stafford.commutator X (P ^ p) := by
87             simp only [Stafford.commutator,
88               AlgebraicAnalysis.ringCommutator, sub_mul, mul_sub, mul_assoc]
89             abel
90     _ = Q * (X * P ^ p - P ^ p * X) := by
91       have hQ' : X * Q - Q * X = 0 := by exact hQ
92       change (X * Q - Q * X) * P ^ p +
93           Q * (X * P ^ p - P ^ p * X) = _
94       rw [hQ', zero_mul, zero_add]
95     _ = Q * -((p : k) • P ^ (p - 1)) := by rw [hpow]
96     _ = -((p : k) • (Q * P ^ (p - 1))) := by
97       calc
98         Q * -((p : k) • P ^ (p - 1)) =
99             -(Q * ((p : k) • P ^ (p - 1))) := by
100               simpa only using (mul_neg Q ((p : k) • P ^ (p - 1)))
101         _ = -((p : k) • (Q * P ^ (p - 1))) :=
102           congrArg Neg.neg
103             (Algebra.mul_smul_comm (p : k) Q (P ^ (p - 1)))
104 
105 @[simp] theorem poissonBracket_newestCoordinate
106     (n : ℕ) (f : SymbolRing k (n + 1)) :
107     poissonBracket (MvPolynomial.X (.inl (0 : Fin (n + 1)))) f =
108       MvPolynomial.pderiv (.inr (0 : Fin (n + 1))) f := by
109   simp only [poissonBracket, MvPolynomial.pderiv_X, mul_zero, sub_zero]
110   rw [Finset.sum_eq_single (0 : Fin (n + 1))]
111   · simp
112   · intro i _ hi
113     simp [Pi.single_apply, hi]
114   · simp
115 
116 theorem pderiv_rename_oldIndex_newestMomentum
117     (n : ℕ) (f : SymbolRing k n) :
118     MvPolynomial.pderiv (.inr (0 : Fin (n + 1)))
119         (MvPolynomial.rename oldIndex f) = 0 := by
120   classical
121   induction f using MvPolynomial.induction_on' with
122   | monomial m c =>
123       rw [MvPolynomial.rename_monomial, MvPolynomial.pderiv_monomial]
124       have hz : (m.mapDomain oldIndex) (.inr (0 : Fin (n + 1))) = 0 := by
125         apply Finsupp.mapDomain_notin_range
126         rintro ⟨i, hi⟩
127         cases i <;> simp [oldIndex, Fin.succ_ne_zero] at hi
128       simp [hz]
129   | add f g hf hg => simp [map_add, hf, hg]
130 
131 theorem extendPhaseExponent_sub_newestMomentum
132     (n a p : ℕ) :
133     extendPhaseExponent n a p 0 -
134         Finsupp.single (.inr (0 : Fin (n + 1))) 1 =
135       extendPhaseExponent n a (p - 1) 0 := by
136   classical
137   ext i
138   rcases i with i | i
139   · by_cases hi : i = 0
140     · subst i
141       simp [extendPhaseExponent, oldIndex]
142     · simp [extendPhaseExponent, oldIndex, hi]
143   · by_cases hi : i = 0
144     · subst i
145       simp [extendPhaseExponent, oldIndex]
146     · simp [extendPhaseExponent, oldIndex, hi]
147 
148 /-- Generator/ordered-block case of the order-symbol commutator formula.
149 The exact degree is `N+p-1`; positivity of `p` prevents truncated subtraction.
150 The sign records the repository convention `[x,p] = -1`. -/
151 theorem principalComponent_coordinate_commutator_eq_neg_poisson
152     (n N a p : ℕ) (z : PresentedWeyl k n) (hp : 0 < p) :
153     presentedPrincipalComponent k (@orderWeight (n + 1)) (N + p - 1)
154         (Stafford.commutator (presentedCoordinate k n)
155           (presentedCoefficientOrdered k n a p z)) =
156       -poissonBracket (MvPolynomial.X (.inl (0 : Fin (n + 1))))
157         (presentedPrincipalComponent k (@orderWeight (n + 1)) (N + p)
158           (presentedCoefficientOrdered k n a p z)) := by
159   rw [presentedCoordinate_commutator_coefficientOrdered]
160   simp only [map_neg, map_smul]
161   rw [show N + p - 1 = N + (p - 1) by omega,
162     presentedPrincipalComponent_coefficientOrdered_order,
163     presentedPrincipalComponent_coefficientOrdered_order,
164     poissonBracket_newestCoordinate,
165     MvPolynomial.pderiv_mul,
166     MvPolynomial.pderiv_monomial,
167     pderiv_rename_oldIndex_newestMomentum,
168     mul_zero, add_zero,
169     extendPhaseExponent_sub_newestMomentum n a p]
170   have hexp : (extendPhaseExponent n a p 0)
171       (.inr (0 : Fin (n + 1))) = p := by
172     simp [extendPhaseExponent, oldIndex]
173   rw [hexp]
174   congr 1
175   rw [← Algebra.smul_mul_assoc, MvPolynomial.smul_monomial]
176   simp
177 
178 #print axioms presentedCoordinate_commutator_coefficientOrdered
179 #print axioms poissonBracket_newestCoordinate
180 #print axioms pderiv_rename_oldIndex_newestMomentum
181 #print axioms extendPhaseExponent_sub_newestMomentum
182 #print axioms principalComponent_coordinate_commutator_eq_neg_poisson
183 
184 end
185 
186 end Stafford38.WeylCommutatorSymbol
187