Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The minimal modular level detects subquadratic local Euler factors

Proved
HorizontalPadicL.ellipticCurve_minimalModularLevel_iff_localEulerFactorDegree_lt_two

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

elliptic-curvesl-functionsmodular-formsnewformsnumber-theory

This is a formalization of a standard textbook result, so low-priority

Let E/QE/\mathbb{Q}E/Q be an elliptic curve which is modular in the sense that its Hasse–Weil LLL-series is the q-expansion of a weight-two cusp form, and let Nmin⁡N_{\min}Nmin​ be the least level at which such a form exists. For every prime ppp,

p∣Nmin⁡⟺Lp(E,s)−1 has degree <2.p \mid N_{\min} \quad\Longleftrightarrow\quad L_p(E,s)^{-1} \text{ has degree }<2.p∣Nmin​⟺Lp​(E,s)−1 has degree <2.

In coefficient terms, primes dividing Nmin⁡N_{\min}Nmin​ satisfy apr+2=apapr+1a_{p^{r+2}}=a_p a_{p^{r+1}}apr+2​=ap​apr+1​, while primes not dividing Nmin⁡N_{\min}Nmin​ satisfy the normalized quadratic recurrence apr+2=apapr+1−papra_{p^{r+2}}=a_p a_{p^{r+1}}-p a_{p^r}apr+2​=ap​apr+1​−papr​. Thus the prime support of the minimal modular level agrees with the bad local-factor support of the elliptic curve.

Preamble
import Definitions.Def_HorizontalPadicL_LocalEulerFactorDegree

set_option autoImplicit false
Formal statement
namespace HorizontalPadicL

/-- The prime support of the least modular level is exactly the set of places
where the elliptic curve's local Euler polynomial has degree below two;
equivalently, the primes outside the level are exactly those with the normalized
quadratic local factor. -/
theorem ellipticCurve_minimalModularLevel_iff_localEulerFactorDegree_lt_two
    (E : WeierstrassCurve ℚ) [E.IsElliptic] (hmod : IsModular E)
    (p : ℕ) (hp : p.Prime) :
    (p ∣ modularConductor E hmod ↔ LocalEulerFactorDegreeBelowTwo E p) ∧
      (¬ p ∣ modularConductor E hmod ↔ LocalEulerFactorDegreeTwo E p) := by
  sorry

end HorizontalPadicL
Source
Diamond–Shurman, A First Course in Modular Forms, Proposition 5.8.5 and the newform/conductor theory in Chapter 5; Silverman, The Arithmetic of Elliptic Curves, Chapter V, §2.

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