Stafford38/Geometry/CoisotropicTranslation.lean

This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a

1 module
2 public import Stafford38.Characteristic.Polynomial
3 
4 @[expose] public section
5 
6 /-!
7 # Poisson closure and vertical translation
8 
9 This file proves a polynomial statement used by the coisotropic part of the
10 Stafford argument.  If a Poisson ideal vanishes at a point of the zero section
11 and contains a polynomial in the base variables, then it also vanishes after
12 the fibre coordinate is translated by any scalar multiple of the differential
13 of that base polynomial at the point.
14 
15 Only polynomial rings, ideals, partial derivatives, and evaluation maps occur
16 here.  In particular, no variety, characteristic support, conormal bundle, or
17 geometric integration theorem is represented by these declarations.
18 -/
19 
20 namespace Stafford38.Geometry.CoisotropicTranslation
21 
22 open Stafford38.Characteristic
23 
24 noncomputable section
25 
26 variable {k : Type*} [Field k] {n : ℕ}
27 
28 /-- Embed a polynomial in the base coordinates into the phase-space ring. -/
29 def baseLift : MvPolynomial (Fin n) k →ₐ[k] SymbolRing k n :=
30   MvPolynomial.rename Sum.inl
31 
32 /-- Evaluate the differential of a base polynomial at a base point. -/
33 def differentialAt (y : Fin n → k) (f : MvPolynomial (Fin n) k) (i : Fin n) : k :=
34   MvPolynomial.eval y (MvPolynomial.pderiv i f)
35 
36 /-- The polynomial obtained by evaluating a phase-space polynomial along the
37 arbitrary affine fibre line `(y, xi + t v)`. -/
38 def affineFibreLinePolynomial
39     (y xi v : Fin n → k) (g : SymbolRing k n) : Polynomial k :=
40   MvPolynomial.aeval
41     (Sum.elim (fun i => Polynomial.C (y i))
42       (fun i => Polynomial.C (xi i) + Polynomial.C (v i) * Polynomial.X)) g
43 
44 /-- The point on the affine fibre line `(y, xi + t v)`. -/
45 def affineFibreTranslatePoint
46     (y xi v : Fin n → k) (t : k) : PhaseVar n → k
47   | Sum.inl i => y i
48   | Sum.inr i => xi i + t * v i
49 
50 @[simp] theorem affineFibreTranslatePoint_inl
51     (y xi v : Fin n → k) (t : k) (i : Fin n) :
52     affineFibreTranslatePoint y xi v t (Sum.inl i) = y i := rfl
53 
54 @[simp] theorem affineFibreTranslatePoint_inr
55     (y xi v : Fin n → k) (t : k) (i : Fin n) :
56     affineFibreTranslatePoint y xi v t (Sum.inr i) = xi i + t * v i := rfl
57 
58 /-- The zero-section point over `y`. -/
59 def zeroSectionPoint (y : Fin n → k) : PhaseVar n → k
60   | Sum.inl i => y i
61   | Sum.inr _ => 0
62 
63 /-- The zero-fibre specialization of `affineFibreTranslatePoint`, translating
64 `(y, 0)` by `t df_y`. -/
65 abbrev differentialTranslatePoint
66     (y : Fin n → k) (f : MvPolynomial (Fin n) k) (t : k) : PhaseVar n → k :=
67   affineFibreTranslatePoint y (fun _ => 0) (differentialAt y f) t
68 
69 theorem differentialTranslatePoint_eq_affineFibreTranslatePoint_zero
70     (y : Fin n → k) (f : MvPolynomial (Fin n) k) (t : k) :
71     differentialTranslatePoint y f t =
72       affineFibreTranslatePoint y (fun _ => 0) (differentialAt y f) t := rfl
73 
74 /-- The polynomial line `t ↦ g(y, t v)` in the fibre over `y`, the
75 zero-fibre specialization of `affineFibreLinePolynomial`. -/
76 abbrev fibreLinePolynomial
77     (y v : Fin n → k) (g : SymbolRing k n) : Polynomial k :=
78   affineFibreLinePolynomial y (fun _ => 0) v g
79 
80 theorem fibreLinePolynomial_eq_affineFibreLinePolynomial_zero
81     (y v : Fin n → k) (g : SymbolRing k n) :
82     fibreLinePolynomial y v g = affineFibreLinePolynomial y (fun _ => 0) v g := rfl
83 
84 /-- Directional derivative in the fibre variables. -/
85 def verticalDeriv (v : Fin n → k) (g : SymbolRing k n) : SymbolRing k n :=
86   ∑ i, MvPolynomial.C (v i) * MvPolynomial.pderiv (Sum.inr i) g
87 
88 @[simp] theorem verticalDeriv_C (v : Fin n → k) (a : k) :
89     verticalDeriv v (MvPolynomial.C a) = 0 := by
90   simp [verticalDeriv]
91 
92 theorem verticalDeriv_add (v : Fin n → k) (g h : SymbolRing k n) :
93     verticalDeriv v (g + h) = verticalDeriv v g + verticalDeriv v h := by
94   simp [verticalDeriv, mul_add, Finset.sum_add_distrib]
95 
96 theorem verticalDeriv_mul (v : Fin n → k) (g h : SymbolRing k n) :
97     verticalDeriv v (g * h) = verticalDeriv v g * h + g * verticalDeriv v h := by
98   simp only [verticalDeriv, MvPolynomial.pderiv_mul, mul_add,
99     Finset.sum_add_distrib]
100   apply congrArg₂ (· + ·)
101   · rw [Finset.sum_mul]
102     apply Finset.sum_congr rfl
103     intro i hi
104     ac_rfl
105   · rw [Finset.mul_sum]
106     apply Finset.sum_congr rfl
107     intro i hi
108     ac_rfl
109 
110 @[simp] theorem verticalDeriv_X_base (v : Fin n → k) (i : Fin n) :
111     verticalDeriv v (MvPolynomial.X (Sum.inl i)) = 0 := by
112   simp [verticalDeriv]
113 
114 @[simp] theorem verticalDeriv_X_fibre (v : Fin n → k) (i : Fin n) :
115     verticalDeriv v (MvPolynomial.X (Sum.inr i)) = MvPolynomial.C (v i) := by
116   classical
117   simp [verticalDeriv, Pi.single_apply]
118 
119 @[simp] theorem fibreLinePolynomial_C
120     (y v : Fin n → k) (a : k) :
121     fibreLinePolynomial y v (MvPolynomial.C a) = Polynomial.C a := by
122   simp [fibreLinePolynomial, affineFibreLinePolynomial]
123 
124 @[simp] theorem fibreLinePolynomial_zero (y v : Fin n → k) :
125     fibreLinePolynomial y v 0 = 0 := by
126   simp [fibreLinePolynomial, affineFibreLinePolynomial]
127 
128 @[simp] theorem fibreLinePolynomial_add
129     (y v : Fin n → k) (g h : SymbolRing k n) :
130     fibreLinePolynomial y v (g + h) =
131       fibreLinePolynomial y v g + fibreLinePolynomial y v h := by
132   simp [fibreLinePolynomial, affineFibreLinePolynomial]
133 
134 @[simp] theorem fibreLinePolynomial_mul
135     (y v : Fin n → k) (g h : SymbolRing k n) :
136     fibreLinePolynomial y v (g * h) =
137       fibreLinePolynomial y v g * fibreLinePolynomial y v h := by
138   simp [fibreLinePolynomial, affineFibreLinePolynomial]
139 
140 theorem fibreLinePolynomial_sum {ι : Type*} [Fintype ι]
141     (y v : Fin n → k) (g : ι → SymbolRing k n) :
142     fibreLinePolynomial y v (∑ i, g i) = ∑ i, fibreLinePolynomial y v (g i) := by
143   simp [fibreLinePolynomial, affineFibreLinePolynomial]
144 
145 @[simp] theorem fibreLinePolynomial_X_base
146     (y v : Fin n → k) (i : Fin n) :
147     fibreLinePolynomial y v (MvPolynomial.X (Sum.inl i)) = Polynomial.C (y i) := by
148   simp [fibreLinePolynomial, affineFibreLinePolynomial]
149 
150 @[simp] theorem fibreLinePolynomial_X_fibre
151     (y v : Fin n → k) (i : Fin n) :
152     fibreLinePolynomial y v (MvPolynomial.X (Sum.inr i)) =
153       Polynomial.C (v i) * Polynomial.X := by
154   simp [fibreLinePolynomial, affineFibreLinePolynomial]
155 
156 /-- Evaluating the affine fibre-line polynomial at time `t` is evaluation at
157 `(y, xi + t v)`. -/
158 theorem eval_affineFibreLinePolynomial (y xi v : Fin n → k)
159     (g : SymbolRing k n) (t : k) :
160     Polynomial.eval t (affineFibreLinePolynomial y xi v g) =
161       MvPolynomial.eval (Sum.elim y (fun i => xi i + t * v i)) g := by
162   change Polynomial.aeval t
163       (MvPolynomial.aeval (Sum.elim
164         (fun i => Polynomial.C (y i))
165         (fun i => Polynomial.C (xi i) + Polynomial.C (v i) * Polynomial.X)) g) = _
166   rw [MvPolynomial.comp_aeval_apply]
167   change MvPolynomial.aeval _ g = MvPolynomial.aeval _ g
168   apply DFunLike.congr_fun
169   apply MvPolynomial.algHom_ext
170   intro i
171   rcases i with i | i
172   · rw [MvPolynomial.aeval_X, MvPolynomial.aeval_X]
173     simp
174   · rw [MvPolynomial.aeval_X, MvPolynomial.aeval_X]
175     simp only [Sum.elim_inr, map_add, Polynomial.aeval_C, Polynomial.aeval_mul,
176       Polynomial.aeval_X]
177     simp
178     ring
179 
180 theorem derivative_fibreLinePolynomial
181     (y v : Fin n → k) (g : SymbolRing k n) :
182     Polynomial.derivative (fibreLinePolynomial y v g) =
183       fibreLinePolynomial y v (verticalDeriv v g) := by
184   induction g using MvPolynomial.induction_on with
185   | C a => simp [verticalDeriv]
186   | add p q hp hq =>
187       simp only [fibreLinePolynomial_add, Polynomial.derivative_add, hp, hq]
188       rw [verticalDeriv_add, fibreLinePolynomial_add]
189   | mul_X p i hp =>
190       rcases i with i | i
191       · simp only [fibreLinePolynomial_mul, fibreLinePolynomial_X_base, Polynomial.derivative_mul,
192           Polynomial.derivative_C, zero_mul, add_zero, hp]
193         simp [verticalDeriv_mul]
194       · simp only [fibreLinePolynomial_mul, fibreLinePolynomial_X_fibre, Polynomial.derivative_mul,
195           Polynomial.derivative_C, Polynomial.derivative_X, zero_mul, zero_add, mul_one, hp]
196         simp [verticalDeriv_mul]
197 
198 theorem eval_fibreLinePolynomial (y v : Fin n → k)
199     (g : SymbolRing k n) (t : k) :
200     Polynomial.eval t (fibreLinePolynomial y v g) =
201       MvPolynomial.eval (Sum.elim y (fun i => t * v i)) g := by
202   rw [fibreLinePolynomial_eq_affineFibreLinePolynomial_zero,
203     eval_affineFibreLinePolynomial]
204   apply MvPolynomial.eval₂_congr
205   intro i c hi hc
206   rcases i with i | i <;> simp
207 
208 theorem eval_zero_fibreLinePolynomial (y v : Fin n → k)
209     (g : SymbolRing k n) :
210     Polynomial.eval 0 (fibreLinePolynomial y v g) =
211       MvPolynomial.eval (zeroSectionPoint y) g := by
212   rw [eval_fibreLinePolynomial]
213   apply MvPolynomial.eval₂_congr
214   intro i c hi hc
215   rcases i with i | i <;> simp [zeroSectionPoint]
216 
217 theorem pderiv_baseLift_base (f : MvPolynomial (Fin n) k) (i : Fin n) :
218     MvPolynomial.pderiv (Sum.inl i) (baseLift f) =
219       baseLift (MvPolynomial.pderiv i f) := by
220   exact MvPolynomial.pderiv_rename Sum.inl_injective i f
221 
222 theorem pderiv_baseLift_fibre (f : MvPolynomial (Fin n) k) (i : Fin n) :
223     MvPolynomial.pderiv (Sum.inr i) (baseLift f) = 0 := by
224   apply MvPolynomial.pderiv_eq_zero_of_notMem_vars
225   intro hi
226   rcases MvPolynomial.mem_vars_rename Sum.inl f hi with ⟨j, hj, hji⟩
227   exact Sum.inl_ne_inr hji
228 
229 theorem fibreLinePolynomial_baseLift
230     (y v : Fin n → k) (f : MvPolynomial (Fin n) k) :
231     fibreLinePolynomial y v (baseLift f) = Polynomial.C (MvPolynomial.eval y f) := by
232   induction f using MvPolynomial.induction_on with
233   | C a => simp [baseLift, fibreLinePolynomial, differentialAt]
234   | add p q hp hq => simp only [map_add, fibreLinePolynomial_add, hp, hq,
235       MvPolynomial.eval_add, map_add]
236   | mul_X p j hp =>
237       rw [map_mul, fibreLinePolynomial_mul, hp, MvPolynomial.eval_mul,
238         MvPolynomial.eval_X, map_mul]
239       simp [baseLift]
240 
241 theorem fibreLinePolynomial_baseLift_pderiv
242     (y v : Fin n → k) (f : MvPolynomial (Fin n) k) (i : Fin n) :
243     fibreLinePolynomial y v
244         (MvPolynomial.pderiv (Sum.inl i) (baseLift f)) =
245       Polynomial.C (differentialAt y f i) := by
246   rw [pderiv_baseLift_base, fibreLinePolynomial_baseLift]
247   rfl
248 
249 theorem fibreLinePolynomial_poissonBracket_baseLift
250     (y : Fin n → k) (f : MvPolynomial (Fin n) k) (g : SymbolRing k n) :
251     fibreLinePolynomial y (differentialAt y f) (poissonBracket (baseLift f) g) =
252       fibreLinePolynomial y (differentialAt y f)
253         (verticalDeriv (differentialAt y f) g) := by
254   simp only [poissonBracket, pderiv_baseLift_base, pderiv_baseLift_fibre, zero_mul,
255     sub_zero, verticalDeriv, fibreLinePolynomial_sum]
256   apply Finset.sum_congr rfl
257   intro i hi
258   simp [fibreLinePolynomial_mul, fibreLinePolynomial_baseLift, differentialAt]
259 
260 /-! ## Iterated Hamiltonian differentiation -/
261 
262 /-- Iteration of bracketing on the left by one base equation. -/
263 def hamiltonIter (f : MvPolynomial (Fin n) k) : ℕ → SymbolRing k n → SymbolRing k n
264   | 0, g => g
265   | m + 1, g => poissonBracket (baseLift f) (hamiltonIter f m g)
266 
267 theorem iterate_derivative_fibreLinePolynomial
268     (y : Fin n → k) (f : MvPolynomial (Fin n) k)
269     (g : SymbolRing k n) (m : ℕ) :
270     (Polynomial.derivative^[m])
271         (fibreLinePolynomial y (differentialAt y f) g) =
272       fibreLinePolynomial y (differentialAt y f) (hamiltonIter f m g) := by
273   induction m with
274   | zero => rfl
275   | succ m hm =>
276       rw [Function.iterate_succ_apply', hm, derivative_fibreLinePolynomial,
277         ← fibreLinePolynomial_poissonBracket_baseLift]
278       rfl
279 
280 theorem hamiltonIter_mem
281     (J : Ideal (SymbolRing k n)) (hJ : IsPoisson J)
282     (f : MvPolynomial (Fin n) k) (hf : baseLift f ∈ J)
283     (g : SymbolRing k n) (hg : g ∈ J) :
284     ∀ m, hamiltonIter f m g ∈ J := by
285   intro m
286   induction m with
287   | zero => exact hg
288   | succ m hm => exact hJ (baseLift f) hf (hamiltonIter f m g)
289 
290 theorem polynomial_eq_zero_of_eval_iterate_derivative_zero
291     [CharZero k]
292     (q : Polynomial k)
293     (h : ∀ m, Polynomial.eval 0 ((Polynomial.derivative^[m]) q) = 0) :
294     q = 0 := by
295   ext m
296   have hm0 : ((Polynomial.derivative^[m]) q).coeff 0 = 0 := by
297     rw [Polynomial.coeff_zero_eq_eval_zero]
298     exact h m
299   have hm : (Nat.factorial m : k) * q.coeff m = 0 := by
300     simpa only [Polynomial.coeff_iterate_derivative, zero_add,
301       Nat.descFactorial_self, nsmul_eq_mul] using hm0
302   have hc : q.coeff m = 0 :=
303     (mul_eq_zero.mp hm).resolve_left (by exact_mod_cast Nat.factorial_ne_zero m)
304   simpa using hc
305 
306 theorem fibreLinePolynomial_eq_zero_of_poisson
307     [CharZero k]
308     (J : Ideal (SymbolRing k n)) (hJ : IsPoisson J)
309     (y : Fin n → k)
310     (hzero : ∀ g ∈ J, MvPolynomial.eval (zeroSectionPoint y) g = 0)
311     (f : MvPolynomial (Fin n) k) (hf : baseLift f ∈ J)
312     (g : SymbolRing k n) (hg : g ∈ J) :
313     fibreLinePolynomial y (differentialAt y f) g = 0 := by
314   apply polynomial_eq_zero_of_eval_iterate_derivative_zero
315   intro m
316   rw [iterate_derivative_fibreLinePolynomial, eval_zero_fibreLinePolynomial]
317   exact hzero _ (hamiltonIter_mem J hJ f hf g hg m)
318 
319 /-! ## The exact translation statement -/
320 
321 /--
322 A zero-section common zero of a Poisson ideal remains a common zero after
323 vertical translation by `t df_y`, for every scalar `t`, whenever the base
324 polynomial `f` belongs to the ideal.
325 
326 The radical hypothesis customary in the geometric application is unnecessary
327 for this polynomial implication; see the wrapper below.
328 -/
329 theorem zeroSection_stable_under_differential_translation
330     [CharZero k]
331     (J : Ideal (SymbolRing k n)) (hJ : IsPoisson J)
332     (y : Fin n → k)
333     (hzero : ∀ g ∈ J, MvPolynomial.eval (zeroSectionPoint y) g = 0)
334     (f : MvPolynomial (Fin n) k) (hf : baseLift f ∈ J)
335     (g : SymbolRing k n) (hg : g ∈ J) (t : k) :
336     MvPolynomial.eval (differentialTranslatePoint y f t) g = 0 := by
337   have heval :
338       MvPolynomial.eval (differentialTranslatePoint y f t) g =
339         MvPolynomial.eval (Sum.elim y (fun i => t * differentialAt y f i)) g := by
340     apply MvPolynomial.eval₂_congr
341     intro i c hi hc
342     rcases i with i | i <;> simp [differentialTranslatePoint, affineFibreTranslatePoint]
343   rw [heval, ← eval_fibreLinePolynomial]
344   rw [fibreLinePolynomial_eq_zero_of_poisson J hJ y hzero f hf g hg]
345   exact Polynomial.eval_zero
346 
347 /-- The same statement with the radical hypothesis carried explicitly. -/
348 theorem radicalPoisson_zeroSection_stable_under_differential_translation
349     [CharZero k]
350     (J : Ideal (SymbolRing k n)) (_hJrad : J.IsRadical) (hJ : IsPoisson J)
351     (y : Fin n → k)
352     (hzero : ∀ g ∈ J, MvPolynomial.eval (zeroSectionPoint y) g = 0)
353     (f : MvPolynomial (Fin n) k) (hf : baseLift f ∈ J)
354     (g : SymbolRing k n) (hg : g ∈ J) (t : k) :
355     MvPolynomial.eval (differentialTranslatePoint y f t) g = 0 :=
356   zeroSection_stable_under_differential_translation J hJ y hzero f hf g hg t
357 
358 #print axioms derivative_fibreLinePolynomial
359 #print axioms fibreLinePolynomial_poissonBracket_baseLift
360 #print axioms hamiltonIter_mem
361 #print axioms polynomial_eq_zero_of_eval_iterate_derivative_zero
362 #print axioms fibreLinePolynomial_eq_zero_of_poisson
363 #print axioms zeroSection_stable_under_differential_translation
364 #print axioms radicalPoisson_zeroSection_stable_under_differential_translation
365 
366 end
367 
368 end Stafford38.Geometry.CoisotropicTranslation
369