Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Existence of a cleared relative two-form primitive on the (01)-reflection cubic for diagonal-permutation

Open
HodgeComputer.DiagonalPermutation.relative_primitive_exists

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

algebraic-geometryhodge-theorypolynomials

On the (01)(01)(01)-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, let 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 be the weighted cubic of diagonal-permutation and let Pdiag(λ,b,c,d,u)P_{\mathrm{diag}}(\lambda, b, c, d, u)Pdiag​(λ,b,c,d,u) be the descended cubic source of 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​.

The theorem asserts the existence of a cleared relative two-form primitive on fdiag=0f_{\mathrm{diag}} = 0fdiag​=0:

RelativePrimitive⁡(fdiag,  Pdiag).\operatorname{RelativePrimitive}(f_{\mathrm{diag}},\; P_{\mathrm{diag}}).RelativePrimitive(fdiag​,Pdiag​).

Via reflection-chart transport and S3S_3S3​-equivariant linear combination, this affine cubic primitive implies both transposition_quotient_certificate and the root target HodgeComputer.DiagonalPermutation.certificate.

Preamble
import Definitions.Def_HodgeComputerDiagonalPermutationQuotient
Formal statement
theorem HodgeComputer.DiagonalPermutation.relative_primitive_exists :
    HodgeComputer.ReflectionChart.RelativePrimitive
      HodgeComputer.DiagonalPermutation.diagWeighted
      HodgeComputer.DiagonalPermutation.diagSource := by sorry
Source
Hodge.computer Atlas instance `diagonal-permutation`, Chapter 3B and Discussion #177 (`benediamond`), 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