Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A bounded nonzero derivative on the enlarged auxiliary grid

Proved
WeierstrassEllipticZeta.auxiliary_grid_bounded_nonzero_derivative

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

complex-analysiselliptic-functionstranscendence

Let LLL be a complex period pair with lattice Λ\LambdaΛ and canonical Weierstrass functions ℘,ζ\wp,\zeta℘,ζ. Let ω,u1,u2∈C\omega,u_1,u_2\in\mathbb Cω,u1​,u2​∈C satisfy RegularAuxiliaryGridData: the integer map

J(a,b,c)=au1+bu2+cωJ(a,b,c)=au_1+bu_2+c\omegaJ(a,b,c)=au1​+bu2​+cω

is injective; J(a,b,c)J(a,b,c)J(a,b,c) lies in Λ\LambdaΛ exactly when a=b=0a=b=0a=b=0; two integer points are congruent modulo Λ\LambdaΛ exactly when their first two coordinates agree; and every J(a,b,c)+u1/2J(a,b,c)+u_1/2J(a,b,c)+u1​/2 is outside Λ\LambdaΛ. The data also includes the standard finite-grid cardinality, shifted-grid regularity and radius estimates, and period-translation formulas for ℘,℘′\wp,\wp'℘,℘′ and ζ\zetaζ.

Define the unshifted rectangular grid

Γ(A,B,C)={au1+bu2+cω:0≤a<A, 0≤b<B, 0≤c<C},\Gamma(A,B,C)=\{au_1+bu_2+c\omega:0\le a<A,\ 0\le b<B,\ 0\le c<C\},Γ(A,B,C)={au1​+bu2​+cω:0≤a<A, 0≤b<B, 0≤c<C},

with integer indices, and put

mN=⌊N/log⁡N⌋,ℓN=⌊Nlog⁡N⌋,sN=⌊N3/16⌋,qN=⌊N5/8log⁡N/64⌋.m_N=\lfloor N/\log N\rfloor,\quad \ell_N=\lfloor\sqrt{N\log N}\rfloor,\quad s_N=\lfloor N^{3/16}\rfloor,\quad q_N=\lfloor N^{5/8}\log N/64\rfloor.mN​=⌊N/logN⌋,ℓN​=⌊NlogN​⌋,sN​=⌊N3/16⌋,qN​=⌊N5/8logN/64⌋.

There is an integer K≥1K\ge1K≥1 such that, for every sufficiently large integer NNN and every nonzero coefficient vector c=(cijk)∈C{0,…,mN}×{0,…,ℓN}2c=(c_{ijk})\in\mathbb C^{\{0,\ldots,m_N\}\times\{0,\ldots,\ell_N\}^2}c=(cijk​)∈C{0,…,mN​}×{0,…,ℓN​}2, the function

Fc(w)=∑i=0mN∑j=0ℓN∑k=0ℓNcijkwi℘(w)jζ(w)kF_c(w)=\sum_{i=0}^{m_N}\sum_{j=0}^{\ell_N}\sum_{k=0}^{\ell_N} c_{ijk}w^i\wp(w)^j\zeta(w)^kFc​(w)=i=0∑mN​​j=0∑ℓN​​k=0∑ℓN​​cijk​wi℘(w)jζ(w)k

has a nonzero derivative Fc(n)(u1/2+v)F_c^{(n)}(u_1/2+v)Fc(n)​(u1​/2+v) for some v∈Γ(3sN,3sN,3qN)v\in\Gamma(3s_N,3s_N,3q_N)v∈Γ(3sN​,3sN​,3qN​) and some integer 0≤n≤KmN0\le n\le Km_N0≤n≤KmN​. The constant and the threshold are uniform in the coefficient vector. No size bound or initial vanishing condition is imposed on the coefficients. All evaluation points are regular by the grid hypotheses.

This is the bounded-order zero estimate needed in the auxiliary construction. It does not assert an upper bound on the magnitude of the selected derivative. The analytic estimates and arithmetic construction are separate proved steps.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_GridJetMatrices
import Definitions.Def_TranscendenceTheory_ComplexAuxiliarySystem

open scoped Polynomial
open Filter WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.auxiliary_grid_bounded_nonzero_derivative
    (L : PeriodPair) (ω u₁ u₂ : ℂ)
    (h_grid : RegularAuxiliaryGridData L ω u₁ u₂) :
    ∃ K : ℕ, 1 ≤ K ∧ ∀ᶠ N : ℕ in Filter.atTop,
      let m := auxiliaryL0 N
      let l := auxiliaryL N
      ∀ c : Fin (m + 1) × Fin (l + 1) × Fin (l + 1) → ℂ,
        c ≠ 0 → ∃ v ∈ auxiliaryGrid u₁ u₂ ω
          ![3 * auxiliaryS N, 3 * auxiliaryS N, 3 * auxiliaryS3 N],
          ∃ n : ℕ, n ≤ K * m ∧
            iteratedDeriv n (fun w => ∑ i, c i * w ^ i.1.val *
              L.weierstrassP w ^ i.2.1.val * weierstrassZeta L w ^ i.2.2.val)
                (u₁ / 2 + v) ≠ 0 := by sorry
Source
Senthil Kumar K (2026), Section 5, Lemma 9 and its proof using the algebraic independence of z, wp(z), zeta(z) and the appendix zero estimate A.1, https://doi.org/10.1017/S001309152610145X. The formulation is uniform over all nonzero complex coefficient vectors; it isolates the zero estimate used before the arithmetic size argument.
Human review
  • Endorsed by Shuze Chen · Sep 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by tomasz · Sep 29, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me