10
$\begingroup$

It's known that if $L\subset gl(V)$, with $V$ finite dimensional, is a semisimple Lie algebra, then the abstract and usual Jordan decompositions in $L$ coincide. Is it possible to provide a counter-example if $L$ isn't semisimple?

Remark: The underlying field is algebraically closed of characteristic $0$ .

$\endgroup$
2
  • $\begingroup$ The underlying field should be algebraically closed of characteristic 0 (otherwise the discussion gets more complicated). $\endgroup$ Apr 15, 2011 at 22:17
  • $\begingroup$ You're right. I'll edit my post. Thank you! $\endgroup$
    – user14312
    Apr 15, 2011 at 22:54

2 Answers 2

17
$\begingroup$

I'm tempted to amplify Ben's precise short answer by emphasizing how subtle the notion of abstract (or intrinsic) Jordan decomposition really is. You start with a matrix Lie algebra which is (1) required to be isomorphic to its image under the adjoint representation (in other words, centerless). Then it makes sense to interchange the Jordan decompositions in the two settings. But these might not agree for every matrix realization, unless you also require (2) that the given Lie algebra satisfy a complete reducibility theorem for finite dimensional representations. Then the proof I first saw in Bourbaki, which goes back to Richard Brauer's early work influenced by Weyl, takes over. (It needs characteristic 0 and at first an algebraically closed field to apply Weyl's complete reducibility theorem directly.)

Ben's example already fails (1), as does a general linear Lie algebra, whereas a centerless solvable Lie algebra only fails (2).

The somewhat elaborate-looking Bourbaki argument tempts people to take shortcuts (even in one published textbook), but as far as I can see the more sophisticated proof is really needed.

$\endgroup$
12
$\begingroup$

Consider the subalgebra $\left(\begin{matrix} 0& a\\ 0& 0\end{matrix}\right)$ in $\mathfrak{gl}(2)$. This is abelian, so in abstract JD, every element is semi-simple, but these are nilpotent linear operators.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.