Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The reflection on modular-symbol cochains is an involution

Proved
MTT.Cohomology.reflection_involutive

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

group-cohomologymodular-forms

Let RRR be a commutative ring and let ϕ:Div⁡-pairs→Sym⁡n(R2)\phi:\operatorname{Div}\text{-pairs}\to\operatorname{Sym}^n(R^2)ϕ:Div-pairs→Symn(R2) be any Sym⁡n\operatorname{Sym}^nSymn-valued cochain on pairs of cusps. The reflection R\mathcal RR is induced by the matrix diag⁡(−1,1)\operatorname{diag}(-1,1)diag(−1,1): it acts on cusps by x↦−xx\mapsto -xx↦−x and on binary polynomials by X↦−XX\mapsto -XX↦−X. Then

R(R ϕ)=ϕ.\mathcal R(\mathcal R\,\phi)=\phi .R(Rϕ)=ϕ.

That is, the reflection is an involution on cochains. This is the fact that makes the signed projectors 12(1±R)\tfrac12(1\pm\mathcal R)21​(1±R) idempotent and lets one decompose Hecke eigenspaces of modular symbols into their ±\pm± parts.

Formalization Note The statement is about the underlying cochains (Cusp × Cusp) → Binary R; combined with MTT.Cohomology.reflection_class, which shows the reflection preserves the modular-symbol submodule, it gives the involution on Hc(N,n;R)H_c(N,n;R)Hc​(N,n;R).

Preamble
import Definitions.Def_MTT_Cohomology
set_option autoImplicit false
noncomputable section
open scoped BigOperators TensorProduct
open MTT.Cohomology
Formal statement
theorem MTT.Cohomology.reflection_involutive {R : Type*} [CommRing R]
    (φ : (Cusp × Cusp) → Binary R) : reflection (reflection φ) = φ := by sorry
Source
Shimura, Introduction to the Arithmetic Theory of Automorphic Functions (1971), Ch. 8 (the involution induced by diag(-1,1)); C. Williams, An introduction to p-adic L-functions II: modular forms, Definition 11.8 and Proposition 11.9 (p. 26), https://warwick.ac.uk/fac/sci/maths/people/staff/cwilliams/lecturenotes/lecture_notes_part_ii.pdf; Prove2Me definition MTT_Cohomology (reflection).

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