Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bipartite sign involutions and strict core certificate predicates for four-plus-two-residual

Definition
HodgeComputerFourPlusTwoSymmetry

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

algebraic-geometrycommutative-algebrahodge-theorypolynomials

This module defines the bipartite (Z/2×Z/2)(\mathbb{Z}/2 \times \mathbb{Z}/2)(Z/2×Z/2) sign involutions and normalized certificate predicates on the four-variable core polynomial H(x0,x1,y0,y1)H(x_0, x_1, y_0, y_1)H(x0​,x1​,y0​,y1​) of four-plus-two-residual.

Write (x0,x1,y0,y1)(x_0, x_1, y_0, y_1)(x0​,x1​,y0​,y1​) for the four core coordinates (X 0, X 1, X 2, X 3) in C[x0,x1,y0,y1]\mathbb{C}[x_0, x_1, y_0, y_1]C[x0​,x1​,y0​,y1​], where

H(x0,x1,y0,y1)=(x06+57x05x1+107x0x15+x16)+(y06+57y05y1+157y0y15+y16)+57x0x1y0y1(x02+2y02),H(x_0, x_1, y_0, y_1) = \Bigl(x_0^6 + \frac{5}{7} x_0^5 x_1 + \frac{10}{7} x_0 x_1^5 + x_1^6\Bigr) + \Bigl(y_0^6 + \frac{5}{7} y_0^5 y_1 + \frac{15}{7} y_0 y_1^5 + y_1^6\Bigr) + \frac{5}{7} x_0 x_1 y_0 y_1 (x_0^2 + 2 y_0^2),H(x0​,x1​,y0​,y1​)=(x06​+75​x05​x1​+710​x0​x15​+x16​)+(y06​+75​y05​y1​+715​y0​y15​+y16​)+75​x0​x1​y0​y1​(x02​+2y02​),

and A=x03y03A = x_0^3 y_0^3A=x03​y03​. Because every monomial of HHH has even total degree in (x0,x1)(x_0, x_1)(x0​,x1​) and even total degree in (y0,y1)(y_0, y_1)(y0​,y1​), the two commuting sign involutions

σAB(x0,x1,y0,y1)=(−x0,−x1,y0,y1),σCD(x0,x1,y0,y1)=(x0,x1,−y0,−y1)\sigma_{AB}(x_0, x_1, y_0, y_1) = (-x_0, -x_1, y_0, y_1), \qquad \sigma_{CD}(x_0, x_1, y_0, y_1) = (x_0, x_1, -y_0, -y_1)σAB​(x0​,x1​,y0​,y1​)=(−x0​,−x1​,y0​,y1​),σCD​(x0​,x1​,y0​,y1​)=(x0​,x1​,−y0​,−y1​)

preserve HHH while negating A=x03y03A = x_0^3 y_0^3A=x03​y03​.

The module introduces two normalized refinements of CoreCertificate:

  1. StrictCoreCertificate D N: a nonzero homogeneous denominator DDD of degree k+1k + 1k+1 and homogeneous vector field N=(N0,N1,N2,N3)N = (N_0, N_1, N_2, N_3)N=(N0​,N1​,N2​,N3​) of degree k+2k + 2k+2 satisfying the decoupled divergence-free system
N⋅∇H=ADandDdiv⁡(N)−N⋅∇D=0.N \cdot \nabla H = A D \qquad \text{and} \qquad D \operatorname{div}(N) - N \cdot \nabla D = 0.N⋅∇H=ADandDdiv(N)−N⋅∇D=0.
  1. BipartiteCoreCertificate D N: an even-degree core certificate (deg⁡D=2m+2\deg D = 2m + 2degD=2m+2, deg⁡Ni=2m+3\deg N_i = 2m + 3degNi​=2m+3) whose denominator DDD is invariant under both σAB\sigma_{AB}σAB​ and σCD\sigma_{CD}σCD​, while (N0,N1)(N_0, N_1)(N0​,N1​) is σAB\sigma_{AB}σAB​-even and (N2,N3)(N_2, N_3)(N2​,N3​) is σAB\sigma_{AB}σAB​-odd.

Formalization Note Built on Definitions.Def_HodgeComputerFourPlusTwoCore using MvPolynomial.aeval algebra homomorphisms flipAB and flipCD.

Definition code
import Definitions.Def_HodgeComputerFourPlusTwoCore

set_option autoImplicit false
noncomputable section

namespace HodgeComputer.FourPlusTwoResidual

open MvPolynomial
open scoped BigOperators

/-- Sign involution `(x₀, x₁, x₂, x₃) ↦ (-x₀, -x₁, x₂, x₃)` on the four-variable core ring. -/
def flipAB : MvPolynomial (Fin 4) ℂ →ₐ[ℂ] MvPolynomial (Fin 4) ℂ :=
  aeval ![-X 0, -X 1, X 2, X 3]

/-- Sign involution `(x₀, x₁, x₂, x₃) ↦ (x₀, x₁, -x₂, -x₃)` on the four-variable core ring. -/
def flipCD : MvPolynomial (Fin 4) ℂ →ₐ[ℂ] MvPolynomial (Fin 4) ℂ :=
  aeval ![X 0, X 1, -X 2, -X 3]

/-- A strict divergence-free core certificate: `D ≠ 0` homogeneous of degree `k + 1` and
`N` homogeneous of degree `k + 2` satisfying both `N · ∇H = A D` and `D div(N) - N · ∇D = 0`. -/
def StrictCoreCertificate (D : MvPolynomial (Fin 4) ℂ)
    (N : Fin 4 → MvPolynomial (Fin 4) ℂ) : Prop :=
  D ≠ 0 ∧ (∃ k : ℕ, D.IsHomogeneous (k + 1) ∧ ∀ i, (N i).IsHomogeneous (k + 2)) ∧
    (∑ i, pderiv i core * N i = coreSource * D) ∧
    (D * (∑ i, pderiv i (N i)) - ∑ i, pderiv i D * N i = 0)

/-- An even-degree `(ℤ/2 × ℤ/2)`-equivariant core certificate: `D` has even positive degree `2m + 2`
and is invariant under both `flipAB` and `flipCD`, while `(N₀, N₁)` is `flipAB`-even and `(N₂, N₃)`
is `flipAB`-odd, satisfying the exact four-variable `CoreCertificate` differential equation. -/
def BipartiteCoreCertificate (D : MvPolynomial (Fin 4) ℂ)
    (N : Fin 4 → MvPolynomial (Fin 4) ℂ) : Prop :=
  D ≠ 0 ∧ (∃ m : ℕ, D.IsHomogeneous (2 * m + 2) ∧ ∀ i, (N i).IsHomogeneous (2 * m + 3)) ∧
    flipAB D = D ∧ flipCD D = D ∧
    flipAB (N 0) = N 0 ∧ flipAB (N 1) = N 1 ∧
    flipAB (N 2) = -N 2 ∧ flipAB (N 3) = -N 3 ∧
    2 * coreSource * D ^ 2 - 2 * D * (∑ i, pderiv i core * N i)
      + 3 * core * (D * (∑ i, pderiv i (N i)) - ∑ i, pderiv i D * N i) = 0

end HodgeComputer.FourPlusTwoResidual
Source
Hodge.computer Atlas instance `four-plus-two-residual`, `data/four-plus-two-residual/instance.rec`, and GitHub Discussion #120 (`benediamond`, `kejace`, `DiamondJM`, `kmehltretter82`), 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