Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Irreducibility of the four-variable sextic core of four-plus-two-residual

Proved
HodgeComputer.FourPlusTwoResidual.core_irreducible

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

algebraic-geometrycommutative-algebrahodge-computerpolynomials

The four-variable homogeneous sextic core polynomial

H(x0,x1,y0,y1)=x06+57x05x1+57x03x1y0y1+107x0x15+107x0x1y03y1+x16+y06+57y05y1+157y0y15+y16H(x_0, x_1, y_0, y_1) = x_0^6 + \frac{5}{7} x_0^5 x_1 + \frac{5}{7} x_0^3 x_1 y_0 y_1 + \frac{10}{7} x_0 x_1^5 + \frac{10}{7} x_0 x_1 y_0^3 y_1 + x_1^6 + y_0^6 + \frac{5}{7} y_0^5 y_1 + \frac{15}{7} y_0 y_1^5 + y_1^6H(x0​,x1​,y0​,y1​)=x06​+75​x05​x1​+75​x03​x1​y0​y1​+710​x0​x15​+710​x0​x1​y03​y1​+x16​+y06​+75​y05​y1​+715​y0​y15​+y16​

of four-plus-two-residual is irreducible in C[x0,x1,y0,y1]\mathbb{C}[x_0, x_1, y_0, y_1]C[x0​,x1​,y0​,y1​].

Consequently, HHH generates a prime ideal in the unique factorization domain C[x0,x1,y0,y1]\mathbb{C}[x_0, x_1, y_0, y_1]C[x0​,x1​,y0​,y1​], so any homogeneous denominator DDD satisfies gcd⁡(H,D)=1\gcd(H, D) = 1gcd(H,D)=1 if and only if H∤DH \nmid DH∤D.

Formalization Note Proved via monic specialization in x0x_0x0​ along (x1,y0,y1)=(0,T+r,1)(x_1, y_0, y_1) = (0, T + r, 1)(x1​,y0​,y1​)=(0,T+r,1) at a simple complex root rrr of z6+57z5+157z+1=0z^6 + \frac{5}{7} z^5 + \frac{15}{7} z + 1 = 0z6+75​z5+715​z+1=0, applying Eisenstein's criterion at (T)⊂C[T](T) \subset \mathbb{C}[T](T)⊂C[T].

Preamble
import Definitions.Def_HodgeComputerFourPlusTwoCore
import Mathlib.RingTheory.Polynomial.UniqueFactorization
Formal statement
theorem HodgeComputer.FourPlusTwoResidual.core_irreducible :
    Irreducible HodgeComputer.FourPlusTwoResidual.core := by sorry
Source
Hodge.computer Atlas instance `four-plus-two-residual` (`data/four-plus-two-residual/instance.rec`) and GitHub Discussion #120, 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