----
> [!definition] Definition. ([[Dynkin diagram]])
> Let $(\Phi, E)$ be a [[root system]], $\Delta$ a [[root basis]]. The corresponding **Dynkin diagram** is the decorated [[network|graph]] $D(\Phi)$ defined by the properties[[reflection|:]]
> - Vertices are [[root basis|simple roots]] $\alpha_{1},\dots,\alpha_{\ell}$
> - Two (distinct)vertices $\alpha, \beta$ are connected by an edge iff $(\alpha, \beta) \neq 0$. In that case, we draw exactly $\underbrace{ \langle \alpha, \check \beta \rangle \langle \beta, \check \alpha \rangle }_{ \in \{ 1,2,3 \} }$ edges between them
> - Suppose $\alpha, \beta \in \Delta$ are connected by an edge. If $(\alpha, \alpha) = (\beta, \beta)$, we declare the edge to be undirected. If the two roots have different length, $(\alpha, \alpha)< (\beta, \beta)$[^1], we capture this by drawing an '