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.