Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sigma multiplication, nonvanishing, and zeta values on regular multiples

Proved
WeierstrassEllipticZeta.division_sigma_multiplication

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

complex-analysiselliptic-functionspolynomialstranscendence

Let LLL be a complex period pair, with lattice Ω\OmegaΩ, invariants g2,g3g_2,g_3g2​,g3​, and canonical functions ℘,℘′,ζ\wp,\wp',\zeta℘,℘′,ζ. For the fixed integer polynomials and derivation specified below, write

yz=(g2/4,g3/4,℘(z),℘′(z),ζ(z)),fn(z)=Fn(yz).y_z=(g_2/4,g_3/4,\wp(z),\wp'(z),\zeta(z)),\qquad f_n(z)=F_n(y_z).yz​=(g2​/4,g3​/4,℘(z),℘′(z),ζ(z)),fn​(z)=Fn​(yz​).

Assume a normalized sigma datum, the canonical derivative identity ζ′=−℘\zeta'=-\wpζ′=−℘ outside the lattice, and the conditional elliptic division identities, all specified below. Let n≥1n\ge1n≥1 and let u∈Cu\in\mathbb Cu∈C satisfy

ku∉Ω(1≤k≤n).ku\notin\Omega\qquad(1\le k\le n).ku∈/Ω(1≤k≤n).

Then

σ(nu)=(−1)n+1σ(u)n2fn(u),fn(u)≠0,\sigma(nu)=(-1)^{n+1}\sigma(u)^{n^2}f_n(u),\qquad f_n(u)\ne0,σ(nu)=(−1)n+1σ(u)n2fn​(u),fn​(u)=0, nfn(u)ζ(nu)=n2fn(u)ζ(u)+(DFn)(yu).nf_n(u)\zeta(nu)=n^2f_n(u)\zeta(u)+(\mathcal D F_n)(y_u).nfn​(u)ζ(nu)=n2fn​(u)ζ(u)+(DFn​)(yu​).

For positive nnn, the sign displayed here is the same as (−1)n−1(-1)^{n-1}(−1)n−1 in equation (13). This result establishes the sigma multiplication identity, denominator nonvanishing, and the zeta multiplication identity on a finite block of regular multiples. It uses only the first of the two conditional elliptic identities. It supplies the analytic induction and differentiation step needed to combine rational elliptic formulas into full multiplication presentations.

A normalized sigma datum is a function σ:C→C\sigma:\mathbb C\to\mathbb Cσ:C→C satisfying

σ(0)=0,σ′(0)=1,\sigma(0)=0,\qquad \sigma'(0)=1,σ(0)=0,σ′(0)=1,

and, at every z∉Ωz\notin\Omegaz∈/Ω, differentiability together with

σ(z)≠0,σ′(z)=ζ(z)σ(z).\sigma(z)\ne0,\qquad \sigma'(z)=\zeta(z)\sigma(z).σ(z)=0,σ′(z)=ζ(z)σ(z).

For every z,v∉Ωz,v\notin\Omegaz,v∈/Ω it also satisfies the multiplied-out addition identity

σ(z+v)σ(z−v)=(℘(v)−℘(z))σ(z)2σ(v)2.\sigma(z+v)\sigma(z-v)=(\wp(v)-\wp(z))\sigma(z)^2\sigma(v)^2.σ(z+v)σ(z−v)=(℘(v)−℘(z))σ(z)2σ(v)2.

The sum and difference may belong to the lattice. This interface records exactly the sigma properties used here; it does not assert any growth estimate.

The conditional elliptic division identities mean that, for every positive integer nnn and every zzz such that

z∉Ω,nz∉Ω,fn(z)≠0,z\notin\Omega,\qquad nz\notin\Omega,\qquad f_n(z)\ne0,z∈/Ω,nz∈/Ω,fn​(z)=0,

one has

fn(z)2℘(nz)=℘(z)fn(z)2−fn−1(z)fn+1(z),f_n(z)^2\wp(nz)=\wp(z)f_n(z)^2-f_{n-1}(z)f_{n+1}(z),fn​(z)2℘(nz)=℘(z)fn​(z)2−fn−1​(z)fn+1​(z), fn(z)4℘′(nz)=f2n(z).f_n(z)^4\wp'(nz)=f_{2n}(z).fn​(z)4℘′(nz)=f2n​(z).

Nonvanishing is a hypothesis of these conditional identities, not a conclusion.

Work in the integer polynomial ring in five independent variables, ordered as

(G,H,x,p,Z).(G,H,x,p,Z).(G,H,x,p,Z).

Set

β=16(x3−Gx−H)2,γ=3x4−6Gx2−12Hx−G2,\beta=16(x^3-Gx-H)^2,\qquad \gamma=3x^4-6Gx^2-12Hx-G^2,β=16(x3−Gx−H)2,γ=3x4−6Gx2−12Hx−G2, δ=2x6−10Gx4−40Hx3−10G2x2−8GHx+2G3−16H2.\delta=2x^6-10Gx^4-40Hx^3-10G^2x^2-8GHx+2G^3-16H^2.δ=2x6−10Gx4−40Hx3−10G2x2−8GHx+2G3−16H2.

Let rn=preNormEDS⁡′(β,γ,δ,n)r_n=\operatorname{preNormEDS}'(\beta,\gamma,\delta,n)rn​=preNormEDS′(β,γ,δ,n) be Mathlib's auxiliary normalized elliptic-divisibility sequence. Explicitly, its initial terms and recurrences are

r0=0,r1=r2=1,r3=γ,r4=δ,r_0=0,\quad r_1=r_2=1,\quad r_3=\gamma,\quad r_4=\delta,r0​=0,r1​=r2​=1,r3​=γ,r4​=δ, r2k=rk−12rkrk+2−rk−2rkrk+12(k≥3),r_{2k}=r_{k-1}^2r_kr_{k+2}-r_{k-2}r_kr_{k+1}^2\quad(k\ge3),r2k​=rk−12​rk​rk+2​−rk−2​rk​rk+12​(k≥3), r2k+1=rk+2rk3{βk even,1k odd−rk−1rk+13{1k even,βk odd(k≥2).r_{2k+1}=r_{k+2}r_k^3\begin{cases}\beta&k\text{ even},\\1&k\text{ odd}\end{cases} -r_{k-1}r_{k+1}^3\begin{cases}1&k\text{ even},\\\beta&k\text{ odd}\end{cases}\quad(k\ge2).r2k+1​=rk+2​rk3​{β1​k even,k odd​−rk−1​rk+13​{1β​k even,k odd​(k≥2).

The reduced division polynomial is

Fn=rn{pn even,1n odd.F_n=r_n\begin{cases}p&n\text{ even},\\1&n\text{ odd}.\end{cases}Fn​=rn​{p1​n even,n odd.​

These are the usual division-polynomial representatives after using the cubic relation to replace even powers of ppp. The even factor is ppp, corresponding to 2y=℘′2y=\wp'2y=℘′. The signs above correspond to the curve y2=x3−Gx−Hy^2=x^3-Gx-Hy2=x3−Gx−H.

Define the integer polynomial derivation D\mathcal DD by

D(G,H,x,p,Z)=(0,0,p,6x2−2G,−x).\mathcal D(G,H,x,p,Z)=(0,0,p,6x^2-2G,-x).D(G,H,x,p,Z)=(0,0,p,6x2−2G,−x).
Preamble
import Definitions.Def_WeierstrassEllipticZeta_SigmaAddition

open MvPolynomial WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.division_sigma_multiplication (L : PeriodPair) (S : EllipticSigmaData L)
    (h_zeta_deriv : ∀ z : ℂ, z ∉ L.lattice →
      HasDerivAt (weierstrassZeta L) (-L.weierstrassP z) z)
    (h_wp_division : EllipticDivisionWpIdentities L)
    (u : ℂ) (n : ℕ) (hn : 0 < n)
    (h_regular : ∀ k : ℕ, 0 < k → k ≤ n → (k : ℂ) * u ∉ L.lattice) :
    let e := eval₂ (Int.castRingHom ℂ) (ellipticMultipleGenerators L u)
    let f := fun k => e (ellipticDivisionPolynomial k)
    S.sigma ((n : ℂ) * u) = (-1) ^ (n + 1) * S.sigma u ^ (n ^ 2) * f n ∧
      f n ≠ 0 ∧
      (n : ℂ) * f n * weierstrassZeta L (n * u) =
        (n : ℂ) ^ 2 * f n * weierstrassZeta L u +
          e (ellipticMultipleDerivation (ellipticDivisionPolynomial n)) := by sorry
Source
Senthil Kumar K (2026), Section 4 Lemma 5, equations (12) and (13) and the induction immediately following (13). This is the conditional sigma argument under explicitly stated sigma addition and rational elliptic multiplication hypotheses. Finite regularity of multiples 1 through n is retained to justify cancellation and local differentiation. The proof also derives the duplication case from normalized sigma addition and identifies the complex derivative with the polynomial derivation. 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