|
|
|
|
| LEADER |
02718nmm a2200361 u 4500 |
| 001 |
EB002119845 |
| 003 |
EBX01000000000000001257902 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
221028 ||| eng |
| 020 |
|
|
|a 9780080535456
|
| 020 |
|
|
|a 9780444501165
|
| 020 |
|
|
|a 0444501169
|
| 050 |
|
4 |
|a QA252.3
|
| 100 |
1 |
|
|a De Graaf, Willem A.
|
| 245 |
0 |
0 |
|a Lie algebras
|b theory and algorithms
|c Willem A. de Graaf
|
| 250 |
|
|
|a 1st ed
|
| 260 |
|
|
|a Amsterdam
|b Elsevier
|c 2000, 2000
|
| 300 |
|
|
|a xii, 393 pages
|
| 505 |
0 |
|
|a Basic constructions. On nilpotency and colvability. Cartan subalgebras. Lie algebras with non-degenerate Killing form. The classification of the simple Lie algebras. Universal enveloping algebras. Finitely presented Lie algebras. Representations of semisimple Lie algebras. On associative algebras. Bibliography. Index of Symbols. Index of Terminology. Index of Algorithms
|
| 505 |
0 |
|
|a Includes bibliographical references (pages 379-386) and index
|
| 653 |
|
|
|a MATHEMATICS / Algebra / Linear / bisacsh
|
| 653 |
|
|
|a Lie algebras / http://id.loc.gov/authorities/subjects/sh85076782
|
| 653 |
|
|
|a Lie-algebra's / gtt
|
| 653 |
|
|
|a Lie algebras / fast / (OCoLC)fst00998125
|
| 653 |
|
|
|a Algoritmen / gtt
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b ZDB-1-ELC
|a Elsevier eBook collection Mathematics
|
| 490 |
0 |
|
|a North-Holland mathematical library
|
| 015 |
|
|
|a GBB6H1995
|
| 856 |
4 |
0 |
|u https://www.sciencedirect.com/science/bookseries/09246509/56
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 512/.55
|
| 520 |
|
|
|a The aim of the present work is two-fold. Firstly it aims at a giving an account of many existing algorithms for calculating with finite-dimensional Lie algebras. Secondly, the book provides an introduction into the theory of finite-dimensional Lie algebras. These two subject areas are intimately related. First of all, the algorithmic perspective often invites a different approach to the theoretical material than the one taken in various other monographs (e.g., [42], [48], [77], [86]). Indeed, on various occasions the knowledge of certain algorithms allows us to obtain a straightforward proof of theoretical results (we mention the proof of the Poincaré-Birkhoff-Witt theorem and the proof of Iwasawa's theorem as examples). Also proofs that contain algorithmic constructions are explicitly formulated as algorithms (an example is the isomorphism theorem for semisimple Lie algebras that constructs an isomorphism in case it exists). Secondly, the algorithms can be used to arrive at a better understanding of the theory. Performing the algorithms in concrete examples, calculating with the concepts involved, really brings the theory of life
|