Combine elliptic multiplication polynomials by addition and period translation
ProvedWeierstrassEllipticZeta.compose_elliptic_generator_polynomialsLet be a complex period pair with lattice , and let have regular auxiliary-grid data. Thus the integer grid map is injective, an integer grid point belongs to the lattice precisely when its first two coordinates vanish, and two such points are congruent modulo the lattice precisely when their first two coordinates agree. Every integer grid point shifted by is outside the lattice. The data also give grid cardinalities, the shifted triangle-inequality radius bound, periodicity of , and
Assume the canonical identity off the lattice, and the following addition identities whenever are outside the lattice:
Suppose that both points have single-point multiplication data:
Then
Thus the bounded common-denominator presentations for positive multiples of each point can be combined into bounded polynomials in the nine generators for every nonlattice natural grid point. The addition step treats both indices nonzero, and direct renaming handles either index zero. Period translation preserves the denominator, adds at most one to the degree, and adds only a factor linear in the period index to coefficient length. The full meanings of the two data properties follow.
Fix a complex period pair with lattice and a point . The five single-point generators are
For natural numbers , a multiple presentation consists of a common denominator and three numerators in . All four polynomials have total degree at most and coefficient length at most , where coefficient length is the sum of the absolute values of the integer coefficients. They satisfy
The property asserts that there are positive natural constants , chosen before all indices, such that for every positive integer there is a multiple presentation with
Numerators may vanish. Evaluated denominators may not. There is no requirement at index zero. The constants and polynomials may depend on the fixed lattice and point; the polynomials may also depend on the index. The predicate itself asserts these presentations at all positive indices. The theorem establishing it assumes that all positive multiples of the point are outside the lattice. No arithmetic parameters, auxiliary grid, or period generator occur in this property.
Fix a complex period pair , with lattice , and complex numbers . The ordered generator tuple is
For a point and nonnegative integers , a generator presentation consists of a common denominator and three numerators in , with total degrees at most and coefficient lengths at most , satisfying
Coefficient length means the sum of the absolute values of all integer coefficients. Numerators may vanish; the evaluated denominator may not.
The property asserts that there are positive integers , chosen before all indices, with the following property. For every triple , set
If , there is a generator presentation at with bounds
Thus the degree is quadratic in the two nonperiodic indices and independent of the period index; the period index occurs only linearly in the coefficient-length bound. The constants may depend on the fixed lattice and generators. The polynomials may depend on the index triple. This property does not assert that one polynomial family works for every lattice. It contains no arithmetic parameters , auxiliary integer , or reduced polynomial model.
import Definitions.Def_WeierstrassEllipticZeta_MultiplePolynomials open WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.compose_elliptic_generator_polynomials
(L : PeriodPair) (ω u₁ u₂ : ℂ)
(h_grid : RegularAuxiliaryGridData L ω u₁ u₂)
(h_zeta_deriv : ∀ z : ℂ, z ∉ L.lattice →
HasDerivAt (weierstrassZeta L) (-L.weierstrassP z) z)
(h_zeta_addition : ∀ z v : ℂ,
z ∉ L.lattice → v ∉ L.lattice → z + v ∉ L.lattice →
2 * (L.weierstrassP v - L.weierstrassP z) * weierstrassZeta L (z + v) =
2 * (weierstrassZeta L z + weierstrassZeta L v) *
(L.weierstrassP v - L.weierstrassP z) +
L.derivWeierstrassP v - L.derivWeierstrassP z)
(h_wp_addition : ∀ z v : ℂ,
z ∉ L.lattice → v ∉ L.lattice → z + v ∉ L.lattice →
4 * (L.weierstrassP v - L.weierstrassP z) ^ 2 * L.weierstrassP (z + v) =
-4 * (L.weierstrassP z + L.weierstrassP v) *
(L.weierstrassP v - L.weierstrassP z) ^ 2 +
(L.derivWeierstrassP v - L.derivWeierstrassP z) ^ 2)
(h₁ : EllipticMultiplePolynomialData L u₁)
(h₂ : EllipticMultiplePolynomialData L u₂) :
EllipticGeneratorPolynomialData L ω u₁ u₂ := by sorry