In the semisimple Lie algebra convention, an abstract root system is a finite subset of a finite-dimensional real Euclidean space with the following properties: it spans , does not contain zero, is reduced, is invariant under each of its root reflections, and satisfies crystallographic integrality. More explicitly, for every ,
Here is a positive-definite inner product. The first condition is reducedness, the second gives closure under root reflections, and the last number is a Cartan integer. The rank is . A simple root basis is a basis of consisting of roots such that each root has integral coordinates that are either all nonnegative or all nonpositive. The two signs distinguish positive and negative roots. The diagrams in this problem concern these reduced crystallographic root systems; broader definitions sometimes omit one of these conditions.
Put and let denote a matrix unit. The antidiagonal matrix satisfies , so the orthogonal condition is , or entrywise . Consequently the diagonal Cartan subalgebra is
We first take . Since , the matrix root basis of the even orthogonal Lie algebra gives
The zero weight space is ; its basis is . No vector of weight occurs, because the corresponding matrix unit is forced to be its own negative. These spaces account for dimensions, exhausting the Special orthogonal Lie algebra. Thus its decomposition as a -module and its Dn root system are
Each nonzero root space has dimension one; the zero weight has multiplicity .
The upper triangular root spaces are precisely those of weights and with . Therefore
These roots form the simple roots. To check that they generate the chosen positive system with nonnegative coefficients, write . For ,
and for use . Empty sums are zero. Their linear independence and these expansions identify the base of the root system.
Equip the real span of the roots in with the inner product making the orthonormal. All roots then have squared length two. The coroots of are , so the fundamental weights of Dn, characterized by , are
Taking their pairings with and verifies the defining identities directly. For each pair , the sum of its two positive roots is . Hence the half-sum of positive roots is
The Dynkin diagram has a chain ending at , which is joined to both and . Every edge is a single bond because the root lengths agree; the nonzero off-diagonal simple-root pairings are minus one. The labelled Dn Dynkin diagram and its low-rank versions are shown below.
Figure 1.
Labelled D-type Dynkin diagrams, including the low-rank cases
. Details.
For , and are orthogonal, giving two disconnected A1 root systems. For , the diagram is the chain , of type A3 root system; the displayed weight formulas still apply. If is allowed, is one-dimensional and abelian: there are no roots or fundamental weights, and .
The Weyl group acts on the weight lattice by its root reflections and extends to ring automorphisms of the group ring of a weight lattice:
Weights and their multiplicities in a finite-dimensional Lie algebra representation of a semisimple Lie algebra are permuted by this action, so its formal character is Weyl-invariant.
Choose a set of positive roots and put
Here are the fundamental weights, and , where the Coxeter length counts positive roots carried to negative ones. For a dominant integral weight , let denote the finite-dimensional Irreducible Lie algebra representation of highest weight . The Weyl character formula is
The second denominator expression is the Weyl denominator formula. Both alternants change sign under each root reflection; their quotient is invariant. Although written as a fraction, the theorem asserts that it is a finite element of with the nonnegative coefficients given by weight multiplicities. The highest-weight classification specifies which label the irreducibles, while the root system and choice of positive roots determine every other term.
Work with a finite-dimensional complex semisimple Lie algebra. The Dynkin diagram is obtained from its intrinsic root system, with several structure theorems entering the construction.
First choose a Cartan subalgebra . The semisimple structure theory gives the root-space decomposition
The nonzero roots span , root spaces have dimension one, and every root has its negative. The rank is .
Next use the Killing form. Its nondegeneracy on and its positive-definite restriction to the real coroot span identify the real root span with a Euclidean space. Explicitly, if , put . The sl2 subalgebra associated with a root supplies its normalized coroot and the integral pairing
The root-string theorem makes the reflection permute . Together with the absence of multiples other than , this shows that is a finite reduced root system and a crystallographic root system. These properties come from semisimple Lie algebra theory, not from the diagram's definition.
Choose a vector in that is not perpendicular to any root. Define the positive roots by positive inner product with this vector. The simple roots are those positive roots that cannot be expressed as sums of two positive roots. Root-system theory shows that they form a basis , and each root is an integer combination of them with coefficients all of one sign. Distinct simple roots have nonpositive inner product.
Use the standard Cartan matrix convention
There is one diagram vertex for each simple root. For , the integral off-diagonal entries are nonpositive and
Connect the two vertices with respectively zero, one, two or three edges. The corresponding angles are . A multiple edge carries an arrow toward the shorter root. For joined vertices, the length ratio is determined by ; hence the diagram records both angle and relative length.
For example, has simple roots and , giving two equal-length vertices joined by one edge: type . For , take and . Then
so the two vertices have a double edge directed toward , the shorter root: type .
Finally, orthogonal irreducible components of the root system correspond to the simple ideals of a Lie algebra in the semisimple Lie algebra, so its diagram is the disjoint union of their connected diagrams. Conjugacy of Cartan subalgebras and the Weyl group action on choices of positive roots make the resulting diagram independent of these choices up to isomorphism. Thus the vertices, edge multiplicities, arrows and connected components encode the simple-root geometry and the simple-ideal decomposition.
Choose a fundamental system of a root system . Distinct simple roots have nonpositive inner product. Their Cartan matrix has diagonal entries two and off-diagonal entries , where either , or are positive integers. The root-system finiteness lemma gives . After exchanging the simple roots, the possibilities are
Their angles and relative lengths determine the two simple roots up to an orthogonal transformation and common scaling, except that the two orthogonal components can be scaled separately.
To see that no extra roots remain unspecified, write a positive root with nonnegative integer coefficients. If it is not simple, some simple root has : otherwise . The root reflection in subtracts a positive integer multiple of . The other coordinate stays nonnegative; since is not proportional to , it is positive, so the reflected root must still be positive by the defining sign property of a fundamental system of a root system. Its height decreases. Repeating reduces to a simple root. Thus every root is in a Weyl group orbit of a simple root.
For the four matrices, applying their simple reflections gives, respectively, the following positive roots:
where in the last two rows is long, short. For example, and for the displayed matrices when the convention is . The sets comprising these positive roots and their negatives are invariant under both reflections, as direct substitution verifies. The height argument therefore shows they are the whole root system. This proves the classification of rank-two root systems:
Use the course convention that a root system is finite and is a reduced root system satisfying the crystallographic root system condition. These hypotheses are essential for the angle restriction. For roots , the two Cartan integers
satisfy . If are not parallel, the strict Cauchy-Schwarz inequality and integrality give . These values give angles , or , or , and or , respectively. If the roots are parallel, reducedness implies , giving or . Therefore
Here are examples accounting for every angle. In the A1 root system, the pairs and give . Two roots from different summands of give . The six unit vectors at angles form an A2 root system: taking one root at angle zero and another at or gives those two angles. In the B2 root system , pair with or to obtain . In a G2 root system, take short unit roots at angles and long roots of length at angles . A short root at zero paired with long roots at gives the remaining angles.
A Dynkin diagram has one vertex for each simple root. Vertices are joined by bonds, where are the off-diagonal Cartan integers. No bond means orthogonality; one, two and three bonds mean angles . A multiple-bond arrow points to the shorter root. Thus the Dynkin diagram determines the Cartan matrix, including the relative lengths inside each connected component.
An irreducible root system corresponds to a connected Dynkin diagram. The classification of finite crystallographic Dynkin diagrams gives
Here is already represented by , and by . General systems are orthogonal direct sums of these, with separate component scales. The following diagrams specify all the types; dots denote a continued chain, not additional vertices.
Figure 1.
Finite irreducible crystallographic Dynkin diagrams, with every arrow pointing toward the shorter root
. Details.
For orientation, the An Dynkin diagram is a single chain, the Bn Dynkin diagram has a terminal double bond pointing to its terminal short root, and the Cn Dynkin diagram reverses that arrow. The Dn Dynkin diagram has arm lengths . The En Dynkin diagram has arm lengths ; ; or . The F4 Dynkin diagram has a central double bond and the G2 Dynkin diagram a triple bond.
The positivity behind this finite list is the positive-definite Gram matrix of the simple roots. In particular the underlying graph is a tree: if it contained a cycle, the sum of its normalized roots would have squared norm at most zero, since each bonded inner product is at most . This contradicts linear independence. Restricting the possible bonds and branches by positive definiteness gives precisely the listed chains and trees. Conversely their Cartan matrices are positive definite after symmetrization and their reflection-generated root sets give the indicated finite root systems.
Work in finite dimension over ; the characteristic-zero real version follows by complexification. The Cartan solvability criterion is
Its semisimplicity consequence, also often called Cartan's criterion, is is semisimple if and only if its Killing form is nondegenerate. We prove both forms.
The auxiliary results used are as follows. The Lie theorem simultaneously triangularizes every finite-dimensional representation of a complex solvable Lie algebra. The Engel theorem says that a matrix Lie algebra consisting entirely of nilpotent endomorphisms has a common annihilated nonzero vector and a basis making all its matrices strictly upper triangular; in particular it is a nilpotent Lie algebra. Nilpotent means that the lower central series terminates, which implies that the derived series terminates as well. Finally, the Additive Jordan decomposition writes any complex endomorphism uniquely as , where is diagonalizable, is nilpotent and they commute. On a generalized eigenspace , the two parts are and , and both are polynomials in . On endomorphisms, is diagonalizable, is nilpotent, and these are the Jordan parts of : the first assertion follows by splitting into maps between eigenspaces, and the second by expanding repeated commutators with the nilpotent .
First prove the linear trace version: if and
then is solvable. Fix and let be its generalized eigenspace decomposition. Define to act on by the scalar . We do not assume that , or belongs to .
On , has the form with nilpotent, whereas is multiplication by . Choose a polynomial with for every occurring eigenvalue difference , and with all its derivatives of positive order up to the relevant nilpotency index zero at . Such a polynomial exists by Hermite interpolation, or the Chinese remainder theorem for the pairwise coprime powers of . At its value is zero, so . Expanding now gives
Because and is an ideal, every positive power of sends into . The zero constant term therefore gives .
Express as a sum of commutators with . Cyclicity of trace and the hypothesis imply
But on , has trace , since the nilpotent part has trace zero. Hence
forcing every eigenvalue of to vanish. Thus every member of the derived algebra is a nilpotent endomorphism. By the Engel theorem, is nilpotent and therefore solvable; its derived series terminates, and adjoining the initial term shows that is solvable.
Conversely, if is solvable, the Lie theorem makes it upper triangular. Commutators of upper-triangular matrices have zero diagonal, and multiplying such a commutator by an upper-triangular matrix still has zero diagonal. Therefore the trace condition holds. Apply this equivalence to . Its trace pairing is the Killing form, and solvability of its image is equivalent to solvability of : the kernel is its abelian centre, so a terminating derived series in the quotient terminates after at most one more step in . This proves the solvability criterion.
For the semisimplicity criterion, let be the radical of the Killing form. Invariance makes a Lie algebra ideal. For , their adjoint actions on vanish, so computing trace in a basis adapted to gives . The solvability criterion applied to shows it is a solvable ideal. Thus a semisimple Lie algebra has and a nondegenerate Killing form.
Conversely, any nonzero solvable ideal has a last nonzero term in its derived series; this is an abelian ideal of . For , , the map sends into and vanishes on , so has trace zero. Hence . A nondegenerate Killing form therefore rules out nonzero solvable ideals, exactly the definition of semisimplicity.
For classification, nondegeneracy of the Killing form provides the duality and root-space pairings used to extract a reduced crystallographic root system from a semisimple Lie algebra. Classification then reduces to the finite Dynkin diagrams and reconstruction of the Lie algebra from its root data.
A reduced crystallographic abstract root system in a finite-dimensional real inner product space is a finite set such that: it spans and does not contain zero; the only scalar multiples of belonging to are ; every root reflection
permutes ; and each Cartan integer is integral. These are the crystallographic and reduced conventions appropriate to roots of a complex semisimple Lie algebra. Without crystallographic integrality, the numerical restrictions in the following subparts would not hold.
There is an exception to the printed assertion: for , the inner product is negative but is not a root. This already occurs in the rank-one root system .
For the intended assertion, assume . By the preceding list, at least one of equals . If the first does, the reflection axiom gives
If the second does, use instead. Thus the precise reusable conclusion is
This proves that obtuse nonopposite roots have a root sum directly from the reflection and integrality axioms, without appealing to the classification of root systems.
Work with a complex semisimple Lie algebra and its root system in the real span of the roots of a root system. The Killing form induces a positive definite inner product on this real root space, after the usual identification with the dual of the real span of the coroots. For each root , its Weyl reflection is
The Weyl group is . The structural facts being used are that these reflections preserve the finite root system, that the roots span , and that the reflections in the simple roots already generate . Thus is finite: it acts faithfully as permutations of . Equivalently, it is the normalizer of the Cartan subalgebra modulo its centralizer in the associated adjoint group.
Use the weight of a representation convention from Question 1: , with simple roots and . This identification is necessary: the general preceding setup does not by itself specify which root system the symbols refer to.
The Weyl group is , acting by permutations of the . Let and , with composition read from right to left. Then
Hence
For direct verification, the diagonal coefficients of are , so its two Dynkin labels are and , both strictly positive. Thus is in the open Weyl chamber. The original three coefficients are distinct, so its stabilizer is trivial and this permutation is unique.
In the finite-dimensional complex semisimple Lie algebra setting implicit in this root-system construction, the given Cartan subalgebra and root spaces determine a reduced crystallographic root system . The ordering divides into positive roots and their negatives. The simple roots are the positive roots that cannot be written as a sum of two positive roots; a standard root-system fact is that they form a basis and that every positive root is a nonnegative integral combination of them.
Index the simple roots as and form the Cartan matrix
For , these entries are nonpositive integers and . Construct one vertex per simple root and join distinct vertices by lines. If root lengths differ, direct the arrow toward the shorter simple root. This labelled and oriented graph is the Dynkin diagram. Its unoriented Coxeter graph is admissible: normalizing the simple roots to unit length gives . A general Lie algebra without the semisimple root-system hypotheses need not produce such a diagram.
Let be a complex semisimple Lie algebra, choose a Cartan subalgebra and positive root system , and put . For a dominant integral weight , let be the finite-dimensional highest-weight representation with highest weight . The Weyl dimension formula is
Here is the coroot, the pairing is between a weight and a coroot, and is the Weyl vector. The inner product can be any Weyl group invariant normalization on each simple factor: its scaling cancels from the ratios. The dominance condition means that is a nonnegative integer for each simple root.
Equip with the inner product defining the root system, so the Weyl group acts by orthogonal transformations. As usual, the root system spans its ambient space . Let be an invariant subspace for the reflection representation of a Weyl group. Its orthogonal complement is also invariant.
For a root , the Weyl reflection satisfies
If for every , then . Otherwise choose with . Both and belong to , and their difference is a nonzero multiple of , so . Hence
The two sets are mutually orthogonal and individually closed under their root reflections. If both were nonempty, this would decompose into two orthogonal root systems, contradicting that it is an irreducible root system. All roots therefore lie in one of the two subspaces. Because they span , either or , the latter giving . Thus the reflection representation is an irreducible representation.