Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Boundary symbols: Γ1(N)\Gamma_1(N)Γ1​(N)-equivariant cusp data and their boundary cochains

Definition
MTT_Cohomology_Boundary

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

group-cohomologymodular-forms

Let Γ=Γ1(N)\Gamma=\Gamma_1(N)Γ=Γ1​(N) and n≥0n\ge0n≥0. A boundary datum is a Γ\GammaΓ-equivariant function Φ:P1(Q)→Sym⁡n(R2)\Phi:\mathbf P^1(\mathbf Q)\to\operatorname{Sym}^n(R^2)Φ:P1(Q)→Symn(R2) on the cusps, i.e. an element of Hom⁡Γ(Div⁡(P1(Q)),Sym⁡nR2)\operatorname{Hom}_\Gamma(\operatorname{Div}(\mathbf P^1(\mathbf Q)),\operatorname{Sym}^n R^2)HomΓ​(Div(P1(Q)),SymnR2). Its boundary cochain is the restriction along Div⁡0⊂Div⁡\operatorname{Div}^0\subset\operatorname{Div}Div0⊂Div,

(∂Φ)(x,y)=Φ(y)−Φ(x),(\partial\Phi)(x,y)=\Phi(y)-\Phi(x),(∂Φ)(x,y)=Φ(y)−Φ(x),

with the pair (x,y)(x,y)(x,y) representing the degree-zero divisor [x]−[y][x]-[y][x]−[y], matching the orientation of the cusp-to-cusp integration cochain. The boundary cochains form the boundary summand BSymbΓ(Vn)\mathrm{BSymb}_\Gamma(V_n)BSymbΓ​(Vn​) of the space of modular symbols: in the Ash–Stevens long exact sequence they are the image of H0(Γ,Hom⁡(Div⁡,Vn))→Hc1(Γ,Vn)H^0(\Gamma,\operatorname{Hom}(\operatorname{Div},V_n))\to H^1_c(\Gamma,V_n)H0(Γ,Hom(Div,Vn​))→Hc1​(Γ,Vn​), and Eichler–Shimura identifies them with the Eisenstein contribution. They are the terms that must be excluded from a cuspidal eigenpacket.

Definition code
import Definitions.Def_MTT_Cohomology
set_option autoImplicit false
noncomputable section
open scoped BigOperators
namespace MTT.Cohomology

/-- The data of a boundary symbol: a `Γ₁(N)`-equivariant `Sym^n`-valued function on cusps,
i.e. an element of `Hom_Γ(Div(P¹(ℚ)), Sym^n(R²))`. -/
def IsBoundaryDatum (N n : ℕ) {R : Type*} [CommRing R] (Φ : Cusp → Binary R) : Prop :=
  (∀ x, Φ x ∈ Sym R n) ∧
  ∀ γ : CongruenceSubgroup.Gamma1 N, ∀ x, Φ (cuspAct γ.val x) = act γ.val.val (Φ x)

/-- The boundary cochain of `Φ`: the restriction of `Φ` along `Div⁰ ⊂ Div`,
`(x, y) ↦ Φ y − Φ x`, with `(x, y)` representing `[x] − [y]`. -/
def boundaryCochain {R : Type*} [CommRing R] (Φ : Cusp → Binary R) :
    (Cusp × Cusp) → Binary R :=
  fun D => Φ D.2 - Φ D.1

end MTT.Cohomology
Source
Ash–Stevens, Modular forms in characteristic l and special values of their L-functions, Duke Math. J. 53 (1986), §4, Definition 4.1 and Proposition 4.2 (pp. 861–862), https://math.bu.edu/people/ghs/papers/Mod_fms_char_ell.pdf; C. Williams, An introduction to p-adic L-functions II: modular forms, §11.2, the boundary symbols BSymb (p. 24), https://warwick.ac.uk/fac/sci/maths/people/staff/cwilliams/lecturenotes/lecture_notes_part_ii.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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me