Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Generalized variable-source core certificate algebra, polynomial-exact baseline, and coprime linear system

Definition
HodgeComputerFourPlusTwoSourceAlgebra

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

algebraic-geometrycommutative-algebrahodge-theorypolynomials

This module extends the four-variable core definitions of four-plus-two-residual to arbitrary homogeneous sextic sources S∈C[x0,x1,y0,y1]S \in \mathbb{C}[x_0, x_1, y_0, y_1]S∈C[x0​,x1​,y0​,y1​], providing the algebraic primitives needed to assemble multi-divisor bundle certificates and audit candidate denominators via their source images WD/EW_D / EWD​/E.

  1. coreResidual S D N: the cleared four-variable residual
FH(S,D,N)=2SD2−2D∑i=03(∂iH)Ni+3H(D∑i=03∂iNi−∑i=03(∂iD)Ni).F_H(S, D, N) = 2 S D^2 - 2 D \sum_{i=0}^3 (\partial_i H) N_i + 3 H \Bigl(D \sum_{i=0}^3 \partial_i N_i - \sum_{i=0}^3 (\partial_i D) N_i\Bigr).FH​(S,D,N)=2SD2−2Di=0∑3​(∂i​H)Ni​+3H(Di=0∑3​∂i​Ni​−i=0∑3​(∂i​D)Ni​).
  1. CoreCertificateFor S D N: a nonzero denominator DDD homogeneous of degree d≥0d \ge 0d≥0 and numerators NiN_iNi​ homogeneous of degree d+1d + 1d+1 satisfying coreResidual S D N = 0. Allowing d=0d = 0d=0 includes the polynomial-exact baseline D=1D = 1D=1 with linear vector fields deg⁡Ni=1\deg N_i = 1degNi​=1.

  2. PolyExactCoreSource S: a source representable at D=1D = 1D=1 as S=L⋅∇H−32Hdiv⁡(L)S = L \cdot \nabla H - \frac{3}{2} H \operatorname{div}(L)S=L⋅∇H−23​Hdiv(L) for a homogeneous linear vector field LLL (deg⁡Li=1\deg L_i = 1degLi​=1).

  3. CoprimeLinearCoreSystem S D N T: the lower-degree linear pair ∑i(∂iD)Ni=DT\sum_i (\partial_i D) N_i = D T∑i​(∂i​D)Ni​=DT (degree 2d2d2d) and 2SD−2∑i(∂iH)Ni+3H(∑i∂iNi−T)=02 S D - 2 \sum_i (\partial_i H) N_i + 3 H (\sum_i \partial_i N_i - T) = 02SD−2∑i​(∂i​H)Ni​+3H(∑i​∂i​Ni​−T)=0 (degree d+6d + 6d+6).

Definition code
import Definitions.Def_HodgeComputerFourPlusTwoSymmetry

set_option autoImplicit false
noncomputable section

namespace HodgeComputer.FourPlusTwoResidual

open MvPolynomial
open scoped BigOperators

/-- Cleared four-variable core residual `F_H(S, D, N)` for an arbitrary sextic source `S`:
`2 S D² - 2 D (N · ∇H) + 3 H (D div(N) - N · ∇D)`. -/
def coreResidual (S D : MvPolynomial (Fin 4) ℂ)
    (N : Fin 4 → MvPolynomial (Fin 4) ℂ) : MvPolynomial (Fin 4) ℂ :=
  2 * S * D ^ 2 - 2 * D * (∑ i, pderiv i core * N i) +
    3 * core * (D * (∑ i, pderiv i (N i)) - ∑ i, pderiv i D * N i)

/-- Generalized core certificate for an arbitrary source `S`, allowing `deg D = d ≥ 0`
(including `D = 1` with linear numerators `deg Nᵢ = 1`). -/
def CoreCertificateFor (S D : MvPolynomial (Fin 4) ℂ)
    (N : Fin 4 → MvPolynomial (Fin 4) ℂ) : Prop :=
  D ≠ 0 ∧ (∃ d : ℕ, D.IsHomogeneous d ∧ ∀ i, (N i).IsHomogeneous (d + 1)) ∧
    coreResidual S D N = 0

/-- A sextic source `S` is polynomial-exact on the core if `S = L · ∇H - (3/2) H div(L)`
for a homogeneous linear vector field `L` (`deg Lᵢ = 1`), i.e. the `D = 1` baseline. -/
def PolyExactCoreSource (S : MvPolynomial (Fin 4) ℂ) : Prop :=
  ∃ L : Fin 4 → MvPolynomial (Fin 4) ℂ,
    (∀ i, (L i).IsHomogeneous 1) ∧
      2 * S = 2 * (∑ i, pderiv i core * L i) - 3 * core * (∑ i, pderiv i (L i))

/-- Lower-degree linear pair `(N, T)` equivalent to `CoreCertificateFor S D N` when `H ∤ D`,
with equations of degrees `2d` and `d + 6` instead of `2d + 6`. -/
def CoprimeLinearCoreSystem (S D : MvPolynomial (Fin 4) ℂ)
    (N : Fin 4 → MvPolynomial (Fin 4) ℂ) (T : MvPolynomial (Fin 4) ℂ) : Prop :=
  (∑ i, pderiv i D * N i = D * T) ∧
    (2 * S * D - 2 * (∑ i, pderiv i core * N i) +
      3 * core * ((∑ i, pderiv i (N i)) - T) = 0)

end HodgeComputer.FourPlusTwoResidual
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