Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Nonexistence of scalar-core and low-degree core certificates on four-plus-two-residual

Proved
HodgeComputer.FourPlusTwoResidual.no_low_degree_or_scalar_core_certificate

by kmehltretter82 · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrycommutative-algebrahodge-computerhodge-theorypolynomials

Let H(x0,x1,y0,y1)H(x_0, x_1, y_0, y_1)H(x0​,x1​,y0​,y1​) be the sextic core of four-plus-two-residual and A=x03y03A = x_0^3 y_0^3A=x03​y03​. The space of four-variable core certificates satisfies three unconditional obstructions over C\mathbb{C}C:

  1. No scalar-multiple-of-core denominator: For every c∈Cc \in \mathbb{C}c∈C and every NNN, (cH,N)(c H, N)(cH,N) is not a CoreCertificate. Equivalently, the second-order pole equation 5(N⋅∇H)−3Hdiv⁡(N)=2cAH5 (N \cdot \nabla H) - 3 H \operatorname{div}(N) = 2 c A H5(N⋅∇H)−3Hdiv(N)=2cAH has no polynomial solution (c,N)(c, N)(c,N) with c≠0c \neq 0c=0 (settling the D=HD = HD=H case of Griffiths–Dwork reduction on THT_HTH​).

  2. Unconditional strictness at degree 666: Every homogeneous sextic denominator DDD admitting a CoreCertificate satisfies H∤DH \nmid DH∤D and therefore admits a StrictCoreCertificate.

  3. Low-degree exclusion (deg⁡D≤4\deg D \le 4degD≤4): No homogeneous polynomial DDD of degree d≤4d \le 4d≤4 admits a CoreCertificate.

Formalization Note Certified via exact integer Farkas dual functionals evaluated through a verified balanced merge engine over packed exponent keys.

Preamble
import Definitions.Def_HodgeComputerFourPlusTwoSymmetry
Formal statement
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
Source
Hodge.computer Atlas instance `four-plus-two-residual` and GitHub Discussion #120 (`benediamond`, `kejace`, `DiamondJM`, `kmehltretter82`), https://github.com/hodge-computer/sextics/discussions/120

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me