A highest-weight vector is a nonzero vector satisfying and ; its eigenvalue is the highest weight. Existence does not require the Lie algebra representation to be antihermitian. Since is a nonzero finite-dimensional complex vector space, has an eigenvector with some eigenvalue . The commutator with shows that each nonzero has eigenvalue . Infinitely many such vectors would have distinct eigenvalues and be linearly independent, which is impossible. The last nonzero vector in this raising chain is therefore a highest-weight vector .
Put . The ladder operator relations give . The raising coefficient follows by expanding the commutator of with a power of :
The factor is essential: these ladder operators have , rather than the convention with . The same finite-dimensionality argument gives a last nonzero lowered vector , with . Applying to yields
so . All are nonzero and have distinct eigenvalues. Their span is invariant under and therefore under the original three generators. Irreducibility of the Lie algebra representation makes this span equal to . Hence
In particular, the initial construction produces the largest eigenvalue of , since its full spectrum is now . This establishes the highest weight without assuming beforehand that all eigenvalues are real or that is diagonalizable.
For the additional antihermitian Lie algebra representation, the given definitions imply and . Thus distinct eigenvalues give orthogonal weight vectors. With , write . The adjoint relation and the raising coefficient give
Multiplying this recursion proves the normalized highest-weight lowering formula in the present normalization:
Every factorial argument is an integer, even for half-integral . The displayed states have unit norm, mutually distinct eigenvalues, and span , so they form an orthonormal basis. Their phase convention also fixes the positive ladder amplitudes
with the endpoint actions interpreted as zero. These amplitudes will determine the Clebsch-Gordan coefficients.
The Clebsch-Gordan decomposition for SU2 is
where increases by one and every summand occurs once. The tensor product of Lie algebra representations is antihermitian for the product inner product, so an invariant subspace has an invariant orthogonal complement; this gives complete reducibility. To see the particular summands, suppose . The product weight diagram has one state of weight , two of weight , and increasing multiplicities down to the plateau determined by . Subtracting the weight string of leaves a single highest state of weight . Repeating highest-weight character subtraction yields exactly the displayed sequence, down to . Its dimensions exhaust the tensor product because
The case is identical with the factors exchanged.
Let be the Clebsch-Gordan coefficients. Since the total is , orthogonality of its eigenspaces gives the selection rule unless . Normalize the coupled states by lowering from a unit highest-weight vector, as in part (i); a common phase for an entire summand is immaterial. Then
Take the inner product with . On the other hand, the total ladder operator is , and . Its action on the product bra is therefore
Equating the two evaluations and multiplying by proves both signs of the ladder recurrence for Clebsch-Gordan coefficients:
Terms with an index outside its allowed weight range are zero. Merely specifying eigenvectors of would allow unrelated phases for different ; the coherent positive-ladder convention above is what makes these recurrences hold with the displayed positive square roots.

Articles by others on the same topic (0)

There are currently no matching articles.