Canonical polynomial generator of elliptic contact conditions
ProvedWeierstrassEllipticZeta.wp_contact_minpoly_generatorFix the elliptic-extension geometry of the mission. Let , let be finite and contain zero, and let be a polynomial in the seven homogeneous coordinates. Assume the existing chart certificates for . Let be any finite subset, and put .
Use the regular affine chart with coordinates . In the ring , let
where is the chart contact ideal: its elements and their first derivatives along the chart flow vanish at . Let , and let be the class of , the elliptic coordinate. Then there exists a monic polynomial such that
and, for every ,
Thus is the unique monic generator of the polynomial contact conditions and has the least degree among their nonzero solutions. The theorem proves that the relevant quotient is finite dimensional from the existing chart certificates; finiteness is not an extra assumption. It includes an empty nonlattice subset, where the contact conditions are vacuous and the generator is .
Formalization Note. The geometry and chart certificates are the existing stable records. Algebra.adjoin denotes the subalgebra generated by the elliptic coordinate; its dimension counts independent coordinate powers, not the dimension of the whole contact quotient. No new interface fields or general zero-estimate hypotheses are introduced.
import Definitions.Def_WeierstrassEllipticZeta_InterfaceGeometry import Mathlib.RingTheory.Adjoin.PowerBasis import Mathlib.RingTheory.Ideal.Quotient.Operations import Mathlib.Analysis.Analytic.Polynomial noncomputable section open WeierstrassEllipticZeta open scoped Pointwise Classical Topology
theorem WeierstrassEllipticZeta.wp_contact_minpoly_generator
(G : Frontier.Geometry) (m n U : ℕ) (X : Finset ℂ)
(Q : MvPolynomial (Fin 7) ℂ) (hX : 0 ∈ X)
(hcharts : Frontier.HasChartCertificates G m n U X Q)
(Y : Finset ℂ) (hYX : Y ⊆ X) :
let Z := Y.filter (fun z => z ∉ G.L.lattice)
let I : Ideal (MvPolynomial (Fin 4) ℂ) :=
⨅ z : Z, extensionChartContactIdeal G.L.g₂ G.L.g₃ 0
(extensionChartCoordinates G.S 0 z.val) (3 * U + 1)
let x := Ideal.Quotient.mk I (MvPolynomial.X (1 : Fin 4))
∃ p : Polynomial ℂ, p.Monic ∧
p.natDegree = Module.finrank ℂ (Algebra.adjoin ℂ ({x} : Set _)) ∧
∀ q : Polynomial ℂ, p ∣ q ↔ ∀ z ∈ Y, z ∉ G.L.lattice → ∀ j < 3 * U + 1,
iteratedDeriv j (fun w => q.eval (G.L.weierstrassP w)) z = 0 := by sorry