Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Eichler–Shimura decomposition is compatible with the nebentype operators

Proved
MTT.Cohomology.eichler_shimura_nebentype_compatible

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

group-cohomologymodular-forms

In the setting of MTT.Cohomology.eichler_shimura_span, the three subspaces of HcH_cHc​ — holomorphic classes I(Sk)I(S_k)I(Sk​), reflected classes R I(Sk)\mathcal R\,I(S_k)RI(Sk​), and boundary symbols ∂Φ\partial\Phi∂Φ — are each stable under the diamond operators through Γ0(N)\Gamma_0(N)Γ0​(N), and their sum is direct. Consequently the nebentype law is inherited by the summands: if

ϕ=I(g)+R(I(h))+∂Φsatisfiesϕ(γx,γy)=e(dγ) γ⋅ϕ(x,y)  (γ∈Γ0(N)),\phi=I(g)+\mathcal R\big(I(h)\big)+\partial\Phi\qquad\text{satisfies}\qquad \phi(\gamma x,\gamma y)=e(d_\gamma)\,\gamma\cdot\phi(x,y)\ \ (\gamma\in\Gamma_0(N)),ϕ=I(g)+R(I(h))+∂Φsatisfiesϕ(γx,γy)=e(dγ​)γ⋅ϕ(x,y)  (γ∈Γ0​(N)),

then I(g)I(g)I(g), R(I(h))\mathcal R(I(h))R(I(h)) and ∂Φ\partial\Phi∂Φ each satisfy the same law with the same function eee of dγ mod Nd_\gamma\bmod Ndγ​modN.

This is the nebentype half of the statement that Eichler–Shimura is an isomorphism of modules over the Hecke algebra together with the group Γ0(N)/Γ1(N)≃(Z/N)×\Gamma_0(N)/\Gamma_1(N)\simeq(\mathbf Z/N)^\timesΓ0​(N)/Γ1​(N)≃(Z/N)× of nebentype operators, which commute with the Hecke action.

Formalization Note The function eee is arbitrary; only the law itself is used. Stated on underlying cochains, with the boundary datum Φ\PhiΦ explicit.

Preamble
import Definitions.Def_MTT_Cohomology_Boundary
set_option autoImplicit false
noncomputable section
open scoped BigOperators TensorProduct
open MTT.Cohomology
Formal statement
theorem MTT.Cohomology.eichler_shimura_nebentype_compatible
    {N k : ℕ} (hN : 0 < N) (hk : 2 ≤ k)
    (I : CuspForm (MTT.GammaOne N) (k : ℤ) →ₗ[ℂ] Hc N (k-2) ℂ)
    (hI : ∀ f, IntegralClass f (I f))
    (g h : CuspForm (MTT.GammaOne N) (k : ℤ)) (Φ : Cusp → Binary ℂ)
    (hΦ : IsBoundaryDatum N (k-2) Φ) (e : ZMod N → ℂ)
    (hlaw : ∀ γ : CongruenceSubgroup.Gamma0 N, ∀ x y,
      ((I g).val + reflection (I h).val + boundaryCochain Φ) (cuspAct γ.val x, cuspAct γ.val y) =
        e (γ.val 1 1 : ZMod N) •
          act γ.val.val (((I g).val + reflection (I h).val + boundaryCochain Φ) (x, y))) :
    (∀ γ : CongruenceSubgroup.Gamma0 N, ∀ x y,
      (I g).val (cuspAct γ.val x, cuspAct γ.val y) =
        e (γ.val 1 1 : ZMod N) • act γ.val.val ((I g).val (x, y))) ∧
    (∀ γ : CongruenceSubgroup.Gamma0 N, ∀ x y,
      reflection (I h).val (cuspAct γ.val x, cuspAct γ.val y) =
        e (γ.val 1 1 : ZMod N) • act γ.val.val (reflection (I h).val (x, y))) ∧
    (∀ γ : CongruenceSubgroup.Gamma0 N, ∀ x y,
      boundaryCochain Φ (cuspAct γ.val x, cuspAct γ.val y) =
        e (γ.val 1 1 : ZMod N) • act γ.val.val (boundaryCochain Φ (x, y))) := by sorry
Source
Ash–Stevens, Modular forms in characteristic l and special values of their L-functions, Duke Math. J. 53 (1986), https://math.bu.edu/people/ghs/papers/Mod_fms_char_ell.pdf, §2 p. 854 (the nebentype operators of Γ₀/Γ₁ on H*(Γ₁;E) commute with the Hecke action), Theorem 2.3 (p. 853) and Proposition 4.2 (p. 862, all maps are Hecke-module morphisms); C. Williams, An introduction to p-adic L-functions II: modular forms, https://warwick.ac.uk/fac/sci/maths/people/staff/cwilliams/lecturenotes/lecture_notes_part_ii.pdf, Theorem 11.5 (Hecke-equivariant isomorphism, p. 25).

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