3
$\begingroup$

The Clebsch-Gordan coefficients can only be non-zero if the triangle inequality holds: $$\vert j_1-j_2 \vert \le j \le j_1+j_2$$ In my syllabus they give the following proof: $$-j \le m \le j$$ $$-j_1 \le m_1 \le j_1$$ and $$-j_2 \le m_2 \le j_2$$

When $m$ takes its maximal value, $m = j$, $m_1 = j_1$ and $m_2 = j_2$, and we get:

1) $-j_1 \le j-j_2 \le j_1$ which implies $j_2-j_1 \le j \le j_1+j_2$

2) $-j_2 \le j-j_1 \le j_2$ which implies $j_1-j_2 \le j \le j_1+j_2$

which should prove the triangle inequality.

This proof looks really simple, but I don't completely understand it though. It seems that I'm missing some essential reasoning, and I can't find where. Why for instance do they take for $m_1$, $m_2$ and $m$ all maximal values? Can't I also take $m$ maximal and $m_1$ minimal? This would give bad results though. So I really don't understand it, and I hope that someone can clarify it.

$\endgroup$

3 Answers 3

3
$\begingroup$

First of all, if $m$ is maximal, $m_1$ cannot be minimal because $m=m_1+m_2$ so $m_{max}=m_{1, max}+m_{2, max}$ by definition.

The reason they need to use maximal values for $m_i$ is because they need to find a relationship between only the $j$-values, but they only have a relationships between $m$-values and $j$-values (namely, $-j_i \le m_i \le j_i$).

When $m_i$ is maximal, $m_i=j_i$ (by virtue of the inequality relationship above). Therefore, $j=m_{max}=m_{1, max}+m_{2, max}=j_1+j_2$ or, in other words, $j_2=m_2=j-j_1$ (and vice versa for $m_1$).

By substituting into the inequality $-j_2\le m_2\le j_2$, we get $-j_2\le j-j_1\le j_2$. The rest of the proof is a trivial extension of what is done here. The arguments are exactly the same.

$\endgroup$
1
$\begingroup$

The previous answers don't make any sense to me. Both of them confuse $j$ with $j_{max}$ so they find $j=j_1+j_2$, thus, the statement $|j_1-j_2|\le j\le j_1+j_2$ is obviously true but not correctly proven.

The only demonstration I can come up with is by direct computation (and a couple of caveats).

Let's assume $j_{min}\le j \le j_{max}$ and the hypothesised inequalities $$|m_i|\le j_i \\|m|\le j$$ for $i=1,2$.

We want to find $j_{max}$ and $j_{min}$, namely the max and min values of the eigenvalues of the $\hat{J}^2$ operator, which can be conveniently written as $$\hat{J}^2=(\hat{J}_1+\hat{J}_2)^2=\hat{J}_1^2+\hat{J}_2^2+2\hat{J}_{1_z}\hat{J}_{2_z}+\hat{J}_{1_+}\hat{J}_{2_-}+\hat{J}_{1_-}\hat{J}_{2_+}$$ So, applying the operator to the generic state $\left|j_1 j_2 m_1m_2\right>$ we can get the (awful) analytical form of the generic eigenvalue, and manipulating $m_1$ and $m_2$ one can rigorously get $j_{min}$ and $j_{max}$. Fortunately, we can choose suitable states such that the computation is reduced to the bare minimum.

For instance, let's look for the $j_{max}$ value. We are summing two angular momentum vectors; the scenario for which the sum has the maximum possible value is when the twos are parallel to each other (and have the same direction). Our inequalities allow us to take $m_i=\pm j_i$, that is, when both the vectors are parallel to the $z$ axis; thus, the two states $\left|j_1 j_2 m_1 m_2\right>=\left|j_1 j_2 \pm j_1 \pm j_2\right>$ are the ones for which the total angular momentum is maximum.

Now, applying $\hat{J}^2$ to this state is much easier than the general case, because the operators $\hat{J}_{i_+}$ nullify the maximal states. So we get $$\begin{aligned} \hat{J}^2\left|j_1 j_2 \pm j_1 \pm j_2\right>&=\hbar^2 \left[j_1(j_1+1)+j_2(j_2+1)+2j_1 j_2\right]\left|j_1 j_2 \pm j_1 \pm j_2\right> \\&=\hbar^2 (j_1+j_2)(j_1+j_2+1)\left|j_1 j_2 \pm j_1 \pm j_2\right> \end{aligned} $$ Thus, $$j_{max}=(j_1+j_2) \tag{*}$$

To find $j_{min}$ one can reiterate the reasoning in search of the state(s) with the minimum total momentum, i.e, with opposite and maximum $z$ angular momentum, $m_1=\pm j_1$ and $m_2=\mp j_2$. But in this way, one has to deal with the terms given by the construction/annihilation operators.

A more elegant way to find $j_{min}$ (for me) is by looking at the dimension of the Hilbert space in which our eigenstates lives.

We have built states such that $$\left|j_1 j_2 m_1 m_2\right>=\left|j_1 m_1\right>\otimes\left|j_1 m_1\right> \in \mathcal{H}_1 \otimes \mathcal{H}_2=:\mathcal{H}$$ thus $$ \dim(\mathcal{H})=\dim(\mathcal{H_1})\dim(\mathcal{H_2})=(2j_1+1)(2j_2+1)=4j_1 j_2+2(j_1+j_2)+1 \tag{1} $$ but also $$ \dim(\mathcal{H})=\sum_{j=j_{min}}^{j_{max}}(2j+1) $$ because for each value of permitted $j$ there are $2j+1$ associated states (all its discrete $z$ projections).

The latter sum can be rewritten as $$\begin{aligned} \sum_{j=j_{min}}^{j_{max}}(2j+1)&=j_{max}-j_{min}+1+2\sum_{j=j_{min}}^{j_{max}}j=\\&= j_{max}-j_{min}+1+2\left( \sum_{j=1}^{j_{max}}j-\sum_{j=1}^{j_{min}-1}j \right)=\\&= j_{max}-j_{min}+1+2\left( \frac{j_{max}(j_{max}+1)}{2}-\frac{(j_{min}-1)(j_{min}-1+1)}{2} \right)=\\&= j_{max}^2+2j_{max}-j_{min}^2+1 \end{aligned}\tag{2}$$ Where in the third line we used Gauss' triangular number formula.

Finally, recalling $(*)$ and equating $(1)$ with $(2)$ we obtain $$ j_{min}^2=(j_1-j_2)^2 \iff j_{min}=|j_1-j_2| \tag{**}$$ Demonstrating the triangle selection rule.

$\endgroup$
0
$\begingroup$

This is only to add on the other answer:

Note that we have $m = m_1 + m_2$ and $-j_1 \le m_1 \le j_1$, so $$-j_1 \le m - m_2 \le j_1$$ In particular $m$ can take its maximum value $j$ and $m_2$ can take its maximum value $j_2$, which gives $$-j_1 \le j - j_2 \le j_1$$ In fact one can consider the situation where $m$ takes its minimum value $-j$ and $m_2$ takes its minimum value $-j_2$, which gives $$-j_1 \le -j + j_2 \le j_1$$ But this is in fact the same inequality after rearrangement.

The other two situations when one takes its minimum and the other takes its maximum are forbidden.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.