Canonical linear-in-u trace reduction for cubic threefolds with up-to-cubic sources
ProvedHodgeComputer.ReflectionChart.relative_primitive_of_canonical_tracealgebraic-geometrycommutative-algebrahodge-theorypolynomials
Consider a family of affine cubic threefolds
whose leading coefficient depends only on the pencil parameter and satisfies , while is irreducible and vanishes at . Let be any polynomial source of degree at most in with -independent coefficients , and define
If admits a cleared relative primitive for the linear-in- canonical trace source , then admits a cleared relative primitive for itself.
The reduction rests on the exact polynomial identity
which simultaneously removes the pole (via modulo ) and the branch multiple of , together with the fact that is constant along the fiber derivatives .
Formalization Note Scaling a witness for to preserves relative primality to because is irreducible and .
Preamble
import Definitions.Def_HodgeComputerReflectionChart import Mathlib.RingTheory.Polynomial.UniqueFactorization
Formal statement
theorem HodgeComputer.ReflectionChart.relative_primitive_of_canonical_trace
(f P ell c2 c1 c0 p0 p1 p2 p3 : HodgeComputer.ReflectionChart.ChartPoly)
(hf : f = ell * MvPolynomial.X 4 ^ 3 + c2 * MvPolynomial.X 4 ^ 2 + c1 * MvPolynomial.X 4 + c0)
(hP : P = p0 + p1 * MvPolynomial.X 4 + p2 * MvPolynomial.X 4 ^ 2 + p3 * MvPolynomial.X 4 ^ 3)
(hH_irred : Irreducible (HodgeComputer.ReflectionChart.squareLift f))
(h_pt_zero : MvPolynomial.eval HodgeComputer.ReflectionChart.normalPoint
(HodgeComputer.ReflectionChart.squareLift f) = 0)
(h_pt_ell : MvPolynomial.eval HodgeComputer.ReflectionChart.normalPoint
(HodgeComputer.ReflectionChart.squareLift ell) ≠ 0)
(hell_base : ∀ k : Fin 4, MvPolynomial.pderiv k.succ ell = 0)
(hc2_u : MvPolynomial.pderiv 4 c2 = 0)
(hc1_u : MvPolynomial.pderiv 4 c1 = 0)
(hc0_u : MvPolynomial.pderiv 4 c0 = 0)
(hp0_u : MvPolynomial.pderiv 4 p0 = 0)
(hp1_u : MvPolynomial.pderiv 4 p1 = 0)
(hp2_u : MvPolynomial.pderiv 4 p2 = 0)
(hp3_u : MvPolynomial.pderiv 4 p3 = 0)
(h_lin : HodgeComputer.ReflectionChart.RelativePrimitive f
(HodgeComputer.ReflectionChart.cubicTraceK0 ell c2 c1 c0 p0 p2 p3 +
HodgeComputer.ReflectionChart.cubicTraceK1 ell c2 p1 p2 p3 * MvPolynomial.X 4)) :
HodgeComputer.ReflectionChart.RelativePrimitive f P := by sorrySource
Generalization of the quadratic canonical trace identity in Hodge.computer Discussion #117 (`fqlx`, `benediamond`, `kmehltretter82`) to degree-three reflection sources such as `diagonal-permutation` (Discussion #177), https://github.com/hodge-computer/sextics/discussions/177