File size: 4,061 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 | import OAI.AlgebraicGeometry.HilbertScheme.Presentations.Local.DegreeRankSpecialization
import OAI.AlgebraicGeometry.HilbertScheme.Presentations.GeneratedPolynomialTest
/-! # Rank Test -/
namespace OAI.AlgebraicGeometry.HilbertScheme.Presentations.Local.RankTest.GradedHilbert
noncomputable section
/-! Over a local base, a flat homogeneous family has a prescribed field-fiber
Hilbert polynomial exactly when finitely many actual quotient ranks have the
prescribed values. -/
open _root_.MvPolynomial
universe u v z
theorem generatorHilbertFunctionBound_ge (n N : β) : N β€ Bounded.GeneratorFunction.GradedHilbert.generatorHilbertFunctionBound n N := by
unfold Bounded.GeneratorFunction.GradedHilbert.generatorHilbertFunctionBound Uniform.GroebnerCompletion.GradedHilbert.homogeneousGroebnerDegreeBound
have hp : 1 β€ 2 ^ ControlledCompletionCertificates.GradedHilbert.polynomialCompletionHorizon n N := Nat.one_le_two_pow
have hN : N β€ N * 2 ^ ControlledCompletionCertificates.GradedHilbert.polynomialCompletionHorizon n N := by
simpa only [Nat.mul_one] using Nat.mul_le_mul_left N hp
exact hN.trans (by
simpa only [Nat.one_mul] using
Nat.mul_le_mul_right (N * 2 ^ ControlledCompletionCertificates.GradedHilbert.polynomialCompletionHorizon n N) (Nat.succ_le_succ (Nat.zero_le n)))
variable {R : Type u} [CommRing R] [IsLocalRing R]
variable {K : Type v} [Field K] [Algebra R K]
variable {n : β} {ΞΉ : Type z} [Fintype ΞΉ]
theorem homogeneous_local_hilbertPolynomial_rank_test
(g : ΞΉ β Hilbert.Polynomial.GradedHilbert.CoordinateRing R n) (N : β) (hg : β i, (g i).IsHomogeneous N)
(hflat : β d, Module.Flat R (Hilbert.Polynomial.GradedHilbert.DegreeQuotient (Homogeneous.RelationPresentation.GradedHilbert.homogeneousGeneratorsIdeal g N hg).toIdeal (d + N)))
(P : Polynomial β) :
Hilbert.Polynomial.GradedHilbert.HasHilbertPolynomial (Homogeneous.RelationPresentation.GradedHilbert.homogeneousGeneratorsIdeal (Finite.SyzygyLifting.GradedHilbert.mapRelationVector (algebraMap R K) g) N
(fun i => (hg i).map (algebraMap R K))).toIdeal P β
P.natDegree β€ n β§ β i : Fin (n + 1),
(Module.finrank R (Hilbert.Polynomial.GradedHilbert.DegreeQuotient (Homogeneous.RelationPresentation.GradedHilbert.homogeneousGeneratorsIdeal g N hg).toIdeal
(Bounded.GeneratorFunction.GradedHilbert.generatorHilbertFunctionBound n N + i.val)) : β) =
P.eval ((Bounded.GeneratorFunction.GradedHilbert.generatorHilbertFunctionBound n N + i.val : β) : β) := by
refine (GeneratedPolynomialTest.GradedHilbert.homogeneousGenerators_hilbertPolynomial_finite_test
(Finite.SyzygyLifting.GradedHilbert.mapRelationVector (algebraMap R K) g) N (fun i => (hg i).map (algebraMap R K)) P).trans ?_
apply and_congr_right
intro _
apply forall_congr'
intro i
have hd : N β€ Bounded.GeneratorFunction.GradedHilbert.generatorHilbertFunctionBound n N + i.val :=
(generatorHilbertFunctionBound_ge n N).trans (Nat.le_add_right _ _)
have hr : Module.finrank K (Hilbert.Polynomial.GradedHilbert.DegreeQuotient
(Homogeneous.RelationPresentation.GradedHilbert.homogeneousGeneratorsIdeal (Finite.SyzygyLifting.GradedHilbert.mapRelationVector (algebraMap R K) g) N
(fun i => (hg i).map (algebraMap R K))).toIdeal (Bounded.GeneratorFunction.GradedHilbert.generatorHilbertFunctionBound n N + i.val)) =
Module.finrank R (Hilbert.Polynomial.GradedHilbert.DegreeQuotient (Homogeneous.RelationPresentation.GradedHilbert.homogeneousGeneratorsIdeal g N hg).toIdeal
(Bounded.GeneratorFunction.GradedHilbert.generatorHilbertFunctionBound n N + i.val)) := by
rw [β Nat.sub_add_cancel hd]
let := hflat (Bounded.GeneratorFunction.GradedHilbert.generatorHilbertFunctionBound n N + i.val - N)
exact DegreeRankSpecialization.GradedHilbert.homogeneousDegree_finrank_baseChange_of_local_flat g N hg _
change ((Module.finrank K _ : β) = _) β _
rw [hr]
end
end OAI.AlgebraicGeometry.HilbertScheme.Presentations.Local.RankTest.GradedHilbert
|