Cleared auxiliary polynomial with separate degree bounds
ProvedWeierstrassEllipticZeta.cleared_auxiliary_polynomial_presentationcomplex-analysiselliptic-functionstranscendence
Let be a complex period pair with lattice and canonical Weierstrass functions . Let , let be nonnegative integers, and let be any complex coefficient array. There is a polynomial such that every monomial with nonzero coefficient satisfies
and, for every such that ,
No nonzero-coefficient hypothesis or nonvanishing-denominator hypothesis is imposed. In particular the identity also applies when . The two degree bounds are separate: ordinary degree in , and combined degree in the three elliptic/zeta variables.
An explicit construction sets , , and
then takes . The exponent is nonnegative because . The addition identities give the evaluation formula without division.
Preamble
import Definitions.Def_WeierstrassEllipticZeta_Defs import Mathlib.Algebra.MvPolynomial.Eval open WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.cleared_auxiliary_polynomial_presentation
(L : PeriodPair) (v : ℂ) (hv : v ∉ L.lattice) (m l : ℕ)
(c : Fin (m + 1) × Fin (l + 1) × Fin (l + 1) → ℂ) :
∃ P : MvPolynomial (Fin 4) ℂ,
(∀ d ∈ P.support, d 0 ≤ m ∧ d 1 + d 2 + d 3 ≤ 5 * l) ∧
∀ z : ℂ, z ∉ L.lattice → z + v ∉ L.lattice →
MvPolynomial.eval ![z, L.weierstrassP z, L.derivWeierstrassP z,
weierstrassZeta L z] P =
(2 * (L.weierstrassP v - L.weierstrassP z)) ^ (3 * l) *
(∑ i, c i * (z + v) ^ i.1.val * L.weierstrassP (z + v) ^ i.2.1.val *
weierstrassZeta L (z + v) ^ i.2.2.val) := by sorry
Source
Senthil Kumar K (2026), proof of Lemma 9 and equations (5)-(6), https://doi.org/10.1017/S001309152610145X. This derived formulation makes the cleared polynomial Q explicit, for any regular translate v and arbitrary coefficient array. The elliptic degree is a bound on each monomial exponent sum, as needed for bihomogenization; it is not a sum of three separate maximal variable degrees. It uses the division-free addition formulas, and includes vanishing clearing factors and zero integer parameters.