Degree-lowering linear (N, T) system equivalence for core certificates with H not dividing D
ProvedHodgeComputer.FourPlusTwoResidual.coprime_coreCertificateFor_iff_linearSystemalgebraic-geometrycommutative-algebrahodge-computerhodge-theorypolynomials
Let be any homogeneous sextic in , let be homogeneous of degree with (no squarefreeness assumption on ), and let be homogeneous of degree . Then CoreCertificateFor S D N (, output degree ) holds if and only if there exists a homogeneous polynomial of degree satisfying the lower-degree linear pair
Formalization Note Uses Irreducible core to deduce IsRelPrime D core directly from ¬ (core ∣ D) without requiring to be squarefree.
Preamble
import Definitions.Def_HodgeComputerFourPlusTwoSourceAlgebra
Formal statement
theorem HodgeComputer.FourPlusTwoResidual.coprime_coreCertificateFor_iff_linearSystem
(d : ℕ) (S D : MvPolynomial (Fin 4) ℂ) (N : Fin 4 → MvPolynomial (Fin 4) ℂ)
(hS : S.IsHomogeneous 6) (hD_ne : D ≠ 0) (hDd : D.IsHomogeneous d)
(hNd : ∀ i, (N i).IsHomogeneous (d + 1))
(hndvd : ¬ (HodgeComputer.FourPlusTwoResidual.core ∣ D)) :
HodgeComputer.FourPlusTwoResidual.CoreCertificateFor S D N ↔
∃ T : MvPolynomial (Fin 4) ℂ,
T.IsHomogeneous d ∧
HodgeComputer.FourPlusTwoResidual.CoprimeLinearCoreSystem S D N T := by sorrySource
Hodge.computer Atlas instance `four-plus-two-residual` and GitHub Discussion #120, https://github.com/hodge-computer/sextics/discussions/120