Nonassociative rings and algebras Definition
Root system
Builds on Euclidean spaceInner productReflection
Definition
Let be a finite-dimensional real vector space with an inner product , a Euclidean space. For a nonzero , let be the reflection in the hyperplane orthogonal to . A root system in is a finite subset such that:
- spans and ;
- for each , the only multiples of in are and ;
- for each , the reflection maps onto ;
- for all , the number is an integer.
The elements of are the roots, and is the rank of .
Remarks
Example: let be the plane in , with the standard basis of . The six vectors with form the root system , whose roots point to the corners of a regular hexagon. They span ; each swaps two coordinates, so it permutes ; and all numbers lie in . Non-example: with orthonormal, the set fails clause 3, since is not in the set. Some authors drop clause 2 and call the systems that satisfy it reduced; then in is the non-reduced system . Some authors also drop the spanning condition in clause 1.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Euclidean space object
- Inner product concept
- Reflection concept
- Root system definition
Further reading
- Web https://en.wikipedia.org/wiki/Root_system, Definition
About this page
| Tag | Y32EWAATPG |
|---|---|
| URI | m2://Y32EWAATPG |
| Kind | definition |
| Writing | W1 stated |
| MSC | 17B22, 20F55 |
| Defines | Root system |
| Uses | Euclidean space, Inner product, Reflection |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (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.