Counting the States for \bgroup\color{black}$\vert\ell_1-\ell_2\vert\leq j\leq\ell_1+\ell_2$\egroup.

If we add \bgroup\color{black}$\ell_1$\egroup to \bgroup\color{black}$\ell_2$\egroup there are \bgroup\color{black}$(2\ell_1+1)(2\ell_2+1)$\egroup product states. Lets add up the number of states of total \bgroup\color{black}$\ell$\egroup. To keep things simple we assume we ordered things so \bgroup\color{black}$\ell_1\geq\ell_2$\egroup.

\begin{displaymath}\bgroup\color{black}\sum\limits_{\ell=\ell_1-\ell_2}^{\ell_1+...
...l_2+1)(2\ell_1-2\ell_2+1)+2\sum\limits_{n=0}^{2\ell_2}n \egroup\end{displaymath}


\begin{displaymath}\bgroup\color{black}=(2\ell_2+1)(2\ell_1-2\ell_2+1)+(2\ell_2+1)(2\ell_2)
=(2\ell_2+1)(2\ell_1+1)\egroup\end{displaymath}

This is what we expect.



Jim Branson 2013-04-22