1.12: Reduction of Representations I
- Page ID
- 9335
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)
( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\id}{\mathrm{id}}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\kernel}{\mathrm{null}\,}\)
\( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\)
\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\)
\( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)
\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)
\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)
\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vectorC}[1]{\textbf{#1}} \)
\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)
\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)
\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)Let us now go back and look at the \(C_{3v}\) representation we derived in \(10.1\) in more detail. If we look at the matrices carefully we see that they all take the same block diagonal form (a square matrix is said to be block diagonal if all the elements are zero except for a set of submatrices lying along the diagonal).
\[\begin{array}{ccc} \Gamma(E) & \Gamma(C_3^-) & \Gamma(C_3^+) & \Gamma(\sigma_v) & \Gamma(\sigma_v') & \Gamma(\sigma_v'') \\ \scriptsize{\begin{pmatrix} \textbf{1} & \text{0} & \text{0} & \text{0} \\ \text{0} & \textbf{1} & \textbf{0} & \textbf{0} \\ \text{0} & \textbf{0} & \textbf{1} & \textbf{0} \\ \text{0} & \textbf{0} & \textbf{0} & \textbf{1} \end{pmatrix}} & \scriptsize{\begin{pmatrix} \textbf{1} & 0 & 0 & 0 \\ 0 & \textbf{0} & \textbf{1} & \textbf{0} \\ 0 & \textbf{0} & \textbf{0} & \textbf{1} \\ 0 & \textbf{1} & \textbf{0} & \textbf{0} \end{pmatrix}} & \scriptsize{\begin{pmatrix} \textbf{1} & 0 & 0 & 0 \\ 0 & \textbf{0} & \textbf{0} & \textbf{1} \\ 0 & \textbf{1} & \textbf{0} & \textbf{0} \\ 0 & \textbf{0} & \textbf{1} & \textbf{0} \end{pmatrix}} & \scriptsize{\begin{pmatrix} \textbf{1} & 0 & 0 & 0 \\ 0 & \textbf{1} & \textbf{0} & \textbf{0} \\ 0 & \textbf{0} & \textbf{0} & \textbf{1} \\ 0 & \textbf{0} & \textbf{1} & \textbf{0} \end{pmatrix}} & \scriptsize{\begin{pmatrix} \textbf{1} & 0 & 0 & 0 \\ 0 & \textbf{0} & \textbf{1} & \textbf{0} \\ 0 & \textbf{1} & \textbf{0} & \textbf{0} \\ 0 & \textbf{0} & \textbf{0} & \textbf{1} \end{pmatrix}} & \scriptsize{\begin{pmatrix} \textbf{1} & 0 & 0 & 0 \\ 0 & \textbf{0} & \textbf{0} & \textbf{1} \\ 0 & \textbf{0} & \textbf{1} & \textbf{0} \\ 0 & \textbf{1} & \textbf{0} & \textbf{0} \end{pmatrix}} \\ \chi(E) = 4 & \chi(C_3^+) = 1 & \chi(C_3^-) = 1 & \chi(\sigma_v) = 2 & \chi(\sigma_v') = 2 & \chi(\sigma_v'') = 2 \end{array} \nonumber\]
A block diagonal matrix can be written as the direct sum of the matrices that lie along the diagonal. In the case of the \(C_{3v}\) matrix representation, each of the matrix representatives may be written as the direct sum of a \(1 \times1\) matrix and a \(3 \times3\) matrix.
\[\Gamma^{(4)}(g) = \Gamma^{(1)}(g) \otimes \Gamma^{(3)}(g) \label{12.1}\]
in which the bracketed superscripts denote the dimensionality of the matrices. Note that a direct sum is very different from ordinary matrix addition since it produces a matrix of higher dimensionality. A direct sum of two matrices of orders \(n\) and \(m\) is performed by placing the matrices to be summed along the diagonal of a matrix of order \(n + m\) and filling in the remaining elements with zeroes.
The reason why this result is useful in group theory is that the two sets of matrices \(\Gamma^{(1)}(g)\) and \(\Gamma^{(3)}(g)\) also satisfy all of the requirements for a matrix representation. Each set contains the identity and an inverse for each member, and the members multiply together associatively according to the group multiplication table\(^3\). Recall that the basis for the original four-dimensional representation had the \(s\) orbitals \(\begin{pmatrix} s_N, s_1, s_2, s_3 \end{pmatrix}\) of ammonia as its basis. The first set of reduced matrices, \(\Gamma^{(1)}(g)\), forms a one-dimensional representation with \(\begin{pmatrix} s_N \end{pmatrix}\) as its basis. The second set, \(\Gamma^{(3)}(g)\) forms a three-dimensional representation with the basis \(\begin{pmatrix}s_1, s_2, s_3 \end{pmatrix}\). Separation of the original representation into representations of lower dimensionality is called reduction of the representation. The two reduced representations are shown below.
\[\begin{array}{cccccccl} g & E & C_3^+ & C_3^- & \sigma_v & \sigma_v' & \sigma_v'' & \\ \Gamma^{(1)}(g) & (1) & (1) & (1) & (1) & (1) & (1) & \begin{array}{l} \small \text{1D representation} \\ \small \text{spanned by} \: (s_N) \end{array} \\ \Gamma^{(3)}(g) & \scriptsize{\begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{pmatrix}} & \scriptsize{\begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 1 & 0 & 0 \end{pmatrix}} & \scriptsize{\begin{pmatrix} 0 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \end{pmatrix}} & \scriptsize{\begin{pmatrix} 1 & 0 & 0 \\ 0 & 0 & 1 \\ 0 & 1 & 0 \end{pmatrix}} & \scriptsize{\begin{pmatrix} 0 & 1 & 0 \\ 1 & 0 & 0 \\ 0 & 0 & 1 \end{pmatrix}} & \scriptsize{\begin{pmatrix} 0 & 0 & 1 \\ 0 & 1 & 0 \\ 1 & 0 & 0 \end{pmatrix}} & \begin{array}{l} \small \text{3D representation} \\ \small \text{spanned by} \: \begin{pmatrix} s_1, s_2, s_3 \end{pmatrix} \end{array} \end{array} \nonumber\]
The logical next step is to investigate whether or not the three dimensional representation \(\Gamma^{(3)}(g)\) can be reduced any further. As it stands, the matrices making up this representation are not in block diagonal form (some of you may have noted that the matrices representing \(E\) and \(\sigma_v\) are block diagonal, but in order for a representation to be reducible all of the matrix representatives must be in the same block diagonal form) so the representation is not reducible. However, we can carry out a similarity transformation (see \(10.1\)) to a new representation spanned by a new set of basis functions (made up of linear combinations of \(\begin{pmatrix} s_1, s_2, s_3 \end{pmatrix}\)), which is reducible. In this case, the appropriate (normalized) linear combinations to use as our new basis functions are
\[\begin{array}{c} s_1' = \dfrac{1}{\sqrt{3}}(s_1 + s_2 + s_3) \\ s_2' = \dfrac{1}{\sqrt{6}}(2s_1 - s_2 - s_3) \\ s_3' = \dfrac{1}{\sqrt{2}}(s_2 - s_3) \end{array} \label{12.2}\]
or in matrix form
\[\begin{array}{cccc} \begin{pmatrix} s_1', s_2', s_3' \end{pmatrix} & = & \begin{pmatrix} s_1, s_2, s_3 \end{pmatrix} & \begin{pmatrix} \dfrac{1}{\sqrt{3}} & \dfrac{2}{\sqrt{6}} & 0 \\ \dfrac{1}{\sqrt{3}} & -\dfrac{1}{\sqrt{6}} & \dfrac{1}{\sqrt{2}} \\ \dfrac{1}{\sqrt{3}} & -\dfrac{1}{\sqrt{6}} & -\dfrac{1}{\sqrt{2}} \end{pmatrix} \\ \textbf{x'} & = & \textbf{x} & C \end{array} \label{12.3}\]
The matrices in the new representation are found from \(\Gamma'(g)\) = \(C^{-1}\Gamma(g)C\) to be
\[\begin{array}{lcccccc} & E & C_3^+ & C_3^- & \sigma_v & \sigma_v' & \sigma_v'' \\ \Gamma^{(3),}(g) & \scriptsize{\begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{pmatrix}} & \scriptsize{\begin{pmatrix} 1 & 0 & 0 \\ 0 & -\dfrac{1}{2} & \dfrac{\sqrt{3}}{2} \\ 0 & -\dfrac{\sqrt{3}}{2} & -\dfrac{1}{2} \end{pmatrix}} & \scriptsize{\begin{pmatrix} 1 & 0 & 0 \\ 0 & -\dfrac{1}{2} & -\dfrac{\sqrt{3}}{2} \\ 0 & \dfrac{\sqrt{3}}{2} & -\dfrac{1}{2} \end{pmatrix}} & \scriptsize{\begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & -1 \end{pmatrix}} & \scriptsize{\begin{pmatrix} 1 & 0 & 0 \\ 0 & -\dfrac{1}{2} & \dfrac{\sqrt{3}}{2} \\ 0 & \dfrac{\sqrt{3}}{2} & \dfrac{1}{2} \end{pmatrix}} & \scriptsize{\begin{pmatrix} 1 & 0 & 0 \\ 0 & -\dfrac{1}{2} & -\dfrac{\sqrt{3}}{2} \\ 0 & -\dfrac{\sqrt{3}}{2} & \dfrac{1}{2} \end{pmatrix}} \end{array} \]
We see that each matrix is now in block diagonal form, and the representation may be reduced into the direct sum of a 1 x 1 representation spanned by \(\begin{pmatrix} s_1' \end{pmatrix}\) and a 2x2 representation spanned by \(\begin{pmatrix} s_2', s_3' \end{pmatrix}\). The complete set of reduced representations obtained from the original 4D representation is:
\[\begin{array}{ccccccl} E & C_3^+ & C_3^- & \sigma_v & \sigma_v' & \sigma_v'' & \\ (1) & (1) & (1) & (1) & (1) & (1) & \begin{array}{l} \text{1D representation spanned} \\ \text{by} \: \begin{pmatrix} s_N \end{pmatrix} \end{array} \\ (1) & (1) & (1) & (1) & (1) & (1) & \begin{array}{l} \text{1D representation spanned} \\ \text{by} \: \begin{pmatrix} s_1' \end{pmatrix} \end{array} \\ \scriptsize{\begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}} & \scriptsize{\begin{pmatrix} -\dfrac{1}{2} & \dfrac{\sqrt{3}}{2} \\ -\dfrac{\sqrt{3}}{2} & -\dfrac{1}{2} \end{pmatrix}} & \scriptsize{\begin{pmatrix} -\dfrac{1}{2} & -\dfrac{\sqrt{3}}{2} \\ \dfrac{\sqrt{3}}{2} & -\dfrac{1}{2} \end{pmatrix}} & \scriptsize{\begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix}} & \scriptsize{\begin{pmatrix} -\dfrac{1}{2} & \dfrac{\sqrt{3}}{2} \\ \dfrac{\sqrt{3}}{2} & \dfrac{1}{2} \end{pmatrix}} & \scriptsize{\begin{pmatrix} -\dfrac{1}{2} & -\dfrac{\sqrt{3}}{2} \\ -\dfrac{\sqrt{3}}{2} & \dfrac{1}{2} \end{pmatrix}} & \begin{array}{l} \text{2D representation spanned} \\ \text{by} \: \begin{pmatrix} s_2', s_3' \end{pmatrix} \end{array} \end{array}\]
This is as far as we can go in reducing this representation. None of the three representations above can be reduced any further, and they are therefore called irreducible representations, of the point group. Formally, a representation is an irreducible representation if there is no similarity transform that can simultaneously convert all of the representatives into block diagonal form. The linear combination of basis functions that converts a matrix representation into block diagonal form, allowing reduction of the representation, is called a symmetry adapted linear combination (SALC).
\(^3\) The 1x1 representation in which all of the elements are equal to 1 is sometimes called the unfaithful representation, since it satisfies the group properties in a fairly trivial way without telling us much about the symmetry properties of the group.