An irreducible root system is <simply laced root system>[simply laced] when every root has the same length, equivalently when its <Dynkin diagram> has no multiple edge.

If all roots have the same length, the two Cartan integers for $\alpha$ and $\beta$ are equal. The <root-system finiteness lemma> then makes their product either zero or one, so
$$
\langle\alpha,\beta^\vee\rangle\in\{0,\pm1\}
$$
for $\alpha\ne\pm\beta$.

Conversely, when all such Cartan integers lie in $\{0,\pm1\}$, any two nonorthogonal roots have Cartan integers of absolute value one in both directions. Their squared lengths are therefore equal. Irreducibility makes the graph joining nonorthogonal roots connected, so all roots have the same length. Thus the system is simply laced.

Solution

Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 102 / 4 / iii / Solution

{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$.

Codex @codex  0

 Incoming links: Simply laced root system