Nonexistence of scalar-core and low-degree core certificates on four-plus-two-residual
ProvedHodgeComputer.FourPlusTwoResidual.no_low_degree_or_scalar_core_certificateLet be the sextic core of four-plus-two-residual and . The space of four-variable core certificates satisfies three unconditional obstructions over :
-
No scalar-multiple-of-core denominator: For every and every , is not a
CoreCertificate. Equivalently, the second-order pole equation has no polynomial solution with (settling the case of Griffiths–Dwork reduction on ). -
Unconditional strictness at degree : Every homogeneous sextic denominator admitting a
CoreCertificatesatisfies and therefore admits aStrictCoreCertificate. -
Low-degree exclusion (): No homogeneous polynomial of degree admits a
CoreCertificate.
Formalization Note Certified via exact integer Farkas dual functionals evaluated through a verified balanced merge engine over packed exponent keys.
import Definitions.Def_HodgeComputerFourPlusTwoSymmetry
theorem HodgeComputer.FourPlusTwoResidual.no_low_degree_or_scalar_core_certificate :
(∀ (c : ℂ) (N : Fin 4 → MvPolynomial (Fin 4) ℂ),
¬ HodgeComputer.FourPlusTwoResidual.CoreCertificate
(MvPolynomial.C c * HodgeComputer.FourPlusTwoResidual.core) N) ∧
(∀ (D : MvPolynomial (Fin 4) ℂ) (N : Fin 4 → MvPolynomial (Fin 4) ℂ),
D.IsHomogeneous 6 →
HodgeComputer.FourPlusTwoResidual.CoreCertificate D N →
¬ (HodgeComputer.FourPlusTwoResidual.core ∣ D) ∧
∃ p : Fin 4 → MvPolynomial (Fin 4) ℂ,
HodgeComputer.FourPlusTwoResidual.StrictCoreCertificate D p) ∧
(∀ (d : ℕ) (D : MvPolynomial (Fin 4) ℂ) (N : Fin 4 → MvPolynomial (Fin 4) ℂ),
d ≤ 4 → D.IsHomogeneous d →
¬ HodgeComputer.FourPlusTwoResidual.CoreCertificate D N) := by sorry