Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Full-support modular-symbol zero set

Definition
KN_SeededThetaFullSupportModularSymbolZeroSet

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

modular-formsmodular-symbolsnumber-theoryp-adic-l-functions

At a horizontal character primitive at its full selected support, finite theta evaluation has the same zero set as the character-weighted complex modular-symbol sum for the primitive product of the seed and realized character. This separates the finite theta construction from Birch--Mellin.

Definition code
import Definitions.Def_KN_SeededThetaFullSupportInterpolationV2

set_option autoImplicit false
noncomputable section
open scoped BigOperators

namespace HorizontalPadicL

/-- At characters which are primitive at the full selected support, evaluation
of the finite theta element has the same zero set as the complex modular-symbol
sum occurring in the Birch--Mellin formula for the product of the seed and the
realized horizontal character.  This isolates the finite theta construction
from the analytic Birch--Mellin calculation. -/
def SeededFiniteThetaDataV3.HasFullSupportModularSymbolZeroSet
    {N k p B : ℕ} {ι : MTT.Qbar →+* ℂ} [Fact p.Prime]
    {ιp : MTT.Qbar →+* ℂ_[p]} {f : MTT.Eigenform N k ι}
    {η : DirichletCharacterWithLevel}
    {L : SeededHorizontalPrimeDataV3 p ιp f η B}
    (Θ : SeededFiniteThetaDataV3 L) : Prop :=
  ∀ χ, (Θ.characters.realized χ).2.conductor = L.supportModulus χ.support →
    (Θ.eval χ ≠ 0 ↔
      let θ := primitiveProductV2 η (Θ.characters.realized χ)
      letI : NeZero θ.1.1 := ⟨Nat.ne_of_gt θ.1.2⟩
      (∑ a : ZMod θ.1.1,
        ι (θ.2 a) * MTT.modularSymbol f.form (k / 2 - 1) a.val θ.1.1) ≠ 0)

end HorizontalPadicL
Source
Kriz--Nordentoft, https://arxiv.org/pdf/2310.20678, Corollary 3.6 and Corollary 5.4; MTT.birch_mellin_formula.

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