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 yieldsso . 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 . HenceIn 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 giveMultiplying 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 amplitudeswith the endpoint actions interpreted as zero. These amplitudes will determine the Clebsch-Gordan coefficients.
Articles by others on the same topic
There are currently no matching articles.