Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equality of almost all Hecke Euler factors and minimal eigenform level

Definition
MTT_HeckeEquivalence

by riccardo.brasca · Sep 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

hecke-operatorsmodular-formsnewforms

Fix a weight and a complex embedding of the algebraic coefficients. Two normalized cuspidal eigenforms have the same Hecke system if there is a positive integer BBB such that, for every prime ppp not dividing BBB,

ap(f)=ap(g),εf(p)=εg(p).a_p(f)=a_p(g),\qquad \varepsilon_f(p)=\varepsilon_g(p).ap​(f)=ap​(g),εf​(p)=εg​(p).

Thus their unramified Euler polynomials agree outside a finite set. An eigenform of positive level NNN has minimal level in its Hecke system if every equivalent eigenform at a positive level MMM satisfies N≤MN\le MN≤M. These predicates express the minimal-level interface used in newform theory, at the actual weight of the forms and with arbitrary nebentype.

Formalization Note. Positivity of the form's own level is supplied by the theorems that use these predicates. This file defines the predicates only; it does not assume nonvanishing or newform-existence results.

Definition code
import Definitions.Def_MTT_Arithmetic

set_option autoImplicit false

namespace MTT.Eigenform

/-- Two eigenforms have the same prime Hecke eigenvalues and nebentypus values outside a
finite set of primes. -/
def SameHeckeSystem {N M k : ℕ} {ι : Qbar →+* ℂ}
    (f : Eigenform N k ι) (g : Eigenform M k ι) : Prop :=
  ∃ B : ℕ, 0 < B ∧ ∀ p : ℕ, p.Prime → ¬ p ∣ B →
    f.coeff p = g.coeff p ∧ f.epsilon p = g.epsilon p

/-- An eigenform has least positive level among forms with the same Hecke system. -/
def HasMinimalLevel {N k : ℕ} {ι : Qbar →+* ℂ} (f : Eigenform N k ι) : Prop :=
  ∀ M : ℕ, 0 < M → ∀ g : Eigenform M k ι, SameHeckeSystem f g → N ≤ M

end MTT.Eigenform
Source
Atkin--Lehner--Li newform theory: William Stein, Modular Forms: A Computational Approach, Chapter 9, Theorem 9.4, https://wstein.org/books/modform/modform/newforms.html; Ribet--Stein, Lectures on Modular Forms and Hecke Operators, Section 9.1, printed p.74, multiplicity-one discussion following Theorem 9.1.9, https://wstein.org/books/ribet-stein/main.pdf. The minimal-level predicate is the least-positive-level formulation of that Hecke-system interface.

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