Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Constant-denominator equivalence and non-exactness of x0^3 y0^3 modulo polynomial vector fields

Proved
HodgeComputer.FourPlusTwoResidual.coreSource_not_polyExact

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

algebraic-geometrycommutative-algebrahodge-computerhodge-theorypolynomials
  1. A polynomial S∈C[x0,x1,y0,y1]S \in \mathbb{C}[x_0, x_1, y_0, y_1]S∈C[x0​,x1​,y0​,y1​] satisfies PolyExactCoreSource S (2S=2(L⋅∇H)−3Hdiv⁡(L)2 S = 2 (L \cdot \nabla H) - 3 H \operatorname{div}(L)2S=2(L⋅∇H)−3Hdiv(L) with linear LiL_iLi​ of degree 111) if and only if LLL furnishes a constant-denominator certificate CoreCertificateFor S 1 L.

  2. The target source A=x03y03A = x_0^3 y_0^3A=x03​y03​ (coreSource) satisfies ¬ PolyExactCoreSource coreSource: in fact, for every homogeneous linear vector field LLL on C4\mathbb{C}^4C4, the monomial x03y03x_0^3 y_0^3x03​y03​ has coefficient identically zero in 2(L⋅∇H)−3Hdiv⁡(L)2 (L \cdot \nabla H) - 3 H \operatorname{div}(L)2(L⋅∇H)−3Hdiv(L). Consequently, [A]≠0[A] \neq 0[A]=0 in the 323232-dimensional odd-odd quotient W/EW / EW/E.

Preamble
import Definitions.Def_HodgeComputerFourPlusTwoSourceAlgebra
Formal statement
theorem HodgeComputer.FourPlusTwoResidual.coreSource_not_polyExact :
    (∀ S : MvPolynomial (Fin 4) ℂ,
      HodgeComputer.FourPlusTwoResidual.PolyExactCoreSource S ↔
        ∃ L : Fin 4 → MvPolynomial (Fin 4) ℂ,
          (∀ i, (L i).IsHomogeneous 1) ∧
            HodgeComputer.FourPlusTwoResidual.CoreCertificateFor S 1 L) ∧
    ¬ HodgeComputer.FourPlusTwoResidual.PolyExactCoreSource
        HodgeComputer.FourPlusTwoResidual.coreSource := by sorry
Source
Hodge.computer Atlas instance `four-plus-two-residual` 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