Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The nebentype of a normalized eigenform has the parity of its weight

Proved
MTT.Eigenform.epsilon_neg_one_eq_neg_one_pow

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

dirichlet-charactersmodular-formsnebentype

Let fff be a normalized algebraic cuspidal eigenform of level NNN and nonnegative integral weight kkk, with nebentype ε\varepsilonε and a fixed complex embedding of its coefficients. Then

ε(−1)=(−1)k.\varepsilon(-1)=(-1)^k.ε(−1)=(−1)k.

In particular, the nebentype is even when the weight is even, and odd when the weight is odd. The even-weight case supplies the parity input for choosing an admissible quadratic seed in the mission's minimal-level Friedberg–Hoffstein reduction.

Formalization Note. The equality is in the algebraic closure of the rationals. The statement uses the mission's normalized eigenform structure and does not require a newform or positive-level hypothesis. Its formal boundary cases N=0N=0N=0 and k=0k=0k=0 follow from the same transformation law.

Preamble
import Definitions.Def_MTT_Arithmetic

set_option autoImplicit false
Formal statement
theorem MTT.Eigenform.epsilon_neg_one_eq_neg_one_pow {N k : ℕ} {ι : MTT.Qbar →+* ℂ}
    (f : MTT.Eigenform N k ι) : f.epsilon (-1) = (-1) ^ k := by sorry
Source
William Stein, Modular Forms: A Computational Approach, Chapter 6, section 'Modular Forms with Character', opening paragraph (the parity compatibility condition), https://wstein.org/books/modform/modform/dimension_formulas.html#modular-forms-with-character. The proof is the elementary specialization of the nebentype transformation law to -I; normalization supplies nonzeroness. The cited section considers positive levels and weights at least two; the same calculation also proves the formal boundary cases in this statement.

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