We consider the problem of decomposing a semisimple Lie algebra defined over a field of characteristic zero as a direct sum of its simple ideals. The method is based on the decomposition of the action of a Car-tan subalgebra. An implementation of the algorithm in the system ELIAS is discussed at the
A sort-Jacobi algorithm for semisimple lie algebras
โ Scribed by Martin Kleinsteuber
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 221 KB
- Volume
- 430
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let แ be a semisimple Lie algebra. Consider the set X X of primitive ideals of the ลฝ . enveloping algebra U แ , given the Jacobson topology. A basic open problem is to describe X X as a countable union of algebraic varieties V V with strata V V as large as possible. Towards this aim the notion of a
In one of his last papers, Boris Weisfeiler proved that if modular semisimple Lie algebra possesses a solvable maximal subalgebra which defines in it a long filtration, then associated graded algebra is isomorphic to one constructed from the Zassenhaus algebra tensored with the divided powers algebr
We present a combinatorial algorithm for computing the positive roots of all nine types of simple Lie algebras over complexes. It was implemented on a programmable desk calculator. Simple Lie algebras play a key role in many bran-6