View source for Appendix D - Group Theory

===Introduction===

<nowiki>''</nowiki>''Symmetry, as wide or as narrow as you may define its meaning, is one idea by which man through the ages has tried to comprehend and create order, beauty and perfection.''<nowiki>''</nowiki>

'''Hermann Weyl'''

====Symmetries and Groups====

Symmetry arguments have been used widely in mathematics, physics,
chemistry, biology, computer science, engineering, and elsewhere.  
Group theory can be an invaluable organizational tool,
whether it is used explicitly or implicitly, in many areas of
science.  

In physics, symmetry principles are often used to describe what
changes and what does not in a physical system undergoing some
particular transformation.  For example, if a knob is turned in an
experiment and nothing changes, then that is an invariant of the
system and thus indicates a symmetry.  (Of course, the trivial case
where the knob has nothing to do with the experiment, like if the
machine with the knob is unplugged, should be excluded.) The objective
here is to explain group theory with this practical viewpoint in
mind; the idea is for this motivation to be kept in mind
throughout these notes.  Some formalism is necessary however.  

It is worth noting that very general things tend to need to be 
abstract.  And so it is with group theory.  However, to reiterate, the 
objective here is to be as concrete as possible with the emphasis on 
physical applications.  In this regard, it is worth mentioning that, 
directly or indirectly, [[Bibliography#Tinkham:gpthbook|Michael Tinkham's book [22]]] 
on group theory very much influenced these notes.  Also, Encyclopedia of Maths, Hammermesh, ...

====Group Theory in Physics====

The applications to physics are too numerous to mention here.  However, several comments
are in order.  First, if a system has a symmetry (often able to be determined by inspection), then it has a
constraint placed on it. This limits the acceptability of solutions to a problem -
they must satisfy the symmetry requirement.  Thus identifying
symmetries is an excellent problem-solving technique.  Choosing 
coordinates for a problem in three-dimensional space is an example 
of such symmetry identification.  Some simple problems in calculus are very difficult (if not impossible) to solve if the "wrong" coordinate system is chosen.  

In physics, as in other areas, a group most often arises as a set of symmetries.  
Suppose that, for example, elements 
<math>A,B,C,D,...\,\!</math> operate on an object in such a way 
that they do not change the object.  Most often in physics the
elements are matrices and the objects on which they act are vectors.
If a vector or set of vectors is unchanged by these operations, then
the vectors have a symmetry described by the action of these
operators.  In Example 2 below the vectors are the vertices of the triangle
and the triangle is unchanged by the action of the group elements given in the example.  (Notice that, as an example
of how a set of symmetries forms a group, if the vector is <math>v\,\!</math>
and assuming <math>Av=v\,\!</math>, i.e. <math>A\,\!</math> is a symmetry operation, and also assuming
<math>Bv=v\,\!</math>, then <math>ABv = v\,\!</math>. Thus the set is closed under multiplication, which means that the product of elements in the set is always in the set.)
One way to think of this is quite literal.  If a symmetry operation is
applied to the equilateral triangle and the triangle is still an 
equilateral with the vertices indistinguishable (assuming no labels), then the
operation did not change anything discernible.  

It turns out that group theory has been applied with great success to
many areas of quantum physics: solid-state physics including
crystallography, nuclear physics, atomic physics, molecular physics,
and particle physics.  It has also been applied in classical physics
and relativity.  It has been especially indispensable in quantum field theory and particle 
physics where symmetries correspond to conserved quantities observed in experiment. 

Some groups which have an infinite number of elements, such as Lie groups, were originally
studied in order to understand the symmetries of differential equations.  Even if one cannot solve a particular problem, a great deal can be said about the solution by examining the symmetries of the problems.

===Definitions and Examples===

====Definition 1: Group====
A '''group''' <math>\mathcal{G}\,\!</math> is a set of objects <math>\{A,B,C,
...\}\,\!</math> together with a composition rule between them (denoted <math>\circ\,\!</math> here and 
called a product or multiplication) such that the following are satisfied:
#<math>(A\circ B)\circ C = A\circ (B \circ C)\,\!</math>. (<math>\circ\,\!</math> is associative.)
#If <math>A\in \mathcal{G}\,\!</math> and <math>B\in\mathcal{G}\,\!</math>, then their product is <math>A\circ B \in \mathcal{G}\,\!</math>.  (The set is closed under multiplication.)
#There is an element <math>\mathbb{I}\in \mathcal{G}\,\!</math>  such that, for all <math>A\in \mathcal{G}\,\!</math>, <math>\mathbb{I}\circ A = A = A\circ \mathbb{I}\,\!</math>. (<math>\mathcal{G}\,\!</math> contains the identity element.)
#For all <math>A\in \mathcal{G}\,\!</math> there exists an element <math>A^{-1}\in\mathcal{G}\,\!</math> such that <math>A\circ A^{-1} =  \mathbb{I} =A^{-1}\circ A\,\!</math>.


In the examples, the objective is to make the direct connection between a group and a set of symmetries of an object.  The reason is that ''a set of symmetries forms a group'' since it satisfies all the conditions in the definition.  The symmetries are things you can do to (i.e., operations you can perform on) a set that leaves the set unchanged.   

To see this, suppose that we operate on a set of vectors whose endpoints have a certain symmetry associated with them.  (For example, the vertices of an equilateral triangle.)  Assume their origin is the origin of a coordinate axes.  Operating on these with a set of matrix operators may leave the set of vectors unchanged, e.g. the arrows associated with the vectors still point to the same set of points, if the set of matrices is chosen properly.  Assuming all possible such matrices are included in the set, then the set of matrices, or set of symmetries, forms a group.

====Example 1====

Consider a line segment of length 2 cm with midpoint at zero.  Suppose the end points are located at <math>\pm 1\,\!</math> cm of the x-axis.  If the line segment were rotated <math>180^o\,\!</math> about any line perpendicular to the segment, it would look like the same line segment.  (Let us be definite and choose the axis perpendicular to the x-y plane after choosing x and y axes.)  What this would do is exchange the two ends.  The set of points <math>\pm 1\,\!</math> could be acted upon by an operator that
exchanges the two.  This rotation operation can be represented using multiplication by <math>-1\,\!</math>.  Then there are two elements in the set of operations to consider.  The first is ''do nothing'' represented by <math>1\,\!</math>.  (This, of course, is the identity operation <math>\mathbb{I}\,\!</math> for this ''group''.)  The other element is <math>-1\,\!</math>.  Thus, representing
multiplication by <math>\circ\,\!</math>, we have a group with the set <math>\{+1,-1\}\,\!</math>
and operation <math>\circ \equiv \times \,\!</math>.  Clearly the product is associative (it is multiplication), the set contains the identity, the results products are either <math>+1\,\!</math> or <math>-1\,\!</math> which are both in the group (indicating closure), and the inverse of <math>-1\,\!</math> is <math>-1\,\!</math>; all of requirements defined above are satisfied.  In fact this is the simplest group.

====Example 2====

The set of symmetries of an equilateral triangle can be represented in several ways.  Two that are presented here are (1) the set of operations on vectors from the origin to the vertices and (2) the set of permutations on three objects.  

<center> <div id="Figure D.1">'''Figure D.1'''</div>
{|
|[[File:triangle2.jpg]]
|}
Figure D.1:  An equilateral triangle with vertices in the x-y plane, <math> v_1\,\!</math> at <math>(0,1/\sqrt{3})\,\!</math>, <math>v_2\,\!</math> at <math>(-1/2,-1/(2\sqrt{3}))\,\!</math>, and  <math>v_3\,\!</math> at <math>(1/2,-1/(2\sqrt{3}))\,\!</math>.
</center>

Consider an equilateral triangle with its 
center at the origin of the x-y plane and  vertices
placed at the following points: <math>(0,1/\sqrt{3})\,\!</math>,
<math>(1/2,-1/(2\sqrt{3}))\,\!</math>, <math>(-1/2,-1/(2\sqrt{3}))\,\!</math>.  (See [[#Figure D.1|Figure D.1]].)  Now consider the
following operations on the triangle: a rotation of <math>0^o\,\!</math> (do
nothing), a rotation of <math>120^o\,\!</math>, a rotation of <math>240^o\,\!</math>, and a reflection
about the <math>x\,\!</math> axis, <math>\sigma_1\,\!</math>.  There are two other reflections we could perform, labelled <math>\sigma_2\,\!</math> and <math>\sigma_3\,\!</math>, which are reflections through lines bisecting the angles at vertices 2 and 3 respectively, as shown in [[#Figure D.1|Figure D.1]].  These make up the set of six symmetry operations on the equilateral triangle.  

If we take the first of these, <math>P_0\,\!</math>, to be the original configuration (shown in [[#Figure D.1|Figure D.1]]), then each of the first three of these are a rotation from the original configuration.  Each of the last three is obtained from a reflection combined with a rotation.  To be explicit, let us consider the following operations:  
{{Equation|<math>
\mathbb{I}_2 = \left(\begin{array}{cc} 1 & 0  \\ 0 & 1  
  \end{array}\right), 
R_1 = \left(\begin{array}{cc} -1/2 & -\sqrt{3}/2 \\ \sqrt{3}/2
    & -1/2 \end{array}\right), \; \; 
R_2 = \left(\begin{array}{cc}  -1/2 & \sqrt{3}/2  \\ -\sqrt{3}/2
    & -1/2 \end{array}\right), 
\,\!</math>|D.1}}
where <math>R_1\,\!</math> is a rotation of the x-y plane by <math>120^o\,\!</math>, <math>R_2\,\!</math>  is a rotation
of the x-y plane by <math>240^o\,\!</math>, and <math>\mathbb{I}_2\,\!</math> is a rotation of <math>0^o\,\!</math> (the identity subscript refers to the 2-dimensional nature of the transformation, unlike the other subscripts here).  In addition to these operations, two others must be included
to complete the set: 
{{Equation|<math>
\sigma_1   = \left(\begin{array}{cc} -1 &0 \\ 0 &1 \end{array}\right), \;\; 
\sigma_2 =\sigma_1 R_1 =  \left(\begin{array}{cc} 1/2 & \sqrt{3}/2 \\ \sqrt{3}/2
    & -1/2 \end{array}\right), \; \; 
\sigma_3 = \sigma_1R_2 = \left(\begin{array}{cc}  1/2 & -\sqrt{3}/2  \\ -\sqrt{3}/2
    & -1/2 \end{array}\right), \; \; 
\,\!</math>|D.2}}
where <math>\sigma_1 R_1\,\!</math> is the same as <math>\sigma_1\circ R_1\,\!</math>, but the <math>\circ\,\!</math> has been dropped
since this is ordinary matrix multiplication.  This group will be used
as an example for several group properties and is called <math>S_3\,\!</math>.  The
products of these 
elements are summarized in [[#Table D.1|Table D.1]], which is called the
multiplication table for the group.  The multiplication table will be
discussed repeatedly throughout this appendix due to its importance in
group theory.  It would be advisable to stare at it for some time to
see what patterns can be identified.  The meaning of these patterns
will be discussed later.

<center><div id="Table D.1">
'''Table D.1: Group Multiplication Table for''' <math>S_3\,\!</math></div>
{| border="1" cellpadding="20" cellspacing="0"
|-
|align="center"|<math> \downarrow\rightarrow\,\!</math>
|align="center"|<math>\mathbb{I}_2 \,\!</math>
|align="center"|<math>R_1 \,\!</math>
|align="center"|<math>R_2 \,\!</math>
|align="center"|<math> \sigma_1 \,\!</math>
|align="center"|<math>\sigma_2 \,\!</math>
|align="center"|<math>\sigma_3 \,\!</math>
|-
|align="center"|<math> \mathbb{I}_2\,\!</math>
|align="center"|<math>\mathbb{I}_2 \,\!</math>
|align="center"|<math>R_1 \,\!</math>
|align="center"|<math>R_2 \,\!</math>
|align="center"|<math> \sigma_1 \,\!</math>
|align="center"|<math>\sigma_2 \,\!</math>
|align="center"|<math>\sigma_3 \,\!</math>
|-
|align="center"|<math> R_1 \,\!</math>
|align="center"|<math> R_1 \,\!</math>
|align="center"|<math> R_2  \,\!</math>
|align="center"|<math> \mathbb{I}_2\,\!</math>
|align="center"|<math> \sigma_3\,\!</math>
|align="center"|<math>  \sigma_1  \,\!</math>
|align="center"|<math> \sigma_2  \,\!</math>
|-
|align="center"|<math> R_2\,\!</math>
|align="center"|<math> R_2\,\!</math>
|align="center"|<math> \mathbb{I}_2  \,\!</math>
|align="center"|<math> R_1\,\!</math>
|align="center"|<math> \sigma_2\,\!</math>
|align="center"|<math> \sigma_3\,\!</math>
|align="center"|<math>  \sigma_1 \,\!</math>
|-
|align="center"|<math> \sigma_1  \,\!</math>
|align="center"|<math> \sigma_1  \,\!</math>
|align="center"|<math> \sigma_2 \,\!</math>
|align="center"|<math> \sigma_3 \,\!</math>
|align="center"|<math> \mathbb{I}_2\,\!</math>
|align="center"|<math> R_1\,\!</math>
|align="center"|<math> R_2\,\!</math>
|-
|align="center"|<math> \sigma_2 \,\!</math>
|align="center"|<math> \sigma_2 \,\!</math>
|align="center"|<math> \sigma_3\,\!</math>
|align="center"|<math>  \sigma_1  \,\!</math>
|align="center"|<math> R_2 \,\!</math>
|align="center"|<math> \mathbb{I}_2 \,\!</math>
|align="center"|<math> R_1 \,\!</math>
|-
|align="center"|<math> \sigma_3 \,\!</math>
|align="center"|<math> \sigma_3 \,\!</math>
|align="center"|<math>  \sigma_1  \,\!</math>
|align="center"|<math> \sigma_2\,\!</math>
|align="center"|<math> R_1 \,\!</math>
|align="center"|<math> R_2 \,\!</math>
|align="center"|<math> \mathbb{I}_2\,\!</math>
|}
</center>
<center>
Table D.1: ''Group multiplication table for the group <math>S_3\,\!</math>.  The notation in the upper left corner (<math>\downarrow\rightarrow\,\!</math>) indicates that the element in the first column is to be multiplied by the element in the first row to obtain the result.  Since the group is not abelian, i.e. the elements do not commute, the order matters.''
</center>

A second way to identify all possible configurations of
the triangle that leave the triangle looking the same is to use the positions of the vertices.  There are six possible choices for the positions of the vertices.  Let us name them 1,2,3.  Then, reading counter-clockwise
from the top, we can have <math>P_0=(1,2,3)\,\!</math>, <math>P_2=(3,1,2)\,\!</math>, <math>P_4=(2,3,1)\,\!</math>,
<math>P_1=(1,3,2)\,\!</math>, <math>P_3=(3,2,1)\,\!</math>, <math>P_5=(2,1,3)\,\!</math>.  These are all of the permutations of three objects.  (In this case the three objects are the numbers 1,2,3.)  This is another way to represent the various configurations of the equilateral triangle.

====Definition 2: Order of a Group====

The number of elements in a group is called the '''order''' of the group.  

Example 1 has two elements and so has order two. Example 2 has six
elements, so the order of this group is six.

====Definition 3: Abelian and Nonabelian Group====

A group for which every element of the group commutes with every other element of the group (<math>g_1g_2 = g_2g_1,\;\;\forall g_1,g_2\in \mathcal{G}\,\!</math>) is called '''abelian'''.  If any two elements do not commute, the group is called '''nonabelian'''.  

It is clear that Example 1 is an abelian group consisting of only two
elements <math>+1\,\!</math> and <math>-1\,\!</math>.  However, Example 2 is clearly a nonabelian
group as can be seen from the multiplication table.  For example
<math>\sigma_2R_2 = \sigma_1 \,\!</math>, but <math>R_2\sigma_2 =\sigma_3 \neq \sigma_1 \,\!</math>.

====Definition 4: Cyclic Group====
A '''cyclic group''' is a group in which every element of the group can be obtained from one element and all its distinct powers.  The particular element is called the '''generating element'''.  

Example 4 provides examples of cyclic groups.

====Definition 5: Subgroup====

A '''subgroup''' <math>\mathcal{S}\,\!</math> of a group <math>\mathcal{G}\,\!</math> is a subset of the group elements that satisfies all
the properties in the definition of a group under the inherited multiplication rule.

====Example 3====

Consider the set <math>\{0,1,2,3, \cdots, N-1\}\,\!</math> and identify <math> N\,\!</math> and <math>0\,\!</math>.  This is often written as <math>0 \equiv N\,\!</math>, but is also sometimes written <math>N= 0 \mbox{ mod } N\,\!</math>.  The operation on this set will be addition.  This is called the group of integers modulo <math>N\,\!</math> and is
denoted <math>\mathbb{Z}_N\,\!</math>.  To be concrete, let us consider the group <math>\mathbb{Z}_3\,\!</math>, consisting of 
<math>\{0,1,2;+\}\,\!</math>.  (When the operation could be ambiguous, it is often useful to specify it explicitly along with the members of the set.)  Let us check that this is a group.  First, addition is certainly associative.  Second, the identity is zero since 
<math>a+0 =a\,\!</math> for any integer <math>a\,\!</math>.  Third, <math>1+2=3 = 0 \mbox{ mod } 3\,\!</math>.
In other words, since <math>3\,\!</math> and <math>0\,\!</math> are equivalent, the sum of one and
two is zero which is in the set.  The order of the group is 3 (hence the subscript).

It should be noted that binary addition, commonly found in digital electronics, is just an example of this group with <math>N = 2\,\!</math> <math>\mathbb{Z}_2\,\!</math>.

====Example 1 Revisited====

Recall  [[#Example 1|Example 1]] is a group with <math>\{+1,-1\}\,\!</math> using multiplication.  
This is the simplest nontrivial 
''cyclic group'', since it is a cyclic group of order two.  
All elements of this group are obtained from powers
of <math>-1\,\!</math>, namely <math>-1\,\!</math> and <math>(-1)^2 =1\,\!</math>.  Notice that the generating
element is special; one cannot just take any element of the group to
be a generating element.

====Example 4====

We can represent the cyclic group of order <math>N\,\!</math> 
in several ways.  One we have seen is <math>\mathbb{Z}_N\,\!</math> with the operation of addition.  Another is the set of elements 
<math>\{e^{2\pi i n/N}\}\,\!</math>, <math>n = 0, 1, 2, 3, ..., N-1\,\!</math> with the operation of multiplication.  Since this group can be
seen as the consisting of the element <math>e^{2\pi i/N}\,\!</math> and all its
powers, then this is a cyclic group with generating element 
<math>e^{2\pi i/N}\,\!</math>.

====Example 5====

Include modular arithmetic under multiplication as a group.

===Comparing Groups: Homomorphisms and Isomorphisms===

Let us consider two groups <math>\mathcal{G}_1\,\!</math> and <math>\mathcal{G}_2\,\!</math> with product rules symbolized by <math>\cdot\,\!</math> and <math>\circ\,\!</math> respectively.  Let the elements of <math>\mathcal{G}_1\,\!</math> be denoted <math>a_1,a_2, ...\,\!</math> and the elements of <math>\mathcal{G}_2\,\!</math> be denoted <math>b_1,b_2, ...\,\!</math>  When comparing two groups to see how similar they are, the relationship among the
elements under the product rule is all-important.  Therefore, if a map from one set of elements to another is given by <math>f:\mathcal{G}_1\rightarrow\mathcal{G}_2\,\!</math>, meaning <math>f(a_1) \in\mathcal{G}_2\,\!</math>, then the two groups have the same (algebraic) structure if, for all
<math>a_i,a_j,a_k \in \mathcal{G}_1\,\!</math>, 
{{Equation|<math>
a_i\cdot a_j = a_k \;\; \Rightarrow \;\; f(a_i)\circ f(a_j) = f(a_k).
\,\!</math>|D.3}}  
(Notice that this can be true even if the map takes all of the elements <math>a_i\,\!</math> to the identity.)  

====Definition 6: Homomorphism====

If the condition [[#eqD.3|Eq.(D.3)]] is satisfied, the map is called a '''homomorpic map''' or a '''homomorphism'''.  A homomorphism <math>f\,\!</math> satisfies the important property that 
{{Equation|<math>
f(A\circ B) = f(A) \cdot f(B).
\,\!</math>|D.4}}
The composition <math>\circ\,\!</math> can, in general, be different from <math>\cdot\,\!</math>, but here both will be matrix multiplication unless otherwise stated.

====Definition 7: Isomorphism====

If a homomorphism is one-to-one (each <math>a_i\,\!</math> is mapped to one and only one <math>b_j\,\!</math>) and onto (each element in <math>\mathcal{G}_2\,\!</math> has an element of <math>\mathcal{G}_1\,\!</math> mapped to it), then the map is called an '''isomorphic map''' or an
'''isomorphism'''.  

These definitions are used repeatedly in the representation theory of groups discussed below.

===Discussion===

With only these few definitions it is possible to discuss many important properties of groups and some of the reasons why they are so
important to physics.  Let us first discuss some of the important properties of the group multiplication table.  

====Group Multiplication Table====

The group multiplication table specifies the structure of the group and thus identifies a group.  One example of this is when the
group is abelian.  For all abelian groups the table is symmetric about the diagonal.  (This follows from the fact that <math>ab=ba\,\!</math> for abelian
groups.)  Another example is the presence of subgroups.  This will be illustrated in this section.   

====Subgroups: Return to Example 2====

In [[#Example 2|Example 2]], [[#Table D.1|Table D.1]] immediately shows that the elements
<math>\mathbb{I}, R_1,\,\!</math> and <math>R_2\,\!</math> form a subgroup since they are closed
under multiplication.  Another somewhat less obvious subgroup
consists of the elements <math>\mathbb{I}\,\!</math> and <math>\sigma_1 \,\!</math>.  This is a convenient
method for identifying subgroups, but is clearly limited to groups
with a relatively small order.

====The Rearrangement Theorem====

Notice that each group element appears in each row and each column of [[#Table D.1|Table D.1]] once and only once.  This is no coincidence, but
is a general property of the multiplication table for groups.  This implies that each row and column contains each and every group element
(due to the presence of the identity) so that each row and column is a simple rearrangement of the set of elements.  For this reason, this is
sometimes called the rearrangement theorem and follows directly from the uniqueness of the elements in the set.  (If there were two
elements in a row that were the same, then <math>ac=ab\,\!</math> for some <math>a,b,c\,\!</math>.
But then <math>a^{-1}ac = a^{-1}ab \Rightarrow c=b\,\!</math>, which cannot happen if
all elements are distinct.)

===A Little Representation Theory===

A group is specified by a set of elements, its product rule, and the
relations among the elements of the group under the product rule.  
For finite order groups the group multiplication table is how one 
identifies a group or shows that two groups are homomorphic
(explicitly or not).  

====Definition 8: Representation====

A '''matrix representation''' of an abstract group is
any set of elements which is homomorphic to the set of elements in the abstract group.  

More generally, if there is a homomorphic map from the set of abstract group elements onto a set of operators which, with their own combination rule (multiplication rule), satisfies the group axioms, then the operators form a representation of the group.  (This includes preserving products as described in [[#Definition 6: Homomorphism|Section 3.1]].)

For our purposes, it is very important to note that a
set of group elements can always be represented by a set of matrices
so that we may restrict our attention to matrix representations.  
This, along with ordinary 
matrix multiplication for the product rule, provides a way to represent
any group.  This is true for groups that have a finite order as well
as infinite order (discussed later).  

Note that a representation is a ''homomorphism'' that can be a many-to-one map.  If it is an isomorphism, the representation is said to be '''faithful'''.  If, however, all matrices are the identity matrix, then all group elements are mapped to the identity and the multiplication relations (in the group multiplication table) are preserved; this representation is sometimes called the ''trivial representation''.  This is always a valid, but not very informative and certainly not faithful, representation of any group.  

As will be shown in this first example, there are different sets of matrices that can represent the same group.  This example will provide motivation for what follows.

====Example 6====

Let us consider an example of the representation of the group from
[[#Example 2|Example 2]].  This is a group of operations that will
take any permutation of the vertices to any other permutation.  This
is also the set of permutations of three objects.  This group is often
denoted <math>S_3\,\!</math>.  The set of matrices representing the
rotations, reflection, and rotations combined with reflection provides
one way of representing this group.  Another way to represent this
group is to use <math>3\times 3\,\!</math> matrices rather than the
<math>2\times 2\,\!</math> matrices given in the example.  Let us
consider the following set of matrices:
{{Equation|<math>\begin{align}
\mathbb{I}_3 = \left(\begin{array}{ccc} 1&0&0 \\ 0&1&0 \\ 0&0&1 \end{array}\right), \;\;\;
&
P_2 = \left(\begin{array}{ccc} 0&0&1 \\ 1&0&0 \\ 0&1&0 \end{array}\right), \\
P_4 = \left(\begin{array}{ccc} 0&1&0 \\ 0&0&1 \\ 1&0&0 \end{array}\right), \;\;\;
&
P_1 = \left(\begin{array}{ccc} 1&0&0 \\ 0&0&1 \\ 0&1&0 \end{array}\right),\\
P_3 = \left(\begin{array}{ccc} 0&0&1 \\ 0&1&0 \\ 1&0&0 \end{array}\right), \;\;\;
&
P_5 = \left(\begin{array}{ccc} 0&1&0 \\ 1&0&0 \\ 0&0&1 \end{array}\right). 
\end{align}\,\!</math>|D.5}}
Clearly, when these matrices act on a column vector, labelling the
vertices,
{{Equation|<math>
\left(\begin{array}{c} 1 \\ 2 \\ 3 \end{array}\right), 
\,\!</math>|D.6}}
the result is one of the permutations of three objects.  These
orientations correspond to the same action as the <math>2\times 2\,\!</math> matrices
given in [[#Example 2|Example 2]] above.  Therefore, these two sets of matrices
represent the ''same'' group, <math>S_3\,\!</math>.  These representations are clearly
different; in fact, the dimensions of the matrices representing the
group is different for the two different representations.  There are 
other representations that can be immediately constructed.   Consider
a set of matrices like the following:  
{{Equation|<math>\begin{align}
\mathbb{I}_5 = \left(\begin{array}{cc} \mathbb{I}_3&0 \\ 0&\mathbb{I}_2 \end{array}\right), \;\;\;
&
g_2 = \left(\begin{array}{cc} P_2&0 \\ 0&R_1  \end{array}\right), \\
g_4 = \left(\begin{array}{cc} P_4&0 \\ 0&R_2  \end{array}\right), \; \;\;
&
g_1 = \left(\begin{array}{cc} P_1&0 \\ 0& \sigma_1 \end{array}\right), \\
g_3 = \left(\begin{array}{cc} P_3&0 \\ 0&\sigma_2 \end{array}\right), \;\;\;
&
g_5 = \left(\begin{array}{cc} P_5&0 \\ 0& \sigma_3  \end{array}\right). 
\end{align}\,\!</math>|D.7}}
This set of matrices is said to be block-diagonal since it only has
non-zero elements in blocks along the diagonal.  The <math>0\,\!</math> represents a
block of zeroes which is either <math>3\times 2\,\!</math> (upper right) or <math>2\times
3\,\!</math> (lower left).  This set of matrices clearly satisfies the same multiplication relations as the sets given above,
(<math>\{\mathbb{I}_3,P_1,P_2,P_3,P_4,P_5\}\,\!</math> and <math>\{\mathbb{I}_2, R_1, R_2, \sigma_1, \sigma_2, \sigma_3\}\,\!</math>), since the matrices multiply in
blocks.  The elements of the group have the same multiplication table
and thus are isomorphic.  Therefore this is another representation of
the group <math>S_3\,\!</math> that is different from either of the
two representations in the subblocks along the diagonal since it is a
combination of the two.

====Definition 9: Similarity Transformation====

Let <math>S\,\!</math> be an invertible matrix and <math>M\,\!</math> be any matrix.  In these notes, by '''similarity transformation'''  we mean a transformation of the matrix <math>M\,\!</math> to <math>M^\prime\,\!</math> that looks like 
{{Equation|<math>M^\prime = SMS^{-1}.\,\!</math>|D.8}}
We say the matrices <math>M\,\!</math> and <math>M^\prime\,\!</math> are similar matrices.  

The importance of similarity transformations for representation theory is that they leave matrix equations unchanged.  Suppose <math>A=BC \,\!</math>.  Then defining <math>A^\prime = SAS^{-1}\,\!</math>, <math>B^\prime = SBS^{-1}\,\!</math>, and <math>C^\prime = SCS^{-1}\,\!</math>, then
<center>
<math>A=BC \; \Rightarrow A^\prime=B^\prime C^\prime\,\!</math>.
</center>

For more discussion on similarity transformations, see [[Appendix C - Vectors and Linear Algebra|Appendix C]], especially [[Appendix C - Vectors and Linear Algebra#The Trace|Section 3.5]], [[Appendix C - Vectors and Linear Algebra#The Trace|Section 3.6]], and  [[Appendix C - Vectors and Linear Algebra#The Trace|Section 5.1]].

====Example 6 Continued====

Example 6 is a non-trivial problem even though it appears
otherwise.  The way to show this is to
perform a similarity transformation, <math>g
\rightarrow S g S^{-1}\,\!</math>, on all elements <math>g\,\!</math>
of the group.  Since <math>S \,\!</math> is any invertible matrix,
it could mix all rows and columns.  This would make it very difficult to identify the block-diagonal form or even know that it exists unless some other tools are used.

Furthermore, given a set of matrices that are known to form a representation of the group, it is non-trivial to find the similarity transformation that will simultaneously block-diagonalize all of these matrices to enable the identification of irreducible blocks.

====Equivalent Representations====

Two representations <math>D^{(1)}\,\!</math> and <math>D^{(2)} \,\!</math> are '''equivalent''' if and only if there is an invertible matrix <math>S \,\!</math> such that <math>D^{(1)} = SD^{(2)}S^{-1} \,\!</math>.

We will only consider matrix representations.  In this case, the matrices will act on a vector space <math>\mathcal{V}\,\!</math> called the '''representation space.'''

===Miscellaneous Definitions===

====Definition 10: Stabilizer====

The '''stabilizer''' of an element <math>m\,\!</math> of a set <math>\mathcal{M}\,\!</math> is the subgroup <math>\mathcal{S}\,\!</math> of a group <math>\mathcal{G}\,\!</math> that leaves the element <math>m\,\!</math> fixed: 
{{Equation|<math>
\mathcal{S} = \{S\in \mathcal{S}|sm=m\}
\,\!</math>|D.9}}
The stabilizer of <math>m\,\!</math> is also called the '''isotropy group''' of <math>m\,\!</math>, the '''isotropy subgroup''' of <math>m\,\!</math>, the '''stationary subgroup''' of <math>m\,\!</math>, or sometimes in physics, '''little group''' of <math>m\,\!</math>.

====Definition 11: Centralizer====

The '''centralizer''' subgroup of a group consists of elements of the group that commute with all elements of a certain set.

====Definition 12: Pauli Group====
The '''Pauli Group''' on <math>n\,\!</math> qubits, denoted <math>\mathcal{P}_n\,\!</math>, is the set of <math>n\,\!</math> tensor products of the Pauli matrices <math>\mathbb{I}, X, Y, Z\,\!</math> along with coefficients <math>\pm 1,\pm i\,\!</math>.  This is an example of a group.  It is defined here due to its importance for quantum error correcting codes and the factors <math>\pm 1,\pm i\,\!</math> are required for the closure property in the definition of a group.

====Properties of the Pauli Group====

Let us consider the Pauli group for 2 qubits with the tensor product symbols omitted.  The following are elements:
{{Equation|<math>
\mathbb{I}\mathbb{I},\mathbb{I}X,\mathbb{I}Y,\mathbb{I}Z,X\mathbb{I},XX,XY,XZ,Y\mathbb{I},YX,YY,YZ,Z\mathbb{I},ZX,ZY,ZZ,
\,\!</math>|D.10}}
as are all of these elements multiplied by <math>-1,\,\!</math> and all of these elements multiplied by <math>i,\,\!</math> as well as all of these elements multiplied by <math>-i.\,\!</math>  Thus there are <math>4^3\,\!</math> total elements of the group for two qubits.  In general there are <math>4\cdot 4^n\,\!</math> elements for the Pauli group for <math>n\,\!</math> qubits.

One of the nice and interesting properties of the Pauli group is that every pair, say <math>A,B\,\!</math>, of elements of the Pauli group either commutes <math>[A,B]= AB-BA =0\,\!</math> or anti-commutes <math>\{A,B\} = AB+BA =0\,\!</math>.  This turns out the be very useful.  

Another notation for [[#eqD.10|Equation (D.10)]] is 
{{Equation|<math>
\mathbb{I},X_2,Y_2,Z_2,X_1,X_1X_2,X_1Y_2,X_1Z_2,Y_1,Y_1X_2,Y_1Y_2,Y_1Z_2,Z_1,Z_1X_2,Z_1Y_2,Z_1Z_2.
\,\!</math>|D.11}}
Clearly this index notation has an advantage for large products.  It also enables us to immediately see the weight of an operator.

====Definition 13: Weight of an Operator====

The '''weight of an operator''' is the number of non-identity elements in the tensor product.  

This definition is most often used in the context of the Pauli Group.  Its importance is seen in quantum error correcting codes.

====Definition 14: Generators of a Group====

Let us consider a discrete group (or subgroup of a larger group).  There exists a subset of the group elements that will give all of the (sub)group elements through multiplication.  The elements in this subset are called '''generators''' of the group.  

Note that the set of generators is not unique.  

The generators are a very convenient set to use because it is a much smaller set than the whole group and many properties of the group can discovered using only the generators.  For example, if every generator of a subgroup acts on an object and leaves it invariant, then every element of the group will also leave it invariant since they are all given by products of the generators.  Thus one only needs to check whether or not the generators will leave an object invariant.  

One example is the stabilizer subgroup where a set of generators stabilizes, or leaves invariant, the code words of the stabilizer code.

====Definition 15: Normalizer====

The '''normalizer''' of a set <math>\mathcal{M}\,\!</math> is the subgroup <math>\mathcal{S}\,\!</math> of a group <math>\mathcal{G}\,\!</math> that leaves the set <math>\mathcal{M}\,\!</math> fixed: 
{{Equation|<math>
\mathcal{S} = \{S\in \mathcal{S}|S\mathcal{M}=\mathcal{M}\}.
\,\!</math>|D.12}}
Note the difference between the centralizer, with which this should not be confused.  The centralizer leaves ''every element'' of the set fixed.  The elements of the normalizer contain the elements of the centralizer as a special case, but they can move elements around within the set.

====Definition 16: Coset====

Let <math>\mathcal{S}\,\!</math> be a subgroup and <math>G\,\!</math> be an element of the group <math>\mathcal{G}\,\!</math>.  The left '''coset''' is a subset of the group 
{{Equation|<math>
G\mathcal{S} = \{GS|S\in\mathcal{S} \}.
\,\!</math>|D.13}}

One can similarly define the right coset.  

The importance of cosets is that they partition the group in a particular way.  If there is another coset, 
{{Equation|<math>
K\mathcal{S} = \{KS|S\in\mathcal{S} \},
\,\!</math>|D.14}}
then either <math>G\mathcal{S}=K\mathcal{S}\,\!</math> or they are disjoint sets, having no element in common.  (This is because <math>\mathcal{S}\,\!</math> is a subgroup.  You could multiply by an element to show they are the same set.)

===Infinite Order Groups: Lie Groups===

All of the examples presented so far have been groups with finite order.  Most groups that are of concern in physics and have infinite order can be described with one or more parameters. These groups are differentiable with respect to those parameters and are called ''Lie groups''.  


====Definition 17: Lie Group====

A '''Lie group''' is a group that is also a differentiable manifold.  (See for example [[Bibliography#Cecile:book|Analysis, Manifolds, and Physics [6]]]).  

In this section, several examples of Lie groups are given.  In physics these groups correspond to a continuous set of symmetries, whereas the groups of finite order correspond to a discrete set of symmetries.

====Example 7====

The Lie group most often used as the introductory example is the group consisting of the set <math>e^{i\theta}\,\!</math> for all 
<math>\theta\,\!</math>.  This group has an infinite number of elements (i.e. an infinite order) and one parameter, <math>\theta\,\!</math>.  The group is also a differentiable manifold---a circle.  Notice that this group is also isomorphic to the set of matrices 
{{Equation|<math>
\left(\begin{array}{cc}
       \cos \theta & -\sin \theta \\
       \sin \theta & \cos \theta 
\end{array}\right).  
\,\!</math>|D.15}}
If this matrix were to act on a unit vector in the x-y plane, it would rotate that vector around in a circle; after <math>2\pi\,\!</math>, the tip of the vector would sweep out a circle of unit radius.

====Example 8====

Another example of a Lie group, and one of the most important for quantum information, is the set of complex <math>2\times 2\,\!</math> matrices
that satisfy
{{Equation|<math>
U^\dagger U = \mathbb{I} = U U^\dagger. 
\,\!</math>|D.16}}
This group is called <math>U(2)\,\!</math>  and is the set of ''unitary'' 
<math>2\times 2\,\!</math> matrices (hence the <math>U\,\!</math>).  Notice that the determinant
of this set is <math>e^{i\alpha}\,\!</math> where <math>\alpha\,\!</math> is a real number, since  
{{Equation|<math>
1 = \det(\mathbb{I}) = \det(U U^\dagger) = \det(U)\det(U^\dagger) 
  = \det(U)(\det(U))^*. 
\,\!</math>|D.17}}

There is a subgroup of this group that is often considered---the subgroup with determinant one.  This group is denoted <math>SU(2)\,\!</math>
and is known as the ''special unitary group''.  The term unitary refers to the fact that <math>U^\dagger U = I = UU^\dagger\,\!</math>, and the "S" for special indicates that it has determinant one.

====Example 9====

One can immediately generalize the unitary and special unitary groups
to <math>N\times N\,\!</math> matrices.  These are denoted <math>U(N)\,\!</math> and <math>SU(N)\,\!</math>
respectively.  In quantum computing, an important set of unitary groups is the set with <math>U(2^n)\,\!</math> where <math>n\,\!</math> is the number of qubits.  This is the set of all possible unitary transformations on a set of qubits.

====Example 10====

The complex General Linear group is the set of invertible <math>N\times N\,\!</math> matrices with complex numbers as entries.  It is denoted <math>GL(N,\mathbb{C})\,\!</math>.

===More Representation Theory===

In physics we are most often concerned with linear representations of groups that use linear operators to represent group elements; we represent these operators with matrices.  In this Appendix, the focus is entirely on these types of representations, although this is not always stated explicitly.  Although these comments have been made above for finite groups, they are worth reiterating due to their importance and because they also apply to infinite order groups, such as Lie groups.  Furthermore, definitions introduced for finite order groups are also applicable to Lie groups.

Thus the previous discussion of representation theory applies to the representation of Lie groups.  A representation of a group can be "reduced" to block-diagonal form.  When these blocks cannot be further reduced, the blocks are called "irreducible".  These irreducible blocks make up "irreducible representations." Our study of representation theory is our concern with irreducible blocks and how to find them.  

Clearly, a set of matrices that may be block-diagonalizable but has been acted upon by a highly non-trivial <math>S \,\!</math> may well represent a group <math>\mathcal{G}\,\!</math> for sets of matrices with many different dimensions and many different block-diagonal forms.  Therefore finding irreducible blocks and the similarity transformation that simultaneously block-diagonalizes all matrices of a given representation is highly non-trivial.  

Before discussing the representation of Lie groups, there is another definition that is quite helpful.  

====The Lie Algebra of a Lie Group====

The Lie algebra of a Lie group is defined as the set of left-invariant vector fields on the manifold of the Lie group.  For our purposes, the Lie algebra will be described by the basis elements of the tangent space to the origin of the group that is isomorphic to the set of left-invariant vector fields.  To see how to relate the group and algebra and to see how this is useful, let us suppose that there is a Lie algebra corresponding to a Lie group that has a set of basis elements <math>\{\lambda_i\}\,\!</math>.  To describe the relation between the Lie group and Lie algebra, let <math>g\in\mathcal{G}\,\!</math> and let <math>\{a_i\}\,\!</math> be a set of parameters.  Then an element of the Lie algebra is given by <math> \sum_i a_i\lambda_i\,\!</math> and an element of the group written in terms of these parameters is 
{{Equation|<math>
g=\exp\left(-i\sum_i a_i \lambda_i\right).
\,\!</math>|D.17}}
The tangent space to the origin is given by the derivative of <math>g \,\!</math> with respect to the parameters <math> a_i\,\!</math> evaluated at the origin.  In this way, one sees that the group is an analytic manifold.  There are several reasons why it is useful to consider the Lie algebra.  One is that it is often easier to analyze than the Lie group, and several important properties of the Lie group are able to be obtained from properties of the Lie algebra.  (For example, subalgebras correspond to subgroups.)

====Representation Theory for Lie Groups====

As with finite order groups, one of the primary objectives of this introduction to group theory is to enable one to find irreducible representations of a group from a given reducible one.  At the least, the objective should be to understand what this means, how one would go about it in principle, and how it is used in quantum physics and quantum computing.  

Lie groups, represented by a set of matrices consisting of differentiable parameters, may also be described by matrices that are reducible to block-diagonal form with blocks that cannot be reduced further.  These irreducible blocks form irreducible representations of the group.  One may suppose that irreducible representations of Lie groups are more difficult to understand than finite groups due to the fact that there are an infinite number of matrices in the set of group elements.  This is certainly true, so one sometimes relies on the Lie algebra.  Suppose a set of elements <math>\{\lambda_i\}\,\!</math> of a Lie algebra obeys a particular set of commutation relations, say
{{Equation|<math>
[\lambda_i,\lambda_j] = 2i\sum_kf_{ijk}\lambda_k,
\,\!</math>|D.18}}
where <math>f_{ijk}\,\!</math> is some set of constants (and the factor of two is a non-standard convention).  Then any other set that obeys the same commutation relations is also a representation of the same Lie algebra.  The representation of the algebra can then give a representation of the group through exponentiation, although the representation may not be faithful.  

Now let us suppose that there exists a similarity transformation <math>S\,\!</math> that will simultaneously block-diagonalize all elements of a group.  Then, observing that 
{{Equation|<math>
SgS^{-1}=S\exp\left(-i\sum_i a_i \lambda_i\right)S^{-1} = \exp\left(-i\sum_i a_i S\lambda_iS^{-1}\right),
\,\!</math>|D.19}}
it is clear that the same similarity transformation will block-diagonalize the elements of the algebra as well.

====Some Useful Relations Among Lie Algebra Elements====

A Lie algebra will obey the the commutation relations, [[#eqD.18|Equation (D.18)]].  However, since the emphasis here is the representation of groups in terms of matrices, there are several other useful relations that will be listed.  These relations apply to all Lie algebra elements of <math>SU(d)\,\!</math>.  

We have chosen the following convention for the normalization of 
the algebra of Hermitian matrices that represent generators of <math>SU(d)\,\!</math>:  
{{Equation|<math>
\text{Tr}(\lambda_i\lambda_j) = 2\delta_{ij}.  
\,\!</math>|D.20}}

The commutation and anti-commutation relations of the matrices 
representing the basis for the Lie algebra can be summarized 
by
{{Equation|<math>
\lambda_i \lambda_j = \frac{2}{d}\delta_{ij} + if _{ijk} \lambda_k 
                      + d_{ijk}\lambda_k,
\,\!</math>|D.21}}
where here, and throughout this section, a sum over repeated 
indices is understood.  The numbers <math> d_{ijk}\,\!</math> are called totally symmetric d-tensor components.  

As with any Lie algebra, we have the Jacobi identity:
{{Equation|<math>
f_{ilm}f_{jkl} + f_{jlm}f_{kil} + f_{klm}f_{ijl} =0,
\,\!</math>|D.22}}
which may also be written as
{{Equation|<math>
[[\lambda_i,\lambda_j],\lambda_k]+ [[\lambda_j,\lambda_k],\lambda_i] + [[\lambda_k,\lambda_i],\lambda_j]  =0.
\,\!</math>|D.23}}
There is also a Jacobi-like identity,
{{Equation|<math>
f_{ilm}d_{jkl} + f_{jlm}d_{kil} + f_{klm}d_{ijl} =0,
\,\!</math>|D.24}}
which was given by [[Bibliography#Macfarlane/etal|Macfarlane, et al. [38]]]. 

Also provided in [[Bibliography#Macfarlane/etal|Macfarlane, et al. [38]]] are the following identities:
{{Equation|<math>
\begin{align}
d_{iik} &= 0, \\
d_{ijk}f_{ljk} &= 0,  \\
f_{ijk}f_{ljk} &= d\delta_{il},  \\
d_{ijk}d_{ljk} &= \frac{d^2 - 4}{d}\delta_{il},  
\end{align}
\,\!</math>|D.25}}
and
{{Equation|<math>
f_{ijm}f_{klm} = \frac{2}{d}(\delta_{ik}\delta_{jl} - \delta_{il}\delta_{jk}) 
                  + (d_{ikm}d_{jlm} - d_{jkm}d_{ilm}) 
\,\!</math>|D.26}}
and finally
{{Equation|<math>
\begin{align}
f_{piq}f_{qjr}f_{rkp} &= -\left(\frac{d}{2}\right)f_{ijk},\\
d_{piq}f_{qjr}f_{rkp} &= -\left(\frac{d}{2}\right)d_{ijk},\\
d_{piq}d_{qjr}f_{rkp} &= \left(\frac{d^2 - 4}{2d}\right)f_{ijk},\\
d_{piq}d_{qjr}d_{rkp} &= \left(\frac{d^2 - 12}{2d}\right)d_{ijk}.
\end{align} 
\,\!</math>|D.27}}
The proofs of these are fairly straight-forward and are omitted.

====Tensor Products of Representations====

When one takes the tensor product of two representations, another representation results.  In general, this representation is reducible.  

To see this, let <math> g_1,g_2,g_3,g_4 \in \mathcal{G}\,\!</math>.  A tensor product of two group elements is  <math> g_1\otimes g_1 \in \mathcal{G}\otimes \mathcal{G} \,\!</math>.  Certainly, when <math> g_1\cdot g_2 = g_3, \,\!</math> then <math> g_1\otimes g_1\cdot g_2 \otimes g_3 = g_3 \otimes g_3\,\!</math>.  (See [[Appendix C - Vectors and Linear Algebra#Tensor Products|Section C.7]].)  Therefore, the tensor product of two representations is another representation.  However, even if this is an irreducible representation, one would suspect that the tensor product is a reducible representation---this turns out to be true.  The task is to find the irreducible components.

One very important example of this is used for the addition of angular momenta.  Before revisiting the more general case, this important example is discussed.

====Addition of Angular Momenta====

In the theory of angular momenta, quantum states are labelled according to their total angular momentum eigenstates and the z component of their angular momentum.  Let the total angular momentum square be given by the operator 
{{Equation|<math>
\vec{J} = (J_x,J_y,J_z).  
\,\!</math>|D.26}}
These operators satisfy the commutation relations
{{Equation|<math>
[J_i,J_j] = i\epsilon_{ijk}J_k,
\,\!</math>|D.27}}
where <math>i,j,k = 1,2,\text{ or }3, \,\!</math> and the epsilon tensor is defined in [[Appendix C - Vectors and Linear Algebra#eqC.9|Equation C.9]].  A state <math>\left| j, m\right\rangle\,\!</math> satisfies 
{{Equation|<math>
J^2\left| j, m\right\rangle = j(j+1)\hbar^2\left| j, m\right\rangle, \;\; \text{and} \;\; J_z\left| j, m\right\rangle = m\hbar\left| j, m\right\rangle,
\,\!</math>|D.28}}
where 
{{Equation|<math>
J^2 = \vec{J} \cdot \vec{J} = J_x^2 + J_y^2 + J_z^2.
\,\!</math>|D.29}}
The common problem is as follows.  Given two states <math>\left| j_1, m_1\right\rangle\,\!</math> and <math>\left| j_2, m_2\right\rangle\,\!</math>, find the total angular momentum of the two states combined.  The objective is to find a new basis,  <math>\left| j, m, j_1, j_2\right\rangle\,\!</math>, which is expressed in terms of the old basis.  In other words, we need to find the set of numbers <math>C(j_1,j_2,j,m|m_1,m_2,m)\,\!</math> such that 
{{Equation|<math>
\left| j, m, j_1, j_2\right\rangle = \sum_{m_1,m_2} C(j_1,j_2,j,m|m_1,m_2,m) \left| j_1, m_1\right\rangle \left| j_2, m_2\right\rangle.
\,\!</math>|D.30}}
The numbers <math>C(j_1,j_2,j,m|m_1,m_2,m)\,\!</math> are called Clebsch-Gordan coefficients, or Wigner-Clebsch-Gordan coefficients.  These not only put the tensor product of the vectors into this special form, but they also block-diagonalize the tensor products of the operators.  The most common example of this is the addition of angular momentum of two spin-1/2 particles.  The result is a triplet (spin-1 representation) and a singlet (spin-0 representation).  



<math>  \,\!</math>

====Concluding Remarks====

'''To summarize''', matrix representations of a group are sets of matrices that represent the group in the sense that they follow the same multiplication law as the original group elements.  The representation may be reducible, meaning the set of matrices are all block-diagonalized by a single similarity transformation such that each individual block will represent a group element in its own representation.  If a representation (the set of matrices) cannot be transformed into by a single similarity transformation such that each matrix is comprised of a set of smaller blocks, then the representation is called irreducible.  If there is a isomorphism from the set of matrices to the original group, then the representation is faithful.