Four plus two: strict four-variable core certificate
OpenHodgeComputer.FourPlusTwoResidual.coreCertificateLet be the sextic
and let .
Claim. There exist a nonzero homogeneous polynomial of some degree and homogeneous polynomials of degree such that
In other words, the degree-one rational vector field on solves
exactly, with no error term. The denominator is unrestricted; in particular it may be divisible by .
This is the four-variable core of the Hodge Computer instance four-plus-two-residual, whose polynomial is with source and pole parameter . A solution lifts to a Diamond certificate for that instance with denominator (this lift is formally verified in the sketch for HodgeComputer.FourPlusTwoResidual.certificate). Geometrically the claim says that the class of in of the Calabi–Yau threefold , which is anti-invariant under , vanishes on the complement of a divisor. That statement is asserted on paper by the weighted threefold theorem of the Hodge Computer documentation (Chapter 3B), so a solution is expected to exist, but no explicit is known and the degree may be large.
Formalization Note. The statement is ∃ D N, HodgeComputer.FourPlusTwoResidual.CoreCertificate D N over MvPolynomial (Fin 4) ℂ, with CoreCertificate from Definitions.Def_HodgeComputerFourPlusTwoCore.
import Definitions.Def_HodgeComputerFourPlusTwoCore
theorem HodgeComputer.FourPlusTwoResidual.coreCertificate :
∃ (D : MvPolynomial (Fin 4) ℂ) (N : Fin 4 → MvPolynomial (Fin 4) ℂ),
HodgeComputer.FourPlusTwoResidual.CoreCertificate D N := by sorry