Download data/lean/OAI/AlgebraicGeometry/Resolution/Blowups/Component/ChoiceOpenCover.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.3 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/AlgebraicGeometry/Resolution/Blowups/Component/ChoiceOpenCover.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/AlgebraicGeometry/Resolution/Blowups/Component/ChoiceOpenCover.lean
-
curl -L -o ChoiceOpenCover.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/AlgebraicGeometry/Resolution/Blowups/Component/ChoiceOpenCover.lean
4.3 kB
| import OAI.AlgebraicGeometry.Resolution.Blowups.Component.CenterChoice | |
| import OAI.AlgebraicGeometry.Resolution.Blowups.NeighborhoodCoefficientOrder | |
| import OAI.AlgebraicGeometry.Resolution.Blowups.Curve.IntrinsicStep | |
| /-! # Choice Open Cover -/ | |
| namespace OAI.AlgebraicGeometry.Resolution.Blowups.Component.ChoiceOpenCover.Construction | |
| noncomputable section | |
| /-! A finite actual affine cover supplies canonical component-center choices from a finite differential-order bound. -/ | |
| universe u | |
| variable (k : Type u) [CommRing k] | |
| {R : Type u} [CommRing R] [Algebra k R] [Algebra.Smooth k R] | |
| theorem exists_component_choice_neighborhood | |
| (J : Ideal R) (n : β) (hbound : Relative.DifferentialBlowup.Construction.iteratedRelativeDifferentialIdeal k J (n + 1) = β€) | |
| (p : PrimeSpectrum R) : | |
| β s β p.asIdeal, Nonempty (CenterChoice.Construction.ComponentCenterChoice k (Localization.Away s) | |
| (J.map (algebraMap R (Localization.Away s))) n) := by | |
| let T := Relative.DifferentialBlowup.Construction.iteratedRelativeDifferentialIdeal k J n | |
| have hfirst : Relative.DifferentialBlowup.Construction.firstRelativeDifferentialIdeal k T = β€ := | |
| (Curve.IntrinsicStep.Construction.first_iteratedRelativeDifferentialIdeal k J n).trans hbound | |
| by_cases hT : T β€ p.asIdeal | |
| Β· have hex : β D : Derivation k R R, β z : T, D z.val β p.asIdeal := by | |
| by_contra h | |
| push Not at h | |
| have hle : Relative.DifferentialBlowup.Construction.firstRelativeDifferentialIdeal k T β€ p.asIdeal := by | |
| apply sup_le hT | |
| apply Ideal.span_le.mpr | |
| rintro _ β¨β¨D, zβ©, rflβ© | |
| exact h D z | |
| rw [hfirst] at hle | |
| exact p.isPrime.ne_top (top_le_iff.mp hle) | |
| obtain β¨D, z, hzβ© := hex | |
| let S := DifferentialHypersurfaceNeighborhood.Construction.derivationNeighborhood D z.val | |
| let : Algebra.Etale R S := Algebra.Etale.of_isLocalizationAway (D z.val) | |
| have hz' : algebraMap R S z.val β Relative.DifferentialBlowup.Construction.iteratedRelativeDifferentialIdeal k (J.map (algebraMap R S)) n := by | |
| rw [β Blowups.Smooth.DifferentialNaturality.Construction.smooth_iteratedRelativeDifferentialIdeal_baseChange k J n] | |
| exact Ideal.mem_map_of_mem _ z.property | |
| exact β¨D z.val, hz, β¨.normal (algebraMap R S z.val) (NeighborhoodCoefficientOrder.Construction.normalizedNeighborhoodDerivation D z.val) | |
| (NeighborhoodCoefficientOrder.Construction.normalizedNeighborhoodDerivation_equation D z.val) hz'β©β© | |
| Β· change Β¬ β x : R, x β T β x β p.asIdeal at hT | |
| push Not at hT | |
| obtain β¨s, hs, hspβ© := hT | |
| let S := Localization.Away s | |
| let : Algebra.Etale R S := Algebra.Etale.of_isLocalizationAway s | |
| have ht : Relative.DifferentialBlowup.Construction.iteratedRelativeDifferentialIdeal k (J.map (algebraMap R S)) n = β€ := by | |
| rw [β Blowups.Smooth.DifferentialNaturality.Construction.smooth_iteratedRelativeDifferentialIdeal_baseChange k J n] | |
| exact IdempotentQuotientCenter.Construction.center_map_away_member_eq_top T s hs | |
| exact β¨s, hsp, β¨.terminal htβ©β© | |
| theorem exists_finite_component_choice_cover | |
| (J : Ideal R) (n : β) (hbound : Relative.DifferentialBlowup.Construction.iteratedRelativeDifferentialIdeal k J (n + 1) = β€) : | |
| β (p : Finset (PrimeSpectrum R)) (s : p β R), | |
| (β¨ i, PrimeSpectrum.basicOpen (s i)) = β€ β§ | |
| β i, Nonempty (CenterChoice.Construction.ComponentCenterChoice k (Localization.Away (s i)) | |
| (J.map (algebraMap R (Localization.Away (s i)))) n) := by | |
| classical | |
| choose s hs C using exists_component_choice_neighborhood k J n hbound | |
| have hcover : Set.univ β β p : PrimeSpectrum R, (PrimeSpectrum.basicOpen (s p) : Set (PrimeSpectrum R)) := by | |
| intro p _ | |
| exact Set.mem_iUnion.mpr β¨p, hs pβ© | |
| obtain β¨t, htβ© := isCompact_univ.elim_finite_subcover | |
| (fun p => (PrimeSpectrum.basicOpen (s p) : Set (PrimeSpectrum R))) | |
| (fun p => (PrimeSpectrum.basicOpen (s p)).isOpen) hcover | |
| refine β¨t, fun p => s p.val, top_le_iff.mp ?_, fun p => C p.valβ© | |
| intro p _ | |
| obtain β¨q, hq, hpβ© := Set.mem_iUnionβ.mp (ht (Set.mem_univ p)) | |
| exact TopologicalSpace.Opens.mem_iSup.mpr β¨β¨q, hqβ©, hpβ© | |
| end | |
| end OAI.AlgebraicGeometry.Resolution.Blowups.Component.ChoiceOpenCover.Construction | |