Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exceptional symplectic polynomial modules are Artinian

Proved
SymplecticFreeModules.exceptionalArtinian

by Wenqian Xing · Sep 6, 2026 · Mathlib c5ea003 (Lean v4.30.0)

finite-lengthlie-algebrasrepresentation-theory

For the symplectic polynomial representation family in rank at least two, every decreasing sequence of invariant subspaces stabilizes at each exceptional scalar parameter, for every polynomial twisting parameter. This isolates the descending-chain assertion from the exceptional finite-length theorem; the increasing-chain assertion follows separately from rank-one freeness over the polynomial nilradical algebra.

Preamble
import Definitions.Def_frame_2026_symplectic_free_modules_interfaces
open SymplecticFreeModules
Formal statement
theorem SymplecticFreeModules.exceptionalArtinian (l : ℕ) (hl : 2 ≤ l)
    (P : GeneratorPresentation l) (hP : IsAbelianNilradicalSystem P)
    (tau : ℂ → Poly l → LieRepresentation (Sp l) (Poly l))
    (htau : IsTauFamily P tau) :
    ∀ c phi, IsExceptional l c → IsArtinianRepresentation (tau c phi) := by sorry
Source
Chen and Tan, Simple sp_{2l}(C)-modules which are free over an abelian nilradical, Journal of Algebra 697 (2026), 341-372, Theorem 4.9; https://doi.org/10.1016/j.jalgebra.2026.02.022. Artinian clause only.

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