Definition
Type A root system
The simply laced root system A_n formed by the differences e_i-e_j in the sum-zero hyperplane of R^{n+1}.
Definition
For , the root system of type is
in the -dimensional Euclidean space
It is an irreducible simply laced root system of rank .
Simple roots and diagram
A standard base of simple roots is
Its Dynkin diagram is a chain of vertices. The system has roots, and its Weyl group is the symmetric group , acting by permuting coordinates.
Lie-algebra realization
The roots of relative to its diagonal trace-zero Cartan subalgebra are the functionals . Hence type corresponds under the classification of complex simple Lie algebras to
whose dimension is . See also the special linear Lie algebra.
Low-rank cases
The system consists of two opposite roots. The accidental diagram isomorphism is why the irreducible type family is conventionally indexed from .
References
- James E. Humphreys, Introduction to Lie Algebras and Representation Theory, Springer, 1972, §§11–12. Publisher record.
- Nicolas Bourbaki, Lie Groups and Lie Algebras, Chapters 4–6, Springer, 2002, Chapter VI, §4. Publisher record.
- John C. Baez, “Three Generations in ,” 2026, §§2, 5, 7–8. arXiv record.