# Symmetry representations

I'm Having a real struggle trying to understand symmetry representations matrices and character tables. Is there anyone who would be kind enough to help me out here? I understand it is probably a little broad but nevertheless, I will list some areas that if anyone could shed some light on I would be very appreciative.

1) What is an irreducible representation? My book just starts going into $2\times 2$ matrices like: \begin{equation} \left( \begin{array}{cc} 1 & 0\\ 0& 1\end{array} \right) \end{equation} Saying that we can represent the effect of symmetry operations as such! When the operation actually affects the molecule by changing an atom then the diagonal of the matrix swaps round seemingly !!

2) Leading on from the first question, what is a reducible representation? Why the distinction?

3) What is a basis? My book introduces them via vectors down each of the cartesian axes and then a "set" of them together (why) to give four basis's for a $C_2v$.

4) I can use the reduction formula to see how many irreducible representations are contained within a particular reducible representation, but what am I doing!

• What book are you using? Nov 13, 2014 at 18:39
• Introduction to molecular symmetry. J.S Ogden Oxford primer series. It is a very good book so far but I'm struggling past chapter 3. Nov 13, 2014 at 18:49
• Molecular Symmetry and Group Theory by Vincent is amazing, going into just the right amount of detail for a chemist: eu.wiley.com/WileyCDA/WileyTitle/productCd-0471489395.html Nov 13, 2014 at 20:12
• Algebraic group theory is very useful because it allows us to capture in very abstract terms what the molecule does in terms of symmetry. The transformations within the group fully reflect the transformations within the molecule that make it look like itself.
– Zhe
Jan 22, 2017 at 15:39

A representation is a set of matrices that fulfill the multiplication table for the point group.

So I might be able to use a set of 3x3 matrices, since of course I can define any of the symmetry operations over Cartesian (x,y,z) space. e.g.:

$$E = \left( \begin{array}{ccc} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{array} \right) \; i = \left( \begin{array}{ccc} -1 & 0 & 0 \\ 0 & -1 & 0 \\ 0 & 0 & -1 \end{array} \right)$$

But usually, I can fulfill the multiplication table with much simpler (smaller) matrices.

1. An irreducible representation is a set of matrices that are as small as possible.
2. A reducible representation is a set of matrices that can be decomposed into a linear combination of irreducible representations. This can occur by multiple techniques, including block-diagonalization.

The distinction exists, because for chemical point groups, there are usually a finite number of irreducible representations (given in character tables), but of course there are an infinite number of reducible representations.

The power of symmetry and group theory is that any function of a molecule, like orbitals, vibrations, etc. can be described using a representation. Thus, we usually label orbitals and vibrations by their corresponding irreducible representation.

1. I'll have to hunt down my copy of Ogden, but usually people use the Cartesian axes or $p_z$, $p_x$, and $p_y$ to illustrate the different irreducible representations. That is, a basis is some function (like the Cartesian axes or an atomic orbital) used to generate a representation. We look at how the basis is transformed under the different symmetry operations and write down the matrix or characters from those transformations.

(I try not to use that term because students find it confusing and different guides and texts use subtly different definitions for it.)

1. The reduction formula (or algorithm) is a way of decomposing the reducible representation (which is really a big matrix) into a combination of the different irreducible representations, but only needing to act on the characters of the representations.

That is, I don't need to actually use the reducible matrices themselves. Using the reduction formula, I can get the linear combination of irreducible representations only using multiplication of characters of the representations. It's much easier to do the reduction formula than to figure out how to transform a large reducible matrix.