Stafford38/Geometry/FiniteGradientBoundaryProducer.lean

This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a

1 module
2 public import Stafford38.Geometry.CanonicalAsymptoticLaurentProducer
3 public import Stafford38.Geometry.FiniteGradientBoundaryCertificateOver
4 
5 @[expose] public section
6 
7 /-!
8 # A finite-gradient boundary producer
9 
10 The completed-boundary consumer does not need a comparison of the entire
11 Zariski tangent space with a chosen matrix of tangent columns.  It needs only
12 one conormal covector.  This file replaces that global comparison by an
13 explicit finite expression of the required covector as a linear combination
14 of differentials of equations in the scalar-extended affine ideal.
15 
16 This is the algebraic certificate naturally supplied at a smooth generic
17 point by a Jacobian/conormal calculation.  It is strictly local to the one
18 annihilating row and is independently checkable coordinate by coordinate.
19 No normalization, projective closure, boundary divisor, or existence of such
20 a certificate is asserted here.
21 -/
22 
23 namespace Stafford38.Geometry.FiniteGradientBoundaryProducer
24 
25 open Stafford38
26 open Stafford38.CanonicalSupportVanishingReduction
27 open Stafford38.Characteristic
28 open Stafford38.Characteristic.ReducedSupportIdeal
29 open Stafford38.CharacteristicInitialIdeal
30 open Stafford38.Geometry.AffineConormalClosure
31 open Stafford38.Geometry.AffineConormalSpan
32 open Stafford38.Geometry.CanonicalAsymptoticLaurentProducer
33 open Stafford38.Geometry.CoisotropicTranslation
34 open Stafford38.Geometry.FormalDivisorLaurentConormal
35 open Stafford38.Geometry.FiniteGradientResidueExtension
36 open Stafford38.Geometry.ProjectiveConormalDehomogenization
37 open Stafford38.Geometry.ScalarExtensionPoints
38 open Stafford38.Geometry.PointwiseConormalContainment
39 open Stafford38.GeometryRetractionSpecialization
40 open Stafford38.WeylEulerResidue
41 open Stafford38.WeylIteratedEquivalence
42 open Stafford38.WeylPBWMonicBridge
43 
44 noncomputable section
45 
46 universe u
47 
48 variable {K : Type u} [Field K]
49 
50 /-! ## The finite-gradient bridge -/
51 
52 /-- A coordinate covector is conormal when its coordinates are an explicit
53 finite linear combination of gradients of equations in the ideal.  This
54 avoids any equality or inclusion assertion about the whole tangent space. -/
55 theorem coordinateCovector_mem_affineConormalSpace_of_finite_gradient
56     {m r : ℕ}
57     (I : Ideal (MvPolynomial (Fin m) K))
58     (y xi : Fin m → K)
59     (equations : Fin r → I)
60     (coefficients : Fin r → K)
61     (hgradient : ∀ i,
62       xi i = ∑ j, coefficients j * differentialAt y (equations j).1 i) :
63     coordinateCovector xi ∈ affineConormalSpace y I := by
64   classical
65   rw [affineConormalSpace_eq_equationCovectorSpan]
66   let g := baseLinearCombination coefficients (fun j ↦ (equations j).1)
67   have hg : g ∈ I := by
68     dsimp only [g, baseLinearCombination]
69     apply Ideal.sum_mem
70     intro j hj
71     exact I.mul_mem_left (MvPolynomial.C (coefficients j)) (equations j).2
72   let gI : I := ⟨g, hg⟩
73   have hxi : xi = fun i ↦ differentialAt y g i := by
74     funext i
75     rw [hgradient, differentialAt_baseLinearCombination]
76   have heq : coordinateCovector xi = differentialCovector y g := by
77     apply LinearMap.ext
78     intro v
79     simp only [coordinateCovector_apply, differentialCovector_apply, hxi]
80   rw [heq]
81   apply Submodule.subset_span
82   refine ⟨gI, ?_⟩
83   rfl
84 
85 /-! ## Corrected local boundary interface -/
86 
87 /- A compatibility name for the base-field specialization of the shared
88 residue-field certificate. -/
89 abbrev FiniteGradientBoundaryCertificate
90     (k : Type u) [Field k]
91     (m : ℕ) (hm : 0 < m)
92     (I : Ideal (MvPolynomial (Fin m) k)) :=
93   FiniteGradientBoundaryCertificateOver (k := k) (K := k) m hm I
94 
95 namespace FiniteGradientBoundaryCertificate
96 
97 /-! Keep the former constructor/projection names as aliases to the single
98 record owner; no second certificate structure is introduced. -/
99 abbrev mk {k : Type u} [Field k] {m : ℕ} {hm : 0 < m}
100     {I : Ideal (MvPolynomial (Fin m) k)} :=
101   FiniteGradientBoundaryCertificateOver.mk
102     (k := k) (K := k) (m := m) (hm := hm) (I := I)
103 
104 abbrev equationCount {k : Type u} [Field k] {m : ℕ} {hm : 0 < m}
105     {I : Ideal (MvPolynomial (Fin m) k)}
106     (self : FiniteGradientBoundaryCertificate k m hm I) :=
107   FiniteGradientBoundaryCertificateOver.equationCount
108     (k := k) (K := k) self
109 
110 abbrev q {k : Type u} [Field k] {m : ℕ} {hm : 0 < m}
111     {I : Ideal (MvPolynomial (Fin m) k)}
112     (self : FiniteGradientBoundaryCertificate k m hm I) :=
113   FiniteGradientBoundaryCertificateOver.q (k := k) (K := k) self
114 
115 abbrev ell {k : Type u} [Field k] {m : ℕ} {hm : 0 < m}
116     {I : Ideal (MvPolynomial (Fin m) k)}
117     (self : FiniteGradientBoundaryCertificate k m hm I) :=
118   FiniteGradientBoundaryCertificateOver.ell (k := k) (K := k) self
119 
120 abbrev q_origin_ne {k : Type u} [Field k] {m : ℕ} {hm : 0 < m}
121     {I : Ideal (MvPolynomial (Fin m) k)}
122     (self : FiniteGradientBoundaryCertificate k m hm I) :=
123   FiniteGradientBoundaryCertificateOver.q_origin_ne (k := k) (K := k) self
124 
125 abbrev projective_annihilation {k : Type u} [Field k] {m : ℕ} {hm : 0 < m}
126     {I : Ideal (MvPolynomial (Fin m) k)}
127     (self : FiniteGradientBoundaryCertificate k m hm I) :=
128   FiniteGradientBoundaryCertificateOver.projective_annihilation
129     (k := k) (K := k) self
130 
131 abbrev base_vanish {k : Type u} [Field k] {m : ℕ} {hm : 0 < m}
132     {I : Ideal (MvPolynomial (Fin m) k)}
133     (self : FiniteGradientBoundaryCertificate k m hm I) :=
134   FiniteGradientBoundaryCertificateOver.base_vanish
135     (k := k) (K := k) self
136 
137 abbrev equations {k : Type u} [Field k] {m : ℕ} {hm : 0 < m}
138     {I : Ideal (MvPolynomial (Fin m) k)}
139     (self : FiniteGradientBoundaryCertificate k m hm I) :=
140   FiniteGradientBoundaryCertificateOver.equations (k := k) (K := k) self
141 
142 abbrev coefficients {k : Type u} [Field k] {m : ℕ} {hm : 0 < m}
143     {I : Ideal (MvPolynomial (Fin m) k)}
144     (self : FiniteGradientBoundaryCertificate k m hm I) :=
145   FiniteGradientBoundaryCertificateOver.coefficients (k := k) (K := k) self
146 
147 abbrev gradient_identity {k : Type u} [Field k] {m : ℕ} {hm : 0 < m}
148     {I : Ideal (MvPolynomial (Fin m) k)}
149     (self : FiniteGradientBoundaryCertificate k m hm I) :=
150   FiniteGradientBoundaryCertificateOver.gradient_identity
151     (k := k) (K := k) self
152 
153 abbrev residue_axis {k : Type u} [Field k] {m : ℕ} {hm : 0 < m}
154     {I : Ideal (MvPolynomial (Fin m) k)}
155     (self : FiniteGradientBoundaryCertificate k m hm I) :=
156   FiniteGradientBoundaryCertificateOver.residue_axis
157     (k := k) (K := k) self
158 
159 end FiniteGradientBoundaryCertificate
160 
161 /-- The corrected finite-gradient certificate produces exactly the Laurent
162 conormal witness required by the canonical asymptotic step. -/
163 theorem exists_conormalAxis_of_finiteGradientBoundaryCertificate
164     {k : Type u} [Field k]
165     {m : ℕ} (hm : 0 < m)
166     (I : Ideal (MvPolynomial (Fin m) k))
167     (W : FiniteGradientBoundaryCertificate k m hm I) :
168     ∃ (y : Fin m → LaurentSeries k)
169       (xi : Fin m → PowerSeries k),
170       Sum.elim y
171           (fun i ↦ algebraMap (PowerSeries k) (LaurentSeries k) (xi i)) ∈
172         equationConormalLocus
173           (I.map (scalarPolynomialMap
174             (k := k) (K := LaurentSeries k) (Fin m))) ∧
175       residueColumn xi =
176         (fun i : Fin m ↦ if i = ⟨0, hm⟩ then 1 else 0) := by
177   let Iext := I.map
178     (scalarPolynomialMap (k := k) (K := LaurentSeries k) (Fin m))
179   let y := dehomogenizedPoint (laurentColumn W.q)
180   let xi : Fin m → PowerSeries k := fun i ↦ W.ell i.succ
181   have hconormal :
182       coordinateCovector (fun i ↦ laurentColumn W.ell i.succ) ∈
183         affineConormalSpace y Iext := by
184     exact coordinateCovector_mem_affineConormalSpace_of_finite_gradient
185       Iext y (fun i ↦ laurentColumn W.ell i.succ)
186         W.equations W.coefficients W.gradient_identity
187   refine ⟨y, xi, ?_, W.residue_axis⟩
188   refine ⟨?_, ?_⟩
189   · simpa [Iext, y] using W.base_vanish
190   · simpa [xi, laurentColumn, y, Iext] using hconormal
191 
192 /-! ## Pointwise handoff to the canonical producer -/
193 
194 /-- For fixed canonical data, a finite-gradient boundary certificate has
195 exactly the existential conclusion demanded by
196 `CanonicalAsymptoticLaurentProducer`.  Thus the remaining nonconstant
197 geometric producer may target this certificate instead of the stronger
198 all-tangent-space interface. -/
199 theorem canonicalAsymptoticLaurentWitness_of_finiteGradientBoundaryCertificate
200     {k : Type u} [Field k] [CharZero k] [IsAlgClosed k]
201     (n N : ℕ) (d : PresentedWeyl k (n + 1))
202     (W : FiniteGradientBoundaryCertificate k (n + 1)
203       (Nat.zero_lt_succ n)
204       (reducedOrderBaseIdeal k
205         (canonicalRightIdeal (presentedCoordinate k n) d N))) :
206     ∃ (y : Fin (n + 1) → LaurentSeries k)
207       (xi : Fin (n + 1) → PowerSeries k),
208       Sum.elim y
209           (fun i ↦ algebraMap (PowerSeries k) (LaurentSeries k) (xi i)) ∈
210         equationConormalLocus
211           ((reducedOrderBaseIdeal k
212             (canonicalRightIdeal (presentedCoordinate k n) d N)).map
213               (scalarPolynomialMap
214                 (k := k) (K := LaurentSeries k) (Fin (n + 1)))) ∧
215       residueColumn xi = pureMomentumFibreAxis k n := by
216   obtain ⟨y, xi, hmem, haxis⟩ :=
217     exists_conormalAxis_of_finiteGradientBoundaryCertificate
218       (k := k) (m := n + 1) (Nat.zero_lt_succ n)
219       (reducedOrderBaseIdeal k
220         (canonicalRightIdeal (presentedCoordinate k n) d N)) W
221   exact ⟨y, xi, hmem, haxis⟩
222 
223 #print axioms coordinateCovector_mem_affineConormalSpace_of_finite_gradient
224 #print axioms exists_conormalAxis_of_finiteGradientBoundaryCertificate
225 #print axioms canonicalAsymptoticLaurentWitness_of_finiteGradientBoundaryCertificate
226 
227 end
228 
229 end Stafford38.Geometry.FiniteGradientBoundaryProducer
230