Canonical: https://knowlpedia.com/lie-groups/simple-root/

# Simple root

A minimal positive root; simple roots form a basis for the root system and generate all positive roots.

Fix a root system \(\Phi\subset V\) (see [root system](https://knowlpedia.com/lie-groups/root-system/)) together with a choice of [positive roots](https://knowlpedia.com/lie-groups/positive-root/) \(\Phi^+\subset\Phi\).

A root \(\alpha\in\Phi^+\) is called **simple** if it cannot be written as a sum of two positive roots:
\[
\alpha \neq \beta+\gamma \quad\text{for all }\beta,\gamma\in\Phi^+.
\]
The set of simple roots is usually denoted \(\Delta\subset\Phi^+\).

Key structural facts (standard in root system theory):

- \(\Delta\) is a basis of \(V\) (in particular, the simple roots are linearly independent).
- Every positive root is a nonnegative integer combination of simple roots:
  \[
  \Phi^+ \subset \Big\{\sum_{\alpha\in\Delta} n_\alpha\,\alpha \;:\; n_\alpha\in\mathbb Z_{\ge 0}\Big\}.
  \]

In semisimple Lie theory (see [roots of a Lie algebra](https://knowlpedia.com/lie-groups/root-lie-algebra/) and [root space decomposition](https://knowlpedia.com/lie-groups/root-space-decomposition/)), choosing \(\Delta\) is the combinatorial input for building the [Cartan matrix](https://knowlpedia.com/lie-groups/cartan-matrix/) and [Dynkin diagram](https://knowlpedia.com/lie-groups/dynkin-diagram/). In representation theory, simple roots control highest weights (see [highest weight](https://knowlpedia.com/lie-groups/highest-weight/) and [highest weight theorem](https://knowlpedia.com/lie-groups/highest-weight-theorem/)).
