The Classification
We have built, for each integer \(m \geq 0\), an explicit
polynomial representation
\(\Pi_m\) of \(SU(2)\) of dimension \(m + 1\), and we proved each one
irreducible.
Each \(\Pi_m\)
differentiates to a representation
\(\pi_m\) of \(\mathfrak{su}(2)\), which
extends complex-linearly
to a representation of \(\mathfrak{sl}(2,\mathbb{C})\), still written \(\pi_m\). The
hypothesis of that extension, \(\mathfrak{su}(2) \cap i\,\mathfrak{su}(2) = \{0\}\),
was verified when \(\pi_m\) was constructed. Because \(SU(2)\) is connected (sending
\(U\) to its first column identifies it with the unit sphere in \(\mathbb{C}^2\)), the
group-algebra correspondence
makes \(\pi_m\) irreducible as a representation of \(\mathfrak{su}(2)\), and the
extension is then irreducible as a representation of \(\mathfrak{sl}(2,\mathbb{C})\).
That was the constructive half of the story, and it produced one irreducible
representation of \(\mathfrak{sl}(2,\mathbb{C})\) in each dimension. The present section
completes it. We will show that these are, up to isomorphism, the only
finite-dimensional irreducible complex representations of \(\mathfrak{sl}(2,\mathbb{C})\),
and that nothing else exists. The classification is exact and complete.
The computation is worth doing carefully for three reasons. First,
\(\mathfrak{sl}(2,\mathbb{C})\) is the
complexification
of \(\mathfrak{su}(2)\), which is in turn
isomorphic to \(\mathfrak{so}(3)\).
The representations of \(\mathfrak{so}(3)\) are the mathematics of angular momentum in
quantum mechanics, and the calculation we are about to perform is the one found in physics
texts under that heading, in the normalization where \(H\) plays the role of \(2J_z\).
Second, the method is a template. It shows how the commutation relations, applied to a
finite-dimensional irreducible representation, force its entire structure.
Third, the representation theory of larger semisimple Lie algebras is built by locating
copies of \(\mathfrak{sl}(2,\mathbb{C})\) inside them and applying precisely this result.
The Working Basis
We use the basis of \(\mathfrak{sl}(2,\mathbb{C})\) introduced when we formed the
complexification of \(\mathfrak{su}(2)\),
\[
H = \begin{pmatrix} 1 & 0 \\\\ 0 & -1 \end{pmatrix}, \quad
E = \begin{pmatrix} 0 & 1 \\\\ 0 & 0 \end{pmatrix}, \quad
F = \begin{pmatrix} 0 & 0 \\\\ 1 & 0 \end{pmatrix},
\]
with the commutation relations
\[
\begin{align*}
[H, E] &= 2E, \\\\
[H, F] &= -2F, \\\\
[E, F] &= H.
\end{align*}
\]
These three relations are the entire content of the Lie algebra, and everything that follows
is extracted from them. The element \(H\) is the one we will diagonalize, \(E\) will raise
eigenvalues, and \(F\) will lower them.
A useful consequence is that representations of \(\mathfrak{sl}(2,\mathbb{C})\) are cheap to
specify. Let \(V\) be a finite-dimensional complex vector space and let \(A, B, C\) be
operators on \(V\) satisfying the same three relations \([A, B] = 2B\), \([A, C] = -2C\),
and \([B, C] = A\). Consider the unique complex-linear map
\(\pi : \mathfrak{sl}(2,\mathbb{C}) \to \mathfrak{gl}(V)\) determined by
\[
\pi(H) = A, \quad \pi(E) = B, \quad \pi(F) = C.
\]
Both brackets are commutators, so both are skew-symmetric and complex-bilinear, the latter
because composition of matrices, and of operators, is complex-linear in each factor. Both
sides of the identity \(\pi([X, Y]) = [\pi(X), \pi(Y)]\) are therefore complex-bilinear
in \((X, Y)\), and it suffices to verify it on pairs of basis elements. Skew-symmetry makes it
read \(0 = 0\) on the diagonal pairs and reduces the rest to \((H, E)\), \((H, F)\), and
\((E, F)\), where it says exactly the three relations we imposed on \(A, B, C\). So
\(\pi\) is automatically a representation. Building a representation thus reduces to
finding three operators with the right commutators.
Theorem (Classification of Irreducible Representations of \(\mathfrak{sl}(2,\mathbb{C})\))
For each integer \(m \geq 0\), there is an irreducible complex representation of
\(\mathfrak{sl}(2,\mathbb{C})\) of dimension \(m + 1\). Any two irreducible complex
representations of \(\mathfrak{sl}(2,\mathbb{C})\) of the same dimension are isomorphic.
If \(\pi\) is an irreducible complex representation of \(\mathfrak{sl}(2,\mathbb{C})\) of
dimension \(m + 1\), then \(\pi\) is isomorphic to \(\pi_m\), the representation of
\(\mathfrak{sl}(2,\mathbb{C})\) obtained from the polynomial representation
\(\Pi_m\) of \(SU(2)\).
The existence half is already in hand, since the \(\pi_m\) supply one irreducible
representation in each dimension. What remains is the uniqueness, and it is the substantial
part. We must show that an arbitrary irreducible representation, presented with no structure
beyond the bracket relations, is forced into the shape of some \(\pi_m\). The strategy is to
diagonalize \(\pi(H)\) and watch how \(E\) and \(F\) move its eigenvalues. The single lemma
of the next section is the engine.
Raising and Lowering
When we built the polynomial representations, we saw the operators \(\pi_m(E)\) and
\(\pi_m(F)\) shift the monomial basis up and down a ladder of \(\pi_m(H)\)-eigenvalues in
steps of two. That was a feature of the explicit model. The following lemma shows it is not
special to the model at all. In any representation, \(E\) and \(F\) move
\(\pi(H)\)-eigenvalues by exactly \(+2\) and \(-2\). The fact is forced by the commutation
relations alone, and it is the whole engine of the classification.
Lemma (Raising and Lowering)
Let \(\pi\) be a representation of \(\mathfrak{sl}(2,\mathbb{C})\) on a complex vector
space \(V\), and let \(u\) be an eigenvector of \(\pi(H)\) with eigenvalue
\(\alpha \in \mathbb{C}\). Then
\[
\pi(H)\,\pi(E)\,u = (\alpha + 2)\,\pi(E)\,u.
\]
Thus either \(\pi(E) u = 0\), or \(\pi(E) u\) is an eigenvector of \(\pi(H)\) with
eigenvalue \(\alpha + 2\). Similarly,
\[
\pi(H)\,\pi(F)\,u = (\alpha - 2)\,\pi(F)\,u,
\]
so either \(\pi(F) u = 0\), or \(\pi(F) u\) is an eigenvector of \(\pi(H)\) with
eigenvalue \(\alpha - 2\).
Proof:
Since \(\pi\) is a representation, it carries brackets to commutators:
\([\pi(H), \pi(E)] = \pi([H, E]) = 2\,\pi(E)\), using the relation \([H, E] = 2E\).
Rearranging the commutator gives \(\pi(H)\pi(E) = \pi(E)\pi(H) + 2\pi(E)\). Applying both
sides to \(u\) and using \(\pi(H) u = \alpha u\),
\[
\begin{align*}
\pi(H)\,\pi(E)\,u &= \pi(E)\,\pi(H)\,u + 2\,\pi(E)\,u \\\\
&= \pi(E)\,(\alpha u) + 2\,\pi(E)\,u \\\\
&= (\alpha + 2)\,\pi(E)\,u.
\end{align*}
\]
If \(\pi(E) u \neq 0\) this says \(\pi(E) u\) is a \(\pi(H)\)-eigenvector with
eigenvalue \(\alpha + 2\). The argument for \(\pi(F)\) is identical, starting from
\([\pi(H), \pi(F)] = \pi([H, F]) = -2\,\pi(F)\), which gives
\(\pi(H)\pi(F) = \pi(F)\pi(H) - 2\pi(F)\) and hence
\(\pi(H)\pi(F)u = (\alpha - 2)\pi(F) u\).
The mechanism is purely commutational. Conjugating \(\pi(E)\) past \(\pi(H)\) costs an extra
\(+2\pi(E)\), and that surcharge is what bumps the eigenvalue up by two. Conjugating
\(\pi(F)\) costs \(-2\pi(F)\) and bumps it down. So from a single \(\pi(H)\)-eigenvector we
can manufacture a whole string of them, with eigenvalues marching in steps of two, until an
application of \(E\) or \(F\) finally returns zero. Controlling where those strings start
and stop is exactly what pins down the representation, and that is the next section.
Proof of the Classification
Let \(\pi\) be an irreducible complex representation of \(\mathfrak{sl}(2,\mathbb{C})\)
acting on a finite-dimensional space \(V\). We prove it must take the explicit form of one
of the \(\pi_m\). The argument has three movements: find a top of the ladder, descend it to
discover that the eigenvalues are integers symmetric about zero, and check that the ladder
spans an irreducible invariant subspace, which irreducibility of \(\pi\) then forces to
be everything.
Finding the Top of the Ladder
Fix a basis of \(V\), so that operators on \(V\) become square complex matrices. Since
\(V\) is nonzero, the characteristic polynomial of \(\pi(H)\) has positive degree, so it
has a root by the fundamental theorem of algebra, and \(\pi(H)\) has at least one
eigenvector \(u\), say with eigenvalue \(\alpha\). Applying the raising lemma repeatedly,
\[
\pi(H)\,\pi(E)^k u = (\alpha + 2k)\,\pi(E)^k u,
\]
so each nonzero \(\pi(E)^k u\) is a \(\pi(H)\)-eigenvector with eigenvalue \(\alpha + 2k\).
These eigenvalues \(\alpha, \alpha + 2, \alpha + 4, \dots\) are all distinct. But
eigenvectors for distinct eigenvalues are linearly independent,
a statement whose proof uses only field operations and so holds over \(\mathbb{C}\). A
matrix of size \(\dim V\) therefore has at most \(\dim V\) eigenvalues, and the vectors
\(\pi(E)^k u\) cannot all be nonzero.
Let \(N\) be the largest index with \(\pi(E)^N u \neq 0\), so that
\(\pi(E)^{N+1} u = 0\). Set
\[
u_0 := \pi(E)^N u, \quad \lambda := \alpha + 2N.
\]
By construction \(u_0\) is a nonzero \(\pi(H)\)-eigenvector at the top of its raising chain,
\[
\pi(H)\,u_0 = \lambda\, u_0, \quad \pi(E)\,u_0 = 0.
\]
Raising it gives nothing. Such a vector deserves a name.
Definition: Highest Weight Vector
Let \(\pi\) be a representation of \(\mathfrak{sl}(2,\mathbb{C})\) on a complex vector
space \(V\). The eigenvalues of \(\pi(H)\) are called the weights of
\(\pi\). A nonzero vector \(u \in V\) is a highest weight vector of
weight \(\lambda\) if \(\pi(H)\,u = \lambda u\) and \(\pi(E)\,u = 0\).
The vector \(u_0\) is a highest weight vector of weight \(\lambda\). What the bracket
relations force on any such vector is the content of the next proposition. The three
subsections that follow prove it, and they use only that \(V\) is finite-dimensional and
that \(u_0\) is a highest weight vector, never the irreducibility of \(\pi\).
Irreducibility enters only afterwards.
Proposition (The Chain of a Highest Weight Vector)
Let \((\pi, V)\) be a finite-dimensional representation of \(\mathfrak{sl}(2,\mathbb{C})\)
and let \(u_0 \in V\) be a highest weight vector of weight \(\lambda\). Set
\(u_k := \pi(F)^k u_0\) for \(k \geq 0\). Then:
-
The weight \(\lambda\) is a non-negative integer. We write \(m\) for it.
-
The vectors \(u_0, \dots, u_m\) are nonzero and linearly independent, and
\(u_k = 0\) for every \(k \gt m\).
-
The span \(W = \langle u_0, \dots, u_m \rangle\) is an invariant subspace of
dimension \(m + 1\), and on the basis \(u_0, \dots, u_m\) the three operators act by
\[
\begin{align*}
\pi(H)\,u_k &= (m - 2k)\,u_k, \\\\
\pi(F)\,u_k &= \begin{cases} u_{k+1} & k \lt m, \\\\ 0 & k = m, \end{cases} \\\\
\pi(E)\,u_k &= \begin{cases} k\,[m - (k-1)]\,u_{k-1} & k \gt 0, \\\\ 0 & k = 0. \end{cases}
\end{align*} \tag{2}
\]
-
The restriction of \(\pi\) to \(W\) is irreducible.
Descending the Ladder
Now lower repeatedly along the vectors \(u_k = \pi(F)^k u_0\) of the proposition. By the
lowering half of the lemma, applied \(k\) times to \(u_0\),
\[
\pi(H)\,u_k = (\lambda - 2k)\, u_k.
\]
The action of \(\pi(E)\) on this descending chain is governed by an identity we verify by
induction:
\[
\pi(E)\,u_k = k\,[\lambda - (k - 1)]\, u_{k-1} \quad (k \geq 1). \tag{1}
\]
For \(k = 1\), use the bracket relation \([E, F] = H\) in the form
\(\pi(E)\pi(F) = \pi(F)\pi(E) + \pi(H)\), applied to \(u_0\):
\[
\begin{align*}
\pi(E)\,u_1 = \pi(E)\pi(F)\,u_0
&= \pi(F)\,\pi(E)\,u_0 + \pi(H)\,u_0 \\\\
&= 0 + \lambda\, u_0 = 1 \cdot [\lambda - 0]\, u_0,
\end{align*}
\]
using \(\pi(E) u_0 = 0\). This is \((1)\) at \(k = 1\).
Assume \((1)\) holds at \(k\). Then, again from \(\pi(E)\pi(F) = \pi(F)\pi(E) + \pi(H)\)
applied to \(u_k\),
\[
\begin{align*}
\pi(E)\,u_{k+1} &= \pi(E)\pi(F)\,u_k = \pi(F)\,\pi(E)\,u_k + \pi(H)\,u_k \\\\
&= \pi(F)\bigl(k[\lambda - (k-1)]\,u_{k-1}\bigr) + (\lambda - 2k)\,u_k \\\\
&= k[\lambda - (k-1)]\,u_k + (\lambda - 2k)\,u_k \\\\
&= \bigl(k\lambda - k(k-1) + \lambda - 2k\bigr)\,u_k \\\\
&= (k + 1)\,[\lambda - k]\,u_k,
\end{align*}
\]
where the last line factors
\(k\lambda + \lambda - k^2 + k - 2k = (k+1)\lambda - k(k+1) = (k+1)(\lambda - k)\). This is
\((1)\) at \(k + 1\), completing the induction.
The Eigenvalue Is a Non-Negative Integer
The descending eigenvalues \(\lambda, \lambda - 2, \lambda - 4, \dots\) are again distinct,
so the \(u_k\) cannot all be nonzero. Once some \(u_k\) vanishes, so does every later
\(u_{k'} = \pi(F)^{k'-k} u_k\). Let \(m\) be the largest index with \(u_m \neq 0\), so that
\(u_0, \dots, u_m\) are all nonzero while
\[
u_{m+1} = \pi(F)^{m+1} u_0 = 0,
\]
and \(u_k = 0\) for every \(k \gt m\).
Apply \(\pi(E)\) to this zero vector and use \((1)\) at \(k = m + 1\):
\[
0 = \pi(E)\,u_{m+1} = (m + 1)\,[\lambda - m]\, u_m.
\]
Since \(u_m \neq 0\) and \(m + 1 \neq 0\), we are forced to conclude \(\lambda - m = 0\),
that is,
\[
\lambda = m,
\]
a non-negative integer. The highest weight could not have been anything else. The bracket
relations admit no representation with a non-integer or negative top eigenvalue. This is the
crux of the classification, and it is Point 1 of the proposition. Which \(u_k\) vanish and
which do not was settled above, so of Point 2 only the linear independence remains.
The Ladder Is Everything
With \(\lambda = m\), the vectors \(u_0, u_1, \dots, u_m\) are nonzero eigenvectors of
\(\pi(H)\) with the distinct eigenvalues \(m, m - 2, \dots, -m\), and
eigenvectors for distinct eigenvalues are linearly independent.
So the \(u_k\) are independent, which completes Point 2, and their span
\(W = \langle u_0, \dots, u_m \rangle\) has dimension \(m + 1\). Collecting the three
actions gives exactly the formulas \((2)\). The first line is the eigenvalue computation
above, the second is the definition of \(u_{k+1}\) together with \(u_{m+1} = 0\), and the
third is \((1)\) with \(\lambda = m\) together with \(\pi(E)\,u_0 = 0\). By \((2)\),
\(W\) is carried into itself by \(\pi(H)\), \(\pi(E)\), and \(\pi(F)\), hence by
\(\pi(Z)\) for every \(Z \in \mathfrak{sl}(2,\mathbb{C})\), because \(\pi\) is linear
and \(H, E, F\) span the algebra. So \(W\) is an invariant subspace, which is Point 3.
For Point 4, note first that \(\pi_W(X) := \pi(X)|_W\) is again a representation of
\(\mathfrak{sl}(2,\mathbb{C})\), since the bracket identity holds on all of \(V\) and in
particular on \(W\). Let \(U \subseteq W\) be a nonzero invariant subspace and pick
\(w = \sum_{k=0}^{m} c_k u_k \in U\) with some \(c_j \neq 0\). The operator
\[
P_j := \prod_{k \neq j} \bigl(\pi(H) - (m - 2k)\,I\bigr)
\]
is a polynomial in \(\pi(H)\), so it preserves \(U\). It kills every \(u_k\) with
\(k \neq j\), and it multiplies \(u_j\) by
\[
\prod_{k \neq j} \bigl((m - 2j) - (m - 2k)\bigr) = \prod_{k \neq j} 2(k - j) \neq 0.
\]
Hence \(P_j w\) is a nonzero multiple of \(u_j\), and \(u_j \in U\). Lowering then
gives \(u_{j+1} = \pi(F)\,u_j, \dots, u_m \in U\), and raising gives
\(u_{j-1}, \dots, u_0 \in U\), because \(\pi(E)\,u_k = k\,[m - (k-1)]\,u_{k-1}\) with
coefficient \(k(m - k + 1) \neq 0\) for \(1 \leq k \leq m\). Thus \(U = W\), and
\(\pi_W\) is
irreducible.
This proves the proposition.
Return now to the irreducible \(\pi\). The highest weight vector \(u_0\) constructed above
generates the invariant subspace \(W\) of Point 3, which is nonzero. Because \(\pi\) is irreducible,
\(W = V\). In particular \(\dim V = m + 1\), and \(\pi\) is given on the basis
\(u_0, \dots, u_m\) by the formulas \((2)\).
The formulas \((2)\) determine \(\pi\) completely once \(m\) is fixed, and \(m\) is
fixed by \(\dim V = m + 1\). So if \(\pi'\) is a second irreducible complex representation
of dimension \(m + 1\), with the chain \(u_0', \dots, u_m'\) that the same argument
produces, consider the linear map sending \(u_k\) to \(u_k'\) for each \(k\). This map
carries the action of each of \(\pi(H)\), \(\pi(E)\), \(\pi(F)\) to that of \(\pi'(H)\),
\(\pi'(E)\), \(\pi'(F)\), hence by linearity the action of \(\pi(Z)\) to that of
\(\pi'(Z)\) for every \(Z\). Being invertible, it is an
isomorphism of representations,
so \(\pi\) and \(\pi'\) are isomorphic. The polynomial representation \(\pi_m\) is
irreducible of dimension \(m + 1\), so the argument applies to it as well and exhibits it
in the form \((2)\). Hence every irreducible complex representation of dimension \(m + 1\)
is isomorphic to \(\pi_m\). This proves the classification.
General Representations
The classification described the irreducible representations. For applications we need a few
facts about finite-dimensional representations that need not be irreducible. Those
applications include locating copies of \(\mathfrak{sl}(2,\mathbb{C})\) inside larger
algebras and reading the weight structure of a representation that has not been
decomposed. The facts follow from the classification by decomposing into
irreducibles, but several can be seen directly.
Theorem (Properties of General Representations)
Let \((\pi, V)\) be a finite-dimensional representation of \(\mathfrak{sl}(2,\mathbb{C})\),
not necessarily irreducible. Then:
-
Every eigenvalue of \(\pi(H)\) is an integer. If \(v\) is an eigenvector of
\(\pi(H)\) with eigenvalue \(\lambda\) and \(\pi(E) v = 0\), then \(\lambda\) is a
non-negative integer.
-
The operators \(\pi(E)\) and \(\pi(F)\) are nilpotent.
-
The operator \(S = e^{\pi(E)} e^{-\pi(F)} e^{\pi(E)}\) satisfies
\(S\,\pi(H)\,S^{-1} = -\pi(H)\).
-
If an integer \(k\) is an eigenvalue of \(\pi(H)\), then so is each of the numbers
\(-|k|, -|k| + 2, \dots, |k| - 2, |k|\).
Proof of Point 1:
Let \(v\) be an eigenvector of \(\pi(H)\) with eigenvalue \(\lambda\). By the raising
lemma, \(\pi(E)^j v\) is, when nonzero, a \(\pi(H)\)-eigenvector with eigenvalue
\(\lambda + 2j\). Since \(\pi(H)\) has finitely many eigenvalues, there is some
\(N \geq 0\) with \(\pi(E)^N v \neq 0\) and \(\pi(E)^{N+1} v = 0\). Then \(\pi(E)^N v\)
is a highest weight vector of weight \(\lambda + 2N\), and by
Point 1 of the chain proposition
that weight is a non-negative integer \(m\). So \(\lambda + 2N = m\) and hence
\(\lambda = m - 2N\) is an integer. If already \(\pi(E) v = 0\), then \(N = 0\) and
\(\lambda = m\) is a non-negative integer.
Proof of Point 2:
Over \(\mathbb{C}\), the space \(V\) has a basis of generalized eigenvectors for
\(\pi(H)\), that is, vectors \(v\) for which \([\pi(H) - \lambda I]^r v = 0\) for some
\(\lambda\) and some positive integer \(r\). This is the standard decomposition of a
complex operator into its generalized eigenspaces, a fact of linear algebra that we take
as given here. The point is that raising respects it. Using the relation \([H, E] = 2E\)
and induction on \(r\),
\[
\bigl[\pi(H) - (\lambda + 2) I\bigr]^r \pi(E)
= \pi(E)\,\bigl[\pi(H) - \lambda I\bigr]^r.
\]
Thus if \(v\) is a generalized eigenvector for \(\pi(H)\) with eigenvalue \(\lambda\),
then \(\pi(E) v\) is either zero or a generalized eigenvector with eigenvalue
\(\lambda + 2\). Applying \(\pi(E)\) repeatedly to a generalized eigenvector must
eventually give zero, since \(\pi(H)\) has only finitely many generalized eigenvalues
and each application raises the eigenvalue by two. Since \(V\) is spanned by finitely
many generalized eigenvectors, a single power of \(\pi(E)\) kills all of them, so
\(\pi(E)\) is nilpotent. The same argument, lowering by two, shows \(\pi(F)\) is
nilpotent.
Proof of Point 3:
Write \(S = e^{\pi(E)} e^{-\pi(F)} e^{\pi(E)}\), where operators on \(V\) are
identified with matrices through a basis. Each factor is invertible by
property (c) of the matrix exponential,
with \(\bigl(e^{\pi(Z)}\bigr)^{-1} = e^{-\pi(Z)}\), so \(S\) is invertible.
Conjugation by each exponential is computed by the
exponential-of-\(\mathrm{ad}\) formula:
for any operator \(W\), \(e^{\pi(Z)} W e^{-\pi(Z)} = e^{\mathrm{ad}(\pi(Z))}(W)\). We
apply this three times to \(\pi(H)\), tracking the result through the bracket relations
\([E, H] = -2E\), \([F, H] = 2F\), \([E, F] = H\) (equivalently
\(\mathrm{ad}(\pi(E))(\pi(H)) = -2\pi(E)\) and so on). First,
\[
e^{\mathrm{ad}(\pi(E))}(\pi(H)) = \pi(H) + [\pi(E), \pi(H)] = \pi(H) - 2\pi(E),
\]
the series terminating because \([\pi(E), \pi(E)] = 0\) kills all higher brackets.
Next, applying \(e^{-\mathrm{ad}(\pi(F))}\),
\[
e^{-\mathrm{ad}(\pi(F))}\bigl(\pi(H) - 2\pi(E)\bigr) = -\pi(H) - 2\pi(E),
\]
where the brackets \([F, H] = 2F\) and \([F, E] = -H\) generate the surviving terms. A
short calculation shows the \(\pi(F)\) contributions appearing at first and second order
cancel exactly, and the series again terminates. Finally,
\[
e^{\mathrm{ad}(\pi(E))}\bigl(-\pi(H) - 2\pi(E)\bigr) = -\pi(H).
\]
Composing the three conjugations, \(S\,\pi(H)\,S^{-1} = -\pi(H)\), as claimed.
Proof of Point 4:
First, the operator \(S\) of Point 3 reflects eigenvalues. If \(\pi(H) v = k v\), then
\[
\pi(H)(S v) = S\,(S^{-1}\pi(H) S)\,v = S\,(-\pi(H))\,v = -k\,(S v),
\]
and \(S v \neq 0\) because \(S\) is invertible, so \(-k\) is an eigenvalue whenever
\(k\) is. In particular, whenever \(k\) is an eigenvalue so is \(|k| \geq 0\). It
therefore suffices to run the chain argument from the non-negative eigenvalue \(|k|\).
As in Point 1, raising from a \(\pi(H)\)-eigenvector of eigenvalue \(|k|\) produces a
highest weight vector of weight \(|k| + 2N\) for some \(N \geq 0\). By
Points 1 to 3 of the chain proposition,
the weight \(|k| + 2N\) is a non-negative integer, call it \(m\), so \(m \geq |k|\)
and \(m \equiv |k| \pmod 2\), and the chain it generates consists of nonzero
\(\pi(H)\)-eigenvectors with eigenvalues \(m, m - 2, \dots, -m\), which include every
number from \(|k|\) down to \(-|k|\) in steps of two. Thus
\(-|k|, -|k| + 2, \dots, |k| - 2, |k|\) are all eigenvalues of \(\pi(H)\), as claimed.
The Weight Lattice a Network Sees
Point 4 is the structural fact behind the feature types of a rotation-equivariant
network. When \(\mathfrak{so}(3) \cong \mathfrak{su}(2)\) acts on a layer's activations,
the activations decompose into irreducible pieces indexed by the highest weight \(m\),
and within each piece the \(\pi(H)\)-eigenvalues, the weights, run symmetrically from
\(m\) down to \(-m\) in steps of two. These are exactly the \(m + 1\) components of one
feature type: a scalar for \(m = 0\), a vector for \(m = 2\), and higher tensors beyond.
The physics literature labels the same type by \(\ell = m/2\) and counts its
\(2\ell + 1\) components, and the odd \(m\) are the spinor types, which are
representations of \(\mathfrak{su}(2)\) but do not come from representations of
\(SO(3)\). The classification guarantees there is one irreducible type in each
dimension, and Point 4 guarantees its weights form this symmetric ladder. Together they
fix the menu of feature types a rotation-equivariant architecture can be built from. How
many channels of each type to use remains a design choice.