This project (Stafford38) · 1029fdb382eee06e7b59bcf32801f40931e2079a
1 module 2 public import Stafford38.Geometry.ActualOptionCoordinateEtale 3 public import Stafford38.Geometry.DVRUniformizerNumerator 4 public import Stafford38.Geometry.LocalizationStageFractionCoefficients 5 public import Stafford38.Geometry.NormalizationHeightOne 6 7 @[expose] public section 8 9 set_option autoImplicit false 10 set_option linter.style.haveILetI false 11 set_option maxHeartbeats 5000000 12 13 noncomputable section 14 15 namespace Stafford38.Geometry.ActualNormalizationDivisorEtale 16 17 open IsLocalRing Polynomial 18 19 universe u v w x 20 21 /-- The actual option-coordinate map at a height-one center of a normal model 22 is formally etale when the selected coefficient fraction field is realized 23 inside the coefficient localization and the divisor numerator generates the 24 center's local maximal ideal. The local equivalence and the coefficient map 25 are constructed from the same localization-stage data. -/ 26 theorem formallyEtale_at_actual_normalization_center_of_specified_parameter 27 {k : Type u} [Field k] [CharZero k] {σ : Type v} [Fintype σ] 28 {B : Type w} [CommRing B] [IsDomain B] [Algebra k B] 29 [IsNoetherianRing B] [IsIntegrallyClosed B] 30 {M : Submonoid B} 31 [Algebra k (Localization M)] [IsScalarTower k B (Localization M)] 32 [IsDomain (Localization M)] 33 [Algebra (FractionRing (MvPolynomial σ k)) (Localization M)] 34 [IsScalarTower k (FractionRing (MvPolynomial σ k)) (Localization M)] 35 (p : Ideal (Localization M)) [hpPrime : p.IsPrime] [hpMax : p.IsMaximal] 36 {κ : Type u} [Field κ] 37 (rhoL : Localization M →+* κ) (rhoB : B →+* κ) 38 (hp : p = RingHom.ker rhoL) 39 (hLoc : rhoL.comp (algebraMap B (Localization M)) = rhoB) 40 (f : MvPolynomial σ k →ₐ[k] B) 41 (hinj : Function.Injective (rhoB.comp f.toRingHom)) 42 (hcoeffL : (algebraMap (FractionRing (MvPolynomial σ k)) (Localization M)).comp 43 (algebraMap (MvPolynomial σ k) (FractionRing (MvPolynomial σ k))) = 44 (algebraMap B (Localization M)).comp f.toRingHom) 45 (hfinite : Algebra.FiniteType (FractionRing (MvPolynomial σ k)) (Localization M)) 46 (hheight : (p.comap (algebraMap B (Localization M))).height = 1) 47 (a : B) (ha0 : a ≠ 0) (_haP : a ∈ p.comap (algebraMap B (Localization M))) 48 (hspan : Ideal.span (Set.singleton (algebraMap B 49 (Localization.AtPrime (p.comap (algebraMap B (Localization M)))) a)) = 50 maximalIdeal (Localization.AtPrime (p.comap (algebraMap B (Localization M))))) 51 (fOption : MvPolynomial (Option σ) k →ₐ[k] B) 52 (hnoneB : fOption (MvPolynomial.X none) = a) 53 (hsomeB : ∀ i : σ, 54 fOption (MvPolynomial.X (some i)) = f (MvPolynomial.X i)) : 55 let P := p.comap (algebraMap B (Localization M)) 56 let actualMap : MvPolynomial (Option σ) k →ₐ[k] 57 Localization.AtPrime P := 58 (IsScalarTower.toAlgHom k B (Localization.AtPrime P)).comp fOption 59 letI : Algebra (MvPolynomial (Option σ) k) (Localization.AtPrime P) := 60 actualMap.toRingHom.toAlgebra 61 Algebra.FormallyEtale (MvPolynomial (Option σ) k) (Localization.AtPrime P) := by 62 classical 63 let L := Localization M 64 let E := FractionRing (MvPolynomial σ k) 65 let P : Ideal B := p.comap (algebraMap B L) 66 letI : P.IsPrime := Ideal.comap_isPrime (algebraMap B L) p 67 have hPker : P = RingHom.ker rhoB := by 68 have hcenter : 69 p.comap (algebraMap B L) = RingHom.ker rhoB := by 70 ext b 71 rw [Ideal.mem_comap, hp, RingHom.mem_ker] 72 change rhoL (algebraMap B L b) = 0 ↔ rhoB b = 0 73 have heq : rhoL (algebraMap B L b) = rhoB b := by 74 simpa only [RingHom.comp_apply] using 75 congrArg (fun g : B →+* κ => g b) hLoc 76 rw [heq] 77 exact hcenter 78 let fRing : MvPolynomial σ k →+* B := f.toRingHom 79 let coeffRing : E →+* L := algebraMap E L 80 obtain ⟨e, hcenter, hcoeff⟩ := 81 LocalizationStageFractionCoefficients.stageFractionCoefficientMap_commutes 82 M p rhoL rhoB hp hLoc fRing hinj coeffRing hcoeffL 83 have hcenterP : P = RingHom.ker rhoB := by 84 exact hPker 85 have hDVR : IsDiscreteValuationRing (Localization.AtPrime P) := 86 NormalizationHeightOne.isDiscreteValuationRing_localization_of_height_eq_one P hheight 87 letI : IsDiscreteValuationRing (Localization.AtPrime P) := hDVR 88 letI : Algebra.FiniteType E L := hfinite 89 letI : PerfectField E := inferInstance 90 let hsep : Algebra.IsSeparable E p.ResidueField := 91 DVRParameterSmoothness.residueField_isSeparable_of_maximal_finiteType p 92 93 let Lp := Localization.AtPrime p 94 let Bp := Localization.AtPrime P 95 let aL : L := algebraMap B L a 96 let aLp : Lp := algebraMap L Lp aL 97 let aBp : Bp := algebraMap B Bp a 98 let evalL : Polynomial E →ₐ[E] L := Polynomial.aeval aL 99 letI : Algebra (Polynomial E) L := evalL.toRingHom.toAlgebra 100 have hscalarEL : algebraMap E L = 101 (algebraMap (Polynomial E) L).comp (algebraMap E (Polynomial E)) := by 102 ext c 103 change algebraMap E L c = evalL (algebraMap E (Polynomial E) c) 104 calc 105 algebraMap E L c = evalL (Polynomial.C c) := (Polynomial.aeval_C aL c).symm 106 _ = evalL (algebraMap E (Polynomial E) c) := rfl 107 letI : IsScalarTower E (Polynomial E) L := 108 IsScalarTower.of_algebraMap_eq' hscalarEL 109 have hmapa : e aLp = aBp := by 110 change e (algebraMap B Lp a) = algebraMap B Bp a 111 exact e.commutes a 112 113 let coeffLpRing : E →+* Lp := algebraMap E Lp 114 have hcoeffScalar (c : k) : coeffLpRing (algebraMap k E c) = 115 algebraMap B Lp (algebraMap k B c) := by 116 change algebraMap L Lp (algebraMap E L (algebraMap k E c)) = _ 117 have hcoeffBase : algebraMap E L (algebraMap k E c) = 118 algebraMap B L (algebraMap k B c) := by 119 have hconst := congrArg (fun g : MvPolynomial σ k →+* L => 120 g (MvPolynomial.C c)) hcoeffL 121 have hC : algebraMap (MvPolynomial σ k) E (MvPolynomial.C c) = 122 algebraMap k E c := by 123 calc 124 _ = algebraMap (MvPolynomial σ k) E 125 (algebraMap k (MvPolynomial σ k) c) := rfl 126 _ = _ := IsScalarTower.algebraMap_apply k (MvPolynomial σ k) E c 127 have hfC : f (MvPolynomial.C c) = algebraMap k B c := f.commutes c 128 change algebraMap E L (algebraMap (MvPolynomial σ k) E (MvPolynomial.C c)) = 129 algebraMap B L (f (MvPolynomial.C c)) at hconst 130 calc 131 algebraMap E L (algebraMap k E c) = 132 algebraMap E L (algebraMap (MvPolynomial σ k) E (MvPolynomial.C c)) := by rw [hC] 133 _ = algebraMap B L (f (MvPolynomial.C c)) := hconst 134 _ = algebraMap B L (algebraMap k B c) := by rw [hfC] 135 calc 136 algebraMap L Lp (algebraMap E L (algebraMap k E c)) = 137 algebraMap L Lp (algebraMap B L (algebraMap k B c)) := 138 congrArg (algebraMap L Lp) hcoeffBase 139 _ = algebraMap B Lp (algebraMap k B c) := 140 (IsScalarTower.algebraMap_apply B L Lp _).symm 141 letI : Algebra k Lp := Algebra.compHom Lp (algebraMap k E) 142 letI : SMul k Lp := Algebra.toSMul 143 letI : IsScalarTower k E Lp := IsScalarTower.of_algebraMap_eq' rfl 144 let cLp : E →ₐ[k] Lp := { 145 toRingHom := coeffLpRing 146 commutes' := by intro c; rfl 147 } 148 let evalLp : Polynomial E →ₐ[E] Lp := Polynomial.aeval aLp 149 letI : IsScalarTower E (Polynomial E) Lp := inferInstance 150 letI : IsScalarTower (Polynomial E) L Lp := inferInstance 151 have hEvalLp (z : Polynomial E) : 152 algebraMap (Polynomial E) Lp z = Polynomial.aeval aLp z := by 153 have hXlp : algebraMap (Polynomial E) Lp Polynomial.X = aLp := by 154 rw [IsScalarTower.algebraMap_apply (Polynomial E) L Lp Polynomial.X] 155 change algebraMap L Lp (evalL Polynomial.X) = aLp 156 simp only [evalL, Polynomial.aeval_X] 157 rfl 158 have hAlg : IsScalarTower.toAlgHom E (Polynomial E) Lp = evalLp := by 159 apply Polynomial.algHom_ext 160 rw [IsScalarTower.toAlgHom_apply, Polynomial.aeval_X] 161 exact hXlp 162 have hz := congrArg (fun g : Polynomial E →ₐ[E] Lp => g z) hAlg 163 simpa only [IsScalarTower.toAlgHom_apply, evalLp] using hz 164 165 let cBpRing : E →+* Bp := e.toRingEquiv.toRingHom.comp cLp.toRingHom 166 letI : Algebra E Bp := cBpRing.toAlgebra 167 letI : SMul E Bp := Algebra.toSMul 168 have hscalar_kE : algebraMap k Bp = 169 cBpRing.comp (algebraMap k E) := by 170 ext c 171 calc 172 algebraMap k Bp c = algebraMap B Bp (algebraMap k B c) := 173 (IsScalarTower.algebraMap_apply k B Bp c).symm 174 _ = e (algebraMap B Lp (algebraMap k B c)) := by rw [e.commutes] 175 _ = e (coeffLpRing (algebraMap k E c)) := congrArg e (hcoeffScalar c).symm 176 _ = cBpRing (algebraMap k E c) := rfl 177 letI : IsScalarTower k E Bp := IsScalarTower.of_algebraMap_eq' hscalar_kE 178 let evalBp : Polynomial E →ₐ[E] Bp := Polynomial.aeval aBp 179 letI : Algebra (Polynomial E) Bp := evalBp.toRingHom.toAlgebra 180 letI : SMul (Polynomial E) Bp := Algebra.toSMul 181 have hscalarEBp : algebraMap E Bp = 182 (algebraMap (Polynomial E) Bp).comp (algebraMap E (Polynomial E)) := by 183 ext c 184 change cBpRing c = evalBp (algebraMap E (Polynomial E) c) 185 rw [evalBp.commutes] 186 rfl 187 letI : IsScalarTower E (Polynomial E) Bp := IsScalarTower.of_algebraMap_eq' hscalarEBp 188 have hscalar_kPolyBp : algebraMap k Bp = 189 (algebraMap (Polynomial E) Bp).comp (algebraMap k (Polynomial E)) := by 190 ext c 191 change algebraMap k Bp c = 192 algebraMap (Polynomial E) Bp (algebraMap k (Polynomial E) c) 193 rw [IsScalarTower.algebraMap_apply k E (Polynomial E) c] 194 change algebraMap k Bp c = evalBp 195 (algebraMap E (Polynomial E) (algebraMap k E c)) 196 rw [evalBp.commutes] 197 exact congrArg (fun h : k →+* Bp => h c) hscalar_kE 198 letI : IsScalarTower k (Polynomial E) Bp := 199 IsScalarTower.of_algebraMap_eq' hscalar_kPolyBp 200 let ePoly : Lp ≃ₐ[Polynomial E] Bp := 201 LocalizationStageFractionCoefficients.polynomialAlgEquivOfCompatibleEvaluation 202 e.toRingEquiv 203 (fun c => rfl) 204 aLp aBp hmapa 205 hEvalLp 206 (fun z => by 207 rfl) 208 209 have haLp0 : aLp ≠ 0 := by 210 intro hz 211 have hloc : Function.Injective (algebraMap B Bp) := 212 IsLocalization.injective Bp P.primeCompl_le_nonZeroDivisors 213 have hz' : e aLp = 0 := by rw [hz]; simp 214 have hzero : algebraMap B Bp a = algebraMap B Bp 0 := by 215 calc 216 algebraMap B Bp a = e aLp := hmapa.symm 217 _ = 0 := hz' 218 _ = algebraMap B Bp 0 := by simp 219 exact ha0 (hloc hzero) 220 have hparam : 221 (Stafford38.Geometry.AsymptoticDivisorExistence.coordinateZeroPrime E).map 222 (algebraMap (Polynomial E) Lp) = maximalIdeal Lp := by 223 have hmapSpan : 224 Ideal.map (e : Lp →+* Bp) 225 ((Stafford38.Geometry.AsymptoticDivisorExistence.coordinateZeroPrime E).map 226 (algebraMap (Polynomial E) Lp)) = maximalIdeal Bp := by 227 rw [Stafford38.Geometry.AsymptoticDivisorExistence.coordinateZeroPrime, 228 Ideal.map_span, Ideal.map_span] 229 simp only [Set.image_singleton] 230 rw [hEvalLp, Polynomial.aeval_X] 231 change Ideal.span {e aLp} = maximalIdeal Bp 232 rw [hmapa] 233 change Ideal.span {algebraMap B Bp a} = maximalIdeal Bp 234 exact hspan 235 have hmaxMap : (maximalIdeal Lp).map (e : Lp →+* Bp) = maximalIdeal Bp := 236 IsLocalRing.map_ringEquiv_maximalIdeal e.toRingEquiv 237 have hmapEq : 238 ((Stafford38.Geometry.AsymptoticDivisorExistence.coordinateZeroPrime E).map 239 (algebraMap (Polynomial E) Lp)).map (e : Lp →+* Bp) = 240 (maximalIdeal Lp).map (e : Lp →+* Bp) := by 241 rw [hmapSpan, hmaxMap] 242 have hsups := (Ideal.map_eq_iff_sup_ker_eq_of_surjective 243 (e : Lp →+* Bp) e.surjective).mp hmapEq 244 have hker : RingHom.ker (e : Lp →+* Bp) = ⊥ := 245 (RingHom.injective_iff_ker_eq_bot _).mp e.injective 246 simpa [hker] using hsups 247 248 let q : Option σ → B := fun i => match i with 249 | none => a 250 | some j => f (MvPolynomial.X j) 251 let ρ : B →ₐ[k] Bp := IsScalarTower.toAlgHom k B Bp 252 have hnone : ePoly (algebraMap (Polynomial E) Lp (Polynomial.X : Polynomial E)) = 253 ρ a := by 254 have hX : algebraMap (Polynomial E) Lp Polynomial.X = aLp := by 255 simpa [Polynomial.aeval_X] using hEvalLp Polynomial.X 256 rw [hX] 257 change ePoly aLp = algebraMap B Bp a 258 have hePoly : ∀ x : Lp, ePoly x = e x := fun _ => rfl 259 rw [hePoly] 260 rw [hmapa] 261 have hsome : ∀ i : σ, 262 ePoly (algebraMap (Polynomial E) Lp 263 (Polynomial.C (algebraMap (MvPolynomial σ k) E (MvPolynomial.X i)))) = 264 ρ (f (MvPolynomial.X i)) := by 265 intro i 266 rw [ePoly.commutes] 267 change evalBp (Polynomial.C (algebraMap (MvPolynomial σ k) E 268 (MvPolynomial.X i))) = 269 algebraMap B Bp (f (MvPolynomial.X i)) 270 have hval := congrArg (fun g : E →+* Bp => 271 g (algebraMap (MvPolynomial σ k) E (MvPolynomial.X i))) hcoeff 272 have hval' : cBpRing (algebraMap (MvPolynomial σ k) E (MvPolynomial.X i)) = 273 LocalizationStageFractionCoefficients.fractionRingToAtPrime fRing rhoB P 274 hcenter hinj (algebraMap (MvPolynomial σ k) E (MvPolynomial.X i)) := by 275 change (e.toRingEquiv.toRingHom.comp 276 ((algebraMap L Lp).comp coeffRing)) 277 (algebraMap (MvPolynomial σ k) E (MvPolynomial.X i)) = _ at hval 278 exact hval 279 have hcoeffImage : cBpRing (algebraMap (MvPolynomial σ k) E 280 (MvPolynomial.X i)) = algebraMap B Bp (f (MvPolynomial.X i)) := by 281 calc 282 cBpRing (algebraMap (MvPolynomial σ k) E (MvPolynomial.X i)) = 283 LocalizationStageFractionCoefficients.fractionRingToAtPrime fRing rhoB P 284 hcenter hinj (algebraMap (MvPolynomial σ k) E (MvPolynomial.X i)) := hval' 285 _ = algebraMap B Bp (f (MvPolynomial.X i)) := 286 LocalizationStageFractionCoefficients.fractionRingToAtPrime_algebraMap 287 fRing rhoB P hcenter hinj (MvPolynomial.X i) 288 change Polynomial.aeval aBp (Polynomial.C 289 (algebraMap (MvPolynomial σ k) E (MvPolynomial.X i))) = _ 290 rw [Polynomial.aeval_C] 291 change cBpRing (algebraMap (MvPolynomial σ k) E (MvPolynomial.X i)) = _ 292 exact hcoeffImage 293 294 let fActual : MvPolynomial (Option σ) k →ₐ[k] Bp := ρ.comp fOption 295 letI : Algebra (MvPolynomial (Option σ) k) Bp := fActual.toRingHom.toAlgebra 296 have hX0 : algebraMap (Polynomial E) L Polynomial.X ≠ 0 := by 297 have hX : algebraMap (Polynomial E) L Polynomial.X = aL := by 298 change Polynomial.aeval aL Polynomial.X = aL 299 simp 300 intro h 301 have hmap : algebraMap L Lp (algebraMap (Polynomial E) L Polynomial.X) = aLp := by 302 rw [hX] 303 apply haLp0 304 have := congrArg (algebraMap L Lp) h 305 simpa [hmap] using this 306 have hmodel : Algebra.FormallyEtale (Polynomial E) Lp := 307 DVRParameterSmoothness.formallyEtale_localization_of_polynomial_uniformizer 308 (S := L) p hX0 hparam hsep 309 letI : Algebra.FormallyEtale (Polynomial E) Lp := hmodel 310 have htarget : Algebra.FormallyEtale (Polynomial E) Bp := 311 Algebra.FormallyEtale.of_equiv ePoly 312 have hnone' : fActual (MvPolynomial.X none) = 313 algebraMap (Polynomial E) Bp (Polynomial.X : Polynomial E) := by 314 have hf : fActual (MvPolynomial.X none) = ρ a := by 315 change ρ (fOption (MvPolynomial.X none)) = ρ a 316 rw [hnoneB] 317 calc 318 fActual (MvPolynomial.X none) = ρ (q none) := hf 319 _ = ePoly (algebraMap (Polynomial E) Lp Polynomial.X) := hnone.symm 320 _ = _ := ePoly.commutes Polynomial.X 321 have hsome' : ∀ i : σ, 322 fActual (MvPolynomial.X (some i)) = 323 algebraMap (Polynomial E) Bp 324 (Polynomial.C (algebraMap (MvPolynomial σ k) E (MvPolynomial.X i))) := by 325 intro i 326 have hf : fActual (MvPolynomial.X (some i)) = ρ (f (MvPolynomial.X i)) := by 327 change ρ (fOption (MvPolynomial.X (some i))) = ρ (f (MvPolynomial.X i)) 328 rw [hsomeB i] 329 calc 330 fActual (MvPolynomial.X (some i)) = ρ (q (some i)) := hf 331 _ = ePoly (algebraMap (Polynomial E) Lp 332 (Polynomial.C (algebraMap (MvPolynomial σ k) E (MvPolynomial.X i)))) := 333 (hsome i).symm 334 _ = _ := ePoly.commutes _ 335 have hformal := 336 OptionCoordinateEtaleComposition.formallyEtale_of_optionCoordinate_generator_images 337 fActual hnone' hsome' htarget 338 exact hformal 339 340 /-- The existential convenience wrapper chooses a local numerator once and 341 then delegates to the specified-parameter theorem. The actual chart producer 342 uses the stronger theorem directly to preserve its chosen divisor parameter. -/ 343 theorem formallyEtale_at_actual_normalization_center 344 {k : Type u} [Field k] [CharZero k] {σ : Type v} [Fintype σ] 345 {B : Type w} [CommRing B] [IsDomain B] [Algebra k B] 346 [IsNoetherianRing B] [IsIntegrallyClosed B] 347 {M : Submonoid B} 348 [Algebra k (Localization M)] [IsScalarTower k B (Localization M)] 349 [IsDomain (Localization M)] 350 [Algebra (FractionRing (MvPolynomial σ k)) (Localization M)] 351 [IsScalarTower k (FractionRing (MvPolynomial σ k)) (Localization M)] 352 (p : Ideal (Localization M)) [hpPrime : p.IsPrime] [hpMax : p.IsMaximal] 353 {κ : Type u} [Field κ] 354 (rhoL : Localization M →+* κ) (rhoB : B →+* κ) 355 (hp : p = RingHom.ker rhoL) 356 (hLoc : rhoL.comp (algebraMap B (Localization M)) = rhoB) 357 (f : MvPolynomial σ k →ₐ[k] B) 358 (hinj : Function.Injective (rhoB.comp f.toRingHom)) 359 (hcoeffL : (algebraMap (FractionRing (MvPolynomial σ k)) (Localization M)).comp 360 (algebraMap (MvPolynomial σ k) (FractionRing (MvPolynomial σ k))) = 361 (algebraMap B (Localization M)).comp f.toRingHom) 362 (hfinite : Algebra.FiniteType (FractionRing (MvPolynomial σ k)) (Localization M)) 363 (hheight : (p.comap (algebraMap B (Localization M))).height = 1) : 364 let P := p.comap (algebraMap B (Localization M)) 365 ∃ a : B, a ≠ 0 ∧ a ∈ P ∧ 366 Ideal.span {algebraMap B (Localization.AtPrime P) a} = 367 maximalIdeal (Localization.AtPrime P) ∧ 368 let q : Option σ → B := fun i => match i with 369 | none => a 370 | some j => f (MvPolynomial.X j) 371 let fOption : MvPolynomial (Option σ) k →ₐ[k] B := 372 MvPolynomial.aeval q 373 let actualMap : MvPolynomial (Option σ) k →ₐ[k] 374 Localization.AtPrime P := 375 (IsScalarTower.toAlgHom k B (Localization.AtPrime P)).comp fOption 376 letI : Algebra (MvPolynomial (Option σ) k) (Localization.AtPrime P) := 377 actualMap.toRingHom.toAlgebra 378 Algebra.FormallyEtale (MvPolynomial (Option σ) k) (Localization.AtPrime P) := by 379 classical 380 let L := Localization M 381 let P : Ideal B := p.comap (algebraMap B L) 382 letI : P.IsPrime := Ideal.comap_isPrime (algebraMap B L) p 383 have hDVR : IsDiscreteValuationRing (Localization.AtPrime P) := 384 NormalizationHeightOne.isDiscreteValuationRing_localization_of_height_eq_one P hheight 385 letI : IsDiscreteValuationRing (Localization.AtPrime P) := hDVR 386 obtain ⟨_π, _hπ, a, _b, ha0, haP, _hrep, hspan⟩ := 387 DVRUniformizerNumerator.exists_numerator_of_dvr_localization P 388 refine ⟨a, ha0, haP, hspan, ?_⟩ 389 let q : Option σ → B := fun i => match i with 390 | none => a 391 | some j => f (MvPolynomial.X j) 392 let fOption : MvPolynomial (Option σ) k →ₐ[k] B := MvPolynomial.aeval q 393 have hnoneB : fOption (MvPolynomial.X none) = a := by 394 simp [fOption, q] 395 have hsomeB : ∀ i : σ, 396 fOption (MvPolynomial.X (some i)) = f (MvPolynomial.X i) := by 397 intro i 398 simp [fOption, q] 399 have hcore := 400 formallyEtale_at_actual_normalization_center_of_specified_parameter 401 p rhoL rhoB hp hLoc f hinj hcoeffL hfinite hheight a ha0 haP hspan 402 fOption hnoneB hsomeB 403 simpa [q, fOption] using hcore 404 405 end Stafford38.Geometry.ActualNormalizationDivisorEtale 406