How Can You Partition Symmetry Groups Using the Multiplication Table Method?

H-bar None
Messages
45
Reaction score
0
I reading a great book called Symmetry by Roy McWeeny. For those that love Dover Books this one's a gem.

Anyway, I have a question.

How do you partiton a particular group into distinct classes?


The author was discussing the symmetry group C3v the rotation, and reflection of a triangle.

The author was able to partition this group by using its multiplication table. The classes are {E}, {C3,-C3} and {r1,r2,r3}.

Where E is identity, C3,-C3 are positive and negative rotations, r1,r2,r3 are the reflections.

How did he get this answer?
I hope my ? is clearly stated.
 
Physics news on Phys.org
That would depend upon which classes you mean. I presume you mean conjugacy classes. In general you need to take some element x and work out what all the product zxz^-1 ,which we presume the author did by looking at the multiplication table, are, that set of products is then the conjugacy class.

Here it's simple to do by hand. For larger cases one must be cleverer, but in the case of the symmetric group the conjugacy class is uniquely determined by the cycle type. C3v, also called D_3 or D_6 is the same as S_3 the permutation group on three letters. The letters here being the corners of the triangle. A reflection swaps two of them and fixes one, so it can be written as (12)(3) for some labelling of the corners. It has cycle type 2.1, or just 2. A rotation permutes three of them and can be written as (123) say which has cycle type 3. Read the bit on symmetric/permutation groups to see that in more detail.
 
Thanks for the help. I cut out a triangle, labeled the points and worked the multiplication table manually. Learned a lot.

Now onward to vector spaces and lattices with the rest stop at representaion theory. :biggrin:
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top