Fundamental weights of sl3 Created 2026-10-07 Updated 2026-10-14
For the special linear Lie algebra with upper triangular positive roots, the simple coroots are and . Their dual fundamental weights are and . In simple-root coordinates, and . The primitive vectors and realize these Fundamental representations of sl3.
The Kostant partition function counts nonnegative integer combinations of the positive roots of a root system, without ordering the summands. Multiply the formal geometric series for every positive root. The coefficient of counts precisely these combinations. Every coefficient is finite because a linear functional strictly positive on the positive roots bounds every participating integer coefficient. The sign of each exponent in the cancelling product must agree with that of this series.
Highest root Created 2026-09-24 Updated 2026-10-03
The highest root is the maximal positive root in the root order determined by the simple roots.
Minuscule weight 2026-10-05
A dominant integral weight is minuscule when its irreducible highest-weight representation is a minuscule representation. Equivalently, for every positive root . This convention includes the zero weight and its trivial Lie algebra representation.
Negative root 2026-10-14
After choosing positive roots in a root system, a negative root is the negative of a positive root. Equivalently, for a regular linear functional defining the positive roots, its value on a negative root is negative. Relative to the associated simple roots, the coefficients of a negative root are all nonpositive integers.
Order the simple roots of the G2 root system with long and short. This ordering is consistent with the supplied projection in solution; reversing the nodes would interchange the two fundamental Dynkin labels. Choose , , and . With the same row convention for the Cartan matrix as in solution,
The positive roots, with their Dynkin labels, are
For the highest weight , a lowering chain is
The middle three terms form the length-three weight string for the short simple root. The Weyl dimension formula, with this long-first convention, is
It gives seven for , so the chain exhausts the weight system, with every weight multiplicity equal to one:
For , observe that is the highest root. Thus this is the Adjoint representation; the twelve root spaces contribute the twelve nonzero weights once, and the rank-two Cartan subalgebra contributes two zero weights. Therefore
The same Weyl dimension formula gives fourteen, confirming the count.
Write , with , and let be the highest weight. The positive roots are , and , and the Weyl vector is . The Weyl dimension formula gives
For the quadratic Casimir operator, use the root-length normalization . Substituting the Gram matrix in solution yields
Taking the trace of the defining quadratic Casimir operator identity gives , where is the Dynkin index in the matching normalization. Therefore
In particular and . The common particle-physics convention uses and , giving and . The subsequent discrete gauge anomaly congruences use the integer Dynkin index , while the sign test for the supplied beta function is independent of a common rescaling of all indices.
Use the convention . For a finite reduced crystallographic root system, diagonal entries are two and off-diagonal entries belong to , with . Transposing this convention merely transposes the Cartan matrix.
The -string through has the consecutive roots , where and . For distinct simple roots , the negative step is absent, so and .
The matrix determines each simple reflection on the simple-root basis:
It therefore determines their generated Weyl group as linear transformations. Every root is in the Weyl orbit of a simple root. For a positive nonsimple root , some is positive because . Its reflection subtracts a positive integer multiple of and lowers height. It stays positive unless the root is simple, since the other simple-root coefficients are unchanged and at least one is positive. Induction on height reaches a simple root; negative roots follow by sign. Hence , which is completely reconstructed by those reflection matrices. This determines the system up to root-system isomorphism, rather than fixing an absolute length scale; irreducible components may be rescaled.
For positive roots for a chain Cartan matrix, symmetry and adjacency imply all simple roots have equal length; normalize their squared lengths to two. Adjacent inner products are minus one and all others zero. Since every root is Weyl-conjugate to a simple root, every root also has squared length two. Write a positive root as with nonnegative integers , and set . Then
There must be exactly two nonzero integer differences, one and one . Nonnegativity and the two zero endpoint values imply that the coefficients are one on one consecutive interval and zero elsewhere.
Conversely a single simple root is a root. If is a root and , its pairing with is minus one. Reflecting in therefore adds that simple root, making the next longer interval a root. Induction constructs every interval. Thus
A base of a root system is a vector-space basis of the ambient Euclidean space such that every root is an integer combination of its elements with all coefficients nonnegative or all nonpositive. The corresponding nonzero nonnegative combinations are the positive roots.
If distinct had positive inner product, the allowed root-difference fact would make a root. Its simple-root coefficients have opposite signs, contradicting the definition. Hence distinct simple roots have nonpositive inner product.
For a positive root which is not simple, the identity gives a simple root with and . The allowed fact makes a root. Its coefficients remain nonnegative, and it is nonzero because is not simple. It has smaller height . Induction expresses it as a sum of simple roots with each partial sum a root; appending gives the required expression for .
Finally, reflection in a simple root changes only that root's coefficient:
For positive , at least one other simple coefficient is positive: in a reduced root system the only positive root on the line of is itself. That other coefficient is unchanged. The reflected vector is a root, so its coefficients cannot all be nonpositive and must all be nonnegative. Thus preserves all positive roots except , which it sends to .
Use the column-coroot convention , consistent with the printed matrix and the stated shorter first root. It gives
The root string through in the direction contains . Reflecting in gives . Together with and their negatives these give
There are no further roots. Indeed the simple reflections act on coefficient pairs by and ; the displayed twelve-element set is closed under both. Every positive nonsimple root can be reflected to a positive root of smaller height: choose a simple root with positive inner product as in (a), and its positive integral Cartan pairing decreases height. Repetition reaches a simple root, so every root lies in an orbit already contained in the list. This is the G2 root system.
With , the inner product and length give the two reflected possibilities
Figure 1.
The twelve roots of G2 with the shorter simple root horizontal
. Details.
Give the real root span an inner product with orthonormal. The B2 root system consists of four short roots on the coordinate axes and four long roots on the diagonals. Choose the long-first simple roots
The positive roots are , and . The corresponding simple reflections are
They generate every signed permutation of the two coordinates. Thus the Weyl group has order eight and is the symmetry group of a square; every element sends to or , with independent signs.
Since form an integral basis of , the root lattice is . The simple coroots are and . Therefore the weight lattice is
Solving gives the fundamental weights
The cone of dominant weights is
Indeed and are exactly the two simple-coroot pairings. This describes representations of the Lie algebra, or of its simply connected Spin group; half-integral weights are allowed. For representations descending to itself, the weight must lie in , equivalently must be even.
For a Cartan-Weyl basis, the Jacobi identity gives
Thus the bracket has joint Cartan weight . If , it belongs to the zero-weight space, which is the Cartan subalgebra, and so is a linear combination . If is a nonzero root, its root space is one-dimensional and the bracket is proportional to . If that nonzero sum is not a root, the bracket vanishes. This proves the asserted forms without assuming every pair of roots has a root sum.
With the stated normalization, put . The commutators become
The adjoint relations make , , the usual SU(2) Lie algebra generators. Hence every finite-dimensional SU(2) irreducible component has eigenvalues , with an integer. Therefore has integer eigenvalues , including in the finite-dimensional Adjoint representation. Algebraically this is the sl2 subalgebra associated with a root.
If , another use of the Jacobi identity gives
The bracket is therefore zero or lies in the eigenvalue- space. Within one irreducible SU(2) ladder it is proportional to the next chosen vector . If the full eigenspace has multiplicity, the weight statement is the general one; proportionality to one named vector presupposes the ladder choice. Similarly lowers this eigenvalue by two, and the ladder weights run from to in steps of two.
For a root vector , its weight is
The adjoint SU(2) ladder therefore proves
For nonparallel , raising and lowering move its joint Cartan weight through the root string . The finite irreducible ladder has weights symmetric about zero. Starting at , reaching its partner requires . The corresponding nonzero vector lies in the root space of , proving the Weyl reflection property:
There is no zero joint root in this string when are nonparallel. Its one-dimensional root spaces prevent two irreducible ladders with the same weight parity from overlapping, so the ladder argument applies to the entire string. For , reflection simply interchanges the two opposite roots, which already exist by the adjoint relation.
For angle and length restrictions, set and . These Cartan integers have the same sign when nonzero and obey
For nonparallel, nonorthogonal roots, is an integer strictly between zero and four. The possibilities are consequently:
  • : , equal lengths, and or .
  • : , squared-length ratio or , and or .
  • : , squared-length ratio or , and or .
Orthogonal roots have and . Parallel roots have ; the integer pairs would allow only length multiples . The stated reducedness condition excludes the latter two, so parallel roots are equal or opposite, with angles zero or and equal lengths. Thus
Not every root system realizes every listed angle.
The orthogonal pair alone gives no ratio through . To finish the length restriction for a simple Lie algebra, use irreducibility of its root system. Let span the Weyl group orbit of . Both and are invariant under the orthogonal root reflections. If a root had nonzero projections in both, reflection of its projection in would have a nonzero component, violating invariance. Hence every root is entirely in one of these subspaces. A proper nonzero would split the root system into two orthogonal parts, contradicting irreducibility. This proves that the Weyl orbit spans an irreducible root space.
In particular, some orbit root is nonorthogonal to any chosen , and . Applying the previous integer-pair restriction to therefore also handles orthogonal :
There can be at most two different root lengths: three lengths would have ratios two and three relative to the shortest, but then the longest-to-middle squared-length ratio would be , which is forbidden. A reducible collection of orthogonal rank-one factors could have independently chosen scales; the simple-algebra assumption excludes that exception.
Choose a generic linear functional to define positive roots. The simple roots are those positive roots which cannot be written as sums of two positive roots; they form a basis in which all root coefficients are integers of one sign. Distinct simple roots have nonpositive inner product: if their inner product were positive, their root string would contain their difference, and whichever difference is positive would decompose one of them. In rank two, irreducibility excludes the orthogonal case. The allowed simple-root angles are therefore , giving the three irreducible diagrams in the classification of rank-two root systems: A2 root system, B2 root system and G2 root system. Reflections in the two simple roots generate their respective six, eight and twelve roots.
Here are explicit simple-root choices and positive roots; adding their negatives gives each complete diagram.
  • For A2 root system, take and . The positive roots are ; all have squared length one.
  • For B2 root system, take the long and short . The positive roots are . These give the four axis roots and four diagonal roots, with squared lengths one and two. The rank-two Lie algebra is isomorphic to this one; changing the long/short ordering changes its Cartan presentation.
  • For G2 root system, take short and long . The positive roots are . They give two hexagons rotated by , with squared lengths one and three.
The nonnegative coefficients in each positive-root list verify the chosen simple roots explicitly. The orthogonal four-root system is rank two but reducible, so it is not a diagram for the simple algebra assumed here.
Define the Cartan matrix in the column-coroot convention:
Using the ordered roots above gives
The alternative row-coroot convention transposes these matrices. Stating the convention and root ordering avoids a spurious disagreement in the unequal-length cases.
Figure 1.
The irreducible rank-two root systems A2, B2 and G2, with long and short roots and explicit ordered simple roots highlighted
. Details.
For the usual diagonal Cartan subalgebra, write . The roots are for . The three diagonal entries of the specified have ordering
Therefore the positive roots selected by are
Their positive evaluations are respectively , and . For this nonstandard ordering the simple roots are and ; the third positive root is their sum. These simple roots differ from the usual choice used in Question 1.
Identify the real weight plane with triples of sum zero. Pairing with these simple coroots gives the differences and . Consequently the fundamental chamber of a root system is
Its closure replaces the inequalities by weak inequalities. The fundamental weights for this ordering are and , represented by and . Their simple-coroot pairings are and , so the two boundary rays are
The sketch uses , and in a Euclidean plane. The shaded sector is the sixty-degree closed chamber; its interior is the open chamber. The ordering vector , identified with its dual direction, lies inside it.
Figure 1.
Positive A2 roots and fundamental Weyl chamber for the specified ordering
. Details.
Let be a finite-dimensional complex semisimple Lie algebra, choose a Cartan subalgebra and a set of positive roots, and write for the Weyl group. Let be a dominant integral weight and the finite-dimensional irreducible highest-weight representation with that highest weight. If denotes its weight space of weight , its formal character is . The symbols belong to the group algebra of the weight lattice and multiply by ; they are formal symbols, not matrix exponentials.
Put , the half-sum of positive roots, and let be the Coxeter length of , the least number of simple reflections expressing it. Then in the real reflection representation. The Weyl character formula states
By the Weyl denominator formula, the denominator is , giving the equivalent expression
The quotient can be interpreted in the fraction field of the formal group algebra; the theorem says it simplifies to the finite formal character above. In particular the apparent denominator does not mean that the representation has infinitely many weights.
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.
Evaluate the Killing form on the root-space decomposition. For arbitrary ,
Thus the Killing dual of a coroot is the root expansion
The factor two in the positive-root expression occurs because the contributions of and are equal.
For , let , ; the positive roots are . On their values are . Therefore
This uses the unscaled Killing form . Changing that normalization would change the scalar six.
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.
Use a finite-dimensional complex semisimple Lie algebra, or the complexification of its compact real form, as required for the root construction. Choose a Cartan subalgebra with basis . Simultaneous diagonalization of its adjoint action gives the root-space decomposition
The nonzero weights are the roots of a root system; each root space is one-dimensional in this setting, and roots occur in opposite pairs. This supplies the Cartan and root-vector basis.
The Jacobi identity gives
If the bracket is nonzero and , it is a nonzero vector in the root space of weight , so that sum is a root. The printed implication needs the opposite-root exception: for , can be a nonzero Cartan element, while zero is not a root. The supplied simple-root commutator itself gives this counterexample. This is the root bracket and the opposite-root exception.
Choose a real linear functional nonzero on every root; positive roots are those on which it is positive, and negative roots are their negatives. The simple roots are positive roots not decomposable into two positive roots. They form a basis of the root span, and every root is an integer combination
with all for a positive root and all for a negative root. Positive roots can be decomposed repeatedly until simple roots remain; the finite root set makes this procedure terminate.
For , has simple-root coefficients of both signs and is not a root. It is also nonzero, so the root-space bracket rule gives
The operators have the SU(2) Lie algebra normalization , . In a finite-dimensional representation, a vector killed by is a lowest-weight vector in its SU(2) summands. If its value is , those summands have spin , so
One can also read the termination from successive raising coefficients starting at the lowest weight.
Apply this result in the finite-dimensional Adjoint representation, taking the lowest-weight vector to be . The vanishing bracket just proved is its lowering condition. If , the lowest-weight result forces with a nonnegative integer. It also yields
The last identity is exactly the requested nested commutator. This is the SU(2) proof of the Serre relations, and the identities are the Serre relations in these Chevalley basis conventions.
To construct a highest-weight representation, start from its highest-weight vector and apply negative-root operators. Fix an order on the negative roots. The Poincaré-Birkhoff-Witt theorem gives spanning vectors
of weight . The spanning assertion follows by commuting all negative-root operators to the left, Cartan operators to the middle and positive-root operators to the right; commutators supply lower-order words, positive operators kill the highest-weight vector and Cartan operators act there by scalars. In the finite-dimensional highest-weight representation, impose the simple-root string relations and the commutator/Serre relations. At each weight retain a linearly independent set of the resulting words, discarding zero words and dependencies. This gives a basis, with separate independent vectors retained when a weight has multiplicity greater than one. The construction is finite in the assumed finite-dimensional representation; treating all lowering words as automatically independent would overcount.
For SU(3), put , and . The off-diagonal Cartan entries are minus one, so the Serre relations give . With , these imply
For , expand the commutator using Jacobi identity and the distinct-root brackets:
since . Similarly,
and the same calculation on gives . Thus
These signs also agree with the explicit model , , , , , .
For the SU(3) Casimir in Chevalley generators, set
Using , , and putting Cartan elements on the left, the four terms of are
Their sum is . The remaining terms give
The last two cancel, so . Also commutes with every Cartan polynomial and with each : their raising and lowering weights cancel in the product. Hence
On , and vanish and therefore vanishes as well. All three terms consequently give zero, leaving
The paper's normalization is relative to the conventional SU(3) quadratic Casimir eigenvalue. For example it gives in the fundamental representation, in the octet and in the decuplet.
For the usual positive roots, the chamber condition is that the coefficients of be weakly decreasing, since their consecutive differences are the simple-coroot pairings. Adding the same constant to all three coefficients changes no weight, because .
The given coefficients are . Let exchange , and exchange . With the rightmost reflection acting first,
Thus
Its coefficients are strictly decreasing, so it lies even in the open Weyl chamber; its Dynkin labels are .