This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 public import Stafford38.Geometry.LaurentConormalDirection 3 public import Stafford38.Geometry.ProjectiveDivisorOrderGap 4 public import Stafford38.Geometry.ProjectiveEquationFormalChart 5 public import Stafford38.Geometry.ProjectiveTangentInclusion 6 7 @[expose] public section 8 9 /-! 10 # Laurent conormal specialization over a residue-field extension 11 12 The residue field of a divisorial valuation need not be the original ground 13 field. This file separates the two coefficient roles which are easy to 14 confuse in that situation: 15 16 * `k` is the field of coefficients of the original equations and symbol; 17 * `K` is the residue field of the boundary valuation, and the completed 18 coordinates live in `PowerSeries K` and `LaurentSeries K`. 19 20 Ground coefficients use the canonical map `k -> LaurentSeries K`; the theorem 21 `groundLaurentComposite_eq_algebraMap` proves that it agrees with the tower 22 composite `k -> K -> LaurentSeries K`. The fibre closure itself is taken over `K`. 23 The resulting contradiction uses only field and algebra-tower structure; in 24 particular it does not require `K` to be algebraically closed and does not 25 choose a map `K -> k`. 26 27 The final structure and consumer are a residue-extension version of the 28 completed-boundary local interface. They construct no projective chart, 29 normalization, divisor, or tangent comparison. 30 -/ 31 32 namespace Stafford38.Geometry.LaurentConormalResidueExtension 33 34 open Stafford38 35 open Stafford38.Characteristic 36 open Stafford38.Geometry.AffineConormalClosure 37 open Stafford38.Geometry.AffineConormalSpan 38 open Stafford38.Geometry.LaurentConormalDirection 39 open Stafford38.Geometry.ProjectiveConormalDehomogenization 40 open Stafford38.Geometry.ProjectiveDivisorOrderGap 41 open Stafford38.Geometry.ProjectiveEquationFormalChart 42 open Stafford38.Geometry.ProjectiveTangentInclusion 43 open Stafford38.GeometryPowerSeriesTangentLimit 44 open Stafford38.Geometry.ScalarExtensionPoints 45 open Stafford38.GeometryRetractionSpecialization 46 open Stafford38.GeometryFormalDivisorTangent 47 open Stafford38.GeometrySplitTangentMatrix 48 open Stafford38.Geometry.FormalDivisorLaurentConormal 49 50 noncomputable section 51 52 universe u 53 54 variable {k K : Type u} [Field k] [Field K] [Algebra k K] 55 variable {n : ℕ} 56 57 /-! ## The coefficient tower -/ 58 59 /-- The coefficient map used by equations over the ground field after 60 completion at a boundary with residue field `K`. -/ 61 abbrev groundLaurentMap : k →+* LaurentSeries K := 62 algebraMap k (LaurentSeries K) 63 64 /-- The coefficient tower composite agrees with the canonical structure map. 65 This bridge is needed because the tower instance is not available as a typeclass 66 instance for arbitrary `k → K → LaurentSeries K`. -/ 67 theorem groundLaurentComposite_eq_algebraMap : 68 (algebraMap K (LaurentSeries K)).comp (algebraMap k K) = 69 groundLaurentMap (k := k) (K := K) := by 70 refine RingHom.ext fun a => ?_ 71 simp only [RingHom.comp_apply, HahnSeries.algebraMap_apply', 72 PowerSeries.algebraMap_apply, Algebra.algebraMap_self_apply] 73 74 /-- Ground-field polynomials evaluated in the completed residue-field 75 Laurent series ring. -/ 76 abbrev groundPolynomialMap (σ : Type*) : 77 MvPolynomial σ k →+* MvPolynomial σ (LaurentSeries K) := 78 scalarPolynomialMap (k := k) (K := LaurentSeries K) σ 79 80 /-- The same ground polynomial after first extending its coefficients to the 81 residue field. -/ 82 abbrev residuePolynomialMap (σ : Type*) : 83 MvPolynomial σ k →+* MvPolynomial σ K := 84 scalarPolynomialMap (k := k) (K := K) σ 85 86 /-- Fibre lift after extending the ground coefficients to `K`. -/ 87 def residueFibreLift (P : MvPolynomial (Fin n) k) : 88 MvPolynomial (PhaseVar n) K := 89 fibreLift (residuePolynomialMap (k := k) (K := K) (Fin n) P) 90 91 /-- Extending first to `K` or using the ground coefficient map gives the same 92 Laurent-series evaluation. -/ 93 theorem eval_residueFibreLift_eq_ground 94 (P : MvPolynomial (Fin n) k) 95 (q : PhaseVar n → LaurentSeries K) : 96 MvPolynomial.eval₂ (algebraMap K (LaurentSeries K)) q 97 (residueFibreLift (k := k) (K := K) P) = 98 MvPolynomial.eval₂ (groundLaurentMap (k := k) (K := K)) q 99 (fibreLift P) := by 100 change MvPolynomial.eval₂ (algebraMap K (LaurentSeries K)) q 101 (MvPolynomial.rename Sum.inr 102 (MvPolynomial.map (algebraMap k K) P)) = _ 103 rw [← MvPolynomial.map_rename] 104 rw [MvPolynomial.eval₂_map] 105 rw [← groundLaurentComposite_eq_algebraMap (k := k) (K := K)] 106 rfl 107 108 /-- Evaluation of a ground polynomial agrees with evaluation of its 109 coefficient extension along the residue-field-to-Laurent map. -/ 110 theorem eval_residuePolynomialMap_eq_ground 111 (P : MvPolynomial (Fin n) k) 112 (v : Fin n → LaurentSeries K) : 113 MvPolynomial.eval₂ (algebraMap K (LaurentSeries K)) v 114 (residuePolynomialMap (k := k) (K := K) (Fin n) P) = 115 MvPolynomial.eval₂ (groundLaurentMap (k := k) (K := K)) v P := by 116 change MvPolynomial.eval₂ (algebraMap K (LaurentSeries K)) v 117 (MvPolynomial.map (algebraMap k K) P) = _ 118 rw [MvPolynomial.eval₂_map] 119 rw [← groundLaurentComposite_eq_algebraMap (k := k) (K := K)] 120 121 /-- Fibre-only evaluation ignores the base part of a phase point, also for 122 the explicit ground-to-Laurent coefficient map. -/ 123 theorem eval_ground_fibreLift 124 (P : MvPolynomial (Fin n) k) 125 (q : PhaseVar n → LaurentSeries K) : 126 MvPolynomial.eval₂ (groundLaurentMap (k := k) (K := K)) q 127 (fibreLift P) = 128 MvPolynomial.eval₂ (groundLaurentMap (k := k) (K := K)) 129 (fun i ↦ q (Sum.inr i)) P := by 130 rw [fibreLift, MvPolynomial.eval₂_rename] 131 rfl 132 133 /-! ## Fibre closure over the residue field -/ 134 135 /-- The projected closure of Laurent-valued phase points, with regular fibre 136 residue, formed over `K`. Its base coordinates may have poles. -/ 137 abbrev residueExtensionFibreClosure 138 (S : Set (PhaseVar n → LaurentSeries K)) : Set (Fin n → K) := 139 extensionFibreClosure (k := K) (K := LaurentSeries K) S 140 141 /-- The existing Laurent-residue theorem, instantiated over the residue field 142 `K`. No algebraic-closedness hypothesis occurs. -/ 143 theorem residue_mem_residueExtensionFibreClosure_of_laurent_generic 144 (S : Set (PhaseVar n → LaurentSeries K)) 145 (y : Fin n → LaurentSeries K) 146 (xi : Fin n → PowerSeries K) 147 (hgeneric : 148 Sum.elim y 149 (fun i ↦ algebraMap (PowerSeries K) (LaurentSeries K) (xi i)) ∈ S) : 150 residueColumn xi ∈ residueExtensionFibreClosure (K := K) S := by 151 exact residue_mem_extensionFibreClosure_of_laurent_generic 152 (k := K) S y xi hgeneric 153 154 /-! ## Ground-field contradiction -/ 155 156 /-- The scalar-extended equation-conormal locus associated with a ground 157 ideal, using the canonical `k -> LaurentSeries K` coefficient map. -/ 158 abbrev groundEquationConormalLocus 159 (I : Ideal (MvPolynomial (Fin n) k)) : 160 Set (PhaseVar n → LaurentSeries K) := 161 equationConormalLocus 162 (I.map (groundPolynomialMap (k := k) (K := K) (Fin n))) 163 164 /-- A fibre-only ground polynomial which vanishes on the whole completed 165 equation-conormal locus also vanishes after extending its coefficients to 166 `K` and evaluating at every regular fibre residue. -/ 167 theorem residueFibreLift_mem_extensionValuedVanishingIdeal_of_ground_vanishing 168 (I : Ideal (MvPolynomial (Fin n) k)) 169 (P : MvPolynomial (Fin n) k) 170 (hvanishes : 171 ∀ q ∈ groundEquationConormalLocus (k := k) (K := K) I, 172 MvPolynomial.eval₂ (groundLaurentMap (k := k) (K := K)) q 173 (fibreLift P) = 0) : 174 residuePolynomialMap (k := k) (K := K) (Fin n) P ∈ 175 extensionValuedVanishingIdeal (k := K) (K := LaurentSeries K) 176 (fibreImage (groundEquationConormalLocus (k := k) (K := K) I)) := by 177 rw [mem_extensionValuedVanishingIdeal_iff] 178 intro q hq 179 rcases hq with ⟨z, hz, rfl⟩ 180 rw [eval_residuePolynomialMap_eq_ground] 181 rw [← eval_ground_fibreLift] 182 exact hvanishes z hz 183 184 /-- Exact contradiction consumer for a residue-field-valued boundary arc. 185 186 The hypotheses deliberately use the composite coefficient map and an 187 `eval₂ (algebraMap k K)` axis value. The theorem requires neither 188 `IsAlgClosed K` nor a retraction from `K` to `k`. -/ 189 theorem false_of_ground_fibreOnly_symbol_one_on_residue_and_vanishing 190 (I : Ideal (MvPolynomial (Fin n) k)) 191 (P : MvPolynomial (Fin n) k) 192 (axis : Fin n → K) 193 (y : Fin n → LaurentSeries K) 194 (xi : Fin n → PowerSeries K) 195 (hgeneric : 196 Sum.elim y 197 (fun i ↦ algebraMap (PowerSeries K) (LaurentSeries K) (xi i)) ∈ 198 groundEquationConormalLocus (k := k) (K := K) I) 199 (hresidue : residueColumn xi = axis) 200 (hvanishes : 201 ∀ q ∈ groundEquationConormalLocus (k := k) (K := K) I, 202 MvPolynomial.eval₂ (groundLaurentMap (k := k) (K := K)) q 203 (fibreLift P) = 0) 204 (haxis : MvPolynomial.eval₂ (algebraMap k K) axis P = 1) : False := by 205 let S : Set (PhaseVar n → LaurentSeries K) := 206 groundEquationConormalLocus (k := k) (K := K) I 207 have hP : 208 residuePolynomialMap (k := k) (K := K) (Fin n) P ∈ 209 extensionValuedVanishingIdeal (k := K) (K := LaurentSeries K) 210 (fibreImage S) := by 211 exact residueFibreLift_mem_extensionValuedVanishingIdeal_of_ground_vanishing 212 (k := k) (K := K) I P (by 213 simpa [S] using hvanishes) 214 have hclosure : 215 residueColumn xi ∈ residueExtensionFibreClosure (K := K) S := 216 residue_mem_residueExtensionFibreClosure_of_laurent_generic 217 (K := K) S y xi (by simpa [S] using hgeneric) 218 have hzero : 219 MvPolynomial.eval (residueColumn xi) 220 (residuePolynomialMap (k := k) (K := K) (Fin n) P) = 0 := 221 hclosure _ hP 222 have hzero' : 223 MvPolynomial.eval₂ (algebraMap k K) (residueColumn xi) P = 0 := by 224 simpa [residuePolynomialMap, scalarPolynomialMap] using hzero 225 rw [hresidue, haxis] at hzero' 226 exact one_ne_zero hzero' 227 228 /-! ## Completed-boundary adapter over `K` -/ 229 230 /-- A completed projective boundary chart whose residue coefficients are in 231 `K`, while the target affine ideal remains defined over `k`. Its formal 232 tangent data are one fixed derivative-compatible geometric witness. The 233 one-sided tangent inclusion uses that same stored transverse column, never an 234 alternative split column. -/ 235 structure CompletedProjectiveBoundaryChartOver 236 (m : ℕ) (hm : 0 < m) 237 (I : Ideal (MvPolynomial (Fin m) k)) where 238 equationCount : ℕ 239 tangentCount : ℕ 240 equations : Fin equationCount → 241 MvPolynomial (Fin (m + 1)) (LaurentSeries K) 242 degree : Fin equationCount → ℕ 243 homogeneous : ∀ j, (equations j).IsHomogeneous (degree j) 244 q : Fin (m + 1) → PowerSeries K 245 Z : Matrix (Fin (m + 1)) (Fin tangentCount) (PowerSeries K) 246 rows : Fin tangentCount ↪ Fin (m + 1) 247 chart : Fin (m + 1) 248 zero : Fin (m + 1) 249 axis : Fin (m + 1) 250 ratio : PowerSeries K 251 q_chart : q chart = 1 252 Z_chart : ∀ j, Z chart j = 0 253 q_zero_ne : q zero ≠ 0 254 q_origin_ne : q 0 ≠ 0 255 ratio_ne : ratio ≠ 0 256 q_zero_vanish : PowerSeries.constantCoeff (q zero) = 0 257 ratio_vanish : PowerSeries.constantCoeff ratio = 0 258 q_axis : q axis = q zero * ratio 259 Z_zero_dvd : ∀ j, q zero ∣ Z zero j 260 Z_axis_dvd : ∀ j, q axis ∣ Z axis j 261 selected_minor_nonzero : 262 PowerSeries.constantCoeff (selectedMinor Z rows).det ≠ 0 263 equations_vanish : 264 ∀ j, MvPolynomial.eval (laurentColumn q) (equations j) = 0 265 ideal_containment : 266 I.map (groundPolynomialMap (k := k) (K := K) (Fin m)) ≤ 267 dehomogenizedEquationIdeal equations 268 axis_is_first_fibre : axis = Fin.succ ⟨0, hm⟩ 269 tau : Fin (m + 1) → PowerSeries K 270 C : Matrix (FormalTangentColumn (Fin tangentCount)) 271 (Fin (m + 1)) (PowerSeries K) 272 ell : Fin (m + 1) → PowerSeries K 273 left_inverse : C * formalTangentMatrix q Z tau = 1 274 annihilation : rowMul ell (formalTangentMatrix q Z tau) = 0 275 residue_axis : residueColumn ell = axisRow (k := K) axis 276 tangent_inclusion : 277 zariskiTangentSpace (dehomogenizedPoint (laurentColumn q)) 278 (I.map (groundPolynomialMap (k := k) (K := K) (Fin m))) ≤ 279 dehomogenizedTangentSpan (laurentColumn q) 280 (laurentNonpositionTangentMatrix Z tau) 281 282 /-- The residue-extension completed chart supplies a Laurent equation- 283 conormal point with pure first fibre residue. -/ 284 theorem exists_conormalAxis_of_completedProjectiveBoundaryChartOver 285 [CharZero K] 286 {m : ℕ} (hm : 0 < m) 287 (I : Ideal (MvPolynomial (Fin m) k)) 288 (W : CompletedProjectiveBoundaryChartOver (k := k) (K := K) m hm I) : 289 ∃ (y : Fin m → LaurentSeries K) 290 (xi : Fin m → PowerSeries K), 291 Sum.elim y 292 (fun i ↦ algebraMap (PowerSeries K) (LaurentSeries K) (xi i)) ∈ 293 groundEquationConormalLocus (k := k) (K := K) I ∧ 294 residueColumn xi = 295 (fun i : Fin m ↦ if i = ⟨0, hm⟩ then 1 else 0) := by 296 classical 297 let Iext := I.map (groundPolynomialMap (k := k) (K := K) (Fin m)) 298 have hbase : ∀ f ∈ Iext, 299 MvPolynomial.eval (dehomogenizedPoint (laurentColumn W.q)) f = 0 := by 300 intro f hf 301 exact eval_eq_zero_of_mem_dehomogenizedEquationIdeal 302 W.equations W.degree W.homogeneous (laurentColumn W.q) 303 (laurentColumn_ne_zero_of_ne_zero W.q W.q_origin_ne) 304 W.equations_vanish f (W.ideal_containment hf) 305 have htangent : 306 zariskiTangentSpace (dehomogenizedPoint (laurentColumn W.q)) Iext ≤ 307 dehomogenizedTangentSpan (laurentColumn W.q) 308 (laurentNonpositionTangentMatrix W.Z W.tau) := by 309 exact W.tangent_inclusion 310 have hphase := 311 laurentPhasePoint_mem_equationConormalLocus_of_zariski_le_span 312 Iext W.q W.ell W.Z W.tau W.q_origin_ne W.annihilation hbase htangent 313 refine ⟨dehomogenizedPoint (laurentColumn W.q), 314 (fun i : Fin m ↦ W.ell i.succ), ?_, ?_⟩ 315 · simpa [Iext, groundEquationConormalLocus, laurentColumn] using hphase 316 · calc 317 residueColumn (fun i : Fin m ↦ W.ell i.succ) = 318 (fun i : Fin m ↦ residueColumn W.ell i.succ) := 319 residueColumn_tail W.ell 320 _ = (fun i : Fin m ↦ axisRow (k := K) W.axis i.succ) := by 321 rw [W.residue_axis] 322 _ = (fun i : Fin m ↦ if i = ⟨0, hm⟩ then 1 else 0) := by 323 funext i 324 rw [W.axis_is_first_fibre] 325 by_cases hi : i = ⟨0, hm⟩ 326 · subst i 327 simp [axisRow] 328 · have hne : i.succ ≠ Fin.succ ⟨0, hm⟩ := by 329 intro h 330 exact hi (Fin.succ_injective m h) 331 change (if i.succ = Fin.succ ⟨0, hm⟩ then 1 else 0) = 332 (if i = ⟨0, hm⟩ then 1 else 0) 333 rw [if_neg hne, if_neg hi] 334 335 #print axioms groundLaurentMap 336 #print axioms groundPolynomialMap 337 #print axioms residuePolynomialMap 338 #print axioms residueFibreLift 339 #print axioms eval_residueFibreLift_eq_ground 340 #print axioms eval_residuePolynomialMap_eq_ground 341 #print axioms eval_ground_fibreLift 342 #print axioms residueExtensionFibreClosure 343 #print axioms residue_mem_residueExtensionFibreClosure_of_laurent_generic 344 #print axioms groundEquationConormalLocus 345 #print axioms residueFibreLift_mem_extensionValuedVanishingIdeal_of_ground_vanishing 346 #print axioms false_of_ground_fibreOnly_symbol_one_on_residue_and_vanishing 347 #print axioms CompletedProjectiveBoundaryChartOver 348 #print axioms exists_conormalAxis_of_completedProjectiveBoundaryChartOver 349 350 end 351 352 end Stafford38.Geometry.LaurentConormalResidueExtension 353