math / data /lean /OAI /AlgebraicGeometry /HilbertScheme /Presentations /Bounded /GeneratorFunction.lean
Download data/lean/OAI/AlgebraicGeometry/HilbertScheme/Presentations/Bounded/GeneratorFunction.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.09 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/AlgebraicGeometry/HilbertScheme/Presentations/Bounded/GeneratorFunction.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/AlgebraicGeometry/HilbertScheme/Presentations/Bounded/GeneratorFunction.lean
-
curl -L -o GeneratorFunction.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/AlgebraicGeometry/HilbertScheme/Presentations/Bounded/GeneratorFunction.lean
3.09 kB
| import OAI.AlgebraicGeometry.HilbertScheme.Presentations.Bounded.InitialGenerators | |
| import OAI.AlgebraicGeometry.HilbertScheme.Presentations.Hilbert.Existence | |
| /-! # Generator Function -/ | |
| namespace OAI.AlgebraicGeometry.HilbertScheme.Presentations.Bounded.GeneratorFunction.GradedHilbert | |
| noncomputable section | |
| /-! The Hilbert function of an ideal generated in bounded degrees stabilizes at a field-independent degree, without a saturation hypothesis. -/ | |
| open _root_.MvPolynomial | |
| universe u | |
| theorem exponent_sup_degree_le {n : β} (G : Finset (Fin (n + 1) ββ β)) (B : β) | |
| (hG : β a β G, a.degree β€ B) : (G.sup id).degree β€ (n + 1) * B := by | |
| have hcoord (i : Fin (n + 1)) : (G.sup id) i β€ B := by | |
| apply Finset.sup_induction (p := fun a : Fin (n + 1) ββ β => a i β€ B) | |
| Β· exact Nat.zero_le B | |
| Β· intro a ha c hc | |
| exact max_le ha hc | |
| Β· intro a ha | |
| exact (Finsupp.le_degree i a).trans (hG a ha) | |
| rw [Finsupp.degree_eq_sum] | |
| calc | |
| _ β€ β _i : Fin (n + 1), B := Finset.sum_le_sum (fun i _ => hcoord i) | |
| _ = (n + 1) * B := by simp | |
| def generatorHilbertFunctionBound (n D : β) : β := (n + 1) * Uniform.GroebnerCompletion.GradedHilbert.homogeneousGroebnerDegreeBound n D | |
| variable {K : Type u} [Field K] {n : β} | |
| theorem bounded_generators_hilbertFunction_eq | |
| (I : HomogeneousIdeal (Hilbert.Polynomial.GradedHilbert.grading K n)) (B : Finset (Hilbert.Polynomial.GradedHilbert.CoordinateRing K n)) | |
| (hB : I.toIdeal = Ideal.span (B : Set (Hilbert.Polynomial.GradedHilbert.CoordinateRing K n))) | |
| (D : β) (hb : β b β B, b β 0 β§ β d β€ D, b.IsHomogeneous d) | |
| (P : Polynomial β) (hP : Hilbert.Polynomial.GradedHilbert.HasHilbertPolynomial I.toIdeal P) | |
| (d : β) (hd : generatorHilbertFunctionBound n D β€ d) : | |
| (Hilbert.Polynomial.GradedHilbert.hilbertFunction I.toIdeal d : β) = P.eval (d : β) := by | |
| let m : MonomialOrder (Fin (n + 1)) := MonomialOrder.lex | |
| obtain β¨G, hG, hGdegβ© := InitialGenerators.GradedHilbert.exists_uniform_initial_generators m I B hB D hb | |
| have hPG : Hilbert.Polynomial.GradedHilbert.HasHilbertPolynomial I.toIdeal (Hilbert.Existence.GradedHilbert.monomialHilbertPolynomial G) := by | |
| apply (InitialIdeal.GradedHilbert.hasHilbertPolynomial_initialIdeal_iff m I _).mp | |
| rw [hG] | |
| exact Hilbert.Existence.GradedHilbert.monomialSpan_hasHilbertPolynomial G | |
| have heq : Hilbert.Existence.GradedHilbert.monomialHilbertPolynomial G = P := Hilbert.Polynomial.GradedHilbert.hilbertPolynomial_unique hPG hP | |
| rw [β heq, β InitialIdeal.GradedHilbert.hilbertFunction_initialIdeal m I d, hG] | |
| change (Hilbert.Polynomial.GradedHilbert.hilbertFunction (Hilbert.MonomialBasis.GradedHilbert.monomialSpan K (G : Set (Fin (n + 1) ββ β))).toIdeal d : β) = _ | |
| rw [Hilbert.MonomialBasis.GradedHilbert.hilbertFunction_monomialSpan] | |
| exact Hilbert.Existence.GradedHilbert.card_standard_eventually_polynomial G d ((exponent_sup_degree_le G _ hGdeg).trans hd) | |
| end | |
| end OAI.AlgebraicGeometry.HilbertScheme.Presentations.Bounded.GeneratorFunction.GradedHilbert | |