Stafford38/Characteristic/CanonicalLaurentSymbolControl.lean

This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a

1 module
2 public import Stafford38.MathlibCompat.MvPolynomialCoeff
3 public import Stafford38.CanonicalSupportVanishingReduction
4 public import Stafford38.Geometry.ScalarExtensionPoints
5 
6 @[expose] public section
7 
8 /-!
9 # Conditional Laurent symbol control
10 
11 This module extracts a fibre polynomial from the canonical order symbol and
12 proves the ground-base conormal containment used by this Laurent-direction
13 route. Its `CanonicalGeometricBaseRelativePoisson` hypothesis is specific to
14 that route. The unconditional support proof in `FoundationClosure` uses the
15 checked localized-involutivity and general coisotropic route.
16 -/
17 
18 namespace Stafford38.Characteristic.CanonicalLaurentSymbolControl
19 
20 open Stafford38
21 open Stafford38.CanonicalSupportVanishingReduction
22 open Stafford38.Characteristic
23 open Stafford38.Characteristic.BaseRelativePoisson
24 open Stafford38.Characteristic.BaseZeroSection
25 open Stafford38.Characteristic.ReducedSupportIdeal
26 open Stafford38.CharacteristicFilteredQuotient
27 open Stafford38.CharacteristicInitialIdeal
28 open Stafford38.CharacteristicInitialIdealHomogeneous
29 open Stafford38.EulerSurjectivity
30 open Stafford38.Geometry.AffineConormalClosure
31 open Stafford38.Geometry.AffineConormalSpan
32 open Stafford38.Geometry.CoisotropicTranslation
33 open Stafford38.Geometry.LaurentConormalDirection
34 open Stafford38.Geometry.ScalarExtensionPoints
35 open Stafford38.WeylEulerResidue
36 open Stafford38.WeylIteratedEquivalence
37 open Stafford38.WeylLeadingSymbol
38 open Stafford38.WeylPBWMonicBridge
39 
40 noncomputable section
41 
42 universe u
43 
44 variable {k : Type u} [Field k] {n : ℕ}
45 
46 /-- A phase polynomial supported only on fibre variables comes from a fibre
47 polynomial by the canonical fibre inclusion. -/
48 theorem exists_fibreLift_eq_of_isFibreOnly
49     (Q : SymbolRing k n) (hQ : IsFibreOnly k Q) :
50     ∃ P : MvPolynomial (Fin n) k, fibreLift P = Q := by
51   apply MvPolynomial.exists_rename_eq_of_vars_subset_range Q Sum.inr
52     Sum.inr_injective
53   intro i hi
54   change i ∈ Q.vars at hi
55   rw [MvPolynomial.mem_vars] at hi
56   rcases hi with ⟨m, hm, him⟩
57   have hcoeff : MvPolynomial.coeff m Q ≠ 0 :=
58     MvPolynomial.mem_support_iff.mp hm
59   rcases i with i | i
60   · have hzero := hQ m hcoeff i
61     exact (Finsupp.mem_support_iff.mp him hzero).elim
62   · exact ⟨i, rfl⟩
63 
64 /-- The canonical order symbol has a literal fibre-polynomial preimage. -/
65 theorem exists_canonical_fibrePolynomial
66     (n N : ℕ) {d : PresentedWeyl k (n + 1)}
67     (hd : IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d) :
68     ∃ P : MvPolynomial (Fin (n + 1)) k,
69       fibreLift P =
70         presentedPrincipalComponent k
71           (@Stafford38.WeylFiltration.orderWeight (n + 1)) N d :=
72   exists_fibreLift_eq_of_isFibreOnly
73     (presentedPrincipalComponent k
74       (@Stafford38.WeylFiltration.orderWeight (n + 1)) N d)
75     (canonical_orderPrincipalComponent_isFibreOnly k n N hd)
76 
77 abbrev orderDecompositionGroundExtension :=
78   MvPolynomial.weightedHomogeneousSubmodule k
79     (@Stafford38.WeylFiltration.orderWeight n)
80 
81 local instance orderGradedAlgebraGroundExtensionInstance :
82     GradedAlgebra (orderDecompositionGroundExtension (k := k) (n := n)) :=
83   MvPolynomial.weightedGradedAlgebra k
84     (@Stafford38.WeylFiltration.orderWeight n)
85 
86 /-- A geometric zero of the scalar extension of the ground base contraction
87 lifts to the zero section of the geometric reduced support.  This avoids any
88 claim that scalar extension commutes with the whole base contraction. -/
89 theorem zeroSection_mem_geometricReducedSupport_of_groundBaseZero
90     {K : Type*} [Field K] [Algebra k K]
91     (W : RightIdeal (PresentedWeyl k n)) (y : Fin n → K)
92     (hy : ∀ f ∈ reducedOrderBaseIdeal k W,
93       MvPolynomial.eval₂ (algebraMap k K) y f = 0) :
94     zeroSectionPoint y ∈ MvPolynomial.zeroLocus K
95       (geometricReducedOrderSupportIdeal (k := k) (K := K) W) := by
96   rw [mem_zeroLocus_geometricReducedOrderSupportIdeal_iff]
97   intro P hP
98   obtain ⟨m, hm⟩ := (mem_reducedOrderSupportIdeal_iff k W P).mp hP
99   let f := fibreZeroSpecialization k (P ^ m)
100   have hcomponent :
101       (DirectSum.decompose
102           (orderDecompositionGroundExtension (k := k) (n := n)) (P ^ m) 0 :
103         SymbolRing k n) ∈ orderInitialIdeal k W :=
104     coe_mem_orderInitialIdeal_of_mem_orderSymbolRelation k W 0
105       (DirectSum.decompose
106         (orderDecompositionGroundExtension (k := k) (n := n)) (P ^ m) 0)
107       (decompose_mem_orderSymbolRelation_of_mem_orderInitialIdeal
108         k W (P ^ m) hm 0)
109   have hbaseLift : baseLift f ∈ reducedOrderSupportIdeal k W := by
110     rw [← zeroComponent_eq_baseLift_fibreZeroSpecialization]
111     exact orderInitialIdeal_le_reducedOrderSupportIdeal k W hcomponent
112   have hfbase : f ∈ reducedOrderBaseIdeal k W :=
113     (mem_reducedOrderBaseIdeal_iff k W f).mpr hbaseLift
114   have hfy := hy f hfbase
115   have heval :
116       MvPolynomial.eval (zeroSectionPoint y)
117         ((scalarPolynomialMap (k := k) (K := K) (PhaseVar n) P) ^ m) = 0 := by
118     rw [← map_pow,
119       ← eval_fibreZeroSpecialization K y
120         (scalarPolynomialMap (k := k) (K := K) (PhaseVar n) (P ^ m)),
121       ← scalarPolynomialMap_fibreZeroSpecialization]
122     simpa only [eval_scalarPolynomialMap] using hfy
123   have hp0 :
124       MvPolynomial.eval (zeroSectionPoint y)
125         (scalarPolynomialMap (k := k) (K := K) (PhaseVar n) P) = 0 := by
126     exact (pow_eq_zero_iff'.mp (by simpa only [map_pow] using heval)).1
127   simpa [eval_scalarPolynomialMap] using hp0
128 
129 /-- Under post-extension base-relative Poisson closure, the conormal locus of
130 the scalar-extended *ground* base contraction already lies in geometric
131 support.  Equality with the post-extension base contraction is unnecessary. -/
132 theorem equationConormalLocus_groundMap_subset_geometricReducedSupport
133     {K : Type*} [Field K] [Algebra k K] [CharZero K]
134     (W : RightIdeal (PresentedWeyl k n))
135     (hJ : IsBaseRelativePoisson
136       (geometricReducedOrderSupportIdeal (k := k) (K := K) W)) :
137     equationConormalLocus
138         ((reducedOrderBaseIdeal k W).map
139           (scalarPolynomialMap (k := k) (K := K) (Fin n))) ⊆
140       MvPolynomial.zeroLocus K
141         (geometricReducedOrderSupportIdeal (k := k) (K := K) W) := by
142   intro q hq
143   let y : Fin n → K := fun i => q (Sum.inl i)
144   let xi : Fin n → K := fun i => q (Sum.inr i)
145   have hy : ∀ f ∈ reducedOrderBaseIdeal k W,
146       MvPolynomial.eval₂ (algebraMap k K) y f = 0 :=
147     (mem_equationConormalLocus_map_iff
148       (reducedOrderBaseIdeal k W) q).mp hq |>.1
149   have hzero :=
150     zeroSection_mem_geometricReducedSupport_of_groundBaseZero W y hy
151   have hpoint := affineConormal_coordinatePoint_isCommonZero
152     (geometricReducedOrderSupportIdeal (k := k) (K := K) W) hJ y hzero
153     ((reducedOrderBaseIdeal k W).map
154       (scalarPolynomialMap (k := k) (K := K) (Fin n)))
155     (fun f ↦ map_baseContraction_le_geometricBaseContraction
156       (reducedOrderSupportIdeal k W) f.2)
157     xi hq.2
158   have hsplit : Sum.elim y xi = q := by
159     funext i
160     rcases i with i | i <;> rfl
161   rw [← hsplit]
162   exact hpoint
163 
164 /-- The precise post-extension base-relative Gabber input used by the Laurent
165 symbol argument. -/
166 def CanonicalGeometricBaseRelativePoisson : Prop :=
167   ∀ (k : Type u) [Field k] [CharZero k] [IsAlgClosed k] (n N : ℕ)
168     (d : PresentedWeyl k (n + 1)),
169     0 < N → IsPBWMonicAt k (.inr (0 : Fin (n + 1))) N d →
170       IsBaseRelativePoisson
171         (geometricReducedOrderSupportIdeal
172           (K := LaurentSeries k)
173           (canonicalRightIdeal (presentedCoordinate k n) d N))
174 
175 /-- Post-extension Gabber closure produces the packaged Laurent symbol control
176 consumed by the terminal proof. -/
177 theorem canonicalLaurentSymbolControl_of_geometric_inputs
178     (hgabber : CanonicalGeometricBaseRelativePoisson.{u}) :
179     CanonicalLaurentSymbolControl.{u} := by
180   intro k _ _ _ n N d hN hd
181   letI : CharZero (LaurentSeries k) :=
182     charZero_of_injective_algebraMap
183       (algebraMap k (LaurentSeries k)).injective
184   let W := canonicalRightIdeal (presentedCoordinate k n) d N
185   rcases exists_canonical_fibrePolynomial n N hd with ⟨P, hP⟩
186   refine ⟨P, hP, ?_⟩
187   intro q hq
188   have hqSupport : q ∈ MvPolynomial.zeroLocus (LaurentSeries k)
189       (geometricReducedOrderSupportIdeal
190         (K := LaurentSeries k) W) :=
191     equationConormalLocus_groundMap_subset_geometricReducedSupport
192       W (hgabber k n N d hN hd) hq
193   have hprincipal : presentedPrincipalComponent k
194         (@Stafford38.WeylFiltration.orderWeight (n + 1)) N d ∈
195       reducedOrderSupportIdeal k W :=
196     orderInitialIdeal_le_reducedOrderSupportIdeal k W
197       (canonical_orderPrincipalComponent_mem_initialIdeal k n N hd)
198   have hmapped : scalarPolynomialMap
199         (k := k) (K := LaurentSeries k) (PhaseVar (n + 1))
200         (presentedPrincipalComponent k
201           (@Stafford38.WeylFiltration.orderWeight (n + 1)) N d) ∈
202       geometricReducedOrderSupportIdeal
203         (K := LaurentSeries k) W :=
204     Ideal.le_radical (Ideal.mem_map_of_mem
205       (scalarPolynomialMap
206         (k := k) (K := LaurentSeries k) (PhaseVar (n + 1))) hprincipal)
207   have hzero := hqSupport _ hmapped
208   rw [← hP] at hzero
209   simpa only [MvPolynomial.aeval_eq_eval, eval_scalarPolynomialMap] using hzero
210 
211 #print axioms exists_fibreLift_eq_of_isFibreOnly
212 #print axioms exists_canonical_fibrePolynomial
213 #print axioms zeroSection_mem_geometricReducedSupport_of_groundBaseZero
214 #print axioms equationConormalLocus_groundMap_subset_geometricReducedSupport
215 #print axioms canonicalLaurentSymbolControl_of_geometric_inputs
216 
217 end
218 
219 end Stafford38.Characteristic.CanonicalLaurentSymbolControl
220