Reflection-chart transport from a weighted cubic relative primitive to a projective Hodge certificate
ProvedHodgeComputer.ReflectionChart.certificate_of_relative_primitiveLet be homogeneous polynomials of degree with irreducible, and suppose that along the affine reflection chart
their pullbacks factor through as and for polynomials . Assume that is irreducible and vanishes at the test point with .
If admits a cleared relative two-form primitive on the weighted threefold — that is, polynomials coprime to , , and satisfying
— then the projective sextic target satisfies HodgeComputer.HasCertificate F A 6 1.
This reusable transport theorem eliminates all six-variable Jacobian and homogeneization overhead for any -reflection-invariant sextic fourfold, reducing certificate construction on to a three-component relative primitive on the affine cubic threefold .
Formalization Note Coprimality on the double cover is deduced via even-exponent monomial projection, and homogeneous clearing into is carried out via Piola divergence transport on the ambient rational function field.
import Definitions.Def_HodgeComputerReflectionChart import Mathlib.RingTheory.Polynomial.UniqueFactorization
theorem HodgeComputer.ReflectionChart.certificate_of_relative_primitive
(F A : HodgeComputer.AmbientPoly 5) (f P : HodgeComputer.ReflectionChart.ChartPoly)
(hF_hom : F.IsHomogeneous 6) (hA_hom : A.IsHomogeneous 6)
(hF_irred : Irreducible F) (hH_irred : Irreducible (HodgeComputer.ReflectionChart.squareLift f))
(hF_pull : HodgeComputer.ReflectionChart.affinePullback F = HodgeComputer.ReflectionChart.squareLift f)
(hA_pull : HodgeComputer.ReflectionChart.affinePullback A = HodgeComputer.ReflectionChart.squareLift P)
(h_pt_zero : MvPolynomial.eval HodgeComputer.ReflectionChart.normalPoint
(HodgeComputer.ReflectionChart.squareLift f) = 0)
(h_pt_fu : MvPolynomial.eval HodgeComputer.ReflectionChart.normalPoint
(HodgeComputer.ReflectionChart.squareLift (MvPolynomial.pderiv 4 f)) ≠ 0)
(h_prim : HodgeComputer.ReflectionChart.RelativePrimitive f P) :
HodgeComputer.HasCertificate F A 6 1 := by sorry