In the mathematical field of Lie theory, a Dynkin diagram, named for Eugene Dynkin, is a type of graph with some edges doubled or tripled (drawn as a double or triple line). Dynkin diagrams arise in the classification of semisimple Lie algebras over algebraically closed fields, in the classification of Weyl groups and other finite reflection groups, and in other contexts. Various properties of the Dynkin diagram (such as whether it contains multiple edges, or its symmetries) correspond to important features of the associated Lie algebra. The term "Dynkin diagram" can be ambiguous. In some cases, Dynkin diagrams are assumed to be directed, in which case they correspond to root systems and semi-simple Lie algebras, while in other cases they are assumed to be undirected, in which case they correspond to Weyl groups. In this article, "Dynkin diagram" means directed Dynkin diagram, and undirected Dynkin diagrams will be explicitly so named. The fundamental interest in Dynkin diagrams is that they classify semisimple Lie algebras over algebraically closed fields. One classifies such Lie algebras via their root system, which can be represented by a Dynkin diagram. One then classifies Dynkin diagrams according to the constraints they must satisfy, as described below. Dropping the direction on the graph edges corresponds to replacing a root system by the finite reflection group it generates, the so-called Weyl group, and thus undirected Dynkin diagrams classify Weyl groups. They have the following correspondence for the Lie algebras associated to classical groups over the complex numbers: , the special linear Lie algebra. , the odd-dimensional special orthogonal Lie algebra. , the symplectic Lie algebra. , the even-dimensional special orthogonal Lie algebra (). For the exceptional groups, the names for the Lie algebra and the associated Dynkin diagram coincide. Dynkin diagrams can be interpreted as classifying many distinct, related objects, and the notation "An, Bn, ...

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related courses (7)
MATH-335: Coxeter groups
Study groups generated by reflections
MATH-212: Analyse numérique et optimisation
L'étudiant apprendra à résoudre numériquement divers problèmes mathématiques. Les propriétés théoriques de ces méthodes seront discutées.
MATH-111(e): Linear Algebra
L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et ses applications.
Show more
Related lectures (34)
Multiple Reflection Diagram Example
Demonstrates the application of multiple reflection diagrams to analyze signal behavior in transmission lines.
Determinants: Triangular Matrices and Efficient Calculations
Explores efficient determinant calculations using triangular matrices and specific row/column selections for simplification.
Crystallographic Coxeter Groups
Explores crystallographic Coxeter groups, lattice preservation, and the classification of irreducible Weyl groups.
Show more
Related publications (36)
Related concepts (26)
Root system
In mathematics, a root system is a configuration of vectors in a Euclidean space satisfying certain geometrical properties. The concept is fundamental in the theory of Lie groups and Lie algebras, especially the classification and representation theory of semisimple Lie algebras. Since Lie groups (and some analogues such as algebraic groups) and Lie algebras have become important in many parts of mathematics during the twentieth century, the apparently special nature of root systems belies the number of areas in which they are applied.
Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example. However, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced in 1934 as abstractions of reflection groups , and finite Coxeter groups were classified in 1935 .
Weyl group
In mathematics, in particular the theory of Lie algebras, the Weyl group (named after Hermann Weyl) of a root system Φ is a subgroup of the isometry group of that root system. Specifically, it is the subgroup which is generated by reflections through the hyperplanes orthogonal to the roots, and as such is a finite reflection group. In fact it turns out that most finite reflection groups are Weyl groups. Abstractly, Weyl groups are finite Coxeter groups, and are important examples of these.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.