Compatible adapted pairs and a common slice theorem for some centralizers (Q1024598)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Compatible adapted pairs and a common slice theorem for some centralizers
scientific article

    Statements

    Compatible adapted pairs and a common slice theorem for some centralizers (English)
    0 references
    0 references
    17 June 2009
    0 references
    The paper under review is dedicated to the 80th birthday of Bertram Kostant who, in his exceptional career already spanning more than 50 years, has inspired many generations of mathematicians. As the author mentions, the present study is a modest example, drawing from the remarkably simple and purely algebraic proof of Kostant that regular coadjoint orbits for semisimple Lie algebras admit a slice and the relation this has to the polynomiality of the algebra of invariants. Let \(\mathfrak g\) be a finite dimensional complex simple Lie algebra with adjoint group \(G\). Let \(x\in \mathfrak g\) be nilpotent with centralizer \({\mathfrak g}^x\). The author derives a criterion for when the \(G\)-orbits in \({\mathfrak g}^{\ast}\) and the \(G^x\)-orbits in \(({\mathfrak g}^x)^{\ast}\) admit a common slice, applicable (in principle) when \(x\) is of Bala-Carter type. When \(\mathfrak g\) is of type \(A\), or if \(x\) is the highest root vector with \(\mathfrak g\) not of type \( E_8\), he shows that this criterion is satisfied. In these cases he also shows that the Mishchenko-Fomenko shift of argument produces a maximal Poisson commutative polynomial subalgebra of \(S({\mathfrak g}^x)\) which maps isomorphically by restriction of functions to an affine translate of a subspace of \(({\mathfrak g}^x)^{\ast}\). The author conjectures that the above criterion is satisfied when the dimensions of certain weights spaces, which can be computed purely combinatorially, are decreasing.
    0 references
    centralizers
    0 references
    slices
    0 references
    shift of argument
    0 references
    0 references
    0 references
    0 references

    Identifiers