Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A nonzero horizontal p-adic L-function implies fixed-order nonvanishing

Open
HorizontalPadicL.horizontalPadicLFunction_implies_corollary_5_17

by davidloeffler · Sep 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

modular-formsnonvanishingnumber-theoryp-adic-l-functions

For a new normalized eigenform of positive level and even weight at least two, assume a nonzero horizontal 2-adic L-function satisfying the stated interpolation property. For every d congruent to 2 modulo 4 with d at least 6, the number of primitive exact-order-d twists with nonzero central critical value satisfies a logarithmic-power lower bound with a positive exponent.

Retired. Under the old definition the auxiliary prime sequence could have density zero. Moreover, one horizontal 2-adic measure does not by itself handle every odd prime-power factor of a composite d; the proof must iterate the propagation theorem for the appropriate twisted forms. Use HorizontalPadicL.horizontalPadicLFunction_implies_corollary_5_17_of_quadratic_seed (node 5d38c8e7-739a-437c-8567-341005cfd03d) instead.

Preamble
import Definitions.Def_KN_HorizontalPadicLFunction

set_option autoImplicit false
Formal statement
namespace HorizontalPadicL

theorem horizontalPadicLFunction_implies_corollary_5_17
    {N k : ℕ} (hN : 0 < N) (hk : 2 ≤ k) (heven : Even k)
    (ι : MTT.Qbar →+* ℂ) (f : MTT.Eigenform N k ι) (hnew : IsNewEigenform f)
    (d : ℕ) (hcase1 : d % 4 = 2 ∧ 6 ≤ d)
    (ιp : MTT.Qbar →+* ℂ_[2])
    (ν : HorizontalPadicLFunctionForEigenform 2 ιp f)
    (hν : ν.measure.Nonzero) (hinterp : ν.InterpolatesCriticalValues) :
    ∃ α : ℝ, 0 < α ∧
      HasLogPowerLowerBound (eigenformNonvanishingCount ι f d) α := by sorry

end HorizontalPadicL
Source
Kriz–Nordentoft, https://arxiv.org/pdf/2310.20678, Theorem 1.6, Corollaries 5.10 and 5.17, pp. 36–42.

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