The appropriate abstract object is a finite reduced crystallographic root system in a real inner product space . Its axioms are: is finite, spans , and does not contain zero; for , ; each root reflection
permutes ; and every Cartan integer is an integer. The restriction to a reduced root system and crystallographic integrality distinguishes roots of complex semisimple Lie algebras from more general reflection configurations.
For any two roots of a root system, the Cauchy-Schwarz inequality gives
If the inner product is zero, both Cartan integers vanish. Otherwise their signs agree, and the absolute value of each is a positive integer. Dividing their product by an integer of absolute value at least one proves
For nonproportional roots the product is strictly less than four. In a reduced root system, proportional roots are just and have Cartan integers , so the printed bound is intentionally looser than the resulting bound of three.
A fundamental system of a root system is a basis of made of roots, such that each root is an integer combination of with either all coefficients nonnegative or all nonpositive. Its members are the simple roots. Suppose distinct had . Then
has a positive coefficient of and a negative coefficient of , contradicting the defining sign condition. Thus . Distinct simple roots are linearly independent, so their Cartan-integer product is strictly less than four. Combining integrality and the sign condition gives
Here nonpositive is the intended sense of the printed convention that includes zero among “negative” numbers; orthogonal simple roots really do give zero.
To form a Dynkin diagram, place a vertex at each simple root. Join two vertices by bonds, hence zero, one, two or three. A multiple bond has an arrow toward the short root. Indeed determines the squared length ratio, and the diagram with the Cartan matrix reconstructs the angles and relative lengths. A single bond joins equal-length roots.
The connected finite Dynkin diagrams are the following. The descriptions include bond multiplicities and arrow directions, so distinguish dual diagrams:
There are no other connected finite Dynkin diagrams. Low-rank conventions also identify and ; is disconnected, so introduces no further connected type. Affine diagrams are outside this finite classification.
Finally suppose the underlying graph contained a cycle on distinct simple roots . Put . Any bonded pair has
and all other distinct pairs have nonpositive inner products. The cycle contributes at least bonded pairs, so
But the simple roots, and hence these normalized vectors, are linearly independent, making the displayed sum nonzero. Positive definiteness gives a contradiction. Thus the underlying graph of a finite Dynkin diagram has no cycle. This acyclicity of a finite Dynkin diagram argument also excludes cycles with extra chords or multiple bonds; multiple bonds themselves are not treated as two-edge cycles.
Let be the coroots. With a chosen set of simple roots, the root lattice and weight lattice are
The fundamental weights are defined by , and form an integral basis of . We use the Cartan matrix convention .
For the A2 root system, inversion of its Cartan matrix yields the A2 fundamental weights and weight lattice:
Equivalently and . The root lattice has index three in the weight lattice, since the change-of-basis matrix has determinant three. For a planar realization take
The weight lattice is triangular. In fundamental weight coordinates , a point is in the root lattice exactly when is divisible by three. The following sketch marks both bases and the sublattice:
The integers called Dynkin indices here are the Dynkin labels of the highest weight:
For finite-dimensional Irreducible Lie algebra representations, they are nonnegative integers. All weight coordinates below are these Dynkin label coordinates, not simple-root coordinates.
A weight-string enumeration algorithm gives the set of weights without their weight multiplicities. Begin with and process known weights by increasing height below . For each simple root and known weight , find the largest with a weight; all such higher weights have already been processed. The weight string theorem says that the string has endpoints , , with
and includes every intermediate step. Append and repeat until no new weights appear. This terminates in finite dimension and supplies all weights; every nonhighest weight can be reached by simple-root lowering. A string can contain contributions from several sl2 summands, so the resulting set does not by itself determine weight multiplicities.
For the explicit calculation we use the following general facts: finite-dimensional representations of a complex semisimple Lie algebra are completely reducible by the Weyl complete reducibility theorem; the symmetric powers of the defining sln representation are irreducible of highest weight ; and weights in a tensor product of Lie algebra representations add with multiplicities multiplied. We also use the highest-weight representation classification: each finite-dimensional irreducible has a unique dominant integral highest weight, and a nonzero vector killed by all simple-root raising operators supplies an irreducible summand with that highest weight in a completely reducible module. For , the Weyl dimension formula specializes to
For , the defining fundamental representation has weights . Thus the A2 representation of highest weight (2,0) is , with the six distinct weights
Each has multiplicity one: these are the weights of the six quadratic monomials.
For the tensor square of the A2 representation of highest weight (2,0), add every ordered pair of elements of . To list the complete answer compactly, define four disjoint weight sets:
The tensor product has multiplicity one at each point of , two at each point of , three at each point of , and four at each point of . These fifteen distinct weights account for states.
We next identify the irreducible summands rather than just their dimensions. Split the tensor square of the six-dimensional space into its symmetric power and exterior power, of dimensions and . The square of a highest-weight vector in the symmetric part has highest weight , giving of dimension .
Let be vectors of weights and . In the exterior part has weight and is killed by both simple-root raising operators: raising along gives a multiple of , whose wedge with itself is zero, and the other raising actions vanish. Thus it is a highest-weight vector. The Weyl dimension formula gives , so the entire exterior part is this irreducible summand.
The remaining symmetric part has dimension six. To identify it, the fifteen weights of are exactly
each once. Subtract them from the unordered-pair weights of . The residual weights are , each once, with highest weight . They are the negatives of , so this six-dimensional summand is . Consequently
The corresponding dimensions are ; complete reducibility and the exhibited highest weights ensure that no summands are missing.
The full weight multiplicities in the A2 tensor square of highest weight (2,0) are summarized below. An entry is the multiplicity of each individual weight in that row's set:
Thus has all fifteen weights once, has the six weights once, and has its nine boundary weights once and its three interior weights twice. Only the three interior weights of are degenerate among the irreducible components.
For a complex finite-dimensional simple Lie algebra, a Cartan subalgebra is a maximal commuting subalgebra of elements whose adjoint maps are semisimple. Equivalently in this setting it is a nilpotent self-normalizing subalgebra. Its dimension is the rank of a semisimple Lie algebra. Simultaneous diagonalization of its Adjoint representation gives the root-space decomposition
A root of a root system is a nonzero linear functional for which this root space is nonzero. For a complex semisimple algebra each root space is one-dimensional. A Cartan-Weyl basis consists of a basis of and one nonzero root vector for every root.
The general Lie brackets have the form
For the opposite-root bracket, use the Killing form to define by . Its invariant bilinear form on a Lie algebra property gives
One may normalize the root vectors so that the pairing is one. If instead one uses a coroot as the opposite-root bracket, the root-vector normalization changes accordingly. In particular, root evaluation coordinates cannot simply be used as coefficients in a nonorthonormal Cartan basis.
For the matrix calculation take . The complexification of a Lie algebra of the special unitary group Lie algebra is the special linear Lie algebra : traceless complex matrices. Its Cartan subalgebra consists of traceless diagonal matrices. Write for the matrix units. The given Cartan basis is , , and the other basis elements are with .
The matrix-unit identity gives
Thus all the roots, expressed as evaluation vectors in this precise Cartan basis, are
They are the functionals on traceless diagonal matrices; there are of them. The corresponding root vector is . Together with Cartan generators, they give basis elements. The simple roots can be chosen as , whose evaluation vectors are the rows of the type- Cartan matrix, with on the diagonal and on adjacent entries. These vectors are evaluations on , not coordinates in an orthonormal realization of the root system.
To express every bracket strictly in the chosen basis, introduce the abbreviation
Then all pairs are covered by
Here both input root vectors have distinct row and column indices. The first case is the only one producing diagonal matrix units, and the displayed sum of resolves them completely into the chosen Cartan basis. Reversing the order gives the negative bracket. This also shows explicitly that the two nonzero non-Cartan cases have structure constants and , and verifies the required root-addition rule.
Use the wiki's Cartan matrix convention
Label the long simple root first when the lengths differ. The matrix of an irreducible rank-two root system has the form , where are positive integers. Integrality and the signs follow from the Cartan integers for distinct simple roots, and irreducibility rules out a zero off-diagonal pair. Its positive-definite symmetrization gives , equivalently . Moreover . Thus , giving the entire classification of rank-two root systems relevant to a simple algebra:
These correspond to , , and the exceptional algebra . Here denotes the Isomorphism between so5 and sp4, not an additional case. The disconnected system corresponds to a semisimple but nonsimple algebra and is excluded.
The Dynkin diagrams, with nodes in the same order as the matrices, are
The second and third diagrams have two and three bonds respectively, with the arrowhead pointing to the short root . In the last diagram draws the three bonds and their arrowhead.
To enumerate roots, use the standard root string theorem: for , the roots are consecutive from through , with . Also use the standard results that the root system is reduced, every root is conjugate under the Weyl group to a simple root, and each root space has dimension one.
Write . Since a difference of simple roots is not a root, the -string starting at has and . It produces . The -string starting at has . In type , the further string through has
and is not a root, so it also produces . The resulting positive roots are
All roots are these and their negatives. To check completeness, the simple root reflections act on coordinates by
Each listed set together with its negatives is stable under both reflections. It contains the simple roots and consists of roots already forced by strings. Since every root lies in a Weyl orbit of a simple root, no other roots can occur. This proves the lists for the A2 root system, B2 root system, and G2 root system. The root-space decomposition then gives
For the restriction to a sl2 subalgebra associated with a root, normalize its Cartan element to be . On a root vector of root , its eigenvalue is . The classification of finite-dimensional sl2 representations says that has weights and dimension . A root string of nonparallel roots therefore supplies one such irreducible module: the raising and lowering brackets connect its consecutive root spaces.
For clarity, the positive-side strings for each simple-root direction are listed below. Brackets denote the whole consecutive string; a single listed root is a string of length one. In every row also include each negative string in reverse order, and separately the triple formed by the root , its negative, and .
The root's own triple is always . The one-dimensional subspace of annihilated by commutes with this subalgebra and gives . Each singleton root in the table, and its negative, contributes another . Reading the other string lengths now gives the adjoint branching to root sl2 subalgebras in rank two:
Their dimensions are respectively . The last row agrees with G2 adjoint branching to a short-root sl2 subalgebra. All labels in the table are highest weights, rather than dimensions.
A convenient root basis is
The corresponding Cartan matrix is
Thus the Dynkin diagram is the three-node chain, with a double edge between and and its arrow pointing toward the shorter root .
The Weyl reflection formula , together with the Cartan matrix, gives
These are the images of every simple root under each simple reflection.
The root lattice is . The weight lattice is
Because every Cartan integer is integral, . The Dynkin labels of are
There are three isomorphism classes of complex simple rank-three Lie algebras: types A3 root system, B3 root system, and C3 root system. Use the convention , and order the chain as ---- with .
  • For , take , , and . The double-edge arrow points to the short third root, and
  • For , take , , and . The double-edge arrow points to the short second root, and
The Dynkin labels of a finite-dimensional irreducible representation are those of its highest weight. Thus means the fundamental representation . The weights, written in Dynkin labels and in a lowering order, are
For these are the weights of the defining representation of ; for they are in the vector representation of ; for they are in the defining representation of . Hence the requested dimensions are , , and , respectively.
The squared root lengths and inner product are
With , the Cartan matrix is
This is the Cartan matrix of the G2 root system, with short and long.
A Cartan subalgebra of a complex semisimple Lie algebra is a maximal commuting subalgebra consisting of semisimple elements. A nonzero functional is a root when its space in the root-space decomposition
is nonzero. A Cartan-Weyl basis combines a basis of with root vectors .
A choice of regular hyperplane divides roots into positive and negative roots. The simple roots are the positive roots that are not sums of two positive roots; they form a basis of the real root span. The Cartan matrix is
up to the equivalent transposed indexing convention.
For ordered simple roots, the Cartan matrix is . It determines their relative lengths and angles.
For simple roots , the Cartan matrix is
Its diagonal entries are two, while its off-diagonal entries encode the angles and relative lengths in the Dynkin diagram.
With and roots labeled from left to right, the three Cartan matrices are
Rank-one root system 2026-10-05
A reduced root system of rank one is . Its fundamental weight is , and its Weyl group has two elements. Its ordinary Dynkin diagram has one node; adjoining gives affine Cartan matrix , drawn as a double bond between equal-length roots.