Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Quantitative single-point elliptic multiplication presentations

Definition
WeierstrassEllipticZeta_MultiplePolynomials

by tomasz · Sep 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

complex-analysiselliptic-functionspolynomialstranscendence

Fix a complex period pair LLL with lattice Ω\OmegaΩ and a point u∈Cu\in\mathbb Cu∈C. The five single-point generators are

yu=(g2/4,g3/4,℘L(u),℘L′(u),ζL(u)).y_u=(g_2/4,g_3/4,\wp_L(u),\wp'_L(u),\zeta_L(u)).yu​=(g2​/4,g3​/4,℘L​(u),℘L′​(u),ζL​(u)).

For natural numbers n,D,Jn,D,Jn,D,J, a multiple presentation consists of a common denominator QQQ and three numerators PjP_jPj​ in Z[Y0,…,Y4]\mathbb Z[Y_0,\ldots,Y_4]Z[Y0​,…,Y4​]. All four polynomials have total degree at most DDD and coefficient length at most JJJ, where coefficient length is the sum of the absolute values of the integer coefficients. They satisfy

Q(yu)≠0,Pj(yu)=Q(yu)xj(nu),(x0,x1,x2)=(ζL,℘L,℘L′).Q(y_u)\ne0,\qquad P_j(y_u)=Q(y_u)x_j(nu),\qquad (x_0,x_1,x_2)=(\zeta_L,\wp_L,\wp'_L).Q(yu​)=0,Pj​(yu​)=Q(yu​)xj​(nu),(x0​,x1​,x2​)=(ζL​,℘L​,℘L′​).

The property EllipticMultiplePolynomialData⁡(L,u)\operatorname{EllipticMultiplePolynomialData}(L,u)EllipticMultiplePolynomialData(L,u) asserts that there are positive natural constants C,HC,HC,H, chosen before all indices, such that for every positive integer nnn there is a multiple presentation with

D=Cn2,J=Hn2.D=Cn^2,\qquad J=H^{n^2}.D=Cn2,J=Hn2.

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.

Definition code
import Definitions.Def_WeierstrassEllipticZeta_GeneratorPolynomials

noncomputable section

namespace WeierstrassEllipticZeta

/-- The five generators needed for multiplication at a single point. -/
def ellipticMultipleGenerators (L : PeriodPair) (u : ℂ) : Fin 5 → ℂ :=
  ![L.g₂ / 4, L.g₃ / 4, L.weierstrassP u, L.derivWeierstrassP u, weierstrassZeta L u]

/-- A common denominator for the three elliptic values at a natural multiple. -/
structure EllipticMultiplePresentation (L : PeriodPair) (u : ℂ) (n D H : ℕ) where
  numerator : Fin 3 → MvPolynomial (Fin 5) ℤ
  denominator : MvPolynomial (Fin 5) ℤ
  numerator_degree : ∀ j, (numerator j).totalDegree ≤ D
  denominator_degree : denominator.totalDegree ≤ D
  numerator_length : ∀ j,
    (∑ m ∈ (numerator j).support, ((numerator j).coeff m).natAbs) ≤ H
  denominator_length : (∑ m ∈ denominator.support, (denominator.coeff m).natAbs) ≤ H
  denominator_ne_zero : MvPolynomial.eval₂ (Int.castRingHom ℂ)
    (ellipticMultipleGenerators L u) denominator ≠ 0
  evaluation : ∀ j,
    MvPolynomial.eval₂ (Int.castRingHom ℂ) (ellipticMultipleGenerators L u) (numerator j) =
    MvPolynomial.eval₂ (Int.castRingHom ℂ) (ellipticMultipleGenerators L u) denominator *
      (![weierstrassZeta L (n * u), L.weierstrassP (n * u),
        L.derivWeierstrassP (n * u)] j)

/-- The quadratic division-polynomial bounds needed at one nontorsion point. -/
def EllipticMultiplePolynomialData (L : PeriodPair) (u : ℂ) : Prop :=
  ∃ C H : ℕ, 0 < C ∧ 0 < H ∧ ∀ n : ℕ, 0 < n →
    Nonempty (EllipticMultiplePresentation L u n (C * n ^ 2) (H ^ (n ^ 2)))

end WeierstrassEllipticZeta
Source
Presentation interface for Senthil Kumar K (2026), Section 4 Lemma 5, equation (12), and its use in Section 5 Lemma 7(a). It records a common nonzero denominator, quadratic degree, and exponential coefficient length at positive multiples of one point. It does not assert or define the division polynomials themselves. https://doi.org/10.1017/S001309152610145X

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me