(and for ) preserves the cusp forms of nebentypus on
ProvedMTT.exists_cuspForm_heckePrimeLet , , let be a Dirichlet character modulo with values in , and let have nebentypus :
For a prime define, as in the mission,
When this is the classical Hecke operator on ; when one has and it is the operator .
Claim. is again a cusp form of weight on with nebentypus . Formally: there is with for every , and for all .
Why this holds. For the double coset is the disjoint union of the cosets , , and with , (Diamond–Shurman, Proposition 5.2.1); for the last coset is absent. On forms of nebentypus the diamond operator acts as , which turns the coset sum into the displayed formula (Diamond–Shurman, Proposition 5.3.1 and (5.3)). Directly: right multiplication by permutes the matrices , up to left factors in whose lower-right entries are congruent to , or modulo , and the resulting factors are absorbed exactly by the coefficient in the definition. Each summand is holomorphic, and vanishes at every cusp since it is a slash of by an element of , so is a cusp form.
Retired. This node was stated without a lower bound on the weight; for the mission's heckePrime (which writes with truncated subtraction) no longer agrees with the slash-operator sum, so the statement is only true via the vanishing of weight-zero cusp forms. It is replaced by MTT.exists_cuspForm_heckePrime_pos, which assumes and is proved.
import Definitions.Def_MTT_Arithmetic set_option autoImplicit false noncomputable section open scoped BigOperators
theorem MTT.exists_cuspForm_heckePrime
{N k : ℕ} (hN : 0 < N) (e : DirichletCharacter ℂ N)
(g : CuspForm (MTT.GammaOne N) (k : ℤ))
(hg : ∀ γ : CongruenceSubgroup.Gamma0 N, ∀ z : UpperHalfPlane,
g ((Matrix.SpecialLinearGroup.mapGL ℝ γ.val) • z) =
e (γ.val 1 1 : ZMod N) *
(((γ.val 1 0 : ℤ) : ℂ) * z + ((γ.val 1 1 : ℤ) : ℂ)) ^ k * g z)
(l : ℕ) (hl : l.Prime) :
∃ g' : CuspForm (MTT.GammaOne N) (k : ℤ),
(∀ z, g' z = MTT.heckePrime k (e (l : ZMod N)) l g z) ∧
∀ γ : CongruenceSubgroup.Gamma0 N, ∀ z : UpperHalfPlane,
g' ((Matrix.SpecialLinearGroup.mapGL ℝ γ.val) • z) =
e (γ.val 1 1 : ZMod N) *
(((γ.val 1 0 : ℤ) : ℂ) * z + ((γ.val 1 1 : ℤ) : ℂ)) ^ k * g' z := by sorry