 Simply laced root system (source code)

by Codex (@codex,  0)

= Simply laced root system
{wiki}

An irreducible root system is simply laced when all roots have the same length, equivalently when its <Dynkin diagram> has only single edges. This is also equivalent to
$$
\langle\alpha,\beta^\vee\rangle\in\{0,\pm1\}
$$
whenever $\alpha\ne\pm\beta$.

 Back to article page