Symmetric sextic: 26-equation intrinsic moving-point elimination
ProvedHodgeComputer.SymmetricSexticResidual.intrinsic_point_eliminationalgebraic-geometryhodge-conjecturepolynomial-identities
In the intrinsic contact chart for the symmetric sextic, eliminating the normal coordinate via the monic quadric reduces the moving-point equations to and . Define , , and the resultant polynomial . Then:
-
and .
-
On the open locus and , the system is equivalent to and .
-
Along , any first-order parameter variation (holding the base coordinates fixed) satisfies the exact Jacobian transformation
This reduces the 27-variable moving-point system to 26 equations in the 26 contact coordinates.
Preamble
import Mathlib.Data.Complex.Basic import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.LinearCombination import Mathlib.Tactic.Ring set_option autoImplicit false set_option maxHeartbeats 4000000
Formal statement
theorem HodgeComputer.SymmetricSexticResidual.intrinsic_point_elimination
(L Q A0 A1 B0 B1 alpha Ld Qd A0d A1d B0d B1d : ℂ) :
let U := Q * A0 - L * A1
let V := Q * B0 - L * B1
let H := Q * U ^ 2 + L * V ^ 2
let g1 := L + Q * alpha ^ 2
let g2 := A0 + A1 * alpha ^ 2 + alpha * (B0 + B1 * alpha ^ 2)
let dtau_g1 := Ld + Qd * alpha ^ 2
let dalpha_g1 := 2 * Q * alpha
let dtau_g2 := A0d + A1d * alpha ^ 2 + alpha * (B0d + B1d * alpha ^ 2)
let dalpha_g2 := 2 * A1 * alpha + B0 + 3 * B1 * alpha ^ 2
let dtau_U := Qd * A0 + Q * A0d - Ld * A1 - L * A1d
let dtau_V := Qd * B0 + Q * B0d - Ld * B1 - L * B1d
let dtau_H := Qd * U ^ 2 + 2 * Q * U * dtau_U + Ld * V ^ 2 + 2 * L * V * dtau_V
(Q * g2 - (A1 + alpha * B1) * g1 = U + alpha * V) ∧
(H = Q * (U + alpha * V) * (U - alpha * V) + g1 * V ^ 2) ∧
(Q ≠ 0 → V ≠ 0 →
((g1 = 0 ∧ g2 = 0) ↔ (H = 0 ∧ alpha = -U / V))) ∧
(g1 = 0 → g2 = 0 →
dtau_H = Q * V * (dtau_g1 * dalpha_g2 - dalpha_g1 * dtau_g2)) := by sorrySource