Stafford38/Geometry/ConormalScalarExtensionVanishing.lean

This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a

1 module
2 public import Mathlib.RingTheory.Nullstellensatz
3 public import Stafford38.Geometry.ScalarExtensionPoints
4 
5 @[expose] public section
6 
7 /-!
8 # Scalar extension of equation-conormal vanishing
9 -/
10 
11 namespace Stafford38.Geometry.ConormalScalarExtensionVanishing
12 
13 open Stafford38.Geometry.AffineConormalClosure
14 open Stafford38.Geometry.AffineConormalSpan
15 open Stafford38.Geometry.CoisotropicTranslation
16 open Stafford38.Geometry.ScalarExtensionPoints
17 open Stafford38.Characteristic
18 
19 noncomputable section
20 
21 variable {k K : Type*} [Field k] [IsAlgClosed k] [Field K] [Algebra k K]
22 variable {n : ℕ}
23 
24 def groundGradientSpan (I : Ideal (MvPolynomial (Fin n) k))
25     (y : Fin n → K) : Submodule K (Fin n → K) :=
26   Submodule.span K
27     (Set.range fun h : I => fun i =>
28       MvPolynomial.eval₂ (algebraMap k K) y (MvPolynomial.pderiv i h.1))
29 
30 theorem differential_mem_groundGradientSpan
31     (I : Ideal (MvPolynomial (Fin n) k)) (y : Fin n → K)
32     (hy : ∀ h ∈ I, MvPolynomial.eval₂ (algebraMap k K) y h = 0)
33     (g : MvPolynomial (Fin n) K)
34     (hg : g ∈ I.map (scalarPolynomialMap (k := k) (K := K) (Fin n))) :
35     (fun i => differentialAt y g i) ∈ groundGradientSpan I y := by
36   classical
37   change g ∈ Ideal.span
38     (scalarPolynomialMap (k := k) (K := K) (Fin n) '' I) at hg
39   induction hg using Submodule.span_induction with
40   | mem g hg =>
41       obtain ⟨h, hh, rfl⟩ := hg
42       apply Submodule.subset_span
43       refine ⟨⟨h, hh⟩, ?_⟩
44       funext i
45       exact (differentialAt_scalarPolynomialMap y h i).symm
46   | zero =>
47       change (0 : Fin n → K) ∈ groundGradientSpan I y
48       exact (groundGradientSpan I y).zero_mem
49   | add g h _ _ hg hh =>
50       have heq : (fun i => differentialAt y (g + h) i) =
51           (fun i => differentialAt y g i) + (fun i => differentialAt y h i) := by
52         funext i
53         simp [differentialAt]
54       rw [heq]
55       exact (groundGradientSpan I y).add_mem hg hh
56   | smul a g hg ih =>
57       have hgeval : MvPolynomial.eval y g = 0 := by
58         have hy' : y ∈ MvPolynomial.zeroLocus K
59             (I.map (scalarPolynomialMap (k := k) (K := K) (Fin n))) :=
60           (mem_zeroLocus_map_iff I y).mpr hy
61         exact hy' g hg
62       have heq : (fun i => differentialAt y (a * g) i) =
63           MvPolynomial.eval y a • (fun i => differentialAt y g i) := by
64         funext i
65         simp [differentialAt, MvPolynomial.pderiv_mul, hgeval]
66       rw [smul_eq_mul, heq]
67       exact (groundGradientSpan I y).smul_mem _ ih
68 
69 theorem conormal_covector_mem_groundGradientSpan
70     (I : Ideal (MvPolynomial (Fin n) k)) (q : PhaseVar n → K)
71     (hq : q ∈ equationConormalLocus
72       (I.map (scalarPolynomialMap (k := k) (K := K) (Fin n)))) :
73     (fun i => q (.inr i)) ∈ groundGradientSpan I (fun i => q (.inl i)) := by
74   classical
75   let y : Fin n → K := fun i => q (.inl i)
76   let ξ : Fin n → K := fun i => q (.inr i)
77   have hq' := (mem_equationConormalLocus_map_iff I q).mp hq
78   obtain ⟨c, hc⟩ := coordinate_mem_affineConormalSpace_exists_finsupp
79     y ξ _ hq'.2
80   have heq : ξ = ∑ g ∈ c.support, c g • (fun i => differentialAt y g.1 i) := by
81     funext i
82     simpa [Finset.sum_apply] using (hc i)
83   change ξ ∈ groundGradientSpan I y
84   rw [heq]
85   apply Submodule.sum_mem
86   intro g hg
87   exact (groundGradientSpan I y).smul_mem _
88     (differential_mem_groundGradientSpan I y hq'.1 g.1 g.2)
89 
90 theorem exists_ground_gradient_finsupp
91     (I : Ideal (MvPolynomial (Fin n) k)) (q : PhaseVar n → K)
92     (hq : q ∈ equationConormalLocus
93       (I.map (scalarPolynomialMap (k := k) (K := K) (Fin n)))) :
94     ∃ c : I →₀ K, ∀ i,
95       q (.inr i) = ∑ h ∈ c.support, c h *
96         MvPolynomial.eval₂ (algebraMap k K) (fun j => q (.inl j))
97           (MvPolynomial.pderiv i h.1) := by
98   classical
99   have hm := conormal_covector_mem_groundGradientSpan I q hq
100   rw [groundGradientSpan, Finsupp.mem_span_range_iff_exists_finsupp] at hm
101   obtain ⟨c, hc⟩ := hm
102   refine ⟨c, fun i => ?_⟩
103   have hi := congrFun hc i
104   simpa [Finsupp.linearCombination_apply, Finsupp.sum, mul_comm] using hi.symm
105 
106 def finiteGradientSubstitution {ι : Type*} [Fintype ι]
107     (h : ι → MvPolynomial (Fin n) k) :
108     SymbolRing k n →+* MvPolynomial (Fin n ⊕ ι) k :=
109   MvPolynomial.eval₂Hom MvPolynomial.C
110     (Sum.elim (fun i => MvPolynomial.X (.inl i))
111       (fun i => ∑ a : ι, MvPolynomial.X (.inr a) *
112         MvPolynomial.rename Sum.inl (MvPolynomial.pderiv i (h a))))
113 
114 theorem eval₂_finiteGradientSubstitution {L : Type*} [Field L] [Algebra k L]
115     {ι : Type*} [Fintype ι] (h : ι → MvPolynomial (Fin n) k)
116     (P : SymbolRing k n) (z : Fin n ⊕ ι → L) :
117     MvPolynomial.eval₂ (algebraMap k L) z (finiteGradientSubstitution h P) =
118       MvPolynomial.eval₂ (algebraMap k L)
119         (Sum.elim (fun i => z (.inl i))
120           (fun i => ∑ a : ι, z (.inr a) *
121             MvPolynomial.eval₂ (algebraMap k L) (fun j => z (.inl j))
122               (MvPolynomial.pderiv i (h a)))) P := by
123   induction P using MvPolynomial.induction_on with
124   | C a => simp [finiteGradientSubstitution]
125   | add P Q hP hQ =>
126       simp only [map_add, MvPolynomial.eval₂_add]
127       rw [hP, hQ]
128   | mul_X P i hP =>
129       simp only [map_mul, MvPolynomial.eval₂_mul]
130       rw [hP]
131       rcases i with i | i
132       · simp [finiteGradientSubstitution]
133       · simp [finiteGradientSubstitution, MvPolynomial.eval₂_rename]
134         left
135         congr 1
136 
137 theorem scalarExtension_vanishing
138     (I : Ideal (MvPolynomial (Fin n) k)) (P : SymbolRing k n)
139     (hP : ∀ q ∈ equationConormalLocus I, MvPolynomial.eval q P = 0)
140     (q : PhaseVar n → K)
141     (hq : q ∈ equationConormalLocus
142       (I.map (scalarPolynomialMap (k := k) (K := K) (Fin n)))) :
143     MvPolynomial.eval₂ (algebraMap k K) q P = 0 := by
144   classical
145   obtain ⟨c, hc⟩ := exists_ground_gradient_finsupp I q hq
146   let ι := {h : I // h ∈ c.support}
147   let equations : ι → MvPolynomial (Fin n) k := fun a => a.1.1
148   let ρ := finiteGradientSubstitution equations
149   let J : Ideal (MvPolynomial (Fin n ⊕ ι) k) :=
150     I.map (MvPolynomial.rename Sum.inl)
151   have hvan : ρ P ∈ MvPolynomial.vanishingIdeal k
152       (MvPolynomial.zeroLocus k J) := by
153     rw [MvPolynomial.mem_vanishingIdeal_iff]
154     intro z hz
155     let y : Fin n → k := fun i => z (.inl i)
156     let ξ : Fin n → k := fun i => ∑ a : ι, z (.inr a) * differentialAt y (equations a) i
157     have hy : y ∈ MvPolynomial.zeroLocus k I := by
158       intro f hf
159       have hm : MvPolynomial.rename Sum.inl f ∈ J :=
160         Ideal.mem_map_of_mem (MvPolynomial.rename Sum.inl) hf
161       have := hz _ hm
162       change MvPolynomial.eval₂ (algebraMap k k) z
163         (MvPolynomial.rename Sum.inl f) = 0 at this
164       rw [MvPolynomial.eval₂_rename] at this
165       have he : z ∘ Sum.inl = y := by rfl
166       rw [he] at this
167       simpa [MvPolynomial.aeval_def] using this
168     have hξ : coordinateCovector ξ ∈ affineConormalSpace y I := by
169       rw [affineConormalSpace_eq_equationCovectorSpan]
170       have heq : coordinateCovector ξ =
171           ∑ a : ι, z (.inr a) • differentialCovector y (equations a) := by
172         ext v
173         simp [ξ, coordinateCovector, differentialCovector,
174           Finset.sum_mul, Finset.mul_sum]
175         rw [Finset.sum_comm]
176         simp [mul_assoc]
177       rw [heq]
178       apply Submodule.sum_mem
179       intro a ha
180       apply Submodule.smul_mem
181       apply Submodule.subset_span
182       exact ⟨a.1, rfl⟩
183     have heval := eval₂_finiteGradientSubstitution equations P z
184     have hzero := hP (Sum.elim y ξ) ⟨hy, hξ⟩
185     simpa [ρ, y, ξ, MvPolynomial.aeval_def] using heval.trans hzero
186   letI : Finite ι := Finite.of_fintype ι
187   have hrad : ρ P ∈ J.radical := by
188     rw [← MvPolynomial.vanishingIdeal_zeroLocus_eq_radical (K := k) J]
189     exact hvan
190   obtain ⟨m, hm⟩ := (Ideal.mem_radical_iff.mp hrad)
191   let z : Fin n ⊕ ι → K := Sum.elim (fun i => q (.inl i)) (fun a => c a.1)
192   have hzJ : z ∈ MvPolynomial.zeroLocus K J := by
193     change z ∈ MvPolynomial.zeroLocus K
194       (I.map (MvPolynomial.rename Sum.inl))
195     rw [Ideal.map, MvPolynomial.zeroLocus_span]
196     rintro _ ⟨f, hf, rfl⟩
197     change MvPolynomial.eval₂ (algebraMap k K) z
198       (MvPolynomial.rename Sum.inl f) = 0
199     rw [MvPolynomial.eval₂_rename]
200     have he : z ∘ Sum.inl = fun i => q (.inl i) := by
201       funext i
202       rfl
203     rw [he]
204     exact ((mem_equationConormalLocus_map_iff I q).mp hq).1 f hf
205   have hpw : (MvPolynomial.eval₂ (algebraMap k K) z (ρ P)) ^ m = 0 := by
206     simpa only [MvPolynomial.aeval_def, map_pow] using hzJ _ hm
207   have hrho : MvPolynomial.eval₂ (algebraMap k K) z (ρ P) = 0 :=
208     eq_zero_of_pow_eq_zero hpw
209   rw [eval₂_finiteGradientSubstitution equations P z] at hrho
210   have hpoint :
211       Sum.elim (fun i => z (.inl i))
212         (fun i => ∑ a : ι, z (.inr a) *
213           MvPolynomial.eval₂ (algebraMap k K) (fun j => z (.inl j))
214             (MvPolynomial.pderiv i (equations a))) = q := by
215     funext v
216     rcases v with i | i
217     · rfl
218     · have hi := (hc i).symm
219       rw [← Finset.sum_attach] at hi
220       simpa [z, equations, ι, Finsupp.sum] using hi
221   rw [hpoint] at hrho
222   exact hrho
223 
224 #print axioms differential_mem_groundGradientSpan
225 #print axioms exists_ground_gradient_finsupp
226 #print axioms scalarExtension_vanishing
227 
228 end
229 end Stafford38.Geometry.ConormalScalarExtensionVanishing
230