Prove2Me
Navigate
MissionsFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Hecke acts scalarly on boundary symbols at primes congruent to one

Proved
MTT.Cohomology.boundary_hecke_scalar_at_one

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

group-cohomologymodular-forms

Let N>0N>0N>0, n≥0n\ge0n≥0, and let Φ\PhiΦ be a Γ1(N)\Gamma_1(N)Γ1​(N)-equivariant homogeneous degree-nnn boundary datum. For every prime ℓ≡1(modN)\ell\equiv1\pmod Nℓ≡1(modN), the explicit adjugate-normalized Hecke operator satisfies

Tℓ(∂Φ)=(1+ℓn+1)∂Φ.T_\ell(\partial\Phi)=(1+\ell^{n+1})\partial\Phi.Tℓ​(∂Φ)=(1+ℓn+1)∂Φ.

This is an identity on all boundary cochains, with no eigenvector or nebentype hypothesis. It uses the convention (∂Φ)(x,y)=Φ(y)−Φ(x)(\partial\Phi)(x,y)=\Phi(y)-\Phi(x)(∂Φ)(x,y)=Φ(y)−Φ(x). The coefficient of the second Hecke term is 1.

Preamble
import Definitions.Def_MTT_Cohomology_Boundary
import Mathlib.NumberTheory.LSeries.PrimesInAP
set_option autoImplicit false
noncomputable section
open scoped BigOperators
open MTT.Cohomology
Formal statement
theorem MTT.Cohomology.boundary_hecke_scalar_at_one
    {N n : ℕ} (hN : 0 < N)
    (Φ : Cusp → Binary ℂ) (hΦ : IsBoundaryDatum N n Φ)
    (l : ℕ) (hl : l.Prime) (hlN : (l : ZMod N) = 1) :
    primeHecke (1 : ℂ) l (boundaryCochain Φ) =
      ((1 + l^(n+1) : ℕ) : ℂ) • boundaryCochain Φ := by sorry
Source
Classical boundary-Hecke calculation in the modular-symbol model of Ash–Stevens §4, Definition 4.1 and Proposition 4.2. At a primitive cusp vector, exactly one of the l+1 Hecke matrices gives content l, and the remaining l give content 1. https://math.bu.edu/people/ghs/papers/Mod_fms_char_ell.pdf

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.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me