Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The reflection is a Hecke-equivariant involution on modular symbols

Proved
MTT.Cohomology.reflection_class

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

group-cohomologyhecke-operatorsmodular-formsmodular-symbols

Write J=(−1001)J=\begin{pmatrix}-1&0\\0&1\end{pmatrix}J=(−10​01​) and let

(Rφ)(x,y)=J⋅φ(Jx, Jy)(\mathcal R\varphi)(x,y) = J\cdot\varphi(Jx,\,Jy)(Rφ)(x,y)=J⋅φ(Jx,Jy)

be the reflection operator on cocycles of weight nnn with coefficients in a commutative ring RRR; on cusps JJJ acts by r↦−rr\mapsto -rr↦−r and fixes ∞\infty∞, and on binary forms by X↦−XX\mapsto -XX↦−X, Y↦YY\mapsto YY↦Y. This is the involution whose ±1\pm 1±1-eigenspaces cut out the signed modular symbols. The theorem asserts three things about R\mathcal RR on Hc1(Γ1(N),Sym⁡nR2)H^1_c(\Gamma_1(N),\operatorname{Sym}^n R^2)Hc1​(Γ1​(N),SymnR2).

(i) R\mathcal RR preserves the space. If φ\varphiφ is a Γ1(N)\Gamma_1(N)Γ1​(N)-equivariant cocycle with values in Sym⁡n\operatorname{Sym}^nSymn, so is Rφ\mathcal R\varphiRφ. Equivariance uses that JΓ1(N)J−1=Γ1(N)J\Gamma_1(N)J^{-1}=\Gamma_1(N)JΓ1​(N)J−1=Γ1​(N), since conjugation by JJJ sends (abcd)\begin{pmatrix}a&b\\c&d\end{pmatrix}(ac​bd​) to (a−b−cd)\begin{pmatrix}a&-b\\-c&d\end{pmatrix}(a−c​−bd​).

(ii) R\mathcal RR commutes with the prime Hecke operators. For every ℓ\ellℓ and every scalar e∈Re\in Re∈R,

R(Tℓ(e)φ)=Tℓ(e)(Rφ),Tℓ(e)=∑b=0ℓ−1∣(1b0ℓ)+e∣(ℓ001).\mathcal R\bigl(T_\ell^{(e)}\varphi\bigr)=T_\ell^{(e)}\bigl(\mathcal R\varphi\bigr), \qquad T_\ell^{(e)}=\sum_{b=0}^{\ell-1}\Bigl|\begin{pmatrix}1&b\\0&\ell\end{pmatrix} + e\Bigl|\begin{pmatrix}\ell&0\\0&1\end{pmatrix}.R(Tℓ(e)​φ)=Tℓ(e)​(Rφ),Tℓ(e)​=b=0∑ℓ−1​​(10​bℓ​)+e​(ℓ0​01​).

The identity comes from J(1b0ℓ)J=(1−b0ℓ)J\begin{pmatrix}1&b\\0&\ell\end{pmatrix}J=\begin{pmatrix}1&-b\\0&\ell\end{pmatrix}J(10​bℓ​)J=(10​−bℓ​) together with (1−b0ℓ)=(1−101)(1ℓ−b0ℓ)\begin{pmatrix}1&-b\\0&\ell\end{pmatrix}=\begin{pmatrix}1&-1\\0&1\end{pmatrix}\begin{pmatrix}1&\ell-b\\0&\ell\end{pmatrix}(10​−bℓ​)=(10​−11​)(10​ℓ−bℓ​): the coset representatives are permuted by b↦ℓ−b(modℓ)b\mapsto \ell-b \pmod \ellb↦ℓ−b(modℓ), and the leftover unipotent matrix lies in Γ1(N)\Gamma_1(N)Γ1​(N), so it acts trivially on φ\varphiφ. The second term is fixed because JJJ commutes with diag⁡(ℓ,1)\operatorname{diag}(\ell,1)diag(ℓ,1).

(iii) R\mathcal RR preserves the nebentype law. If φ\varphiφ satisfies φ(γx,γy)=e(d) γ⋅φ(x,y)\varphi(\gamma x,\gamma y)=e(d)\,\gamma\cdot\varphi(x,y)φ(γx,γy)=e(d)γ⋅φ(x,y) for all γ∈Γ0(N)\gamma\in\Gamma_0(N)γ∈Γ0​(N), then so does Rφ\mathcal R\varphiRφ, with the same character eee; conjugation by JJJ preserves Γ0(N)\Gamma_0(N)Γ0​(N) and leaves the lower-right entry ddd unchanged.

Together these say that R\mathcal RR is an involution of the Hecke module of modular symbols, so the signed projections 12(1±R)\tfrac12(1\pm\mathcal R)21​(1±R) are Hecke-equivariant idempotents. This is the algebraic input behind every "plus/minus modular symbol" construction.

Preamble
import Definitions.Def_MTT_Cohomology
import Mathlib.RingTheory.Flat.Basic
set_option autoImplicit false
noncomputable section
open scoped BigOperators TensorProduct
open MTT.Cohomology
Formal statement
theorem MTT.Cohomology.reflection_class {N n : ℕ} {R : Type*} [CommRing R] (φ : Hc N n R) :
    (∃ ψ : Hc N n R, ψ.val = reflection φ.val) ∧
    (∀ (e : R) (l : ℕ), reflection (primeHecke e l φ.val)
        = primeHecke e l (reflection φ.val)) ∧
    (∀ (e : ZMod N → R),
      (∀ γ : CongruenceSubgroup.Gamma0 N, ∀ x y,
        φ.val (cuspAct γ.val x, cuspAct γ.val y)
          = e (γ.val 1 1 : ZMod N) • act γ.val.val (φ.val (x, y))) →
      ∀ γ : CongruenceSubgroup.Gamma0 N, ∀ x y,
        reflection φ.val (cuspAct γ.val x, cuspAct γ.val y)
          = e (γ.val 1 1 : ZMod N) • act γ.val.val (reflection φ.val (x, y))) := by sorry
Source
Mazur-Tate-Teitelbaum, On p-adic analogues of the conjectures of Birch and Swinnerton-Dyer, Invent. Math. 84 (1986), 1-48, I.§1-§4 (signed modular symbols); Ash-Stevens, Modular forms in characteristic l and special values of their L-functions (1986), §4, https://math.bu.edu/people/ghs/papers/Mod_fms_char_ell.pdf; J. E. Cremona, Algorithms for Modular Elliptic Curves, 2nd ed., CUP 1997, §2.1-2.4.

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