Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Auxiliary parameters satisfy the zero-estimate inequalities

Proved
WeierstrassEllipticZeta.auxiliary_zero_estimate_parameter_bounds

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

complex-analysiselliptic-functionstranscendence

For each integer N≥0N\ge0N≥0, define

m=⌊N/log⁡N⌋,ℓ=⌊Nlog⁡N⌋,s=⌊N3/16⌋,q=⌊N5/8log⁡N/64⌋,m=\lfloor N/\log N\rfloor,\quad \ell=\lfloor\sqrt{N\log N}\rfloor,\quad s=\lfloor N^{3/16}\rfloor,\quad q=\lfloor N^{5/8}\log N/64\rfloor,m=⌊N/logN⌋,ℓ=⌊NlogN​⌋,s=⌊N3/16⌋,q=⌊N5/8logN/64⌋,

where floors are natural-number floors. For every real C>0C>0C>0, there is an integer k≥3k\ge3k≥3 such that, for every sufficiently large NNN,

m,ℓ,s,q≥1,s≤q≤m,ℓ≤m,km≥3,m,\ell,s,q\ge1,\qquad s\le q\le m,\qquad \ell\le m,\qquad km\ge3,m,ℓ,s,q≥1,s≤q≤m,ℓ≤m,km≥3,

and

3Cmax⁡{m(15ℓ)2, q(15ℓ)2}<km s2q.3C\max\{m(15\ell)^2,\ q(15\ell)^2\}<km\,s^2q.3Cmax{m(15ℓ)2, q(15ℓ)2}<kms2q.

All constants and the threshold are independent of any polynomial coefficients or grid points. In particular, the order T=kmT=kmT=km satisfies both numerical conditions for the rank-one lattice-intersection zero estimate when the translated polynomial has ordinary degree at most mmm and elliptic-coordinate degrees at most 5ℓ5\ell5ℓ. The additional loss 6ℓ6\ell6ℓ is bounded by 6m6m6m.

This theorem concerns the explicit parameters and their inequalities only; it assumes no zero estimate. One may choose any natural k>691200C+3k>691200C+3k>691200C+3.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_AuxiliaryParameters

open Filter WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.auxiliary_zero_estimate_parameter_bounds (C : ℝ) (hC : 0 < C) :
    ∃ k : ℕ, 3 ≤ k ∧ ∀ᶠ N : ℕ in atTop,
      let m := auxiliaryL0 N
      let l := auxiliaryL N
      let s := auxiliaryS N
      let q := auxiliaryS3 N
      1 ≤ m ∧ 1 ≤ l ∧ 1 ≤ s ∧ 1 ≤ q ∧ s ≤ q ∧ q ≤ m ∧ l ≤ m ∧
      3 ≤ k * m ∧
      3 * C * max ((m : ℝ) * (15 * l) ^ 2) ((q : ℝ) * (15 * l) ^ 2) <
        (k * m : ℕ) * (s : ℝ) ^ 2 * q := by sorry
Source
Senthil Kumar K (2026), Section 5, the numerical estimates in the proof of Lemma 9 and the rank-one case of Appendix Proposition A.1, https://doi.org/10.1017/S001309152610145X. The constants 15, 3, and the loss 6 correspond to cleared translation and the T>=3 zero estimate. The explicit sufficient choice k>691200C+3 and the floor inequalities are a derived quantitative formulation, not quoted constants from the article.

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