Stafford38/Weyl/CoordinateCommutatorSymbol.lean

This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a

1 module
2 public import Stafford38.Weyl.CommutatorSymbol
3 
4 @[expose] public section
5 
6 /-!
7 # Coordinate commutators on arbitrary PBW sums
8 
9 This file extends the ordered-block commutator--symbol formula to arbitrary
10 presented Weyl elements.  The proof packages both sides as linear maps and
11 checks equality on the full PBW basis.
12 -/
13 
14 namespace Stafford38.WeylCoordinateCommutatorSymbol
15 
16 open Stafford38.Characteristic
17 open Stafford38.WeylCommutatorSymbol
18 open Stafford38.WeylFiltration
19 open Stafford38.WeylIteratedEquivalence
20 open Stafford38.WeylLeadingSymbol
21 open Stafford38.WeylPBW
22 
23 noncomputable section
24 
25 universe u
26 
27 variable (k : Type u) [Field k]
28 
29 /-- Commutation with the newest coordinate, followed by extraction of one
30 order-homogeneous component, as a linear map. -/
31 def coordinateCommutatorPrincipalLinear (n T : ℕ) :
32     PresentedWeyl k (n + 1) →ₗ[k] SymbolRing k (n + 1) where
33   toFun w :=
34     presentedPrincipalComponent k (@orderWeight (n + 1)) T
35       (Stafford.commutator (presentedCoordinate k n) w)
36   map_add' a b := by
37     change presentedPrincipalComponent k orderWeight T
38         (Stafford.commutator (presentedCoordinate k n) (a + b)) =
39       presentedPrincipalComponent k orderWeight T
40           (Stafford.commutator (presentedCoordinate k n) a) +
41         presentedPrincipalComponent k orderWeight T
42           (Stafford.commutator (presentedCoordinate k n) b)
43     rw [show Stafford.commutator (presentedCoordinate k n) (a + b) =
44         Stafford.commutator (presentedCoordinate k n) a +
45           Stafford.commutator (presentedCoordinate k n) b by
46       simp only [Stafford.commutator, AlgebraicAnalysis.ringCommutator,
47         mul_add, add_mul]
48       abel]
49     exact LinearMap.map_add _ _ _
50   map_smul' c a := by
51     change presentedPrincipalComponent k orderWeight T
52         (Stafford.commutator (presentedCoordinate k n) (c • a)) =
53       c • presentedPrincipalComponent k orderWeight T
54         (Stafford.commutator (presentedCoordinate k n) a)
55     rw [show Stafford.commutator (presentedCoordinate k n) (c • a) =
56         c • Stafford.commutator (presentedCoordinate k n) a by
57       simp only [Stafford.commutator, AlgebraicAnalysis.ringCommutator,
58         Algebra.mul_smul_comm,
59         Algebra.smul_mul_assoc, smul_sub]]
60     exact LinearMap.map_smul _ _ _
61 
62 /-- The negative Poisson derivative of the next order-homogeneous component,
63 as a linear map. -/
64 def coordinatePoissonPrincipalLinear (n T : ℕ) :
65     PresentedWeyl k (n + 1) →ₗ[k] SymbolRing k (n + 1) :=
66   (-((MvPolynomial.pderiv (R := k)
67       (Sum.inr (0 : Fin (n + 1)) : PhaseVar (n + 1))).toLinearMap)).comp
68     (presentedPrincipalComponent k (@orderWeight (n + 1)) (T + 1))
69 
70 /-- A PBW basis vector in `n+1` pairs is an ordered newest-pair block whose
71 coefficient is the corresponding PBW basis vector in `n` pairs. -/
72 theorem presentedPBWBasis_succ_eq_coefficientOrdered
73     (n : ℕ) (m : PhaseVar (n + 1) →₀ ℕ) :
74     presentedPBWBasis k (n + 1) m =
75       presentedCoefficientOrdered k n
76         (m (.inl (0 : Fin (n + 1))))
77         (m (.inr (0 : Fin (n + 1))))
78         (presentedPBWBasis k n
79           (phaseExponent
80             (fun i => m (.inl i.succ))
81             (fun i => m (.inr i.succ)))) := by
82   rw [presentedPBWBasis_apply, presentedOrderedMonomial,
83     presentedPBWBasis_apply]
84   rfl
85 
86 theorem extendPhaseExponent_sub_newestMomentum_general
87     (n a p : ℕ) (m : PhaseVar n →₀ ℕ) :
88     extendPhaseExponent n a p m -
89         Finsupp.single (.inr (0 : Fin (n + 1))) 1 =
90       extendPhaseExponent n a (p - 1) m := by
91   classical
92   have hnew : (Finsupp.mapDomain oldIndex m)
93       (.inr (0 : Fin (n + 1))) = 0 := by
94     apply Finsupp.mapDomain_notin_range
95     rintro ⟨i, hi⟩
96     cases i <;> simp [oldIndex, Fin.succ_ne_zero] at hi
97   ext i
98   rcases i with i | i
99   · by_cases hi : i = 0
100     · subst i
101       simp [extendPhaseExponent, oldIndex,
102         add_comm, add_left_comm, add_assoc]
103     · simp [extendPhaseExponent, oldIndex, hi,
104         add_comm, add_left_comm, add_assoc]
105   · by_cases hi : i = 0
106     · subst i
107       simp [extendPhaseExponent, oldIndex, hnew]
108     · have h0i : (0 : Fin (n + 1)) ≠ i := Ne.symm hi
109       simp [extendPhaseExponent, oldIndex, hi, h0i,
110         add_comm, add_left_comm, add_assoc]
111 
112 theorem extendPhaseExponent_newestMomentum_apply
113     (n a p : ℕ) (m : PhaseVar n →₀ ℕ) :
114     extendPhaseExponent n a p m (.inr (0 : Fin (n + 1))) = p := by
115   have hnew : (Finsupp.mapDomain oldIndex m)
116       (.inr (0 : Fin (n + 1))) = 0 := by
117     apply Finsupp.mapDomain_notin_range
118     rintro ⟨i, hi⟩
119     cases i <;> simp [oldIndex, Fin.succ_ne_zero] at hi
120   simp [extendPhaseExponent, oldIndex, hnew]
121 
122 theorem coordinate_symbol_linear_maps_eq (n T : ℕ) :
123     coordinateCommutatorPrincipalLinear k n T =
124       coordinatePoissonPrincipalLinear k n T := by
125   apply Module.Basis.ext (presentedPBWBasis k (n + 1))
126   intro m
127   let a := m (.inl (0 : Fin (n + 1)))
128   let p := m (.inr (0 : Fin (n + 1)))
129   let mold : PhaseVar n →₀ ℕ :=
130     phaseExponent
131       (fun i => m (.inl i.succ))
132       (fun i => m (.inr i.succ))
133   rw [presentedPBWBasis_succ_eq_coefficientOrdered k n m]
134   change presentedPrincipalComponent k orderWeight T
135       (Stafford.commutator (presentedCoordinate k n)
136         (presentedCoefficientOrdered k n a p
137           (presentedPBWBasis k n mold))) =
138     -MvPolynomial.pderiv (.inr (0 : Fin (n + 1)))
139       (presentedPrincipalComponent k orderWeight (T + 1)
140         (presentedCoefficientOrdered k n a p
141           (presentedPBWBasis k n mold)))
142   rw [presentedCoordinate_commutator_coefficientOrdered]
143   simp only [map_neg, map_smul]
144   change -((p : k) •
145       MvPolynomial.weightedHomogeneousComponent orderWeight T
146         (presentedNormalFormLinearEquiv k (n + 1)
147           (presentedCoefficientOrdered k n a (p - 1)
148             (presentedPBWBasis k n mold)))) =
149     -MvPolynomial.pderiv (.inr (0 : Fin (n + 1)))
150       (MvPolynomial.weightedHomogeneousComponent orderWeight (T + 1)
151         (presentedNormalFormLinearEquiv k (n + 1)
152           (presentedCoefficientOrdered k n a p
153             (presentedPBWBasis k n mold))))
154   rw [show presentedNormalFormLinearEquiv k (n + 1)
155         (presentedCoefficientOrdered k n a (p - 1)
156           (presentedPBWBasis k n mold)) =
157         MvPolynomial.monomial
158           (extendPhaseExponent n a (p - 1) mold) 1 from
159       presentedCoefficientOrdered_basis_normal k n a (p - 1) mold,
160     weightedHomogeneousComponent_monomial,
161     show presentedNormalFormLinearEquiv k (n + 1)
162         (presentedCoefficientOrdered k n a p
163           (presentedPBWBasis k n mold)) =
164         MvPolynomial.monomial (extendPhaseExponent n a p mold) 1 from
165       presentedCoefficientOrdered_basis_normal k n a p mold,
166     weightedHomogeneousComponent_monomial]
167   let q := extendPhaseExponent n a p mold
168   let q' := extendPhaseExponent n a (p - 1) mold
169   change -((p : k) •
170       (if monomialWeight orderWeight q' = T then
171         MvPolynomial.monomial q' 1 else 0)) =
172     -MvPolynomial.pderiv (.inr (0 : Fin (n + 1)))
173       (if monomialWeight orderWeight q = T + 1 then
174         MvPolynomial.monomial q 1 else 0)
175   by_cases hp : p = 0
176   · simp [hp, q, q', MvPolynomial.pderiv_monomial,
177       extendPhaseExponent_newestMomentum_apply]
178     split <;> simp [MvPolynomial.pderiv_monomial,
179       extendPhaseExponent_newestMomentum_apply]
180   · have hp0 : 0 < p := Nat.pos_of_ne_zero hp
181     have hweight :
182         monomialWeight orderWeight q =
183           monomialWeight orderWeight q' + 1 := by
184       dsimp [q, q']
185       rw [← monomialWeight_extend_order, ← monomialWeight_extend_order]
186       omega
187     by_cases hq : monomialWeight orderWeight q = T + 1
188     · have hq' : monomialWeight orderWeight q' = T := by omega
189       rw [if_pos hq, if_pos hq', MvPolynomial.pderiv_monomial,
190         extendPhaseExponent_newestMomentum_apply,
191         extendPhaseExponent_sub_newestMomentum_general]
192       rw [MvPolynomial.smul_monomial]
193       simp [q']
194     · have hq' : monomialWeight orderWeight q' ≠ T := by
195         intro h
196         apply hq
197         omega
198       rw [if_neg hq, if_neg hq']
199       simp
200 
201 /-- For every presented Weyl element and every homogeneous order degree, the
202 symbol of commutation with the newest coordinate is the negative Poisson
203 bracket with its coordinate symbol.  No filtration-bound hypothesis on `w`
204 is required. -/
205 theorem principalComponent_coordinate_commutator_arbitrary
206     (n T : ℕ) (w : PresentedWeyl k (n + 1)) :
207     presentedPrincipalComponent k (@orderWeight (n + 1)) T
208         (Stafford.commutator (presentedCoordinate k n) w) =
209       -poissonBracket (MvPolynomial.X (.inl (0 : Fin (n + 1))))
210         (presentedPrincipalComponent k (@orderWeight (n + 1)) (T + 1) w) := by
211   have h := LinearMap.congr_fun (coordinate_symbol_linear_maps_eq k n T) w
212   change _ = -MvPolynomial.pderiv (.inr (0 : Fin (n + 1)))
213       (presentedPrincipalComponent k orderWeight (T + 1) w) at h
214   rw [poissonBracket_newestCoordinate]
215   exact h
216 
217 #print axioms presentedPBWBasis_succ_eq_coefficientOrdered
218 #print axioms extendPhaseExponent_sub_newestMomentum_general
219 #print axioms coordinate_symbol_linear_maps_eq
220 #print axioms principalComponent_coordinate_commutator_arbitrary
221 
222 end
223 
224 end Stafford38.WeylCoordinateCommutatorSymbol
225