Prove2Me
Navigate
MissionsFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Reflection identifies the antiholomorphic cusp-form summand

Proved
MTT.Cohomology.period_reflected_cusp_form

by davidloeffler · Sep 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

group-cohomologymodular-formsperiods

Let N>0N>0N>0, k≥2k\ge2k≥2, and h∈Sk(Γ1(N))h\in S_k(\Gamma_1(N))h∈Sk​(Γ1​(N)). Reflection defines a cusp form vvv of the same level and weight, with

v(z)=h(−zˉ)‾,v=0⟺h=0.v(z)=\overline{h(-\bar z)},\qquad v=0\Longleftrightarrow h=0.v(z)=h(−zˉ)​,v=0⟺h=0.

This identifies the reflected period summand with an antiholomorphic differential. Specifically, if ρ=diag⁡(−1,1)\rho=\operatorname{diag}(-1,1)ρ=diag(−1,1), ȷ(z)=−zˉ\jmath(z)=-\bar z(z)=−zˉ and n=k−2n=k-2n=k−2, then pulling back h(z)(zX+Y)n dzh(z)(zX+Y)^n\,dzh(z)(zX+Y)ndz by ȷ\jmath and applying ρ\rhoρ to coefficients gives −v(z)‾(zˉX+Y)n dzˉ-\overline{v(z)}(\bar zX+Y)^n\,d\bar z−v(z)​(zˉX+Y)ndzˉ. The displayed cusp-form existence and zero equivalence are the formal assertion; the differential identity explains its convention.

Preamble
import Definitions.Def_MTT_PeriodPairing

set_option autoImplicit false
noncomputable section
open scoped ComplexConjugate
open MTT.Cohomology
Formal statement
theorem MTT.Cohomology.period_reflected_cusp_form
    {N k : ℕ} (hN : 0 < N) (hk : 2 ≤ k)
    (h : CuspForm (MTT.GammaOne N) (k : ℤ)) :
    ∃ v : CuspForm (MTT.GammaOne N) (k : ℤ),
      (∀ z : UpperHalfPlane, conj (v z) = h (periodReflect z)) ∧
      (v = 0 ↔ h = 0) := by sorry
Source
Columbia Spring 2021 modular-forms seminar notes, Week 4–5, §1.2, Theorem 1 and its injectivity proof, pp. 7–10, https://www.math.columbia.edu/~dmarcil/Seminars/2021_Spring/Notes/Week4-5.pdf. These four lemmas adapt the invariant-contraction/Stokes proof to the MTT mission’s binary-polynomial, reflected-summand and normalized cusp-primitive conventions; the coefficientwise derivative and finite-coset integral interfaces are explicit formalization choices.

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.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me