Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equivalence of unrestricted and even-degree (Z/2 x Z/2)-bipartite core certificates

Proved
HodgeComputer.FourPlusTwoResidual.coreCertificate_iff_bipartite

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

algebraic-geometryhodge-computerhodge-theorypolynomialsrepresentation-theory

The four-variable core problem ∃ D N, CoreCertificate D N for four-plus-two-residual is equivalent to the existence of an even-degree (Z/2×Z/2)(\mathbb{Z}/2 \times \mathbb{Z}/2)(Z/2×Z/2)-equivariant BipartiteCoreCertificate:

(∃D,N,  CoreCertificate⁡(D,N))  ⟺  (∃D^,N^,  BipartiteCoreCertificate⁡(D^,N^)).\bigl(\exists D, N,\; \operatorname{CoreCertificate}(D, N)\bigr) \;\Longleftrightarrow\; \bigl(\exists \widehat{D}, \widehat{N},\; \operatorname{BipartiteCoreCertificate}(\widehat{D}, \widehat{N})\bigr).(∃D,N,CoreCertificate(D,N))⟺(∃D,N,BipartiteCoreCertificate(D,N)).

Specifically, given any core certificate (D,N)(D, N)(D,N) of arbitrary degree k+1≥1k + 1 \ge 1k+1≥1, its negated pullback (D′,N′)=(σAB∗D,  (σAB∗N0,σAB∗N1,−σAB∗N2,−σAB∗N3))(D', N') = (\sigma_{AB}^* D,\; (\sigma_{AB}^* N_0, \sigma_{AB}^* N_1, -\sigma_{AB}^* N_2, -\sigma_{AB}^* N_3))(D′,N′)=(σAB∗​D,(σAB∗​N0​,σAB∗​N1​,−σAB∗​N2​,−σAB∗​N3​)) under σAB(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)σAB​(x0​,x1​,y0​,y1​)=(−x0​,−x1​,y0​,y1​) is again a core certificate because σAB∗H=H\sigma_{AB}^* H = HσAB∗​H=H and σAB∗A=−A\sigma_{AB}^* A = -AσAB∗​A=−A. Clearing denominators of the rational average 12(N/D+N′/D′)\frac{1}{2}(N/D + N'/D')21​(N/D+N′/D′) produces

D^=2DD′,N^i=D′Ni+DNi′,\widehat{D} = 2 D D', \qquad \widehat{N}_i = D' N_i + D N'_i,D=2DD′,Ni​=D′Ni​+DNi′​,

which is automatically nonzero (2DD′≠02 D D' \neq 02DD′=0 in the integral domain C[x0,x1,y0,y1]\mathbb{C}[x_0, x_1, y_0, y_1]C[x0​,x1​,y0​,y1​], bypassing the vanishing hazard of naive linear symmetrization when σAB∗D=−D\sigma_{AB}^* D = -DσAB∗​D=−D), has even degree 2k+22k + 22k+2, is invariant under both σAB\sigma_{AB}σAB​ and σCD\sigma_{CD}σCD​ (since (σAB∘σCD)∗D^=(−1)2k+2D^=D^(\sigma_{AB} \circ \sigma_{CD})^* \widehat{D} = (-1)^{2k+2} \widehat{D} = \widehat{D}(σAB​∘σCD​)∗D=(−1)2k+2D=D), and satisfies the exact (+1,+1,−1,−1)(+1, +1, -1, -1)(+1,+1,−1,−1) bipartite numerator parity.

Formalization Note Halves the symmetry sectors of the open leaf coreCertificate without losing existence.

Preamble
import Definitions.Def_HodgeComputerFourPlusTwoSymmetry
Formal statement
theorem HodgeComputer.FourPlusTwoResidual.coreCertificate_iff_bipartite :
    (∃ (D : MvPolynomial (Fin 4) ℂ) (N : Fin 4 → MvPolynomial (Fin 4) ℂ),
      HodgeComputer.FourPlusTwoResidual.CoreCertificate D N) ↔
    (∃ (D : MvPolynomial (Fin 4) ℂ) (N : Fin 4 → MvPolynomial (Fin 4) ℂ),
      HodgeComputer.FourPlusTwoResidual.BipartiteCoreCertificate D N) := 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