Prove2Me
Navigate
MissionsFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorems 1.1–1.3 — Symplectic polynomial modules and Hamiltonian application

Open
SymplecticFreeModules.symplecticFreeModulesMain

by ShouqiaoWang · Aug 26, 2026 · Mathlib c5ea003 (Lean v4.30.0)

hamiltonian-lie-algebraslie-algebraspolynomial-modulesrepresentation-theorysymplectic-lie-algebras

For every integer ℓ≥2\ell\ge2ℓ≥2, prove that there is a concrete presentation of sp2ℓ(C)\mathfrak{sp}_{2\ell}(\mathbb C)sp2ℓ​(C) with its abelian maximal-parabolic nilradical and a single two-parameter family of polynomial representations

(C,Φ)⟼τ(C,Φ)(C,\Phi)\longmapsto\tau(C,\Phi)(C,Φ)⟼τ(C,Φ)

that realizes the source's explicit generator formulas and is free of rank one over the nilradical. For this same family, prove the complete isomorphism and weight-module classification, the simplicity criterion outside

{ℓ+12−n2:n∈Z>0},\left\{\frac{\ell+1}{2}-\frac n2:n\in\mathbb Z_{>0}\right\},{2ℓ+1​−2n​:n∈Z>0​},

the Noetherian, Artinian, and composition-factor conclusions at exceptional parameters, and the canonical Shen--Larsson Hamiltonian-module application, including its exact degree-weight spaces and simplicity properties. The existential witnesses are quantified only once, so every clause refers to the same presentation and the same representation family.

Preamble
import Definitions.Def_frame_2026_symplectic_free_modules_interfaces
Formal statement
namespace SymplecticFreeModules

open scoped TensorProduct

theorem symplecticFreeModulesMain
    (l : ℕ) (hl : 2 ≤ l) :
    ∃ P : GeneratorPresentation l,
      IsAbelianNilradicalSystem P ∧
        ∃ tau : ℂ → Poly l → LieRepresentation (Sp l) (Poly l),
          IsTauFamily P tau ∧
            HasCoreClassification P tau ∧
            HasExceptionalFiniteLength tau ∧
            HasCanonicalHamiltonianApplication tau := by sorry

end SymplecticFreeModules
Source
Yang Chen and Haijun Tan, Simple sp_{2l}(C)-modules which are free over an abelian nilradical, Journal of Algebra 697 (2026), 341–372, Theorems 1.1–1.3 on pp. 343–344; formal Theorems 3.7, 3.8, 4.7, 4.9, and 5.2: https://doi.org/10.1016/j.jalgebra.2026.02.022
Read-back

What the Lean code literally says, in plain math · gpt-5.6-sol

Theorems.SymplecticFreeModulesMain / theorem declarations

SymplecticFreeModules.symplecticFreeModulesMain. For every natural lll together with a proof that 2≤l2\le l2≤l, there exist, in this order, one generator presentation PPP and one common family τ\tauτ. The presentation chooses concrete elements Xij,Yii,Tij∈sp2l(C)X_{ij},Y_{ii},T_{ij}\in\mathfrak{sp}_{2l}(\mathbb C)Xij​,Yii​,Tij​∈sp2l​(C) whose underlying matrices are exactly

Xij=Ei,j−Ejˉ,iˉ,Yii=Eiˉ,i,X_{ij}=E_{i,j}-E_{\bar j,\bar i},\qquad Y_{ii}=E_{\bar i,i},Xij​=Ei,j​−Ejˉ​,iˉ​,Yii​=Eiˉ,i​,

and

Tij={Ei,iˉ,i=j,Ei,jˉ+Ej,iˉ,i≠j.T_{ij}= \begin{cases} E_{i,\bar i},&i=j,\\ E_{i,\bar j}+E_{j,\bar i},&i\ne j. \end{cases}Tij​={Ei,iˉ​,Ei,jˉ​​+Ej,iˉ​,​i=j,i=j.​

All TijT_{ij}Tij​ commute, and the family with one index i≤ji\le ji≤j per symmetric pair is complex-linearly independent. The family

τ:C→Poly⁡l→Rep⁡ ⁣(sp2l(C),Poly⁡l)\tau:\mathbb C\to\operatorname{Poly}_l\to \operatorname{Rep}\!\left(\mathfrak{sp}_{2l}(\mathbb C),\operatorname{Poly}_l\right)τ:C→Polyl​→Rep(sp2l​(C),Polyl​)

is chosen once before any parameters, where Poly⁡l=C[Tij:i≤j]\operatorname{Poly}_l=\mathbb C[T_{ij}:i\le j]Polyl​=C[Tij​:i≤j]. For every c∈Cc\in\mathbb Cc∈C and every polynomial ϕ\phiϕ, τ(c,ϕ)\tau(c,\phi)τ(c,ϕ) is a genuine Lie representation and acts for all i,j,qi,j,qi,j,q by

τ(c,ϕ)(Tij)q=Tijq,\tau(c,\phi)(T_{ij})q=T_{ij}q,τ(c,ϕ)(Tij​)q=Tij​q, τ(c,ϕ)(Xij)q=X~ijq+(X~ijϕ+1i=jc)q,X~ijq=∑k(1+1k=i)Tki∂kjq,\tau(c,\phi)(X_{ij})q =\widetilde X_{ij}q+ \bigl(\widetilde X_{ij}\phi+\mathbf1_{i=j}c\bigr)q, \qquad \widetilde X_{ij}q =\sum_k(1+\mathbf1_{k=i})T_{ki}\partial_{kj}q,τ(c,ϕ)(Xij​)q=Xij​q+(Xij​ϕ+1i=j​c)q,Xij​q=k∑​(1+1k=i​)Tki​∂kj​q,

and

τ(c,ϕ)(Yii)q=−12(Y~ii c(ϕ)q+Y~ii c(q)+∑kX~ki(ϕ)((∂kiϕ)q+2∂kiq)),\tau(c,\phi)(Y_{ii})q =-\frac12\left( \widetilde Y^{\,c}_{ii}(\phi)q+\widetilde Y^{\,c}_{ii}(q) +\sum_k\widetilde X_{ki}(\phi) \bigl((\partial_{ki}\phi)q+2\partial_{ki}q\bigr) \right),τ(c,ϕ)(Yii​)q=−21​(Yiic​(ϕ)q+Yiic​(q)+k∑​Xki​(ϕ)((∂ki​ϕ)q+2∂ki​q)),

where

Y~ij c(q)=2c ∂ijq+∑kX~ki(∂kjq).\widetilde Y^{\,c}_{ij}(q)=2c\,\partial_{ij}q+ \sum_k\widetilde X_{ki}(\partial_{kj}q).Yijc​(q)=2c∂ij​q+k∑​Xki​(∂kj​q).

For each c,ϕc,\phic,ϕ, there is also a complex-linear equivalence e:Poly⁡l≅Poly⁡le:\operatorname{Poly}_l\cong\operatorname{Poly}_le:Polyl​≅Polyl​ witnessing rank-one freeness in the literal sense

e(Tijq)=τ(c,ϕ)(Tij)e(q)e(T_{ij}q)=\tau(c,\phi)(T_{ij})e(q)e(Tij​q)=τ(c,ϕ)(Tij​)e(q)

for every i,j,qi,j,qi,j,q; the witness may depend on c,ϕc,\phic,ϕ.

The same P,τP,\tauP,τ satisfy all five core claims. First, for every small-universe complex module MMM and every representation ρ\rhoρ of sp2l(C)\mathfrak{sp}_{2l}(\mathbb C)sp2l​(C) on MMM, if there is a complex-linear equivalence e:Poly⁡l≅Me:\operatorname{Poly}_l\cong Me:Polyl​≅M intertwining multiplication by each TijT_{ij}Tij​ with ρ(Tij)\rho(T_{ij})ρ(Tij​), then there exist c,ϕc,\phic,ϕ and a complex-linear equivalence intertwining ρ(x)\rho(x)ρ(x) with τ(c,ϕ)(x)\tau(c,\phi)(x)τ(c,ϕ)(x) for every Lie element xxx. Second,

τ(c1,ϕ1)≅τ(c2,ϕ2)⟺c1=c2 and ϕ1−ϕ2 is a constant polynomial.\tau(c_1,\phi_1)\cong\tau(c_2,\phi_2) \quad\Longleftrightarrow\quad c_1=c_2 \ \text{and}\ \phi_1-\phi_2\text{ is a constant polynomial}.τ(c1​,ϕ1​)≅τ(c2​,ϕ2​)⟺c1​=c2​ and ϕ1​−ϕ2​ is a constant polynomial.

Third, the span of simultaneous eigenvectors for all diagonal XiiX_{ii}Xii​ is the whole polynomial module exactly when ϕ\phiϕ is constant. Fourth, when ϕ\phiϕ is constant, there exists the last index aaa, with a+1=la+1=la+1=l, such that 111 is killed by YaaY_{aa}Yaa​, has XaaX_{aa}Xaa​-eigenvalue ccc, is killed by all displayed reverse-adjacent XijX_{ij}Xij​, has equal adjacent diagonal weights, and generates the whole module in the sense that every invariant submodule containing 111 is the whole module. Fifth,

τ(c,ϕ) is nontrivial and has no proper nonzero invariant submodule⟺¬∃n∈N>0, c=l+12−n2.\tau(c,\phi)\text{ is nontrivial and has no proper nonzero invariant submodule} \quad\Longleftrightarrow\quad \neg\exists n\in\mathbb N_{>0},\ c=\frac{l+1}{2}-\frac n2.τ(c,ϕ) is nontrivial and has no proper nonzero invariant submodule⟺¬∃n∈N>0​, c=2l+1​−2n​.

This simplicity criterion is independent of ϕ\phiϕ.

For every exceptional c=(l+1−n)/2c=(l+1-n)/2c=(l+1−n)/2 with positive natural nnn, and every ϕ\phiϕ, every ascending and every descending chain of invariant complex submodules of τ(c,ϕ)\tau(c,\phi)τ(c,ϕ) stabilizes; at least one finite strictly increasing composition series from 000 to the full module exists; and for any two such finite series there is a permutation of their step indices under which corresponding quotient representations are complex-linearly intertwining-equivalent. Because existence of a composition series is also required, the Jordan–Hölder clause is not left true merely because no series exists. The statement does not enumerate the factors.

Finally, the explicit vector space with basis h~r\widetilde h_rhr​ for nonzero r∈Z2lr\in\mathbb Z^{2l}r∈Z2l and did_idi​ for the 2l2l2l coordinate indices, with h~0=0\widetilde h_0=0h0​=0, has the explicitly defined bracket

[h~r,h~s]=⟨r~,s⟩h~r+s,[di,h~r]=rih~r,[h~r,di]=−rih~r,[di,dj]=0,[\widetilde h_r,\widetilde h_s] =\langle\widetilde r,s\rangle\widetilde h_{r+s},\qquad [d_i,\widetilde h_r]=r_i\widetilde h_r,\qquad [\widetilde h_r,d_i]=-r_i\widetilde h_r,\qquad [d_i,d_j]=0,[hr​,hs​]=⟨r,s⟩hr+s​,[di​,hr​]=ri​hr​,[hr​,di​]=−ri​hr​,[di​,dj​]=0,

extended by finite double sums. The theorem requires this operation to be additive and complex homogeneous in each argument, alternating, and Jacobi. For every nonexceptional ccc, every polynomial ϕ\phiϕ, and arbitrary α,β∈C2l\alpha,\beta\in\mathbb C^{2l}α,β∈C2l, there exists a complex-linear bracket-preserving action σ\sigmaσ of this explicit algebra on

Poly⁡l⊗CC[Z2l]\operatorname{Poly}_l\otimes_{\mathbb C} \mathbb C[\mathbb Z^{2l}]Polyl​⊗C​C[Z2l]

and elements Rr∈sp2l(C)R_r\in\mathfrak{sp}_{2l}(\mathbb C)Rr​∈sp2l​(C) whose matrices are rr~ Tr\widetilde r^{\,T}rrT, such that for every exponents r,sr,sr,s and polynomial vvv,

σ(h~r)(v⊗xs)=(⟨r~,s+α⟩v+τ(c,ϕ)(Rr)v)⊗xr+s,\sigma(\widetilde h_r)(v\otimes x^s) =\bigl(\langle\widetilde r,s+\alpha\rangle v+ \tau(c,\phi)(R_r)v\bigr)\otimes x^{r+s},σ(hr​)(v⊗xs)=(⟨r,s+α⟩v+τ(c,ϕ)(Rr​)v)⊗xr+s, σ(di)(v⊗xs)=(si+βi)v⊗xs.\sigma(d_i)(v\otimes x^s) =(s_i+\beta_i)v\otimes x^s.σ(di​)(v⊗xs)=(si​+βi​)v⊗xs.

This σ\sigmaσ is nontrivial and simple, is spanned by simultaneous did_idi​-weight vectors, and, for every sss, its common eigenspace of weight s+βs+\betas+β is exactly the set {v⊗xs:v∈Poly⁡l}\{v\otimes x^s:v\in\operatorname{Poly}_l\}{v⊗xs:v∈Polyl​}, as equality of sets. The action σ\sigmaσ may depend on c,ϕ,α,βc,\phi,\alpha,\betac,ϕ,α,β.

The existential witnesses PPP and τ\tauτ may depend on lll, but are fixed simultaneously for the classification, exceptional-length, and Hamiltonian conclusions; their uniqueness is not asserted. The hypothesis 2≤l2\le l2≤l excludes the empty and one-index ranks, so none of the displayed finite-index systems is empty. The classification implication ranges only over representations satisfying the explicit freeness premise, but that class is not empty within the conclusion because every τ(c,ϕ)\tau(c,\phi)τ(c,ϕ) is itself required to be free. Exceptional and nonexceptional branches are conditional at each ccc; both classes of complex parameters have members.

SymplecticFreeModules.polynomialModuleMain. For every l≥2l\ge2l≥2, there exist one concrete presentation PPP with the exact matrices above, commuting and linearly independent symmetric TijT_{ij}Tij​, and one family τ(c,ϕ)\tau(c,\phi)τ(c,ϕ) of genuine polynomial representations satisfying the exact XijX_{ij}Xij​, multiplication-TijT_{ij}Tij​, and diagonal-YiiY_{ii}Yii​ formulas and the explicit rank-one freeness condition for every c,ϕc,\phic,ϕ. Every free-rank-one representation is equivalent to some member of this family; two members are equivalent exactly when their ccc’s agree and their ϕ\phiϕ’s differ by a constant; the family is a weight representation exactly for constant ϕ\phiϕ; constant ϕ\phiϕ gives the explicit cyclic lowest-weight vector 111 of weight ccc; and simplicity is equivalent to ccc not being (l+1−n)/2(l+1-n)/2(l+1−n)/2 for any positive natural nnn. At every exceptional parameter and every ϕ\phiϕ, the representation is Noetherian, Artinian, has a finite composition series, and has the stated permutation-and-quotient-intertwiner Jordan–Hölder uniqueness. This theorem makes no assertion about the explicit Hamiltonian bracket or Shen–Larsson tensor action.

SymplecticFreeModules.classificationAndSimplicity. For every l≥2l\ge2l≥2, there exist one exact concrete generator presentation PPP with an independent commuting symmetric TTT-system and one family τ(c,ϕ)\tau(c,\phi)τ(c,ϕ) of genuine representations satisfying the exact candidate generator formulas and rank-one freeness for all c,ϕc,\phic,ϕ. The family classifies every representation satisfying the same literal freeness condition up to an intertwining complex-linear equivalence; its parameters are unique exactly modulo adding a constant to ϕ\phiϕ; it is a weight representation exactly for constant ϕ\phiϕ; constant ϕ\phiϕ gives the explicit lowest-weight cyclic generator 111; and it is simple exactly at the nonexceptional values of ccc. This declaration omits both the exceptional finite-length/Jordan–Hölder conjunction and the canonical Hamiltonian application.

SymplecticFreeModules.exceptionalFiniteLength. For every l≥2l\ge2l≥2, there exist one exact concrete presentation PPP with commuting linearly independent symmetric TTT-generators and one family τ(c,ϕ)\tau(c,\phi)τ(c,ϕ) of genuine representations satisfying all exact candidate generator formulas and the literal rank-one freeness condition for every c,ϕc,\phic,ϕ, such that whenever c=(l+1−n)/2c=(l+1-n)/2c=(l+1−n)/2 for some positive natural nnn, τ(c,ϕ)\tau(c,\phi)τ(c,ϕ) is Noetherian and Artinian, has at least one finite composition series, and any two such series have the same quotient representations up to a permutation and intertwining equivalences. This declaration does not itself assert the core classification, parameter uniqueness, weight, lowest-weight, or simplicity equivalences, despite using the same family shape.

SymplecticFreeModules.hamiltonianApplicationMain. For every l≥2l\ge2l≥2, there exist one exact presentation PPP with its commuting independent TTT-system and one common exact-formula, rank-one-free family τ(c,ϕ)\tau(c,\phi)τ(c,ϕ) satisfying all five core classification, uniqueness, weight, lowest-weight, and simplicity claims. In addition, the explicit (h~r,di)(\widetilde h_r,d_i)(hr​,di​) bracket above satisfies complex bilinearity, alternation, and Jacobi; and for every nonexceptional ccc, every ϕ\phiϕ, and every α,β∈C2l\alpha,\beta\in\mathbb C^{2l}α,β∈C2l, there exists a simple weight representation σ\sigmaσ on Poly⁡l⊗C[Z2l]\operatorname{Poly}_l\otimes\mathbb C[\mathbb Z^{2l}]Polyl​⊗C[Z2l] satisfying the exact Shen–Larsson pure-tensor formulas and having exactly the degree-s+βs+\betas+β weight spaces {v⊗xs}\{v\otimes x^s\}{v⊗xs}. This declaration omits the exceptional Noetherian, Artinian, finite-composition-series, and Jordan–Hölder conjunction.

Human review
  • Endorsed by Shuze Chen · Aug 27, 2026

  • Endorsed by ShouqiaoWang · Aug 27, 2026

    Confirmed by the mission captain (proposal self-audit).

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