i am kind of stupid, so, for most text book with algebra example, i am easy to lost in the middle.
Thus, now, i am going to present a detail calculation based on Recursion Relations.
we just need equation and few observations to calculate all. i like to use the J- relation:
is the coefficient.
Notice that the relation is only on fixed j, thus, we will have our plane with fixed j, so, we have many planes from down to .
We have 2 observations:
- which is the maximum state. the minimum state also equal 1.
- For the coefficient is ZERO.
Thus, on the plane. the right-upper corner is 1. then using the relation, we can have all element down and left. and then, we can have all element on the plane.
the problem comes when we consider plane. no relation is working! and no book tells us how to find it!
Lets take an example, a super easy one, . possible , so we have 2 planes.
The j = 1 plane is no big deal.
but the j = 0 plane, there are only 2 coefficient. and we can just related them and know they are different only a sign. and we have to use the orthonormal condition to find out the value.
See? i really doubt is there somebody really do the actually calculation. J.J.Sakuarai just skip the j = l-1/2 case. he cheats!
when going to higher j1+j2 case, we have w=to use the J- relation to evaluate all coefficient. the way is start from the lower left corner, and use the J- relation to find out the relationship between each lower diagonal coefficients. then, since all lower diagonal coefficients have same m value, thus, the sum of them should be normalized. then, we have our base line and use the J+ to find the rest.
i will add graph and another example. say, j1 = 3, j2 = 1.