Root system

History

The concept of a root system was originally introduced by Wilhelm Killing around 1889 (in German, Wurzelsystem). He used them in his attempt to classify all simple Lie algebras over the field of complex numbers. (Killing originally made a mistake in the classification, listing two exceptional rank 4 root systems, when in fact there is only one, now known as F₄. Cartan later corrected this mistake, by showing Killing's two root systems were isomorphic.)

Killing investigated the structure of a Lie algebra ${\displaystyle L}$ by considering what is now called a Cartan subalgebra ${\displaystyle \mathfrak{h}}$. Then he studied the roots of the characteristic polynomial ${\displaystyle det({\mathrm{ad}}_{L}x-t)}$, where ${\displaystyle x\in \mathfrak{h}}$. Here a root is considered as a function of ${\displaystyle \mathfrak{h}}$, or indeed as an element of the dual vector space ${\displaystyle {\mathfrak{h}}^{\ast }}$. This set of roots forms a root system inside ${\displaystyle {\mathfrak{h}}^{\ast }}$, as defined above, where the inner product is the Killing form.

Elementary consequences of the root system axioms

The cosine of the angle between two roots is constrained to be one-half of the square root of a positive integer. This is because ${\displaystyle ⟨\beta ,\alpha ⟩}$ and ${\displaystyle ⟨\alpha ,\beta ⟩}$ are both integers, by assumption, and $${\displaystyle \begin{array}{cc}⟨\beta ,\alpha ⟩⟨\alpha ,\beta ⟩& =2\frac{(\alpha ,\beta )}{(\alpha ,\alpha )}\cdot 2\frac{(\alpha ,\beta )}{(\beta ,\beta )}\\ & =4\frac{(\alpha ,\beta {)}^2}{|\alpha {|}^2|\beta {|}^2}\\ & =4{\cos }^2(\theta )\\ & =(2\cos (\theta ){)}^2\in \mathbb{Z}.\end{array}}$$

Since ${\displaystyle 2\cos (\theta )\in [-2,2]}$, the only possible values for ${\displaystyle \cos (\theta )}$ are ${\displaystyle 0,\pm \frac{1}{2},\pm \frac{\sqrt{2}}{2},\pm \frac{\sqrt{3}}{2}}$ and ${\displaystyle \pm \frac{\sqrt{4}}{2}=\pm 1}$, corresponding to angles of 90°, 60° or 120°, 45° or 135°, 30° or 150°, and 0° or 180°. Condition 2 says that no scalar multiples of α other than 1 and −1 can be roots, so 0 or 180°, which would correspond to 2α or −2α, are out. The diagram at right shows that an angle of 60° or 120° corresponds to roots of equal length, while an angle of 45° or 135° corresponds to a length ratio of ${\displaystyle \sqrt{2}}$ and an angle of 30° or 150° corresponds to a length ratio of ${\displaystyle \sqrt{3}}$.

In summary, here are the only possibilities for each pair of roots.

• Angle of 90 degrees; in that case, the length ratio is unrestricted.
• Angle of 60 or 120 degrees, with a length ratio of 1.
• Angle of 45 or 135 degrees, with a length ratio of ${\displaystyle \sqrt{2}}$.
• Angle of 30 or 150 degrees, with a length ratio of ${\displaystyle \sqrt{3}}$.

Positive roots and simple roots

Given a root system ${\displaystyle \mathrm{\Phi }}$ we can always choose (in many ways) a set of positive roots. This is a subset ${\displaystyle {\mathrm{\Phi }}^{+}}$ of ${\displaystyle \mathrm{\Phi }}$ such that

• For each root ${\displaystyle \alpha \in \mathrm{\Phi }}$ exactly one of the roots ${\displaystyle \alpha }$, ${\displaystyle -\alpha }$ is contained in ${\displaystyle {\mathrm{\Phi }}^{+}}$.
• For any two distinct ${\displaystyle \alpha ,\beta \in {\mathrm{\Phi }}^{+}}$ such that ${\displaystyle \alpha +\beta }$ is a root, ${\displaystyle \alpha +\beta \in {\mathrm{\Phi }}^{+}}$.

If a set of positive roots ${\displaystyle {\mathrm{\Phi }}^{+}}$ is chosen, elements of ${\displaystyle -{\mathrm{\Phi }}^{+}}$ are called negative roots. A set of positive roots may be constructed by choosing a hyperplane ${\displaystyle V}$ not containing any root and setting ${\displaystyle {\mathrm{\Phi }}^{+}}$ to be all the roots lying on a fixed side of ${\displaystyle V}$. Furthermore, every set of positive roots arises in this way.

An element of ${\displaystyle {\mathrm{\Phi }}^{+}}$ is called a simple root (also fundamental root) if it cannot be written as the sum of two elements of ${\displaystyle {\mathrm{\Phi }}^{+}}$. (The set of simple roots is also referred to as a base for ${\displaystyle \mathrm{\Phi }}$.) The set ${\displaystyle \mathrm{\Delta }}$ of simple roots is a basis of ${\displaystyle E}$ with the following additional special properties:

• Every root ${\displaystyle \alpha \in \mathrm{\Phi }}$ is a linear combination of elements of ${\displaystyle \mathrm{\Delta }}$ with integer coefficients.
• For each ${\displaystyle \alpha \in \mathrm{\Phi }}$, the coefficients in the previous point are either all non-negative or all non-positive.

For each root system ${\displaystyle \mathrm{\Phi }}$ there are many different choices of the set of positive roots—or, equivalently, of the simple roots—but any two sets of positive roots differ by the action of the Weyl group.

Dual root system, coroots, and integral elements

The dual root system

If Φ is a root system in E, the coroot α^∨ of a root α is defined by $${\displaystyle {\alpha }^{\vee }=\frac{2}{(\alpha ,\alpha )}\alpha .}$$

The set of coroots also forms a root system Φ^∨ in E, called the dual root system (or sometimes inverse root system). By direct calculation, α^∨∨ = α, so that Φ is the dual root system of Φ^∨. The lattice in E spanned by Φ^∨ is called the coroot lattice. Both Φ and Φ^∨ have the same Weyl group W and, for s in W, $${\displaystyle (s\alpha {)}^{\vee }=s({\alpha }^{\vee }).}$$

If Δ is a set of simple roots for Φ, then Δ^∨ is a set of simple roots for Φ^∨.

In the classification described below, the root systems of type ${\displaystyle A_n}$ and ${\displaystyle D_n}$ along with the exceptional root systems ${\displaystyle E_6,E_7,E_8,F_4,G_2}$ are all self-dual, meaning that the dual root system is isomorphic to the original root system. By contrast, the ${\displaystyle B_n}$ and ${\displaystyle C_n}$ root systems are dual to one another, but not isomorphic (except when ${\displaystyle n=2}$).

Integral elements

A vector ${\displaystyle \lambda }$ in E is called integral if its inner product with each coroot is an integer: $${\displaystyle 2\frac{(\lambda ,\alpha )}{(\alpha ,\alpha )}\in \mathbb{Z},\alpha \in \mathrm{\Phi }.}$$ Since the set of ${\displaystyle {\alpha }^{\vee }}$ with ${\displaystyle \alpha \in \mathrm{\Delta }}$ forms a base for the dual root system, to verify that ${\displaystyle \lambda }$ is integral, it suffices to check the above condition for ${\displaystyle \alpha \in \mathrm{\Delta }}$.

The set of integral elements is called the weight lattice associated to the given root system. This term comes from the representation theory of semisimple Lie algebras, where the integral elements form the possible weights of finite-dimensional representations.

The definition of a root system guarantees that the roots themselves are integral elements. Thus, every integer linear combination of roots is also integral. In most cases, however, there will be integral elements that are not integer combinations of roots. That is to say, in general the weight lattice does not coincide with the root lattice.

Classification of root systems by Dynkin diagrams

A root system is irreducible if it cannot be partitioned into the union of two proper subsets ${\displaystyle \mathrm{\Phi }={\mathrm{\Phi }}_1\cup {\mathrm{\Phi }}_2}$, such that ${\displaystyle (\alpha ,\beta )=0}$ for all ${\displaystyle \alpha \in {\mathrm{\Phi }}_1}$ and ${\displaystyle \beta \in {\mathrm{\Phi }}_2}$ .

Irreducible root systems correspond to certain graphs, the Dynkin diagrams named after Eugene Dynkin. The classification of these graphs is a simple matter of combinatorics, and induces a classification of irreducible root systems.

Constructing the Dynkin diagram

Given a root system, select a set Δ of simple roots as in the preceding section. The vertices of the associated Dynkin diagram correspond to the roots in Δ. Edges are drawn between vertices as follows, according to the angles. (Note that the angle between simple roots is always at least 90 degrees.)

• No edge if the vectors are orthogonal,
• An undirected single edge if they make an angle of 120 degrees,
• A directed double edge if they make an angle of 135 degrees, and
• A directed triple edge if they make an angle of 150 degrees.

The term "directed edge" means that double and triple edges are marked with an arrow pointing toward the shorter vector. (Thinking of the arrow as a "greater than" sign makes it clear which way the arrow is supposed to point.)

Note that by the elementary properties of roots noted above, the rules for creating the Dynkin diagram can also be described as follows. No edge if the roots are orthogonal; for nonorthogonal roots, a single, double, or triple edge according to whether the length ratio of the longer to shorter is 1, ${\displaystyle \sqrt{2}}$, ${\displaystyle \sqrt{3}}$. In the case of the ${\displaystyle G_2}$ root system for example, there are two simple roots at an angle of 150 degrees (with a length ratio of ${\displaystyle \sqrt{3}}$). Thus, the Dynkin diagram has two vertices joined by a triple edge, with an arrow pointing from the vertex associated to the longer root to the other vertex. (In this case, the arrow is a bit redundant, since the diagram is equivalent whichever way the arrow goes.)

Classifying root systems

Although a given root system has more than one possible set of simple roots, the Weyl group acts transitively on such choices. Consequently, the Dynkin diagram is independent of the choice of simple roots; it is determined by the root system itself. Conversely, given two root systems with the same Dynkin diagram, one can match up roots, starting with the roots in the base, and show that the systems are in fact the same.

Thus the problem of classifying root systems reduces to the problem of classifying possible Dynkin diagrams. A root systems is irreducible if and only if its Dynkin diagram is connected. The possible connected diagrams are as indicated in the figure. The subscripts indicate the number of vertices in the diagram (and hence the rank of the corresponding irreducible root system).

If ${\displaystyle \mathrm{\Phi }}$ is a root system, the Dynkin diagram for the dual root system ${\displaystyle {\mathrm{\Phi }}^{\vee }}$ is obtained from the Dynkin diagram of ${\displaystyle \mathrm{\Phi }}$ by keeping all the same vertices and edges, but reversing the directions of all arrows. Thus, we can see from their Dynkin diagrams that ${\displaystyle B_n}$ and ${\displaystyle C_n}$ are dual to each other.

Weyl chambers and the Weyl group

If ${\displaystyle \mathrm{\Phi }\subset E}$ is a root system, we may consider the hyperplane perpendicular to each root ${\displaystyle \alpha }$. Recall that ${\displaystyle {\sigma }_{\alpha }}$ denotes the reflection about the hyperplane and that the Weyl group is the group of transformations of ${\displaystyle E}$ generated by all the ${\displaystyle {\sigma }_{\alpha }}$'s. The complement of the set of hyperplanes is disconnected, and each connected component is called a Weyl chamber. If we have fixed a particular set Δ of simple roots, we may define the fundamental Weyl chamber associated to Δ as the set of points ${\displaystyle v\in E}$ such that ${\displaystyle (\alpha ,v)>0}$ for all ${\displaystyle \alpha \in \mathrm{\Delta }}$.

Since the reflections ${\displaystyle {\sigma }_{\alpha },\alpha \in \mathrm{\Phi }}$ preserve ${\displaystyle \mathrm{\Phi }}$, they also preserve the set of hyperplanes perpendicular to the roots. Thus, each Weyl group element permutes the Weyl chambers.

The figure illustrates the case of the ${\displaystyle A_2}$ root system. The "hyperplanes" (in this case, one dimensional) orthogonal to the roots are indicated by dashed lines. The six 60-degree sectors are the Weyl chambers and the shaded region is the fundamental Weyl chamber associated to the indicated base.

A basic general theorem about Weyl chambers is this:

Theorem: The Weyl group acts freely and transitively on the Weyl chambers. Thus, the order of the Weyl group is equal to the number of Weyl chambers.

In the ${\displaystyle A_2}$ case, for example, the Weyl group has six elements and there are six Weyl chambers.

A related result is this one:

Theorem: Fix a Weyl chamber ${\displaystyle C}$. Then for all ${\displaystyle v\in E}$, the Weyl-orbit of ${\displaystyle v}$ contains exactly one point in the closure ${\displaystyle \overline{C}}$ of ${\displaystyle C}$.

Root systems and Lie theory

Irreducible root systems classify a number of related objects in Lie theory, notably the following:

• simple complex Lie algebras (see the discussion above on root systems arising from semisimple Lie algebras),
• simply connected complex Lie groups which are simple modulo centers, and
• simply connected compact Lie groups which are simple modulo centers.

In each case, the roots are non-zero weights of the adjoint representation.

We now give a brief indication of how irreducible root systems classify simple Lie algebras over ${\displaystyle \mathbb{C}}$, following the arguments in Humphreys. A preliminary result says that a semisimple Lie algebra is simple if and only if the associated root system is irreducible. We thus restrict attention to irreducible root systems and simple Lie algebras.

• First, we must establish that for each simple algebra ${\displaystyle \mathfrak{g}}$ there is only one root system. This assertion follows from the result that the Cartan subalgebra of ${\displaystyle \mathfrak{g}}$ is unique up to automorphism, from which it follows that any two Cartan subalgebras give isomorphic root systems.
• Next, we need to show that for each irreducible root system, there can be at most one Lie algebra, that is, that the root system determines the Lie algebra up to isomorphism.
• Finally, we must show that for each irreducible root system, there is an associated simple Lie algebra. This claim is obvious for the root systems of type A, B, C, and D, for which the associated Lie algebras are the classical Lie algebras. It is then possible to analyze the exceptional algebras in a case-by-case fashion. Alternatively, one can develop a systematic procedure for building a Lie algebra from a root system, using Serre's relations.

For connections between the exceptional root systems and their Lie groups and Lie algebras see E₈, E₇, E₆, F₄, and G₂.

Properties of the irreducible root systems

Irreducible root systems are named according to their corresponding connected Dynkin diagrams. There are four infinite families (A_n, B_n, C_n, and D_n, called the classical root systems) and five exceptional cases (the exceptional root systems). The subscript indicates the rank of the root system.

In an irreducible root system there can be at most two values for the length (α, α)^1/2, corresponding to short and long roots. If all roots have the same length they are taken to be long by definition and the root system is said to be simply laced; this occurs in the cases A, D and E. Any two roots of the same length lie in the same orbit of the Weyl group. In the non-simply laced cases B, C, G and F, the root lattice is spanned by the short roots and the long roots span a sublattice, invariant under the Weyl group, equal to r²/2 times the coroot lattice, where r is the length of a long root.

In the adjacent table, |Φ^<| denotes the number of short roots, I denotes the index in the root lattice of the sublattice generated by long roots, D denotes the determinant of the Cartan matrix, and |W| denotes the order of the Weyl group.

Explicit construction of the irreducible root systems

An

Let E be the subspace of Rⁿ⁺¹ for which the coordinates sum to 0, and let Φ be the set of vectors in E of length √2 and which are integer vectors, i.e. have integer coordinates in Rⁿ⁺¹. Such a vector must have all but two coordinates equal to 0, one coordinate equal to 1, and one equal to −1, so there are n² + n roots in all. One choice of simple roots expressed in the standard basis is α_i = e_i − e_i+1 for 1 ≤ i ≤ n.

The reflection σ_i through the hyperplane perpendicular to α_i is the same as permutation of the adjacent ith and (i + 1)th coordinates. Such transpositions generate the full permutation group. For adjacent simple roots, σ_i(α_i+1) = α_i+1 + α_i = σ_i+1(α_i) = α_i + α_i+1, that is, reflection is equivalent to adding a multiple of 1; but reflection of a simple root perpendicular to a nonadjacent simple root leaves it unchanged, differing by a multiple of 0.

The A_n root lattice – that is, the lattice generated by the A_n roots – is most easily described as the set of integer vectors in Rⁿ⁺¹ whose components sum to zero.

The A₂ root lattice is the vertex arrangement of the triangular tiling.

The A₃ root lattice is known to crystallographers as the face-centered cubic (or cubic close packed) lattice. It is the vertex arrangement of the tetrahedral-octahedral honeycomb.

The A₃ root system (as well as the other rank-three root systems) may be modeled in the Zometool construction set.

In general, the A_n root lattice is the vertex arrangement of the n-dimensional simplicial honeycomb.

Bn

Let E = Rⁿ, and let Φ consist of all integer vectors in E of length 1 or √2. The total number of roots is 2n². One choice of simple roots is α_i = e_i – e_i+1 for 1 ≤ i ≤ n – 1 (the above choice of simple roots for A_n−1), and the shorter root α_n = e_n.

The reflection σ_n through the hyperplane perpendicular to the short root α_n is of course simply negation of the nth coordinate. For the long simple root α_n−1, σ_n−1(α_n) = α_n + α_n−1, but for reflection perpendicular to the short root, σ_n(α_n−1) = α_n−1 + 2α_n, a difference by a multiple of 2 instead of 1.

The B_n root lattice—that is, the lattice generated by the B_n roots—consists of all integer vectors.

B₁ is isomorphic to A₁ via scaling by √2, and is therefore not a distinct root system.

Cn

Let E = Rⁿ, and let Φ consist of all integer vectors in E of length √2 together with all vectors of the form 2λ, where λ is an integer vector of length 1. The total number of roots is 2n². One choice of simple roots is: α_i = e_i − e_i+1, for 1 ≤ i ≤ n − 1 (the above choice of simple roots for A_n−1), and the longer root α_n = 2e_n. The reflection σ_n(α_n−1) = α_n−1 + α_n, but σ_n−1(α_n) = α_n + 2α_n−1.

The C_n root lattice—that is, the lattice generated by the C_n roots—consists of all integer vectors whose components sum to an even integer.

C₂ is isomorphic to B₂ via scaling by √2 and a 45 degree rotation, and is therefore not a distinct root system.

Dn

Let E = Rⁿ, and let Φ consist of all integer vectors in E of length √2. The total number of roots is 2n(n − 1). One choice of simple roots is α_i = e_i − e_i+1 for 1 ≤ i ≤ n − 1 (the above choice of simple roots for A_n−1) together with α_n = e_n−1 + e_n.

Reflection through the hyperplane perpendicular to α_n is the same as transposing and negating the adjacent n-th and (n − 1)-th coordinates. Any simple root and its reflection perpendicular to another simple root differ by a multiple of 0 or 1 of the second root, not by any greater multiple.

The D_n root lattice – that is, the lattice generated by the D_n roots – consists of all integer vectors whose components sum to an even integer. This is the same as the C_n root lattice.

The D_n roots are expressed as the vertices of a rectified n-orthoplex, Coxeter–Dynkin diagram: .... The 2n(n − 1) vertices exist in the middle of the edges of the n-orthoplex.

D₃ coincides with A₃, and is therefore not a distinct root system. The twelve D₃ root vectors are expressed as the vertices of , a lower symmetry construction of the cuboctahedron.

D₄ has additional symmetry called triality. The twenty-four D₄ root vectors are expressed as the vertices of , a lower symmetry construction of the 24-cell.

E6, E7, E8

• The E₈ root system is any set of vectors in R⁸ that is congruent to the following set:$${\displaystyle D_8\cup \left\{\frac{1}{2}\left(\sum _{i=1}^8{\epsilon }_i{\mathbf{e}}_i\right):{\epsilon }_i=\pm 1,{\epsilon }_1\cdots {\epsilon }_8=+1\right\}.}$$

The root system has 240 roots. The set just listed is the set of vectors of length √2 in the E8 root lattice, also known simply as the E8 lattice or Γ₈. This is the set of points in R⁸ such that:

1. all the coordinates are integers or all the coordinates are half-integers (a mixture of integers and half-integers is not allowed), and
2. the sum of the eight coordinates is an even integer.

Thus, $${\displaystyle E_8=\left\{\alpha \in {\mathbb{Z}}^8\cup {\left(\mathbb{Z}+\frac{1}{2}\right)}^8:|\alpha {|}^2=\sum {\alpha }_i^2=2,\sum {\alpha }_i\in 2\mathbb{Z}.\right\}}$$

• The root system E₇ is the set of vectors in E₈ that are perpendicular to a fixed root in E₈. The root system E₇ has 126 roots.
• The root system E₆ is not the set of vectors in E₇ that are perpendicular to a fixed root in E₇, indeed, one obtains D₆ that way. However, E₆ is the subsystem of E₈ perpendicular to two suitably chosen roots of E₈. The root system E₆ has 72 roots.

An alternative description of the E₈ lattice which is sometimes convenient is as the set Γ'₈ of all points in R⁸ such that

• all the coordinates are integers and the sum of the coordinates is even, or
• all the coordinates are half-integers and the sum of the coordinates is odd.

The lattices Γ₈ and Γ'₈ are isomorphic; one may pass from one to the other by changing the signs of any odd number of coordinates. The lattice Γ₈ is sometimes called the even coordinate system for E₈ while the lattice Γ'₈ is called the odd coordinate system.

One choice of simple roots for E₈ in the even coordinate system with rows ordered by node order in the alternate (non-canonical) Dynkin diagrams (above) is:

α_i = e_i − e_i+1, for 1 ≤ i ≤ 6, and

α₇ = e₇ + e₆

(the above choice of simple roots for D₇) along with $${\displaystyle {\mathit{\alpha }}_8={\mathit{\beta }}_0=-\frac{1}{2}\sum _{i=1}^8{\mathbf{e}}_i=(-1/2,-1/2,-1/2,-1/2,-1/2,-1/2,-1/2,-1/2).}$$

One choice of simple roots for E₈ in the odd coordinate system with rows ordered by node order in alternate (non-canonical) Dynkin diagrams (above) is

α_i = e_i − e_i+1, for 1 ≤ i ≤ 7

(the above choice of simple roots for A₇) along with

α₈ = β₅, where

${\mathit{\beta }}_j=\frac{1}{2}\left(-\sum _{i=1}^j{e}_i+\sum _{i=j+1}^8{e}_i\right).$

(Using β₃ would give an isomorphic result. Using β_1,7 or β_2,6 would simply give A₈ or D₈. As for β₄, its coordinates sum to 0, and the same is true for α_1...7, so they span only the 7-dimensional subspace for which the coordinates sum to 0; in fact −2β₄ has coordinates (1,2,3,4,3,2,1) in the basis (α_i).)

Since perpendicularity to α₁ means that the first two coordinates are equal, E₇ is then the subset of E₈ where the first two coordinates are equal, and similarly E₆ is the subset of E₈ where the first three coordinates are equal. This facilitates explicit definitions of E₇ and E₆ as

E₇ = {α ∈ Z⁷ ∪ (Z+1/2)⁷ : Σα_i² + α₁² = 2, Σα_i + α₁ ∈ 2Z},

E₆ = {α ∈ Z⁶ ∪ (Z+1/2)⁶ : Σα_i² + 2α₁² = 2, Σα_i + 2α₁ ∈ 2Z}

Note that deleting α₁ and then α₂ gives sets of simple roots for E₇ and E₆. However, these sets of simple roots are in different E₇ and E₆ subspaces of E₈ than the ones written above, since they are not orthogonal to α₁ or α₂.

F4

For F₄, let E = R⁴, and let Φ denote the set of vectors α of length 1 or √2 such that the coordinates of 2α are all integers and are either all even or all odd. There are 48 roots in this system. One choice of simple roots is: the choice of simple roots given above for B₃, plus ${\mathit{\alpha }}_4=-\frac{1}{2}\sum _{i=1}^4{e}_i$.

The F₄ root lattice—that is, the lattice generated by the F₄ root system—is the set of points in R⁴ such that either all the coordinates are integers or all the coordinates are half-integers (a mixture of integers and half-integers is not allowed). This lattice is isomorphic to the lattice of Hurwitz quaternions.

G2

The root system G₂ has 12 roots, which form the vertices of a hexagram. See the picture above.

One choice of simple roots is (α₁, β = α₂ − α₁) where α_i = e_i − e_i+1 for i = 1, 2 is the above choice of simple roots for A₂.

The G₂ root lattice—that is, the lattice generated by the G₂ roots—is the same as the A₂ root lattice.

The root poset

The set of positive roots is naturally ordered by saying that ${\displaystyle \alpha \le \beta }$ if and only if ${\displaystyle \beta -\alpha }$ is a nonnegative linear combination of simple roots. This poset is graded by $\mathrm{deg}\left(\sum _{\alpha \in \mathrm{\Delta }}{\lambda }_{\alpha }\alpha \right)=\sum _{\alpha \in \mathrm{\Delta }}{\lambda }_{\alpha }$, and has many remarkable combinatorial properties, one of them being that one can determine the degrees of the fundamental invariants of the corresponding Weyl group from this poset. The Hasse graph is a visualization of the ordering of the root poset.