Root Systems Lie Algebras

A root system is any collection of vectors that has properties that satisfy the roots of a semi simple Lie algebra. If g is semi simple, then the root system A, (Q) can be described as a system of vectors in a Euclidean vector space that possesses some remarkable symmetries and completely defines the Lie algebra of g. The purpose of this paper is to show the essentiality of the root system on the Lie algebra. In addition, the paper will mention the connection between the root system and Ways chambers. In addition, we will show Dynkin diagrams, which are an integral part of the root system.

• Lie Algebras
• Root Systems
• Ways Chambers
• Dynkin Diagrams

1. Introduction

A root system in mathematics is a configuration of vectors in Euclidean space that satisfies certain geometric properties. The concept is fundamental in the theory of Lie algebras and Lie groups, especially in the theory of classification and representation of semisimple Lie algebras. Since Lie groups (and some analogues such as algebraic groups) and Lie algebras became important in many parts of mathematics during the twentieth century, the apparently special nature of root systems is inconsistent with the number of areas in which they are applied.

Definition 1.1. A root system ( V , R ) is a finite-dimensional real vector space V wich an inner product (i.e. a Euclidean vector space), such that the following properties hold:

a) The vectors in R span V.

b) If α is in R and c ∈ R , then c α is in R only if c = ± 1 , then R is called a reduced root system.

c) For any two roots α , β , the number

μ α β = 2 ( α , β ) ( β , β )

is integer.

The dimension of V is called the rank of the root system and the elements of R are called roots.

d) Let s α : V → V be defined by

s α ⋅ β = β − 2 ( β , α ) ( α , α )

for β ∈ V . Another calculation also shows that s α preserves the inner product ( _ ; _ ) , i.e.,

( s α ( α ) , s α ( β ) ) = ( α , β )

for α , β ∈ V , that is, s α is in the orthogonal group O ( V ) . Evidently,

det ( s α ) = ± 1 :

Theorem 1.2. Suppose that α and β are linearly independent elements. Then

1. c ( β , α ) c ( α , β ) = 0 , 1 , 2   or   3 .

2. If c ( α , β ) = 0 , then c ( β , α ) = c ( α , β ) = 0 .

3. If ( α , β ) < 0 and ‖ α ‖ ≤ ‖ β ‖ , then c ( α , β ) = − 1 and

c ( β , α ) = − ( β , β ) / ( α , α ) = − 1 , − 2   or   − 3.

4. If ( α , β ) > 0 and ‖ α ‖ ≤ ‖ β ‖ , then c ( α , β ) = 1 and

c ( β , α ) = ( β , β ) / ( α , α ) = 1 , 2   or   3.

5. If ( α , β ) > 0 and ‖ α ‖ ≤ ‖ β ‖ , the − 2 ( α , β ) + ( β , β ) = 0 . If ( α , β ) < 0 and ‖ α ‖ ≤ ‖ β ‖ , then 2 ( α , β ) + ( β , β ) = 0 .

Proof. 1. Since α and β are linearly independent, the Cauchy-Schwartz Inequality implies that

( α , β ) 2 < ( α , α ) ( β , β ) .

Hence

c ( β , α ) c ( α , β ) = 4 ( α , β ) 2 ( α , α ) ( β , β ) < 4

Since c ( α , β ) and c ( β , α ) are integers, we must have

c ( α , β ) c ( β , α ) = 0 , 1 , 2   or   3.

2. Obvious. If c ( α , β ) = 0 , then c ( β , α ) = c ( α , β ) = 0 .

3. If ( α , β ) < 0 and ‖ α ‖ ≤ ‖ β ‖ ,

2 ( α , β ) ( β , β ) > 2 ( β , α ) ( α , α )

So c ( α , β ) > c ( β , α ) . c ( α , β ) c ( β , α ) = − 1 , − 2   or   − 3 . we must have c ( α , β ) = − 1 , whence

2 ( α , β ) = ( β , β ) . Thus

c ( β , α ) = 2 ( β , α ) ( α , α ) = ( β , β ) ( α , α ) .

4. If ( α , β ) > 0 and ‖ α ‖ ≤ ‖ β ‖ , then

2 ( α , β ) ( β , β ) < 2 ( β , α ) ( α , α )

So c ( α , β ) < c ( β , α ) . By Part (1), c ( α , β ) c ( β , α ) = 1 , 2   or   3 . Since c ( α , β ) is the smaller integer factor, we must have c ( α , β ) = 1 , whence 2 ( α , β ) = ( β , β ) . Thus

c ( β , α ) = 2 ( β , α ) ( α , α ) = ( β , β ) ( α , α ) .

5. Suppose that ( α , β ) > 0 and ‖ α ‖ ≤ ‖ β ‖ . Then by Part (4), c ( α , β ) = 1 , so − 2 ( α , β ) + ( β , β ) = 0 . On the other hand, if ( α , β ) < 0 and ‖ α ‖ ≤ ‖ β ‖ , then by Part (4), c ( α , β ) = − 1 , whence 2 ( α , β ) + ( β , β ) = 0 .

The novelty of this work is based on the connection of root systems with Lie algebra. In addition, the importance of Dynkin diagrams and Ways chamebers with the rook system and Lie algebra is shown. Modern pictures and graphs were used with the help of modern tools to more closely convey the appearance and quality of the work.

2. Basic Theory of Root Systems

Theory 2.1. [1] Let V be a finite-dimensional vector space over R equipt with an inner product ( , ) . The Cauchy-Schwartz inequality asserts that

| ( u , v ) | ≤ ‖ u ‖ ‖ v ‖

for u , v ∈ V . It follows that if u , v ∈ V are nonzero, then

− 1 ≤ ( u , v ) ‖ u ‖ ‖ v ‖ ≤ 1

If u , v ∈ V are nonzero, then we define the angle between u and v to be the unique number 0 ≤ θ ≤ π such that

( u , v ) = ‖ u ‖ ‖ v ‖ cos ϑ

The inner product measures the angle between two vectors, though it is a bit more complicated in that the lengths of x and y are also involved. The term “angle” does make sense geometrically.

Proposition 2.2. [2] Suppose that α and β are linearly independent roots and ‖ α ‖ ≤ ‖ β ‖ . Let θ be the angle between α and β. Then we have the following Table 1 & Figure 1.

Proof. Here cos θ = ( α , β ) / ( ‖ α ‖ ‖ β ‖ ) , so | cos θ | = c ( α , β ) c ( β , α ) / 2 . Now c ( α , β ) c ( β , α ) = 0 , 1 , 2 , or 3 and ‖ β ‖ 2 ‖ α ‖ 2 = | c ( β , α ) | . Moreover, cos θ has the same sign as c ( α , β ) . This gives us Table 1 below.

Table 1

c ( α , β ) c ( β , α ) = 0 , 1 , 2 , or 3 and ‖ β ‖ 2 ‖ α ‖ 2 = | c ( β , α ) |

c ( α , β ) c ( β , α )	c ( α , β )	c ( β , α )	‖ β ‖ 2 / ‖ α ‖ 2	cos ϑ	ϑ
0	0	0	−	0	π 2
1	1	1	1	1 2	π 3
1	−1	−1	1	− 1 2	2 π 3
2	2	2	2	2 2	π 4
2	−2	−2	12	− 2 2	3 π 4
3	3	3	3	3 2	π 6
3	−3	−3	3	− 3 2	5 π 6

Lemma 2.3. If 0 < ϑ < π / 2 , then α − β ∈ R .

Proof If 1, 2 or 3 is written as a product of two positive integers, then one of the factors is 1. Up to swapping α and β we can assume that μ β α = 1 . The reflection in α sends β to β − μ β α α , thus β − α ∈ R .

Definition 2.4. Suppose ( V 1 , R ) and ( V 2 , Q ) are root systems. Consider the vector space, V 1 ⊕ V 2 with the natural inner product determined by the inner products on V 1 and V 2 . Then R ∪ Q is a root system in V 1 ⊕ V 2 , called the direct sum of R and Q.

Definition 2.5. A root system ( V , R ) is called reducible if there exists an orthogonal decomposition V = V 1 ⊕ V 2 with dim V 1 > 0 and dim V 2 > 0 such that every element of R is either in V 1 or in V 2 . If no such decomposition exists, ( V , R ) is called irreducible.

Example 2.6. [3] The following Figure 2 shows the root systems of rank 1 and 2. All of them are indecomposable (except A 1 + A 1 ), and reduced (except B C 1 and B C 2 ).

Proposition 2.7. Every root system of the second rank is isomorphic to one of the systems in Figure 2.

Proof: Suppose that V 1 = R 2 ; therefore, let R ⊏ R 2 be the root system. Let be the smallest angle occurring between any two vectors in R. Since the elements of R span R², we can find two linearly independent vectors α and β in R. If the angle between α and β is greater than π 2 , then the angle between α and -β is less than π 2 therefore, the minimum angle is at most π 2 .

3. Root Systems For Classical Complex Lie Algebras

Definition 3.1. A root α ∈ V is said to be simple if α is positive and α is not the sum of two positive roots. The collection Γ of all simple roots is called a simple system of roots.

Lemma 3.2. Let Γ = { α 1 , ⋯ , α n } be a simple system of roots. Then every positive root δ can be written as δ = α i 1 + α i 2 + ⋯ + α i k , where each initial partial sum α i 1 + ⋯ + α i j ( 1 ≤ j ≤ k ) is a root.

Proof. For every positive root δ = ∑ i = 1 n μ i α i , the height of δ is defined to be the positive number ht δ = ∑ i = 1 n μ i We prove this lemma by induction on ht δ. If δ = 1 , then δ is simple and there is nothing to prove. So assume that m > and that the lemma’s conclusion holds for all positive roots of height < m. Now suppose that δ is a positive root of height m. Now apply the induction hypothesis to the root δ − α i , which has height m − 1 . Then δ − α i = α i 1 + ⋯ + α i m − 1 , where each initial partial sum is a root. Then δ = α i 1 + ⋯ + α i m − 1 + α i . Thus δ satisfies the conclusion of the lemma, completing the induction step as well as the proof.

Definition 3.3. The root system Λ is decomposable if Λ is a union Λ = Λ 1 ∪ Λ 2 with Λ 1 ≠ ∅ , Λ 2 ≠ ∅ , and Λ 1 ⊥ Λ 2 .

Definition 3.4. If Γ is a simple system of roots in Λ, we say that is Γ decomposable if Γ is a union Γ = Γ 1 ∪ Γ 2 , with Γ 1 ≠ ∅ , Γ 2 ≠ ∅ , and Γ 1 ⊥ Γ 2 .

Lemma 3.4. Let Γ be a simple system of roots in Λ. Then Λ is decomposable if and only if Γ is decomposable.

Proof. Suppose that Γ is decomposable, with Λ = Λ 1 ∪ Λ 2 For i = 1 , 2 , let Γ i = Λ i ∩ Γ . Then neither Γ 1 nor Γ 2 can be empty. For if, say Γ 1 = ∅ , then Γ 2 = Γ which implies that Λ 1 ⊥ Γ Since Γ is a basis of E, we conclude that Λ 1 ⊥ Λ , and so Λ 1 = ∅ , contradiction.

Conversely, suppose that Γ is decomposable, with Γ = Γ 1 ∪ Γ 2 . We arrange the elements of Γ so that Γ 1 = { α 1 , ⋯ , α r } and Γ 2 = { α r + 1 , ⋯ , α l } . Now let δ ∈ Γ . We claim that δ is a linear combination of elements of Γ 1 or δ is a linear combination of elements of Γ 2 . To prove this claim, we may assume that δ is positive. Now suppose, to the contrary, that δ is a linear combination

δ = ∑ i = 1 n μ i α i + ∑ i = n + 1 j μ i α i

where both sums on the right are nonzero. Without loss of generality, we can assume that α i 1 ∈ Γ 1 . Let s be the smallest integer such that α i 1 ∈ Γ 2 . Then γ = α i 1 + ⋯ + α i s − 1 + α i s is a root.

Now consider the root r i s _ γ . This root equals

r i s _ ( α i 1 + ⋯ + α i s − 1 + α i s ) = α i 1 + ⋯ + α i s − 1 − α i s ,

which is not a linear combination of simple roots with nonnegative integer coefficients, a contradiction. This proves the claim.

Using the claim, we now let Λ 1 be the set of roots which are linear combinations of elements of Γ 1 , and let Λ 2 be the set of roots which are linear combinations of elements of Γ 2 . Then Λ 1 ≠ ∅ , Λ 2 ≠ ∅ , Λ 1 ⊥ Λ 2 , and Λ = Λ 1 ∪ Λ 2 . Thus Λ is decomposable.

Definition 3.5. Let Γ be a simple system of roots in Λ. Then Λ is decomposable if and only if Γ is decomposable.

Example 3.6. [2] Let E be a two-dimensional inner product space. We will show that, up to isometry, there are only three possible indecomposable simple systems of roots Γ on E. Suppose that Γ = { α 1 , α 2 } . Then ( α 1 , α 2 ) ≠ 0 , since Γ is indecomposable. We may assume that ‖ α 1 ‖ ≤ ‖ α 2 ‖ . c ( α 1 , α 2 ) = − 1 and c ( α 2 , α 1 ) = − 1 , − 2   or   − 3 (Figures 3-5).

Let Γ = { α 1 , α 2 } . be a simple system of roots in Λ. We introduce a partial ordering ≺ on Λ as follows: if α , β ∈ Λ , then α ≺ β if and only if β − α = ∑ I μ I α I where each μ I ∈ Z + and at least one μ I is positive. It is clear that ≺ is indeed a partial order on Λ. Of course, ≺ depends on the choice of Λ. Recall that the simple system Λ was obtained via a lexicographic order < on E. Since each simple root α_i is a positive root under <, it is clear that if α and β are roots such that α ≺ β , then α < β . The converse is not true, as there are vectors in Λ which are not comparable under <.

4. Weyl Chambers

Definition 4.1. Let R be a root system in V. The hyperplanes W α subdivide F into finitely many polyhedral convex cones. We recall that each root α ∈ R . The elements of the set

W α = { x ∈ V : ( x , α ) = 0 }

Also, recall that a vector v ∈ V is regular with respect to R if and only if

v ∈ V r e g ( R ) = V − ∪ α ∈ R W α

Evidently, V r e g is an open subset of V. A path component of the space V r e g is called a Weyl chamber of V with respect to R.

If C is a Weyl chamber, then − C = { x ∈ F / − x ∈ C } is also a Weyl chamber. It is called the Weyl chamber opposite to C. A hyperplane P ⊂ F is called a wall of the Weyl chamber C if P ∩ C = ∅ and P ∩ C ¯ contains a nonempty subset open in P.

A subsystem Π of a root system Λ is called a system of simple roots (ora base) of the system n if Π is linearly independent and each β ∈ Λ can be represented in the form

β = ∑ α ∈ Λ     η α α

where η α , are integers, which are simultaneously either nonpositive or nonnegative. In the first case is β said to be positive (β > 0), in the second negative (β < 0) with respect to Π.

Lemma 4.2. [3] For any Weyl chamber C the system Π(C) is a system of simple roots. The roots that are positive (negative) with respect to Pi(C) coincide with C-positive (respectively, C-negative) roots. The correspondence C → Π ( C ) between the Weyl chambers and systems of simple roots is bijective. For any Weyl chamber C, we have

C = { x ∈ V : x ∈ ( x , α ) > 0 ( α ∈ Π ( C ) ) } ,

C ¯ = { x ∈ V : x ∈ ( x , α ) ≥ 0 ( α ∈ Π ( C ) ) } .

The walls of the Weyl chamber C are the hyperplanes W α where α ∈ Π ( C ) .

Proof. The closure of C consists of C and points x ∈ V with x ≠ C such that there exists a sequence ( x n ) n = 1 ∞ of elements of C such that x n → x as n → ∞ Let x be an element of C the this second type. Assume that there exists α ∈ Π ( C ) such that ( x , α ) < 0 . Since ( x n , α ) → ( x , α ) as n → ∞ , there exists a positive integer n such that ( x n , α ) < 0 . This is a contradiction. It follows that C ¯ is contained in { x ∈ V : x ∈ ( x , α ) ≥ 0 ( α ∈ Π ( C ) ) } . Let x be in { x ∈ V : x ∈ ( x , α ) ≥ 0 ( α ∈ Π ( C ) ) } . we need to prove that x ∈ C ¯ . Let x 0 ∈ C . Consider the sequence ( x + ( 1 / n ) x 0 ) n = 1 ∞ Evidently this sequence converges to x and is contained in C. It follows that x is in C ¯ . This proves the first assertion of the lemma. For the second assertion, let v ∈ V . If v ∈ V r e g ( R ) , then v is by definition in some Weyl chamber. Assume that v = 2 V r e g ( R ) . Then v ∉ V r e g ( R ) , Define

p : V → R     by     p ( x ) = ∏ α ∈ R ( x , α )

The function p is a non-zero polynomial function on V, and the set of zeros of p is exactly ∪ α ∈ R P α . Thus, p ( x ) = 0 . Since p is a non-zero polynomial function on V, p cannot vanish on an open set. Hence, for each positive integer n, there exists vn such that ‖ x − x n ‖ < 1 / n and p ( x n ) ≠ 0 . The sequence ( x n ) n = 1 ∞ converges to x and is contained in V r e g ( R ) ; in particular every element of the sequence is contained in some Weyl chamber. Since the number of Weyl chambers of V with respect to R is finite. We have ( x n k , α ) ≥ 0 for all α ∈ Π ( C ) and positive integers k. Taking limits, we find that ( x , α ) ≥ 0 for all α ∈ Π ( C ) , so that x ∈ C ⌣ .

Example.4.3. [3] Using the lexicographic order with respect to the basis composed of the weights ε i , one can easily construct systems of simple roots Π g , in the root systems Δ g , of the classical Lie algebras g,

g = g l n ( C ) of s l n ( C )

Π g = { α 1 , ⋯ , α n − 1 } , where α i = ε i − ε i + 1

Δ g = { ε i − ε j | i < j ; i , j = 1 , ⋯ , n }

The corresponding Weyl chamber consists of the set of diagonal matrices diag ( x 1 , ⋯ , x n ) such that x 1 > x 2 > ⋯ > x n ,

g = s o 2 l ( C ) , l ≥ 2 ;

Π g = { α 1 , ⋯ , α i } where α i = ε i − ε i − 1 ( i = 1 , ⋯ , l − 1 ) , α i = ε i + 1 − ε l

Δ g + = { ε i ± ε j | i < j ; i , j = 1 , ⋯ , l }

g = s o 2 l + 1 ( C ) , l ≥ 1 ;

Π g = { α 1 , ⋯ , α i } where α i = ε i − ε i − 1 ( i = 1 , ⋯ , l − 1 ) , α i = ε i

Δ g + = { ε i ± ε j , ε i | i , j = 1 , ⋯ , l }

g = s p 2 l ( C ) , l ≥ 1 ;

Π g = { α 1 , ⋯ , α i } where α i = ε i − ε i − 1 ( i = 1 , ⋯ , l − 1 ) , α i = 2 ε i

Δ g + = { ε i ± ε j , 2 ε i | i , j = 1 , ⋯ , l }

Lemma 4.4. In this situation, if α and β are not orthogonal then

‖ α ‖ 2 = k ‖ β ‖ 2 , k = 1 , 2 , 3

and

( cos ∠ ( α , β ) ) 2 = ( α , β ) 2 ‖ α ‖ 2 ‖ β ‖ 2 = k 4

Proof: We know that

2 ( α , β ) ‖ α ‖ 2 , 2 ( α , β ) ‖ β ‖ 2 ∈ Z

Taking the product,

4 ( α , β ) 2 ‖ α ‖ 2 ‖ β ‖ 2 ∈ Z

but α and β are neither proportional nor perpendicular, so ( α , β ) 2 ‖ α ‖ 2 ‖ β ‖ 2 = k 4 where k = 1; 2, or 3. Since ‖ α ‖ ≥ ‖ β ‖ , the first term in the first equation is the smaller integer, hence

| 2 ( α , β ) ‖ α ‖ 2 | = 1

Straightforward manipuulations of this imply what we want.

Corollary 4.5. Suppose α,β are distinct simple roots and ( α , β ) ≠ 0 . Then

∠ ( α , β ) = { 120 ˚     k = 1 135 ˚     k = 2 150 ˚     k = 3

with ‖ α ‖ 2 = k ‖ β ‖ 2 , or vice versa.

5. Cartan Matrices And Dynkin Diagrams

Definition 5.1. A system Φ = { α 1 , ⋯ , α s } is said to be admissible if

a i j = ( α i | α j ) is a nonpositive integer for all i ≠ j . The integer square matrix A ( Φ ) = ( a i j ) is called the matrix of the system Φ. Let m i j = a i j a j i and let θ i j be the angle between the vectors γ i and γ j ( i ≠ j ), implies that for an admissible system Φ the numbers m i j and the angles θ i j can assume only the

following values: m i j = 0 , 1 , 2 , 3 , 4 ; θ i j = π ( 1 − 1 μ i j ) , where μ i j = 2 , 3 , 4 , 6 , ∞ , respectively.

Definition 5.2. The Dynkin diagram of an admissible system of vectors is the graph described above in which the edge joining the vertices numbered by i and j ( i ≠ j , m i j > 0 ) is of multiplicity m i j . If ‖ a i j ‖ < ‖ a j i ‖ , then the corresponding edge is oriented by an arrow pointing from the j-th vertex towards the i-th one.

Theorem 5.3. The Dynkin diagrams of the classical simple Lie algebras g are of the following list.

The A_n root lattice—that is, the lattice generated by the An roots—is most easily described as the set of integer vectors in R n + 1 whose components sum to zero (Figure 6).

Example: The A₃ root lattice is known to crystallographers as a face-centered cubic lattice.

Simple roots in A₃

The A₃ root system (as well as other third-order root systems) can be modeled in the Zometool Construction set (Figures 7-9).

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

Example:

B₁ is isomorphic to A₁ via scaling by 2 , and is therefore not a distinct root system (Figure 10).

Simple roots in B₄

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 (Figure 11).

Example:

C₂ is isomorphic to B₂ via scaling by 2 and a 45 degree rotation, and is therefore not a distinct root system (Figure 12, Figure 13).

Simple roots in C₄

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 (Figure 14).

Example:

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

D₄ has additional symmetry called triality. The 24 D₄ root vectors are expressed as the vertices of, a lower symmetry construction of the 24-cell. 72 vertices (Figure 15).

Simple roots in D₄

72 vertices of 122 represent the root vectors of E₆ (Figure 16, Figure 17, Figure 18 & Figure 19).

126 vertices of 231 represent the root vectors of E₇.

240 vertices of 421 represent the root vectors of E₈ (Figure 20, Figure 21).

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 halfintegers is not allowed). This lattice is isomorphic to the lattice of Hurwitz quaternions (Figure 22, Figure 23).

Simple roots in F₄

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

Simple roots in G₂

The root system G₂ has 12 roots, which form the vertices of a hexagram. One choice of simple roots is: ( α 1 , β = α 2 − α 1 ) where α i = e i − e i + 1 for i = 1 , 2 .

Example 5.4. [4] The extended Dynkin diagrams of simple classical Lie algebras are of the following form (each diagram contains n+1 vertices, the right column lists the standard notation for each of the diagrams) (Figure 25):

Lemma 5.5. A Coxeter-Dynkin graph is a tree (Figure 26).

Proof. Suppose, to the contrary, that there are circuits. Let α 1 , ⋯ , α n be the vertices of a minimal circuit.

Since the circuit is minimal, no root α i is connected to a root α j in the circuit unless j ≡ ( i + 1 ) mod n or j ≡ ( i − 1 ) mod n . Suppose now that α i and α j are consecutive roots in the circuit. We claim that

1 2 ( α i , α i ) + 2 ( α i , α j ) + 1 2 ( α j , α j ) ≤ 0

To show this, we may assume that ‖ α i ‖ ≤ ‖ α j ‖ . Then obviously,

1 2 ( α i , α i ) − 1 2 ( α j , α j ) ≤ 0

We have,

2 ( α i , α j ) + ( α j , α j ) = 0

Adding the left hand sides of the last two relations above, we obtain inequality 1 2 ( α i , α i ) + 2 ( α i , α j ) + 1 2 ( α j , α j ) ≤ 0 . Thus, in particular, 1 2 ( α i , α i ) + 2 ( α i , α i + 1 ) + 1 2 ( α i + 1 , α i + 1 ) ≤ 0 for all i = 1 , ⋯ , n , where the index i + 1 is counted modulo n. Adding these inequalities, we obtain

0 ≥ ∑ i ≡ 1 n ( 1 2 ( α i , α i ) + 2 ( α i , α i + 1 ) + 1 2 ( α i + 1 , α i + 1 ) )

∑ i = 1 n ( α i , α i ) + 2 ∑ i ≡ 1 n ( α i , α i + 1 )

On the other hand,

0 ≤ ( ∑ i = 1 n     α i , ∑ i = 1 n     α i )

= ∑ i = 1 n ( α i , α i ) + ∑ i ≠ j ( α i , α j )

∑ i = 1 n ( α i , α i ) + 2 ∑ i ≡ 1 n ( α i , α i + 1 )

by our remark at the beginning of the proof about adjacent vertices. Inequalities 1 2 ( α i , α i ) + 2 ( α i , α j ) + 1 2 ( α j , α j ) ≤ 0 and ∑ i = 1 n ( α i , α i ) + 2 ∑ i ≡ 1 n ( α i , α i + 1 ) , imply that ∑ i = 0 n α i . But this is a contradiction since the α i are linearly independent.

Lemma 5.6. In a Dynkin diagram, suppose that roots γ and δ are joined by a simple edge. Then the configuration resulting from the deletion of γ and δ and replacement by the single root γ+δ, and then joining γ+δ to all roots connected to γ or δ by the same types of edges as γ or δ is also a Dynkin diagram.

Proof. Note first that since γ and δ are connected, we have ( γ , δ ) ≤ 0 and thus γ + δ is a root. Moreover, since c ( γ , δ ) = c ( δ , γ ) = − 1 , we have ( γ , γ ) = ( δ , δ ) and 2 ( γ , δ ) + ( γ , γ ) = 1 . Hence ( γ + δ , γ + δ ) = ( γ , γ ) .

Let S be the collection of roots β in the Dynkin diagram such that β ≠ γ , β ≠ δ , and β is connected to γ or δ.

So let β ∈ S . Without loss of generality, we can assume that β is connected to γ. Then ( δ , β ) = 0 , and so c ( γ + δ , β ) = c ( γ , β ) .

Moreover,

c ( β , γ + δ ) = 2 ( β , γ + δ ) ( γ + δ , γ + δ ) = 2 ( β , γ ) ( γ , γ ) = c ( β , γ ) .

Hence

c ( γ + δ , β ) c ( β , γ + δ ) = c ( γ , β ) c ( β , γ ) .

This shows that the number of bonds in the edge joining β and γ + δ is the same as the number of bonds in the edge joining β and γ.

Finally, since ‖ γ + δ ‖ = ‖ γ ‖ , the direction of the edge joining β and γ + δ is the same as the direction of the edge joining β and γ (Figure 27).

Example

6. The Future Perspective of This Paper

The future of this work is related to dealing with Lie algebras. The beauty of this science is learned every day by doing as much research and work on it as possible. The close connection with other mathematical disciplines creates abundant opportunities for further research and dealing with what our work is in the future. The primary goal of the paper was to be useful to anyone studying Lie algebra. In addition, this paper shows the influence of Dynkin diagrams on the root system, and the beauty of their diagram, as a close connection with Ways chambers.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

1. Roberts, B. (2018-2019) Lie Algebras. University of Idaho, Moscow. https://www.webpages.uidaho.edu/~brooksr/liealgebraclass.pdf

2. Gonzalez, F.B. (2007) Lie Algebras. https://fgonzale.pages.tufts.edu/lie.algebras.book.pdf

3. Hasic, A. (2021) Introduction to Lie Algebras and Their Representations. Advances in Linear Algebra & Matrix Theory, 11, 67-91. Introduction to Lie Algebras and Their Representations (scirp.org)https://doi.org/10.4236/alamt.2021.113006

4. Onishchik, A.L. and Vinberg, E.B. (Eds.) (1990) Lie Groups and Lie Algebras III. Structure of Lie Groups and Lie Algebras. VINITI, Moscow. https://books.google.me/books?id=l8nJCNiIQAAC&printsec=frontcover&source=gbs_ge_summary_r&cad=0#v=onepage&q&f=false

5. Wikipedia (2023) Root System. https://en.wikipedia.org/wiki/Root_system