Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Degree-six core certificates on four-plus-two-residual normalize to strict divergence-free fields

Proved
HodgeComputer.FourPlusTwoResidual.degreeSix_coreCertificate_iff_strict

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

algebraic-geometrycommutative-algebrahodge-theorypolynomials

Let H(x0,x1,y0,y1)H(x_0, x_1, y_0, y_1)H(x0​,x1​,y0​,y1​) denote the homogeneous sextic core polynomial of four-plus-two-residual, and let A=x03y03A = x_0^3 y_0^3A=x03​y03​ be the core source. Suppose D∈C[x0,x1,y0,y1]D \in \mathbb{C}[x_0, x_1, y_0, y_1]D∈C[x0​,x1​,y0​,y1​] is a nonzero homogeneous polynomial of degree 666 that is relatively prime to HHH.

Then DDD admits a twisted core certificate u=(u0,u1,u2,u3)u = (u_0, u_1, u_2, u_3)u=(u0​,u1​,u2​,u3​) of homogeneous degree 777 satisfying

2AD2−2D(u⋅∇H)+3H(Ddiv⁡(u)−u⋅∇D)=02 A D^2 - 2 D (u \cdot \nabla H) + 3 H \bigl(D \operatorname{div}(u) - u \cdot \nabla D\bigr) = 02AD2−2D(u⋅∇H)+3H(Ddiv(u)−u⋅∇D)=0

if and only if DDD admits a strict divergence-free homogeneous degree-777 vector field p=(p0,p1,p2,p3)p = (p_0, p_1, p_2, p_3)p=(p0​,p1​,p2​,p3​) satisfying the decoupled pair of identities

p⋅∇H=ADandDdiv⁡(p)−p⋅∇D=0.p \cdot \nabla H = A D \qquad \text{and} \qquad D \operatorname{div}(p) - p \cdot \nabla D = 0.p⋅∇H=ADandDdiv(p)−p⋅∇D=0.

Specifically, because deg⁡D=6=deg⁡H\deg D = 6 = \deg HdegD=6=degH and gcd⁡(H,D)=1\gcd(H, D) = 1gcd(H,D)=1, divisibility forces u⋅∇H−AD=HRu \cdot \nabla H - A D = H Ru⋅∇H−AD=HR for a homogeneous sextic RRR, and subtracting the Euler multiple 16R(x0,x1,y0,y1)\frac{1}{6} R (x_0, x_1, y_0, y_1)61​R(x0​,x1​,y0​,y1​) simultaneously cancels both the Jacobian remainder HRH RHR and the divergence numerator Ddiv⁡(u)−u⋅∇D=23DRD \operatorname{div}(u) - u \cdot \nabla D = \frac{2}{3} D RDdiv(u)−u⋅∇D=32​DR. This reduces any degree-666 search on the four-variable core to the strict Jacobian ideal membership AD∈J(H)12A D \in J(H)_{12}AD∈J(H)12​ paired with the divergence-free bracket equations.

Formalization Note Variables 0, 1, 2, 3 in MvPolynomial (Fin 4) ℂ represent (x0,x1,y0,y1)(x_0, x_1, y_0, y_1)(x0​,x1​,y0​,y1​).

Preamble
import Definitions.Def_HodgeComputerFourPlusTwoCore
import Mathlib.RingTheory.Polynomial.UniqueFactorization
open scoped BigOperators
Formal statement
theorem HodgeComputer.FourPlusTwoResidual.degreeSix_coreCertificate_iff_strict
    (D : MvPolynomial (Fin 4) ℂ) (hD_ne : D ≠ 0) (hD_hom : D.IsHomogeneous 6)
    (hD_coprime : IsRelPrime HodgeComputer.FourPlusTwoResidual.core D) :
    (∃ u : Fin 4 → MvPolynomial (Fin 4) ℂ,
      HodgeComputer.FourPlusTwoResidual.CoreCertificate D u) ↔
    (∃ p : Fin 4 → MvPolynomial (Fin 4) ℂ,
      (∀ i, (p i).IsHomogeneous 7) ∧
      (∑ i, MvPolynomial.pderiv i HodgeComputer.FourPlusTwoResidual.core * p i =
        HodgeComputer.FourPlusTwoResidual.coreSource * D) ∧
      (D * (∑ i, MvPolynomial.pderiv i (p i)) -
        ∑ i, MvPolynomial.pderiv i D * p i = 0)) := by sorry
Source
Hodge.computer GitHub Discussion #120 (`four-plus-two-residual`), observation of `benediamond` (2026-11-18, comment `DC_kwDOVLOOJc4BLIHo`), 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