No one-component rational field is a four-plus-two residual certificate
ProvedHodgeComputer.FourPlusTwoResidual.noOneComponentCertificateLet be the six-variable residual sextic of the Hodge Computer instance four-plus-two-residual, and let be the corresponding source, as published in Definitions.Def_HodgeComputerFourPlusTwoResidual (id c341e3ae-c576-40ec-b4a9-1e27c1910aa3). The coordinates are , with official ambient type AmbientPoly n for (so six variables). The pole parameter is .
Claim. This instance admits no Diamond certificate Verify F A 6 1 D N Q whose rational vector field is supported in a single coordinate. Equivalently, there do not exist a coordinate index , a legal denominator , numerators , and a polynomial , such that Verify F A 6 1 D N Q holds and for all .
The obstruction is algebraic and does not use homogeneity beyond the official Verify hypotheses (in particular, the identity and legality IsRelPrime F D). Writing , any one-component certificate would force to divide in the multivariate polynomial ring. For every coordinate , this divisibility fails: for one has and a specialization keeping nonzero makes specialize to a nonzero polynomial of degree at most , while specializes to a degree- polynomial; for and , the specializations and have a nonzero remainder .
This lemma excludes one-component legal rational certificates for the six-variable instance, including arbitrary denominator degree and non-strict defect. It does not prove HodgeComputer.FourPlusTwoResidual.coreCertificate, HodgeComputer.FourPlusTwoResidual.normalChart_residue_solvable, or the mission goal HodgeComputer.FourPlusTwoResidual.certificate; those statements remain open. It also does not by itself exclude one-component strict core solutions: the core equation is different, and a core lift generally creates additional binary components.
Formalization note. The formal statement is the non-existence of , , , and such that Verify F A 6 1 D N Q holds and vanishes off the single index . The obstruction was derived from analysis by a better model, relayed by Ethan Cheung, checked with computer algebra, and formalized here.
import Definitions.Def_HodgeComputerFourPlusTwoResidual open MvPolynomial open HodgeComputer open HodgeComputer.FourPlusTwoResidual
theorem HodgeComputer.FourPlusTwoResidual.noOneComponentCertificate :
¬ ∃ (i : Fin (n + 1)) (D : AmbientPoly n)
(N : Fin (n + 1) → AmbientPoly n) (Q : AmbientPoly n),
Verify F A 6 1 D N Q ∧ ∀ j, j ≠ i → N j = 0 := by sorry