Kostant's filtration conjecture for the odd Harish-Chandra projection

About 15 years old · traced to

Let g=n+⊕h⊕n−\mathfrak{g}=\mathfrak{n}_+\oplus\mathfrak{h}\oplus\mathfrak{n}_- be a Lie algebra with triangular decomposition, let Cl⁡(g)\operatorname{Cl}(\mathfrak{g}) be its Clifford algebra, and let θ:g→Cl⁡(g)\theta:\mathfrak{g}\to\operatorname{Cl}(\mathfrak{g}) be the canonical injection. Let P⊂(⋀g)gP\subset(\bigwedge\mathfrak{g})^{\mathfrak{g}} be the space of primitive elements, let qq be the map from ⋀g\bigwedge\mathfrak{g} to Cl⁡(g)\operatorname{Cl}(\mathfrak{g}), and set P=q(P)\mathcal{P}=q(P). Define

P(k)={v∈P:deg⁡(v)≤k}.\mathcal{P}^{(k)}=\{v\in\mathcal{P}:\operatorname{deg}(v)\leq k\}.

Let hcodd:Cl⁡(g)→Cl⁡(h){\rm hc}_{\rm odd}:\operatorname{Cl}(\mathfrak{g})\to\operatorname{Cl}(\mathfrak{h}) be the odd Harish-Chandra projection. Let gˇ\check{\mathfrak{g}} be the Lie algebra associated with the dual root system, let (eˇ,hˇ,fˇ)(\check e,\check h,\check f) be its principal sl2{\rm sl}_2-triple, and identify h∗\mathfrak{h}^* with hˇ\check{\mathfrak{h}}. Define

F(m)hˇ={x∈hˇ:ad⁡eˇm+1x=0}.\mathcal{F}^{(m)}\check{\mathfrak{h}}=\{x\in\check{\mathfrak{h}}:\operatorname{ad}_{\check e}^{m+1}x=0\}.

Transport this filtration to h\mathfrak{h} via the canonical identification. Kostant's filtration conjecture. For every k∈Nk\in\mathbb{N},

hcodd(P(2k+1))=θ(F(k)h).{\rm hc}_{\rm odd}(\mathcal{P}^{(2k+1)})=\theta\big(\mathcal{F}^{(k)}\mathfrak{h}\big).

The conjecture refines the known equality hcodd(P)=θ(h){\rm hc}_{\rm odd}(\mathcal{P})=\theta(\mathfrak{h}) by identifying the degree filtration on primitive invariant exterior elements with the principal-sl2{\rm sl}_2 filtration on the Cartan subalgebra. It is attributed to Kostant and is presented as an open question in the source.

References

Primary source

Anton Alekseev and Anne Moreau, “On the Kostant conjecture for Clifford algebra”, arXiv:1111.2141 (2011).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.