Quadratic degree and exponential length bounds for elliptic multiplication polynomials
ProvedWeierstrassEllipticZeta.division_multiple_polynomial_boundsFor the following explicit integer polynomials, there exist positive natural constants , independent of the positive integer , such that
Here is the sum of the absolute values of all integer coefficients. The constants are universal for these formal polynomials; no lattice, evaluation point, nonvanishing, or analytic identity is assumed. In particular, this result also bounds each individual coefficient. The recurrences, derivation, and four polynomials are specified below.
Work in the integer polynomial ring in five independent variables, ordered as
Set
Let be Mathlib's auxiliary normalized elliptic-divisibility sequence. Explicitly, its initial terms and recurrences are
The reduced division polynomial is
These are the usual division-polynomial representatives after using the cubic relation to replace even powers of . The even factor is , corresponding to . The signs above correspond to the curve .
Define the integer polynomial derivation by
The explicit common denominator and three numerators are
The definitions are total for natural indices; denotes truncated natural subtraction. Bounds and analytic multiplication claims below are required only for .
import Definitions.Def_WeierstrassEllipticZeta_DivisionPolynomials open WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.division_multiple_polynomial_bounds : ∃ C H : ℕ, 0 < C ∧ 0 < H ∧
∀ n : ℕ, 0 < n →
(ellipticDivisionDenominator n).totalDegree ≤ C * n ^ 2 ∧
(∑ m ∈ (ellipticDivisionDenominator n).support,
((ellipticDivisionDenominator n).coeff m).natAbs) ≤ H ^ (n ^ 2) ∧
(∀ j, (ellipticDivisionNumerator n j).totalDegree ≤ C * n ^ 2) ∧
(∀ j, (∑ m ∈ (ellipticDivisionNumerator n j).support,
((ellipticDivisionNumerator n j).coeff m).natAbs) ≤ H ^ (n ^ 2)) := by sorry