Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Projective Hodge certificate for the (01)-transposition-invariant source on diagonal-permutation

Open
HodgeComputer.DiagonalPermutation.transposition_quotient_certificate

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

algebraic-geometryhodge-theorypolynomialsrepresentation-theory

Let F∈C[X0,X1,X2,Y0,Y1,Y2]F \in \mathbb{C}[X_0, X_1, X_2, Y_0, Y_1, Y_2]F∈C[X0​,X1​,X2​,Y0​,Y1​,Y2​] be the simultaneous-S3S_3S3​-invariant sextic of diagonal-permutation, and let

B2=X03Y03+X13Y13−2X23Y23B_2 = X_0^3 Y_0^3 + X_1^3 Y_1^3 - 2 X_2^3 Y_2^3B2​=X03​Y03​+X13​Y13​−2X23​Y23​

be the (01)(01)(01)-transposition-invariant degree-666 source transpositionSource. The theorem states that B2B_2B2​ admits a rational Hodge certificate at pole order q=1q = 1q=1 on V(F)⊂P5V(F) \subset \mathbb{P}^5V(F)⊂P5:

HasCertificate⁡(F,  B2,  6,  1).\operatorname{HasCertificate}(F,\; B_2,\; 6,\; 1).HasCertificate(F,B2​,6,1).

Because the diagonal S3S_3S3​ action preserves FFF and satisfies A=X03Y03−X13Y13=13(σ12B2−σ02B2)A = X_0^3 Y_0^3 - X_1^3 Y_1^3 = \frac{1}{3}(\sigma_{12} B_2 - \sigma_{02} B_2)A=X03​Y03​−X13​Y13​=31​(σ12​B2​−σ02​B2​), proving this single reflection-even certificate suffices to prove HodgeComputer.DiagonalPermutation.certificate.

Preamble
import Definitions.Def_HodgeComputerDiagonalPermutationQuotient
Formal statement
theorem HodgeComputer.DiagonalPermutation.transposition_quotient_certificate :
    HodgeComputer.HasCertificate
      HodgeComputer.DiagonalPermutation.F
      HodgeComputer.DiagonalPermutation.transpositionSource 6 1 := by sorry
Source
Hodge.computer GitHub Discussion #177 (`diagonal-permutation`), transposition quotient reduction of `benediamond` (2026-10-23, comment `DC_kwDOVLOOJc4BJDbi`), https://github.com/hodge-computer/sextics/discussions/177

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