Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Transposition-invariant source and reflection-chart cubic for diagonal-permutation

Definition
HodgeComputerDiagonalPermutationQuotient

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

algebraic-geometryhodge-theorypolynomialsrepresentation-theory

This module defines the (01)(01)(01)-transposition-invariant source B2B_2B2​, the descended (01)(01)(01)-reflection cubic fdiag(λ,b,c,d,u)f_{\mathrm{diag}}(\lambda, b, c, d, u)fdiag​(λ,b,c,d,u), the cubic source Pdiag(λ,b,c,d,u)P_{\mathrm{diag}}(\lambda, b, c, d, u)Pdiag​(λ,b,c,d,u), and its cleared canonical linear-in-uuu trace representative for the open target diagonal-permutation (Simultaneous permutations · standard sector).

The protected sextic FFF is invariant under the diagonal S3S_3S3​ action permuting (X0,X1,X2)(X_0, X_1, X_2)(X0​,X1​,X2​) and (Y0,Y1,Y2)(Y_0, Y_1, Y_2)(Y0​,Y1​,Y2​) simultaneously, while its target source A=X03Y03−X13Y13A = X_0^3 Y_0^3 - X_1^3 Y_1^3A=X03​Y03​−X13​Y13​ spans the two-dimensional standard representation. Introducing the (01)(01)(01)-transposition-invariant polynomial

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

its S3S_3S3​-iterates B0=σ02(B2)B_0 = \sigma_{02}(B_2)B0​=σ02​(B2​) and B1=σ12(B2)B_1 = \sigma_{12}(B_2)B1​=σ12​(B2​) satisfy A=13(B1−B0)A = \frac{1}{3}(B_1 - B_0)A=31​(B1​−B0​). On the reflection chart (1+v,1−v,b,c+λv,c−λv,d)(1 + v, 1 - v, b, c + \lambda v, c - \lambda v, d)(1+v,1−v,b,c+λv,c−λv,d) with u=v2u = v^2u=v2, FFF pulls back to fdiag(λ,b,c,d,u)=ℓu3+Bu2+Cu+Df_{\mathrm{diag}}(\lambda, b, c, d, u) = \ell u^3 + B u^2 + C u + Dfdiag​(λ,b,c,d,u)=ℓu3+Bu2+Cu+D with ℓ(λ)=2+107λ2+2λ6\ell(\lambda) = 2 + \frac{10}{7}\lambda^2 + 2\lambda^6ℓ(λ)=2+710​λ2+2λ6, and B2B_2B2​ pulls back to the degree-333 polynomial

Pdiag(λ,b,c,d,u)=2λ3u3+(6λc2+18λ2c+6λ3)u2+(6c3+18λc2+6λ2c)u+(2c3−2b3d3).P_{\mathrm{diag}}(\lambda, b, c, d, u) = 2 \lambda^3 u^3 + (6 \lambda c^2 + 18 \lambda^2 c + 6 \lambda^3) u^2 + (6 c^3 + 18 \lambda c^2 + 6 \lambda^2 c) u + (2 c^3 - 2 b^3 d^3).Pdiag​(λ,b,c,d,u)=2λ3u3+(6λc2+18λ2c+6λ3)u2+(6c3+18λc2+6λ2c)u+(2c3−2b3d3).

The polynomial diagCanonicalSource records the cleared linear-in-uuu trace representative K0+K1uK_0 + K_1 uK0​+K1​u obtained after cancelling both the u3u^3u3 first-order pole and the u2u^2u2 branch trace modulo fdiagf_{\mathrm{diag}}fdiag​.

These definitions support the multi-stage reduction of HodgeComputer.DiagonalPermutation.certificate to a linear-source relative primitive on the weighted threefold fdiag=0f_{\mathrm{diag}} = 0fdiag​=0.

Formalization Note Built on HodgeComputerDiagonalPermutation and HodgeComputerReflectionChart.

Definition code
import Definitions.Def_HodgeComputerDiagonalPermutation
import Definitions.Def_HodgeComputerReflectionChart

set_option autoImplicit false
noncomputable section

namespace HodgeComputer.DiagonalPermutation
open MvPolynomial HodgeComputer.ReflectionChart

/-- The `(01)`-transposition-invariant degree-six source
`B₂ = X₀³ Y₀³ + X₁³ Y₁³ - 2 X₂³ Y₂³` (`benediamond`, Discussion #177). -/
def transpositionSource : HodgeComputer.AmbientPoly 5 :=
  X 0 ^ 3 * X 3 ^ 3 + X 1 ^ 3 * X 4 ^ 3 - C 2 * X 2 ^ 3 * X 5 ^ 3

/-- Leading coefficient `ℓ(λ) = 2 + (10/7) λ² + 2 λ⁶` of the `(01)`-reflection cubic. -/
def diagEll : ChartPoly :=
  C 2 + C (10 / 7 : ℂ) * X 0 ^ 2 + C 2 * X 0 ^ 6

/-- Quadratic coefficient `B(λ, b, c, d)` of the `(01)`-reflection cubic. -/
def diagB : ChartPoly :=
  C 30 - C (10 / 11 : ℂ) * X 3 ^ 2 - C (10 / 7 : ℂ) * X 2 ^ 2 +
    C (10 / 7 : ℂ) * X 0 * X 1 * X 3 - C (20 / 11 : ℂ) * X 0 * X 1 * X 2 +
    C (30 / 13 : ℂ) * X 0 ^ 2 * X 2 * X 3 + C (30 / 11 : ℂ) * X 0 ^ 2 * X 1 -
    C (20 / 13 : ℂ) * X 0 ^ 3 * X 3 + C 30 * X 0 ^ 4 * X 2 ^ 2 -
    C (10 / 13 : ℂ) * X 0 ^ 4 * X 1 ^ 2

/-- Linear coefficient `C(λ, b, c, d)` of the `(01)`-reflection cubic. -/
def diagC : ChartPoly :=
  C 30 + C (10 / 13 : ℂ) * X 2 * X 3 ^ 3 + C (10 / 13 : ℂ) * X 2 ^ 3 * X 3 +
    C (30 / 7 : ℂ) * X 1 * X 2 * X 3 + C (30 / 11 : ℂ) * X 1 * X 2 ^ 2 -
    C (20 / 13 : ℂ) * X 0 * X 3 ^ 3 - C (60 / 13 : ℂ) * X 0 * X 2 ^ 2 * X 3 +
    C (30 / 7 : ℂ) * X 0 * X 1 * X 3 - C (60 / 11 : ℂ) * X 0 * X 1 * X 2 +
    C (10 / 7 : ℂ) * X 0 * X 1 ^ 3 * X 3 - C (20 / 11 : ℂ) * X 0 * X 1 ^ 3 * X 2 -
    C (10 / 7 : ℂ) * X 0 ^ 2 + C (30 / 13 : ℂ) * X 0 ^ 2 * X 2 * X 3 +
    C 30 * X 0 ^ 2 * X 2 ^ 4 + C (10 / 11 : ℂ) * X 0 ^ 2 * X 1 +
    C (10 / 11 : ℂ) * X 0 ^ 2 * X 1 ^ 3

/-- Constant coefficient `D(b, c, d)` of the `(01)`-reflection cubic. -/
def diagD : ChartPoly :=
  C 2 + C (10 / 11 : ℂ) * X 3 ^ 2 + X 3 ^ 6 + C (10 / 13 : ℂ) * X 2 * X 3 ^ 3 +
    C (10 / 7 : ℂ) * X 2 ^ 2 + C (10 / 13 : ℂ) * X 2 ^ 3 * X 3 + C 2 * X 2 ^ 6 +
    C (10 / 7 : ℂ) * X 1 * X 2 * X 3 + C (10 / 11 : ℂ) * X 1 * X 2 ^ 2 +
    C (10 / 13 : ℂ) * X 1 ^ 2 * X 2 ^ 4 + C (10 / 7 : ℂ) * X 1 ^ 3 * X 2 * X 3 +
    C (10 / 11 : ℂ) * X 1 ^ 3 * X 2 ^ 2 + X 1 ^ 6

/-- The weighted cubic equation `f_diag(λ, b, c, d, u) = ℓ u³ + B u² + C u + D`
of `diagonal-permutation` on the `(01)`-reflection chart. -/
def diagWeighted : ChartPoly :=
  diagEll * X 4 ^ 3 + diagB * X 4 ^ 2 + diagC * X 4 + diagD

/-- The descended cubic source `P_diag(λ, b, c, d, u)` of `transpositionSource`
on the `(01)`-reflection chart. -/
def diagSource : ChartPoly :=
  C 2 * X 0 ^ 3 * X 4 ^ 3 +
    (C 6 * X 0 * X 2 ^ 2 + C 18 * X 0 ^ 2 * X 2 + C 6 * X 0 ^ 3) * X 4 ^ 2 +
    (C 6 * X 2 ^ 3 + C 18 * X 0 * X 2 ^ 2 + C 6 * X 0 ^ 2 * X 2) * X 4 +
    (C 2 * X 2 ^ 3 - C 2 * X 1 ^ 3 * X 3 ^ 3)

/-- Cleared canonical linear-in-`u` trace source `K₀ + K₁ u` of `diagonal-permutation`,
obtained after subtracting the first-order pole `p₃ / ℓ` and quadratic branch trace modulo `f_diag`. -/
def diagCanonicalSource : ChartPoly :=
  cubicTraceK0 diagEll diagB diagC diagD
    (C 2 * X 2 ^ 3 - C 2 * X 1 ^ 3 * X 3 ^ 3)
    (C 6 * X 0 * X 2 ^ 2 + C 18 * X 0 ^ 2 * X 2 + C 6 * X 0 ^ 3)
    (C 2 * X 0 ^ 3) +
  cubicTraceK1 diagEll diagB
    (C 6 * X 2 ^ 3 + C 18 * X 0 * X 2 ^ 2 + C 6 * X 0 ^ 2 * X 2)
    (C 6 * X 0 * X 2 ^ 2 + C 18 * X 0 ^ 2 * X 2 + C 6 * X 0 ^ 3)
    (C 2 * X 0 ^ 3) * X 4

end HodgeComputer.DiagonalPermutation
Source
Hodge.computer Atlas instance `diagonal-permutation`, `data/diagonal-permutation/instance.rec`, `why.md`, and GitHub Discussion #177 (`benediamond`, `kejace`), 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