Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Four plus two · suspension remainder — instance data

Definition
HodgeComputerFourPlusTwoResidual

by benediamond · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometryfour-plus-two-residualhodge-computer

The exact fixed polynomials and pole parameter for “Four plus two · suspension remainder”, over C\mathbb CC with coordinates X0,X1,X2,Y0,Y1,Y2X_0,X_1,X_2,Y_0,Y_1,Y_2X0​,X1​,X2​,Y0​,Y1​,Y2​:

F=H+B.F=H+B.F=H+B. q=1,A=X03⋅Y03.q=1,\qquad A=X_{0}^{3} \cdot Y_{0}^{3}.q=1,A=X03​⋅Y03​.

where

H=X06+57⋅X05⋅X1+57⋅X03⋅X1⋅Y0⋅Y1+107⋅X0⋅X15+107⋅X0⋅X1⋅Y03⋅Y1+X16+Y06+57⋅Y05⋅Y1+157⋅Y0⋅Y15+Y16B=X26+157⋅X24⋅Y22+107⋅X22⋅Y24+Y26\begin{aligned} H&=X_{0}^{6} + \frac{5}{7}\cdot X_{0}^{5}\cdot X_{1} + \frac{5}{7}\cdot X_{0}^{3}\cdot X_{1}\cdot Y_{0}\cdot Y_{1} + \frac{10}{7}\cdot X_{0}\cdot X_{1}^{5} + \frac{10}{7}\cdot X_{0}\cdot X_{1}\cdot Y_{0}^{3}\cdot Y_{1} + X_{1}^{6} + Y_{0}^{6} + \frac{5}{7}\cdot Y_{0}^{5}\cdot Y_{1} + \frac{15}{7}\cdot Y_{0}\cdot Y_{1}^{5} + Y_{1}^{6} \\ B&=X_{2}^{6} + \frac{15}{7}\cdot X_{2}^{4}\cdot Y_{2}^{2} + \frac{10}{7}\cdot X_{2}^{2}\cdot Y_{2}^{4} + Y_{2}^{6} \end{aligned}HB​=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​=X26​+715​⋅X24​⋅Y22​+710​⋅X22​⋅Y24​+Y26​​
Definition code
import Definitions.Def_DiamondCertificate

set_option autoImplicit false
noncomputable section
namespace HodgeComputer.FourPlusTwoResidual
def n : ℕ := 5
def d : ℕ := 6
def F : HodgeComputer.AmbientPoly n := (((((((((((((((MvPolynomial.X (R := ℂ) (0 : Fin 6)) ^ (6 : ℕ)) + ((((5 : MvPolynomial (Fin 6) ℂ) * ((MvPolynomial.X (R := ℂ) (0 : Fin 6)) ^ (5 : ℕ))) * (MvPolynomial.X (R := ℂ) (1 : Fin 6))) * MvPolynomial.C (σ := Fin 6) (1 / 7 : ℂ))) + ((((((5 : MvPolynomial (Fin 6) ℂ) * ((MvPolynomial.X (R := ℂ) (0 : Fin 6)) ^ (3 : ℕ))) * (MvPolynomial.X (R := ℂ) (1 : Fin 6))) * (MvPolynomial.X (R := ℂ) (3 : Fin 6))) * (MvPolynomial.X (R := ℂ) (4 : Fin 6))) * MvPolynomial.C (σ := Fin 6) (1 / 7 : ℂ))) + ((((10 : MvPolynomial (Fin 6) ℂ) * (MvPolynomial.X (R := ℂ) (0 : Fin 6))) * ((MvPolynomial.X (R := ℂ) (1 : Fin 6)) ^ (5 : ℕ))) * MvPolynomial.C (σ := Fin 6) (1 / 7 : ℂ))) + ((((((10 : MvPolynomial (Fin 6) ℂ) * (MvPolynomial.X (R := ℂ) (0 : Fin 6))) * (MvPolynomial.X (R := ℂ) (1 : Fin 6))) * ((MvPolynomial.X (R := ℂ) (3 : Fin 6)) ^ (3 : ℕ))) * (MvPolynomial.X (R := ℂ) (4 : Fin 6))) * MvPolynomial.C (σ := Fin 6) (1 / 7 : ℂ))) + ((MvPolynomial.X (R := ℂ) (1 : Fin 6)) ^ (6 : ℕ))) + ((MvPolynomial.X (R := ℂ) (2 : Fin 6)) ^ (6 : ℕ))) + ((((15 : MvPolynomial (Fin 6) ℂ) * ((MvPolynomial.X (R := ℂ) (2 : Fin 6)) ^ (4 : ℕ))) * ((MvPolynomial.X (R := ℂ) (5 : Fin 6)) ^ (2 : ℕ))) * MvPolynomial.C (σ := Fin 6) (1 / 7 : ℂ))) + ((((10 : MvPolynomial (Fin 6) ℂ) * ((MvPolynomial.X (R := ℂ) (2 : Fin 6)) ^ (2 : ℕ))) * ((MvPolynomial.X (R := ℂ) (5 : Fin 6)) ^ (4 : ℕ))) * MvPolynomial.C (σ := Fin 6) (1 / 7 : ℂ))) + ((MvPolynomial.X (R := ℂ) (3 : Fin 6)) ^ (6 : ℕ))) + ((((5 : MvPolynomial (Fin 6) ℂ) * ((MvPolynomial.X (R := ℂ) (3 : Fin 6)) ^ (5 : ℕ))) * (MvPolynomial.X (R := ℂ) (4 : Fin 6))) * MvPolynomial.C (σ := Fin 6) (1 / 7 : ℂ))) + ((((15 : MvPolynomial (Fin 6) ℂ) * (MvPolynomial.X (R := ℂ) (3 : Fin 6))) * ((MvPolynomial.X (R := ℂ) (4 : Fin 6)) ^ (5 : ℕ))) * MvPolynomial.C (σ := Fin 6) (1 / 7 : ℂ))) + ((MvPolynomial.X (R := ℂ) (4 : Fin 6)) ^ (6 : ℕ))) + ((MvPolynomial.X (R := ℂ) (5 : Fin 6)) ^ (6 : ℕ)))
def A : HodgeComputer.AmbientPoly n := (((MvPolynomial.X (R := ℂ) (0 : Fin 6)) ^ (3 : ℕ)) * ((MvPolynomial.X (R := ℂ) (3 : Fin 6)) ^ (3 : ℕ)))
def q : ℕ := 1
end HodgeComputer.FourPlusTwoResidual
Source
https://github.com/hodge-computer/sextics/blob/83fbf5c9a0afe9136ce4f1ed324d085a2c899bd0/data/four-plus-two-residual/instance.rec
Read-back

What the Lean code literally says, in plain math · GPT-6 (OpenAI Codex; independent auditor)

The declaration nnn defines the natural number 555.

The declaration ddd defines the natural number 666.

The declaration FFF defines a polynomial in R=C[z0,z1,z2,z3,z4,z5]R=\mathbb C[z_0,z_1,z_2,z_3,z_4,z_5]R=C[z0​,z1​,z2​,z3​,z4​,z5​], where ziz_izi​ is the variable whose index is iii in the six-element index set {0,1,2,3,4,5}\{0,1,2,3,4,5\}{0,1,2,3,4,5}, by

F=z06+57z05z1+57z03z1z3z4+107z0z15+107z0z1z33z4+z16+z26+157z24z52+107z22z54+z36+57z35z4+157z3z45+z46+z56.\begin{aligned}F={}&z_0^6+\tfrac57z_0^5z_1+\tfrac57z_0^3z_1z_3z_4+\tfrac{10}7z_0z_1^5+\tfrac{10}7z_0z_1z_3^3z_4+z_1^6+z_2^6\\&+\tfrac{15}7z_2^4z_5^2+\tfrac{10}7z_2^2z_5^4+z_3^6+\tfrac57z_3^5z_4+\tfrac{15}7z_3z_4^5+z_4^6+z_5^6.\end{aligned}F=​z06​+75​z05​z1​+75​z03​z1​z3​z4​+710​z0​z15​+710​z0​z1​z33​z4​+z16​+z26​+715​z24​z52​+710​z22​z54​+z36​+75​z35​z4​+715​z3​z45​+z46​+z56​.​

The declaration AAA defines the polynomial A=z03z33A=z_0^3z_3^3A=z03​z33​ in C[z0,z1,z2,z3,z4,z5]\mathbb C[z_0,z_1,z_2,z_3,z_4,z_5]C[z0​,z1​,z2​,z3​,z4​,z5​], with the same variable indexing 000 through 555.

The declaration qqq defines the natural number 111.

Human review
  • Endorsed by Shuze Chen · Nov 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by benediamond · Nov 6, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me