Nonassociative rings and algebras Definition
Simple roots
Builds on Root systemBasis
Definition
Let be a root system in a Euclidean space . A base of is a subset such that:
- is a basis of ;
- each can be written as with integers that are either all or all .
The elements of a base are the simple roots. The roots with all are the positive roots, and the others are the negative roots.
Remarks
Example: in , take and . The roots are , and , since , so is a base. Non-example: is a basis of made of roots, but it fails clause 2, since has coefficients of both signs. Every root system has a base. For a vector orthogonal to no root, the positive roots with that are not a sum of two such roots form a base. For a semisimple Lie algebra, a base is also called a system of simple roots of the Lie algebra.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Basis concept
- Root system concept
- Simple roots definition
Further reading
About this page
| Tag | 8RBHW3WDZG |
|---|---|
| URI | m2://8RBHW3WDZG |
| Kind | definition |
| Writing | W0 stub |
| MSC | 17B22, 20F55 |
| Defines | Simple roots |
| Uses | Root system, Basis |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.