Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Symmetric sextic: removable selector moment and pivot nonvanishing

Proved
HodgeComputer.SymmetricSexticResidual.removable_selector_moment

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

algebraic-geometryhodge-conjecturepolynomial-identities

Consider a cubic polynomial f(x,u)=ℓu3+B(x)u2+C(x)u+D(x)f(x, u) = \ell u^3 + B(x) u^2 + C(x) u + D(x)f(x,u)=ℓu3+B(x)u2+C(x)u+D(x) over C\mathbb{C}C with ℓ≠0\ell \neq 0ℓ=0 independent of xxx, where B(x)=b0+b1xB(x) = b_0 + b_1 xB(x)=b0​+b1​x, C(x)=c0+c1x+c2x2C(x) = c_0 + c_1 x + c_2 x^2C(x)=c0​+c1​x+c2​x2, and D(x)=d0+d1x+d2x2+d3x3D(x) = d_0 + d_1 x + d_2 x^2 + d_3 x^3D(x)=d0​+d1​x+d2​x2+d3​x3. Write g=fug = f_ug=fu​, gu=fuug_u = f_{uu}gu​=fuu​, fx=Bxu2+Cxu+Dxf_x = B_x u^2 + C_x u + D_xfx​=Bx​u2+Cx​u+Dx​, and gx=2Bxu+Cxg_x = 2 B_x u + C_xgx​=2Bx​u+Cx​, and define the rational source pair

K0=−BC+4xBxC+9ℓD−12ℓxDx12ℓ,K1=−B2+4xBBx+3ℓC−6ℓxCx6ℓ.K_0 = \frac{-B C + 4 x B_x C + 9 \ell D - 12 \ell x D_x}{12 \ell}, \qquad K_1 = \frac{-B^2 + 4 x B B_x + 3 \ell C - 6 \ell x C_x}{6 \ell}.K0​=12ℓ−BC+4xBx​C+9ℓD−12ℓxDx​​,K1​=6ℓ−B2+4xBBx​+3ℓC−6ℓxCx​​.

Then:

  1. The cleared polynomial certificate
g2−2xggx+2xfxgu−2(gK1−gu(K0+K1u))=3(B+3ℓu)fg^2 - 2 x g g_x + 2 x f_x g_u - 2\bigl(g K_1 - g_u(K_0 + K_1 u)\bigr) = 3(B + 3\ell u) fg2−2xggx​+2xfx​gu​−2(gK1​−gu​(K0​+K1​u))=3(B+3ℓu)f

holds identically.

  1. The pair (K0,K1)(K_0, K_1)(K0​,K1​) expands as polynomials in xxx of degrees at most 333 and 222, respectively, with leading x2x^2x2-coefficient [x2]K1=b12−3ℓc22ℓ[x^2] K_1 = \frac{b_1^2 - 3 \ell c_2}{2 \ell}[x2]K1​=2ℓb12​−3ℓc2​​.

  2. For the symmetric sextic ratio pencil (ℓ,B1,C2)(\ell, B_1, C_2)(ℓ,B1​,C2​) in (λ,s)(\lambda, s)(λ,s), at (λ,s)=(1,0)(\lambda, s) = (1, 0)(λ,s)=(1,0) we have ℓ≠0\ell \neq 0ℓ=0 and [x2]K1=47425182≠0[x^2] K_1 = \frac{47425}{182} \neq 0[x2]K1​=18247425​=0.

This identity absorbs one of the seven normalized-trace selector moment conditions by an explicit vertical rational current.

Preamble
import Mathlib.Data.Complex.Basic
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Ring

set_option autoImplicit false
set_option maxHeartbeats 4000000
Formal statement
theorem HodgeComputer.SymmetricSexticResidual.removable_selector_moment
    (x u l b0 b1 c0 c1 c2 d0 d1 d2 d3 lam s : ℂ) :
    let B := b0 + b1 * x
    let Bx := b1
    let C := c0 + c1 * x + c2 * x ^ 2
    let Cx := c1 + 2 * c2 * x
    let D := d0 + d1 * x + d2 * x ^ 2 + d3 * x ^ 3
    let Dx := d1 + 2 * d2 * x + 3 * d3 * x ^ 2
    let f := l * u ^ 3 + B * u ^ 2 + C * u + D
    let g := 3 * l * u ^ 2 + 2 * B * u + C
    let gu := 6 * l * u + 2 * B
    let fx := Bx * u ^ 2 + Cx * u + Dx
    let gx := 2 * Bx * u + Cx
    let K0 := (-B * C + 4 * x * Bx * C + 9 * l * D - 12 * l * x * Dx) / (12 * l)
    let K1 := (-B ^ 2 + 4 * x * B * Bx + 3 * l * C - 6 * l * x * Cx) / (6 * l)
    let ell := 2 + 2 * lam ^ 6 - (5 / 7 : ℂ) * lam ^ 2 - (10 / 7 : ℂ) * lam ^ 4
    let actualB1 := 30 * lam ^ 4 + (5 / 7 : ℂ) * (1 + 2 * s) +
      (20 / 7 : ℂ) * lam ^ 2 * (1 + 2 * s)
    let actualC2 := 30 * lam ^ 2 - (10 / 7 : ℂ) * (1 + 2 * s) ^ 2
    (l ≠ 0 →
      (g ^ 2 - 2 * x * g * gx + 2 * x * fx * gu - 2 * (g * K1 - gu * (K0 + K1 * u)) =
        3 * (B + 3 * l * u) * f) ∧
      (K0 = (-b0 * c0 + 9 * l * d0) / (12 * l) +
            ((3 * b1 * c0 - b0 * c1 - 3 * l * d1) / (12 * l)) * x +
            ((3 * b1 * c1 - b0 * c2 - 15 * l * d2) / (12 * l)) * x ^ 2 +
            ((3 * b1 * c2 - 27 * l * d3) / (12 * l)) * x ^ 3) ∧
      (K1 = (-b0 ^ 2 + 3 * l * c0) / (6 * l) +
            ((2 * b0 * b1 - 3 * l * c1) / (6 * l)) * x +
            ((b1 ^ 2 - 3 * l * c2) / (2 * l)) * x ^ 2)) ∧
    (lam = 1 → s = 0 →
      ell ≠ 0 ∧ (actualB1 ^ 2 - 3 * ell * actualC2) / (2 * ell) = (47425 / 182 : ℂ)) := by sorry
Source
https://github.com/hodge-computer/sextics/discussions/117#discussioncomment-19498520 (symmetric-contact-current/source/selector/REMOVABLE_SELECTOR_MOMENT.md)

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