Stafford38/Geometry/PaperHamiltonianFlow.lean

This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a

1 module
2 public import Stafford38.Characteristic.BaseRelativePoisson
3 public import Stafford38.Geometry.AffineConormalSpan
4 
5 @[expose] public section
6 
7 /-!
8 # Hamiltonian flows in the paper's proof
9 
10 The paper moves a common zero along the Hamiltonian flow of a base equation.
11 This file proves that statement directly from the base-relative Poisson
12 condition, by finite Taylor expansion on the affine fibre line.  The argument
13 does not assume translation stability as an axiom or as a prior theorem.
14 -/
15 
16 namespace Stafford38.Geometry.PaperHamiltonianFlow
17 
18 open Stafford38.Characteristic
19 open Stafford38.Characteristic.BaseRelativePoisson
20 open Stafford38.Geometry.CoisotropicTranslation
21 open Stafford38.Geometry.AffineConormalSpan
22 open Stafford38.Geometry.PointwiseConormalContainment
23 
24 noncomputable section
25 
26 variable {k : Type*} [Field k] {n : ℕ}
27 
28 /-- Public paper-route name for the canonical affine fibre-line polynomial
29 from `CoisotropicTranslation`. -/
30 abbrev affineFibreLinePolynomial
31     (y xi v : Fin n → k) (g : SymbolRing k n) : Polynomial k :=
32   Stafford38.Geometry.CoisotropicTranslation.affineFibreLinePolynomial y xi v g
33 
34 theorem affineFibreLinePolynomial_eq_canonical
35     (y xi v : Fin n → k) (g : SymbolRing k n) :
36     affineFibreLinePolynomial y xi v g =
37       Stafford38.Geometry.CoisotropicTranslation.affineFibreLinePolynomial y xi v g := rfl
38 
39 @[simp] theorem affineFibreLinePolynomial_C
40     (y xi v : Fin n → k) (a : k) :
41     affineFibreLinePolynomial y xi v (MvPolynomial.C a) = Polynomial.C a := by
42   simp [affineFibreLinePolynomial, Stafford38.Geometry.CoisotropicTranslation.affineFibreLinePolynomial]
43 
44 @[simp] theorem affineFibreLinePolynomial_zero
45     (y xi v : Fin n → k) :
46     affineFibreLinePolynomial y xi v 0 = 0 := by
47   simp [affineFibreLinePolynomial, Stafford38.Geometry.CoisotropicTranslation.affineFibreLinePolynomial]
48 
49 @[simp] theorem affineFibreLinePolynomial_add
50     (y xi v : Fin n → k) (g h : SymbolRing k n) :
51     affineFibreLinePolynomial y xi v (g + h) =
52       affineFibreLinePolynomial y xi v g + affineFibreLinePolynomial y xi v h := by
53   simp [affineFibreLinePolynomial, Stafford38.Geometry.CoisotropicTranslation.affineFibreLinePolynomial]
54 
55 @[simp] theorem affineFibreLinePolynomial_mul
56     (y xi v : Fin n → k) (g h : SymbolRing k n) :
57     affineFibreLinePolynomial y xi v (g * h) =
58       affineFibreLinePolynomial y xi v g * affineFibreLinePolynomial y xi v h := by
59   simp [affineFibreLinePolynomial, Stafford38.Geometry.CoisotropicTranslation.affineFibreLinePolynomial]
60 
61 theorem affineFibreLinePolynomial_sum {ι : Type*} [Fintype ι]
62     (y xi v : Fin n → k) (g : ι → SymbolRing k n) :
63     affineFibreLinePolynomial y xi v (∑ i, g i) =
64       ∑ i, affineFibreLinePolynomial y xi v (g i) := by
65   simp [affineFibreLinePolynomial, Stafford38.Geometry.CoisotropicTranslation.affineFibreLinePolynomial]
66 
67 @[simp] theorem affineFibreLinePolynomial_X_base
68     (y xi v : Fin n → k) (i : Fin n) :
69     affineFibreLinePolynomial y xi v (MvPolynomial.X (Sum.inl i)) =
70       Polynomial.C (y i) := by
71   simp [affineFibreLinePolynomial, Stafford38.Geometry.CoisotropicTranslation.affineFibreLinePolynomial]
72 
73 @[simp] theorem affineFibreLinePolynomial_X_fibre
74     (y xi v : Fin n → k) (i : Fin n) :
75     affineFibreLinePolynomial y xi v (MvPolynomial.X (Sum.inr i)) =
76       Polynomial.C (xi i) + Polynomial.C (v i) * Polynomial.X := by
77   simp [affineFibreLinePolynomial, Stafford38.Geometry.CoisotropicTranslation.affineFibreLinePolynomial]
78 
79 theorem derivative_affineFibreLinePolynomial
80     (y xi v : Fin n → k) (g : SymbolRing k n) :
81     Polynomial.derivative (affineFibreLinePolynomial y xi v g) =
82       affineFibreLinePolynomial y xi v (verticalDeriv v g) := by
83   induction g using MvPolynomial.induction_on with
84   | C a => simp [verticalDeriv]
85   | add p q hp hq =>
86       simp only [affineFibreLinePolynomial_add, Polynomial.derivative_add, hp, hq]
87       rw [verticalDeriv_add, affineFibreLinePolynomial_add]
88   | mul_X p i hp =>
89       rcases i with i | i
90       · simp only [affineFibreLinePolynomial_mul, affineFibreLinePolynomial_X_base,
91           Polynomial.derivative_mul, Polynomial.derivative_C, hp]
92         simp [verticalDeriv_mul]
93       · simp only [affineFibreLinePolynomial_mul, affineFibreLinePolynomial_X_fibre,
94           Polynomial.derivative_mul, Polynomial.derivative_add, Polynomial.derivative_C,
95           Polynomial.derivative_mul, Polynomial.derivative_X, zero_mul, zero_add,
96           mul_one, hp]
97         simp [verticalDeriv_mul]
98 
99 theorem eval_affineFibreLinePolynomial (y xi v : Fin n → k)
100     (g : SymbolRing k n) (t : k) :
101     Polynomial.eval t (affineFibreLinePolynomial y xi v g) =
102       MvPolynomial.eval (Sum.elim y (fun i => xi i + t * v i)) g := by
103   exact Stafford38.Geometry.CoisotropicTranslation.eval_affineFibreLinePolynomial
104     y xi v g t
105 
106 theorem eval_zero_affineFibreLinePolynomial (y xi v : Fin n → k)
107     (g : SymbolRing k n) :
108     Polynomial.eval 0 (affineFibreLinePolynomial y xi v g) =
109       MvPolynomial.eval (Sum.elim y xi) g := by
110   rw [eval_affineFibreLinePolynomial]
111   apply MvPolynomial.eval₂_congr
112   intro i c hi hc
113   rcases i with i | i <;> simp
114 
115 theorem affineFibreLinePolynomial_baseLift
116     (y xi v : Fin n → k) (f : MvPolynomial (Fin n) k) :
117     affineFibreLinePolynomial y xi v (baseLift f) =
118       Polynomial.C (MvPolynomial.eval y f) := by
119   induction f using MvPolynomial.induction_on with
120   | C a => simp [baseLift, affineFibreLinePolynomial]
121   | add p q hp hq => simp [hp, hq, MvPolynomial.eval_add]
122   | mul_X p i hp =>
123       rw [map_mul, affineFibreLinePolynomial_mul, hp,
124         MvPolynomial.eval_mul, MvPolynomial.eval_X]
125       simp [baseLift]
126 
127 theorem affineFibreLinePolynomial_baseLift_pderiv
128     (y xi v : Fin n → k) (f : MvPolynomial (Fin n) k) (i : Fin n) :
129     affineFibreLinePolynomial y xi v
130       (MvPolynomial.pderiv (Sum.inl i) (baseLift f)) =
131         Polynomial.C (differentialAt y f i) := by
132   rw [pderiv_baseLift_base, affineFibreLinePolynomial_baseLift]
133   rfl
134 
135 theorem affineFibreLinePolynomial_poissonBracket_baseLift
136     (y xi : Fin n → k) (f : MvPolynomial (Fin n) k) (g : SymbolRing k n) :
137     affineFibreLinePolynomial y xi (differentialAt y f)
138       (poissonBracket (baseLift f) g) =
139     affineFibreLinePolynomial y xi (differentialAt y f)
140       (verticalDeriv (differentialAt y f) g) := by
141   simp only [poissonBracket, pderiv_baseLift_base, pderiv_baseLift_fibre, zero_mul,
142     sub_zero, verticalDeriv]
143   rw [affineFibreLinePolynomial_sum, affineFibreLinePolynomial_sum]
144   apply Finset.sum_congr rfl
145   intro i hi
146   simp [← pderiv_baseLift_base, affineFibreLinePolynomial_baseLift_pderiv]
147 
148 theorem iterate_derivative_affineFibreLinePolynomial
149     (y xi : Fin n → k) (f : MvPolynomial (Fin n) k)
150     (g : SymbolRing k n) (m : ℕ) :
151     (Polynomial.derivative^[m])
152       (affineFibreLinePolynomial y xi (differentialAt y f) g) =
153         affineFibreLinePolynomial y xi (differentialAt y f) (hamiltonIter f m g) := by
154   induction m with
155   | zero => rfl
156   | succ m hm =>
157       rw [Function.iterate_succ_apply', hm, derivative_affineFibreLinePolynomial,
158         ← affineFibreLinePolynomial_poissonBracket_baseLift]
159       rfl
160 
161 /-- The paper's Hamiltonian map: base fixed and fibre translated by `t df_y`.
162 This is the arbitrary-start specialization of the shared affine fibre-point map. -/
163 abbrev paperHamiltonianFlowPoint (z : PhaseVar n → k)
164     (f : MvPolynomial (Fin n) k) (t : k) : PhaseVar n → k :=
165   Stafford38.Geometry.CoisotropicTranslation.affineFibreTranslatePoint
166     (fun i => z (Sum.inl i)) (fun i => z (Sum.inr i))
167     (differentialAt (fun j => z (Sum.inl j)) f) t
168 
169 theorem paperHamiltonianFlowPoint_eq_affineFibreTranslatePoint
170     (z : PhaseVar n → k) (f : MvPolynomial (Fin n) k) (t : k) :
171     paperHamiltonianFlowPoint z f t =
172       Stafford38.Geometry.CoisotropicTranslation.affineFibreTranslatePoint
173         (fun i => z (Sum.inl i)) (fun i => z (Sum.inr i))
174         (differentialAt (fun j => z (Sum.inl j)) f) t := rfl
175 
176 /-- Apply a finite family of the paper's commuting Hamiltonian translations.
177 Since each flow fixes the base coordinates, this is the canonical affine
178 fibre translation whose direction is the sum of the individual directions. -/
179 abbrev paperHamiltonianFlowsPoint {ι : Type*} [DecidableEq ι]
180     (z : PhaseVar n → k) (f : ι → MvPolynomial (Fin n) k)
181     (t : ι → k) (s : Finset ι) : PhaseVar n → k :=
182   affineFibreTranslatePoint
183     (fun i => z (Sum.inl i))
184     (fun i => z (Sum.inr i))
185     (fun i => s.sum (fun j =>
186       t j * differentialAt (fun l => z (Sum.inl l)) (f j) i))
187     1
188 
189 @[simp] theorem paperHamiltonianFlowsPoint_inl {ι : Type*} [DecidableEq ι]
190     (z : PhaseVar n → k) (f : ι → MvPolynomial (Fin n) k)
191     (t : ι → k) (s : Finset ι) (i : Fin n) :
192     paperHamiltonianFlowsPoint z f t s (Sum.inl i) = z (Sum.inl i) := rfl
193 
194 @[simp] theorem paperHamiltonianFlowsPoint_inr {ι : Type*} [DecidableEq ι]
195     (z : PhaseVar n → k) (f : ι → MvPolynomial (Fin n) k)
196     (t : ι → k) (s : Finset ι) (i : Fin n) :
197     paperHamiltonianFlowsPoint z f t s (Sum.inr i) =
198       z (Sum.inr i) + s.sum (fun j =>
199         t j * differentialAt (fun l => z (Sum.inl l)) (f j) i) := by
200   simp [paperHamiltonianFlowsPoint, affineFibreTranslatePoint]
201 
202 theorem paperHamiltonianFlowPoint_paperHamiltonianFlowsPoint_insert
203     {ι : Type*} [DecidableEq ι]
204     (z : PhaseVar n → k) (f : ι → MvPolynomial (Fin n) k)
205     (t : ι → k) (s : Finset ι) (i : ι) (hi : i ∉ s) :
206     paperHamiltonianFlowPoint (paperHamiltonianFlowsPoint z f t s) (f i) (t i) =
207       paperHamiltonianFlowsPoint z f t (insert i s) := by
208   funext q
209   rcases q with q | q
210   · rfl
211   · simp [paperHamiltonianFlowPoint, affineFibreTranslatePoint,
212       paperHamiltonianFlowsPoint, Finset.sum_insert, hi]
213     ring
214 
215 /-- One Hamiltonian flow preserves a common zero of a base-relatively Poisson
216 ideal. The proof is finite Taylor on the affine fibre line through `z`. -/
217 theorem paperHamiltonianFlow_preserves_commonZero
218     [CharZero k]
219     (J : Ideal (SymbolRing k n)) (hJ : IsBaseRelativePoisson J)
220     (z : PhaseVar n → k)
221     (hzero : ∀ g ∈ J, MvPolynomial.eval z g = 0)
222     (f : MvPolynomial (Fin n) k) (hf : baseLift f ∈ J)
223     (g : SymbolRing k n) (hg : g ∈ J) (t : k) :
224     MvPolynomial.eval (paperHamiltonianFlowPoint z f t) g = 0 := by
225   let y : Fin n → k := fun i => z (Sum.inl i)
226   let xi : Fin n → k := fun i => z (Sum.inr i)
227   have hz : Sum.elim y xi = z := by
228     funext i
229     rcases i with i | i <;> simp [y, xi]
230   have hline : affineFibreLinePolynomial y xi (differentialAt y f) g = 0 := by
231     apply polynomial_eq_zero_of_eval_iterate_derivative_zero
232     intro m
233     rw [iterate_derivative_affineFibreLinePolynomial,
234       eval_zero_affineFibreLinePolynomial]
235     rw [hz]
236     exact hzero _ (hamiltonIter_mem_of_isBaseRelativePoisson J hJ f hf g hg m)
237   have heval :
238       MvPolynomial.eval (paperHamiltonianFlowPoint z f t) g =
239         Polynomial.eval t (affineFibreLinePolynomial y xi (differentialAt y f) g) := by
240     rw [eval_affineFibreLinePolynomial]
241     apply MvPolynomial.eval₂_congr
242     intro i c hi hc
243     rcases i with i | i <;> simp [paperHamiltonianFlowPoint, affineFibreTranslatePoint, y, xi]
244   rw [heval, hline]
245   exact Polynomial.eval_zero
246 
247 /-- Any finite composition preserves a common zero, from an arbitrary starting
248 covector. -/
249 theorem paperHamiltonianFlows_preserve_commonZero
250     [CharZero k] {ι : Type*} [DecidableEq ι]
251     (J : Ideal (SymbolRing k n)) (hJ : IsBaseRelativePoisson J)
252     (z : PhaseVar n → k)
253     (hzero : ∀ g ∈ J, MvPolynomial.eval z g = 0)
254     (f : ι → MvPolynomial (Fin n) k)
255     (hf : ∀ i, baseLift (f i) ∈ J) (t : ι → k) (s : Finset ι) :
256     ∀ g ∈ J, MvPolynomial.eval (paperHamiltonianFlowsPoint z f t s) g = 0 := by
257   induction s using Finset.induction_on with
258   | empty =>
259       intro g hg
260       have hpoint : paperHamiltonianFlowsPoint z f t ∅ = z := by
261         funext q
262         rcases q with q | q <;> simp [paperHamiltonianFlowsPoint]
263       rw [hpoint]
264       exact hzero g hg
265   | @insert i s hi ih =>
266       intro g hg
267       rw [← paperHamiltonianFlowPoint_paperHamiltonianFlowsPoint_insert
268         z f t s i hi]
269       exact paperHamiltonianFlow_preserves_commonZero J hJ
270         (paperHamiltonianFlowsPoint z f t s) ih (f i) (hf i) g hg (t i)
271 
272 /-- The affine conormal consumer using the paper's finite successive-flow
273 argument. Every covector in the equation-defined conormal space is a finite
274 linear combination of equation differentials. -/
275 theorem affineConormal_coordinatePoint_isCommonZero
276     [CharZero k]
277     (J : Ideal (SymbolRing k n)) (hJ : IsBaseRelativePoisson J)
278     (y : Fin n → k)
279     (hzero : ∀ g ∈ J, MvPolynomial.eval (zeroSectionPoint y) g = 0)
280     (I : Ideal (MvPolynomial (Fin n) k))
281     (hlift : ∀ f : I, baseLift f.1 ∈ J)
282     (xi : Fin n → k)
283     (hxi : coordinateCovector xi ∈ affineConormalSpace y I) :
284     ∀ g ∈ J, MvPolynomial.eval (Sum.elim y xi) g = 0 := by
285   classical
286   obtain ⟨c, hc⟩ :=
287     coordinate_mem_affineConormalSpace_exists_finsupp y xi I hxi
288   let ι := {f : I // f ∈ c.support}
289   let equations : ι → MvPolynomial (Fin n) k := fun f => f.1.1
290   let parameters : ι → k := fun f => c f.1
291   have hflows :
292       paperHamiltonianFlowsPoint (zeroSectionPoint y) equations parameters
293         Finset.univ = differentialCombinationPoint y parameters equations := by
294     funext q
295     rcases q with i | i
296     · simp [zeroSectionPoint, paperHamiltonianFlowsPoint,
297         differentialCombinationPoint]
298     · simp [paperHamiltonianFlowsPoint, differentialCombinationPoint,
299         parameters, equations, zeroSectionPoint, differentialAt_baseLinearCombination]
300   have hpoint : differentialCombinationPoint y parameters equations = Sum.elim y xi := by
301     funext q
302     rcases q with i | i
303     · rfl
304     · rw [differentialCombinationPoint_inr]
305       simp only [parameters, equations, Sum.elim_inr]
306       rw [hc i]
307       exact (Finset.sum_subtype c.support (by simp)
308         (fun f => c f * differentialAt y f.1 i)).symm
309   rw [← hpoint, ← hflows]
310   exact paperHamiltonianFlows_preserve_commonZero J hJ (zeroSectionPoint y)
311     hzero equations (fun f => hlift f.1) parameters Finset.univ
312 
313 theorem paperHamiltonianFlowPoint_compose
314     (z : PhaseVar n → k) (f g : MvPolynomial (Fin n) k) (s t : k) :
315     paperHamiltonianFlowPoint (paperHamiltonianFlowPoint z f s) g t =
316       Sum.elim (fun i => z (Sum.inl i))
317         (fun i => z (Sum.inr i) + s * differentialAt (fun j => z (Sum.inl j)) f i +
318           t * differentialAt (fun j => z (Sum.inl j)) g i) := by
319   funext i
320   rcases i with i | i <;> simp [paperHamiltonianFlowPoint, affineFibreTranslatePoint]
321 
322 theorem paperHamiltonianFlowPoint_commute
323     (z : PhaseVar n → k) (f g : MvPolynomial (Fin n) k) (s t : k) :
324     paperHamiltonianFlowPoint (paperHamiltonianFlowPoint z f s) g t =
325       paperHamiltonianFlowPoint (paperHamiltonianFlowPoint z g t) f s := by
326   rw [paperHamiltonianFlowPoint_compose, paperHamiltonianFlowPoint_compose]
327   congr 1
328   funext i
329   ring
330 
331 /-- One Hamiltonian flow preserves a common zero of a base-relatively Poisson
332 ideal.  The proof is finite Taylor on the affine fibre line through `z`. -/
333 theorem two_paperHamiltonianFlows_preserve_commonZero
334     [CharZero k]
335     (J : Ideal (SymbolRing k n)) (hJ : IsBaseRelativePoisson J)
336     (z : PhaseVar n → k)
337     (hzero : ∀ g ∈ J, MvPolynomial.eval z g = 0)
338     (f g : MvPolynomial (Fin n) k) (hf : baseLift f ∈ J) (hg : baseLift g ∈ J)
339     (s t : k) (h : SymbolRing k n) (hh : h ∈ J) :
340     MvPolynomial.eval
341       (paperHamiltonianFlowPoint (paperHamiltonianFlowPoint z f s) g t) h = 0 := by
342   apply paperHamiltonianFlow_preserves_commonZero J hJ _ _ g hg h hh t
343   intro q hq
344   exact paperHamiltonianFlow_preserves_commonZero J hJ z hzero f hf q hq s
345 
346 #print axioms derivative_affineFibreLinePolynomial
347 #print axioms iterate_derivative_affineFibreLinePolynomial
348 #print axioms paperHamiltonianFlowPoint_compose
349 #print axioms paperHamiltonianFlowPoint_commute
350 #print axioms paperHamiltonianFlow_preserves_commonZero
351 #print axioms two_paperHamiltonianFlows_preserve_commonZero
352 #print axioms paperHamiltonianFlows_preserve_commonZero
353 #print axioms affineConormal_coordinatePoint_isCommonZero
354 
355 end
356 
357 end Stafford38.Geometry.PaperHamiltonianFlow
358