Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Auxiliary-system construction from reduced arithmetic derivative presentations

Proved
WeierstrassEllipticZeta.exists_complex_auxiliary_systems_from_reduced_arithmetic_jets

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

complex-analysiselliptic-functionstranscendence

Let LLL be a complex period pair, and let ω,u1,u2∈C\omega,u_1,u_2\in\mathbb Cω,u1​,u2​∈C have regular auxiliary-grid data. Thus integer grid points are distinct, their lattice congruences are determined by their first two coordinates, and every point shifted by u1/2u_1/2u1​/2 is outside the lattice. The finite grids have cardinality A1A2A3A_1A_2A_3A1​A2​A3​ and shifted radius at most

A1∣u1∣+A2∣u2∣+A3∣ω∣+∣u1∣/2.A_1|u_1|+A_2|u_2|+A_3|\omega|+|u_1|/2.A1​∣u1​∣+A2​∣u2​∣+A3​∣ω∣+∣u1​∣/2.

The data also include the elliptic periodicity formulas and

ζ(z+nω)=ζ(z)+nη(ω)(n∈Z, z∉Ω).\zeta(z+n\omega)=\zeta(z)+n\eta(\omega) \qquad(n\in\mathbb Z,\ z\notin\Omega).ζ(z+nω)=ζ(z)+nη(ω)(n∈Z, z∈/Ω).

Assume the canonical zeta derivative identity and the multiplied elliptic and zeta addition identities at regular arguments. Let θ\thetaθ be transcendental over Q\mathbb QQ, let ν∈C\nu\in\mathbb Cν∈C, and let g∈Z[X,Y]g\in\mathbb Z[X,Y]g∈Z[X,Y] be monic of positive YYY-degree rrr with

p(θ,ν)=0  ⟺  g∣p.p(\theta,\nu)=0\iff g\mid p.p(θ,ν)=0⟺g∣p.

For a fixed d∈Z[X]d\in\mathbb Z[X]d∈Z[X] with d(θ)≠0d(\theta)\ne0d(θ)=0, assume the eighteen auxiliary values admit presentations of YYY-degree less than rrr after multiplication by d(θ)d(\theta)d(θ). Those values are

g2/4,g3/4,ω,η(ω),u1/2,u2,ζ(u1/2),℘(u1/2),℘′(u1/2),℘′′(u1/2),g_2/4,g_3/4,\omega,\eta(\omega),u_1/2,u_2, \zeta(u_1/2),\wp(u_1/2),\wp'(u_1/2),\wp''(u_1/2),g2​/4,g3​/4,ω,η(ω),u1​/2,u2​,ζ(u1​/2),℘(u1​/2),℘′(u1​/2),℘′′(u1​/2), ℘(uj),℘′(uj),℘′′(uj),ζ(uj)(j=1,2).\wp(u_j),\wp'(u_j),\wp''(u_j),\zeta(u_j)\quad(j=1,2).℘(uj​),℘′(uj​),℘′′(uj​),ζ(uj​)(j=1,2).

Assume reduced arithmetic jet data as follows.

Fix a period pair LLL, complex numbers θ,ν\theta,\nuθ,ν, and an integer bivariate relation ggg. Write

Jv(z)=(z+v,ζ(v),℘(v),℘′(v),ζ(z),℘(z),℘′(z),℘′′(z)),J_v(z)=(z+v,\zeta(v),\wp(v),\wp'(v),\zeta(z),\wp(z),\wp'(z),\wp''(z)),Jv​(z)=(z+v,ζ(v),℘(v),℘′(v),ζ(z),℘(z),℘′(z),℘′′(z)), Gv(z)=(z+v)l0[2(℘(v)−℘(z))]3M℘(z+v)l2ζ(z+v)l3.G_v(z)=(z+v)^{l_0}[2(\wp(v)-\wp(z))]^{3M}\wp(z+v)^{l_2}\zeta(z+v)^{l_3}.Gv​(z)=(z+v)l0​[2(℘(v)−℘(z))]3M℘(z+v)l2​ζ(z+v)l3​.

Reduced arithmetic jet data mean that there exist positive integers B,HB,HB,H, uniform in all the following choices. For nonnegative integers l0≤L0l_0\le L_0l0​≤L0​, l2,l3≤Ml_2,l_3\le Ml2​,l3​≤M, and nnn, put

K=L0+5M+n,k=(L0,5M,5M,5M,K,K,K,K).K=L_0+5M+n,\qquad k=(L_0,5M,5M,5M,K,K,K,K).K=L0​+5M+n,k=(L0​,5M,5M,5M,K,K,K,K).

Given eight pairs of integer bivariate polynomials Si,QiS_i,Q_iSi​,Qi​ with total degrees at most did_idi​ and coefficient lengths at most hih_ihi​, put

D=∑i=07kidi,T=n! 241(L0+M+n)∏i=07hiki.D=\sum_{i=0}^7 k_i d_i,\qquad T=n!\,2^{41(L_0+M+n)}\prod_{i=0}^7 h_i^{k_i}.D=i=0∑7​ki​di​,T=n!241(L0​+M+n)i=0∏7​hiki​​.

There exists R∈Z[X][Y]R\in\mathbb Z[X][Y]R∈Z[X][Y] with

deg⁡YR<deg⁡Yg,deg⁡X[Yj]R≤BD(j≥0),ℓ(R)≤THD+1.\deg_Y R<\deg_Y g,\qquad \deg_X[Y^j]R\le BD\quad(j\ge0),\qquad \ell(R)\le T H^{D+1}.degY​R<degY​g,degX​[Yj]R≤BD(j≥0),ℓ(R)≤THD+1.

For every v,z,z+vv,z,z+vv,z,z+v outside the lattice, if

Si(θ,ν)=Qi(θ,ν)Jv(z)i(0≤i<8),S_i(\theta,\nu)=Q_i(\theta,\nu)J_v(z)_i\quad(0\le i<8),Si​(θ,ν)=Qi​(θ,ν)Jv​(z)i​(0≤i<8),

then

R(θ,ν)=(∏i=07Qi(θ,ν)ki)Gv(n)(z).R(\theta,\nu)=\left(\prod_{i=0}^7Q_i(\theta,\nu)^{k_i}\right)G_v^{(n)}(z).R(θ,ν)=(i=0∏7​Qi​(θ,ν)ki​)Gv(n)​(z).

Here ℓ\ellℓ sums the absolute values of all integer coefficients. The representative precedes the regular points v,zv,zv,z. Its YYY-degree is bounded independently of the derivative order and monomial cutoffs. The denominator product is shared by all monomials under the same cutoffs. The identity allows zero coordinate denominators and imposes no nonvanishing condition on an elliptic-value difference. This property supplies reduced presentations once coordinate presentations are given; it does not itself provide those inputs or their nonvanishing.

Then there exist a,c>0a,c>0a,c>0 such that every sufficiently large NNN admits a complex auxiliary system with

b=(3+∣θ∣+∣ν∣)a,E<r.b=(3+|\theta|+|\nu|)a,\qquad E<r.b=(3+∣θ∣+∣ν∣)a,E<r.

The system has the degree, height, size, and dimension-gap bounds in ComplexAuxiliarySystem. Every nonzero vector in its evaluated equation kernel with coordinate magnitudes at most ebNe^{bN}ebN has a nonzero test value of magnitude at most e−cN2log⁡Ne^{-cN^2\log N}e−cN2logN. The matrices and finite test family precede the choice of vector.

The remaining construction must supply quantitative grid-coordinate presentations and nonzero denominators, choose asymptotic parameters, and establish interpolation and nonvanishing. Bounded reduction to the fixed power basis is supplied by the reduced arithmetic jet data. The geometric, addition, kernel, and eighteen base-presentation hypotheses and the eventual auxiliary-system conclusion are unchanged.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_ReducedArithmeticJets
import Definitions.Def_WeierstrassEllipticZeta_AuxiliaryGrids
import Definitions.Def_TranscendenceTheory_ComplexAuxiliarySystem
import Mathlib.RingTheory.Algebraic.Defs
import Mathlib.Algebra.Polynomial.AlgebraMap

open scoped Polynomial
open Filter

open WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.exists_complex_auxiliary_systems_from_reduced_arithmetic_jets
    (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θ : Transcendental ℚ θ)
    (ν : ℂ)
    (g : ℤ[X][X]) (hg_monic : g.Monic) (hg_degree : 0 < g.natDegree)
    (hg_kernel : ∀ p : ℤ[X][X],
      p.eval₂ (Polynomial.aeval θ).toRingHom ν = 0 ↔ g ∣ p)
    (h_reduced : ReducedArithmeticJetData L θ ν g)
    (d : ℤ[X]) (hd : Polynomial.aeval θ d ≠ 0)
    (h_data : ∀ i : Fin 18, ∃ p : ℤ[X][X],
      p.natDegree < g.natDegree ∧
      p.eval₂ (Polynomial.aeval θ).toRingHom ν = Polynomial.aeval θ d *
        (![L.g₂/4, L.g₃/4, ω, zetaQuasiPeriod L ω, u₁/2, u₂,
        weierstrassZeta L (u₁/2), L.weierstrassP (u₁/2),
        L.derivWeierstrassP (u₁/2), deriv L.derivWeierstrassP (u₁/2),
        L.weierstrassP u₁, L.derivWeierstrassP u₁, deriv L.derivWeierstrassP u₁,
        weierstrassZeta L u₁, L.weierstrassP u₂, L.derivWeierstrassP u₂,
        deriv L.derivWeierstrassP u₂, weierstrassZeta L u₂] i)) :
    ∃ a c : ℝ, 0 < a ∧ 0 < c ∧
      ∀ᶠ N : ℕ in Filter.atTop,
        ∃ S : TranscendenceTheory.ComplexAuxiliarySystem
          θ ν a ((3 + ‖θ‖ + ‖ν‖) * a) c N,
          S.yDegree < g.natDegree := by sorry
Source
Senthil Kumar K (2026), Section 5 Lemmas 7-10. This auxiliary construction assumes the quantitative monic reduction from Section 3 Lemma 1 has been applied to the arithmetic derivative presentations of Lemma 7(b). Quantitative grid presentations, nonzero denominators, parameters, interpolation and the zero estimate remain open. 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