Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Reflection-chart cubic threefold and cleared relative primitive interface

Definition
HodgeComputerReflectionChart

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

algebraic-geometrycommutative-algebrahodge-theorypolynomials

This module establishes the shared polynomial interface for descending a six-variable projective sextic fourfold V(F)⊂P5V(F) \subset \mathbb{P}^5V(F)⊂P5 with a (01)(01)(01)-reflection symmetry (X0,Y0)↔(X1,Y1)(X_0, Y_0) \leftrightarrow (X_1, Y_1)(X0​,Y0​)↔(X1​,Y1​) to a family of affine cubic threefolds.

Write (λ,b,c,d,v)(\lambda, b, c, d, v)(λ,b,c,d,v) for five affine chart coordinates and embed them into C6\mathbb{C}^6C6 along the reflection-adapted affine slice

(X0,X1,X2,Y0,Y1,Y2)=(1+v,  1−v,  b,  c+λv,  c−λv,  d).(X_0, X_1, X_2, Y_0, Y_1, Y_2) = (1 + v,\; 1 - v,\; b,\; c + \lambda v,\; c - \lambda v,\; d).(X0​,X1​,X2​,Y0​,Y1​,Y2​)=(1+v,1−v,b,c+λv,c−λv,d).

When FFF and a degree-666 source AAA are invariant under (X0,Y0)↔(X1,Y1)(X_0, Y_0) \leftrightarrow (X_1, Y_1)(X0​,Y0​)↔(X1​,Y1​), their pullbacks depend on vvv only through u=v2u = v^2u=v2, giving polynomials f(λ,b,c,d,u)f(\lambda, b, c, d, u)f(λ,b,c,d,u) and P(λ,b,c,d,u)P(\lambda, b, c, d, u)P(λ,b,c,d,u) with F∣chart=f(λ,b,c,d,v2)F|_{\mathrm{chart}} = f(\lambda, b, c, d, v^2)F∣chart​=f(λ,b,c,d,v2) and A∣chart=P(λ,b,c,d,v2)A|_{\mathrm{chart}} = P(\lambda, b, c, d, v^2)A∣chart​=P(λ,b,c,d,v2). After accounting for the Jacobian factor 4v4 v4v, Poincare residue elimination along f=0f = 0f=0 asks for a cleared relative two-form primitive βj=Cj/D\beta_j = C_j / Dβj​=Cj​/D (j∈{b,c,d}j \in \{b, c, d\}j∈{b,c,d}) with D≠0D \neq 0D=0 coprime to fff satisfying

fu2∑j∈{b,c,d}[fu(D∂jCj−Cj∂jD)−fj(D∂uCj−Cj∂uD)]−2D2(fuPu−fuuP)≡0(modf).f_u^2 \sum_{j \in \{b,c,d\}} \Bigl[ f_u (D \partial_j C_j - C_j \partial_j D) - f_j (D \partial_u C_j - C_j \partial_u D) \Bigr] - 2 D^2 (f_u P_u - f_{uu} P) \equiv 0 \pmod{f}.fu2​j∈{b,c,d}∑​[fu​(D∂j​Cj​−Cj​∂j​D)−fj​(D∂u​Cj​−Cj​∂u​D)]−2D2(fu​Pu​−fuu​P)≡0(modf).

For a cubic equation f=ℓu3+c2u2+c1u+c0f = \ell u^3 + c_2 u^2 + c_1 u + c_0f=ℓu3+c2​u2+c1​u+c0​ and a source P=p0+p1u+p2u2+p3u3P = p_0 + p_1 u + p_2 u^2 + p_3 u^3P=p0​+p1​u+p2​u2+p3​u3 of degree at most 333 in uuu, the cleared canonical trace coefficients

K0=6ℓ2p0−2ℓc1p2+(3ℓc0+c2c1)p3,K1=6ℓ2p1−4ℓc2p2+2c22p3K_0 = 6 \ell^2 p_0 - 2 \ell c_1 p_2 + (3 \ell c_0 + c_2 c_1) p_3, \qquad K_1 = 6 \ell^2 p_1 - 4 \ell c_2 p_2 + 2 c_2^2 p_3K0​=6ℓ2p0​−2ℓc1​p2​+(3ℓc0​+c2​c1​)p3​,K1​=6ℓ2p1​−4ℓc2​p2​+2c22​p3​

give the unique linear-in-uuu representative K0+K1uK_0 + K_1 uK0​+K1​u of 6ℓ2P6 \ell^2 P6ℓ2P after subtracting the first-order pole and trace-zero branch multiple of fuf_ufu​ modulo fff.

This shared definition supports reusable transport and trace-reduction theorems across reflection-invariant sextic targets such as symmetric-sextic-residual and diagonal-permutation.

Formalization Note Coordinates in ChartPoly := MvPolynomial (Fin 5) ℂ are ordered (λ,b,c,d,u)(\lambda, b, c, d, u)(λ,b,c,d,u) (or (λ,b,c,d,v)(\lambda, b, c, d, v)(λ,b,c,d,v) after applying the ring homomorphism squareLift sending X4↦X42X_4 \mapsto X_4^2X4​↦X42​). The smooth test point normalPoint is (0,0,0,0,i)(0, 0, 0, 0, i)(0,0,0,0,i).

Definition code
import Definitions.Def_DiamondCertificate

set_option autoImplicit false
noncomputable section

namespace HodgeComputer.ReflectionChart
open MvPolynomial
open scoped BigOperators

/-- Five-variable chart polynomial ring in coordinates `(λ, b, c, d, u)` or `(λ, b, c, d, v)`. -/
abbrev ChartPoly := MvPolynomial (Fin 5) ℂ

/-- Reflection cover substitution `u ↦ v²` on the last coordinate (`Fin 5` index `4`). -/
def squareLift : ChartPoly →+* ChartPoly :=
  eval₂Hom C (fun i : Fin 5 => if i = 4 then X i ^ 2 else X i)

/-- Transformed double-pole source numerator `4 v P(λ, b, c, d, v²)` on the reflection chart. -/
def reflectedSource (P : ChartPoly) : ChartPoly :=
  C 4 * X 4 * squareLift P

/-- Pullback of a six-variable polynomial along the affine reflection chart
`(X₀, X₁, X₂, Y₀, Y₁, Y₂) = (1 + v, 1 - v, b, c + λ v, c - λ v, d)`. -/
def affinePullback : AmbientPoly 5 →+* ChartPoly :=
  eval₂Hom C ![1 + X 4, 1 - X 4, X 1, X 2 + X 0 * X 4, X 2 - X 0 * X 4, X 3]

/-- Canonical smooth test point `(0, 0, 0, 0, i)` on the affine reflection chart. -/
def normalPoint : Fin 5 → ℂ := ![0, 0, 0, 0, Complex.I]

/-- Cleared relative-primitive polynomial defect on the weighted cubic threefold `f(λ, b, c, d, u) = 0`:
`f_u² ∑_{j ∈ {b,c,d}} [f_u (D ∂_j C_j - C_j ∂_j D) - f_j (D ∂_u C_j - C_j ∂_u D)] - 2 D² (f_u P_u - f_{uu} P)`. -/
def cubicResidueDefect (f P D : ChartPoly) (Cvec : Fin 3 → ChartPoly) : ChartPoly :=
  (pderiv 4 f) ^ 2 *
    (∑ j : Fin 3,
      (pderiv 4 f * (D * pderiv j.succ.castSucc (Cvec j) - Cvec j * pderiv j.succ.castSucc D) -
        pderiv j.succ.castSucc f * (D * pderiv 4 (Cvec j) - Cvec j * pderiv 4 D))) -
    C 2 * D ^ 2 * (pderiv 4 f * pderiv 4 P - pderiv 4 (pderiv 4 f) * P)

/-- Existence of a cleared relative two-form primitive `β_j = C_j / D` (`j ∈ {b, c, d}`)
on the weighted threefold `f(λ, b, c, d, u) = 0` for the residue density `2(f_u P_u - f_{uu} P) / f_u³`. -/
def RelativePrimitive (f P : ChartPoly) : Prop :=
  ∃ (D : ChartPoly) (Cvec : Fin 3 → ChartPoly) (Q : ChartPoly),
    D ≠ 0 ∧ IsRelPrime f D ∧ cubicResidueDefect f P D Cvec = f * Q

/-- Cleared constant-in-`u` canonical trace coefficient `K₀` for a cubic equation
`f = ℓ u³ + c₂ u² + c₁ u + c₀` and cubic source `P = p₀ + p₁ u + p₂ u² + p₃ u³`. -/
def cubicTraceK0 (ell c2 c1 c0 p0 p2 p3 : ChartPoly) : ChartPoly :=
  C 6 * ell ^ 2 * p0 - C 2 * ell * c1 * p2 + (C 3 * ell * c0 + c2 * c1) * p3

/-- Cleared linear-in-`u` canonical trace coefficient `K₁` for a cubic equation
`f = ℓ u³ + c₂ u² + c₁ u + c₀` and cubic source `P = p₀ + p₁ u + p₂ u² + p₃ u³`. -/
def cubicTraceK1 (ell c2 p1 p2 p3 : ChartPoly) : ChartPoly :=
  C 6 * ell ^ 2 * p1 - C 4 * ell * c2 * p2 + C 2 * c2 ^ 2 * p3

end HodgeComputer.ReflectionChart
Source
Hodge.computer Sextic Fourfold Atlas, Chapter 3B (Weighted Threefolds and Reflection Charts) and Discussion #117 / #177, https://hodge.computer/#book/03b-weighted-threefolds and https://github.com/hodge-computer/sextics/discussions/117

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