Prove2Me
Navigate
MissionsFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Cusp lower bound for the central coinduced T-fixed space

Proved
MTT.Cohomology.centralCoinduced_T_fixed_cusp_lower_bound

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

number-theoryrepresentation-theory

For N≥5N\ge5N≥5 and n>0n>0n>0, let WWW be the central-fixed coinduced degree-nnn binary-form representation attached to Γ1(N)\Gamma_1(N)Γ1​(N). The number of cusp double cosets Γ1(N)\SL2(Z)/⟨T,−I⟩\Gamma_1(N)\backslash\mathrm{SL}_2(\mathbb Z)/\langle T,-I\rangleΓ1​(N)\SL2​(Z)/⟨T,−I⟩ is at most dim⁡Cker⁡(ρW(T)−1)\dim_{\mathbb C}\ker(\rho_W(T)-1)dimC​ker(ρW​(T)−1). This is the remaining parabolic fixed-space input after the coefficient and elliptic fixed dimensions are computed.

Preamble
import Definitions.Def_MTT_FullParabolicCohomology
import Mathlib.GroupTheory.DoubleCoset
import Mathlib.LinearAlgebra.FiniteDimensional.Defs
open scoped MatrixGroups
Formal statement
theorem MTT.Cohomology.centralCoinduced_T_fixed_cusp_lower_bound {N n : ℕ}
    (hN : 5 ≤ N) (hn : 0 < n) :
    Nat.card (DoubleCoset.Quotient (CongruenceSubgroup.Gamma1 N : Set SL(2, ℤ))
      ((Subgroup.zpowers ModularGroup.T ⊔ Subgroup.zpowers (-1) : Subgroup SL(2, ℤ)) :
        Set SL(2, ℤ))) ≤
      Module.finrank ℂ ((MTT.Cohomology.centralCoinduced N n).ρ ModularGroup.T -
        LinearMap.id).ker := by sorry
Source
Residual cusp fixed-space input in MTT frontier bb6b5766-fb31-4de5-9462-40a64feda1a8; the central action must be retained also for odd symmetric powers.

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