File size: 3,801 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 | import OAI.AlgebraicGeometry.HilbertScheme.Presentations.Linear.FormQuotient
import OAI.AlgebraicGeometry.HilbertScheme.Presentations.ExactFinrank
/-! # Form Function -/
namespace OAI.AlgebraicGeometry.HilbertScheme.Presentations.Linear.FormFunction.GradedHilbert
noncomputable section
/-! The Hilbert-function recurrence from an actual regular linear form. -/
open _root_.MvPolynomial
universe u
variable {K : Type u} [Field K] {n : β}
theorem linearForm_hilbertFunction (I : HomogeneousIdeal (Hilbert.Polynomial.GradedHilbert.grading K n))
(l : Hilbert.Polynomial.GradedHilbert.CoordinateRing K n) (hl : l.IsHomogeneous 1)
(hreg : β f : Hilbert.Polynomial.GradedHilbert.CoordinateRing K n, l * f β I.toIdeal β f β I.toIdeal) (d : β) :
Hilbert.Polynomial.GradedHilbert.hilbertFunction I.toIdeal d + Hilbert.Polynomial.GradedHilbert.hilbertFunction (FormQuotient.GradedHilbert.linearFormQuotientIdeal I l hl).toIdeal (d + 1) =
Hilbert.Polynomial.GradedHilbert.hilbertFunction I.toIdeal (d + 1) := by
let β³ := Coordinate.IntegerQuotient.GradedHilbert.integerQuotientGrading I
let β := Coordinate.IntegerQuotient.GradedHilbert.integerQuotientGrading (FormQuotient.GradedHilbert.linearFormQuotientIdeal I l hl)
let i := (FormQuotient.GradedHilbert.linearFormScalar I l).restrictScalars K
let p := (FormQuotient.GradedHilbert.linearFormQuotientMap I l hl).restrictScalars K
have hi : β e x, x β ReindexedGrading.GradedModules.shiftedGrading β³ (-1) e β i x β β³ e := by
intro e x hx
change FormQuotient.GradedHilbert.linearFormScalar I l x β Coordinate.IntegerQuotient.GradedHilbert.integerQuotientGrading I e
have h := FormQuotient.GradedHilbert.linearFormScalar_homogeneous I l hl (e + -1) x hx
simpa only [neg_add_cancel_right] using h
have hp : β e x, x β β³ e β p x β β e := FormQuotient.GradedHilbert.linearFormQuotientMap_homogeneous I l hl
let i' := Graded.Exactness.GradedModules.degreeMap (ReindexedGrading.GradedModules.shiftedGrading β³ (-1)) β³ i hi ((d + 1 : β) : β€)
let p' := Graded.Exactness.GradedModules.degreeMap β³ β p hp ((d + 1 : β) : β€)
have hi' : Function.Injective i' := by
intro x y hxy
exact Subtype.ext (FormQuotient.GradedHilbert.linearFormScalar_injective I l hreg (congrArg Subtype.val hxy))
have hp' : Function.Surjective p' := Graded.Exactness.GradedModules.degreeMap_surjective β³ β p hp
(FormQuotient.GradedHilbert.linearFormQuotientMap_surjective I l hl) _
have hex : Function.Exact i' p' := Graded.Exactness.GradedModules.degreeMap_exact (ReindexedGrading.GradedModules.shiftedGrading β³ (-1)) β³ β i p hi hp
(FormQuotient.GradedHilbert.linearFormQuotient_exact I l hl) _
let Eβ : Hilbert.Polynomial.GradedHilbert.DegreeQuotient I.toIdeal d ββ[K] ReindexedGrading.GradedModules.shiftedGrading β³ (-1) ((d + 1 : β) : β€) :=
(Coordinate.IntegerQuotient.GradedHilbert.integerDegreeQuotientEquiv I d).trans (LinearEquiv.ofEq _ _ (by
change Coordinate.IntegerQuotient.GradedHilbert.integerQuotientGrading I (d : β€) = Coordinate.IntegerQuotient.GradedHilbert.integerQuotientGrading I (((d + 1 : β) : β€) + -1)
congr 1
omega))
let Eβ := Coordinate.IntegerQuotient.GradedHilbert.integerDegreeQuotientEquiv I (d + 1)
let Eβ := Coordinate.IntegerQuotient.GradedHilbert.integerDegreeQuotientEquiv (FormQuotient.GradedHilbert.linearFormQuotientIdeal I l hl) (d + 1)
let : Module.Finite K (β³ ((d + 1 : β) : β€)) := Module.Finite.equiv Eβ
have h := ExactFinrank.finrank_add_of_short_exact i' p' hi' hp' hex
rw [β Eβ.finrank_eq, β Eβ.finrank_eq, β Eβ.finrank_eq] at h
exact h
end
end OAI.AlgebraicGeometry.HilbertScheme.Presentations.Linear.FormFunction.GradedHilbert
|