Group Theory
Appendix A Group Theory
This appendix is a survey of only those topics in group theory that are needed to understand the composition of symmetry transformations and its consequences for fundamental physics. It is intended to be self-contained and covers those topics that are needed to follow the main text. Although in the end this appendix became quite long, a thorough understanding of group theory is possible only by consulting the appropriate literature in addition to this appendix. In order that this book not become too lengthy, proofs of theorems were largely omitted; again I refer to other monographs. From its very title, the book by H. Georgi [206] is the most appropriate if particle physics is the primary focus of interest. The book by G. Costa and G. Fogli [100] is written in the same spirit. Both books also cover the necessary group theory for grand unification ideas. A very comprehensive but also rather dense treatment is given by [418]. Still a classic is [248]; it contains more about the treatment of dynamical symmetries in quantum mechanics.
A.1 Basics
A.1.1 Definitions: Algebraic Structures
From the structureless notion of a set, one can successively generate more and more algebraic structures. Those that play a prominent role in physics are defined in the following.
Group
A group G is a set with elements gi and an operation ◦ (called group multiplication) with the properties that (i) the operation is closed: gi ◦gj ∈ G, (ii) a neutral element g0 ∈ G exists such that gi ◦ g0 = g0 ◦ gi = gi, (iii) for every gi exists an inverse −1 ∈ ◦ −1 −1 ◦ element gi G such that gi gi = g0 = gi gi, (iv) the operation is associative: gi ◦ (gj ◦ gk)=(gi ◦ gj) ◦ gk. The closure property can be expressed
K. Sundermeyer, Symmetries in Fundamental Physics, 493 Fundamental Theories of Physics 176, DOI 10.1007/978-94-007-7642-5, c Springer Science+Business Media B.V. 2014 494 A Group Theory
Table A.1 The group D4 1 i -1 -i C Ci -C -Ci 1 1 i -1 -i C Ci -C -Ci i i -1 -i 1 -Ci C Ci -C -1 -1 -i 1 i -C -Ci C Ci -i -i 1 i -1 Ci -C -Ci C C C Ci -C -Ci 1 i -1 -i Ci Ci -C -Ci C -i 1 i -1 -C -C -Ci C Ci -1 -i 1 i -Ci -Ci C Ci -C i -1 -i 1 by considering the operation as a mapping ◦ : G × G → G. There is indeed only one neutral element and the inverse of a group element is unique, as easily can be shown. A group is called finite if the number of its elements (also called the order of the group) is finite. An example of a finite group is the rotations of a square by ◦ 90 (in mathematics and crystallography called C4; a group of order 4). Examples of infinite groups are the integers with respect to addition (countably infinite) and the symmetry group of the circle, characterized by a parameter ϕ [0 ≤ ϕ<2π] (continuous group). The center of a group is defined as the set of those elements of G which commute with all other elements of the group: Cent(G)={c ∈ G | cg = gc for all g ∈ G}.
Example: From the multiplication table of D4 (see Table A.1; more about this group later), one can see that its center is given by the set {1, −1}. 1 A group is called Abelian if the operation is commutative: gi ◦ gj = gj ◦ gi. Obviously the center of an Abelian group is the group itself. The symmetry group C4 of the square is Abelian; the analogous group of the cube is an example of a non–Abelian group. In physics we often deal with groups (or subgroups of) GL(n, F). This is the set of non–singular n × n matrices with elements from the field F which are in the majority of cases real numbers R or complex numbers C. GL(n, F) is in general a non–Abelian group with matrix multiplication as the group operation. The restriction to non–singular matrices is necessary because otherwise the inverse would not be defined. A subset of G, which itself is a group, is called a subgroup of G. By this definition, every group has two trivial subgroups, namely itself (G ⊂ G) and the set consisting of the neutral element ({g0}⊂G). Although in the context of symmetries in fundamental physics, continuous group are the most important ones, many notions from group theory will subsequently
1 This term derives from the name of the Norwegian mathematician Niels HenrikAbel (1802–1829). He is treated with some disrespect by the fact that contemporary theoreticians use his name in a negated form, by talking for instance of “non–Abelian” gauge theories. A.1 Basics 495
i
1 i––1 i b
–1 1
C C Ci –C –Ci a –i c
Fig. A.1 Symmetries of the square
be explained on a finite group. This is the group D4, defined by its multiplication table above. The notation of its elements is taken from [400]. D4 is a group of order 8, its neutral element is (1), and it is non–Abelian (for instance (Ci)C = −i, but C(Ci)=i). This abstract group is realized by 90◦-rotations of the square and reflections along its diagonals; see Fig. A.1. Here the vertices of the square are represented by the points 1, i, –1, –i. The group D4 has various nontrivial subgroups; these are ◦ • order 2: rotations by 180 realized by C2 = {1, −1}, and four reflections realized by {1,C}, {1,Ci}, {1, −C}, {1, −Ci}. ◦ • order 4: rotations by 90 realized by C4 = {1,i,−1, −i}, reflections along diagonals, that is {1, −1,C,−C}, and reflections along the two parallels to the edges of the square: {1, −1,Ci,−Ci}.
Field
A field is a set F with elements fi together with two operations
+: F × F → F ∗ : F × F → F with the properties that (i) F is an Abelian group under the operation + with f0 as the identity, (ii) F \{f0} is a group under ∗, and (iii) there is a distributive law
fi ∗ (fj + fk)=fi ∗ fj + fi ∗ fk, (fi + fj) ∗ fk = fi ∗ fk + fj ∗ fk.
Prominent examples of fields are the real and the complex numbers under the usual addition and multiplication operations. Further fields are known, as for instance quaternions (building a 4–dimensional number system and having some link to Dirac matrices), octonions, sedenions, ... the latter bearing a relation to the exceptional Lie groups. 496 A Group Theory
Vector Space
A (linear) vector space consists of a set V with elements vi and a field F together with two operations
+: V × V → V: F × V → V with the properties that (i) (V,+) is an Abelian group, (ii) the operation fulfills
fi (fj vk)=(fi ∗ fj) vk
1 vi = vi = vi 1
fi (vj + vk)=fi vj + fi vk, (fi + fj) vk = fi vk + fj vk.
Further definitions: • ∈ F A set of vectors vk is called linearly dependent iff fj exist such that fk vk ≡ 0. k • The dimension D of a vector space is defined as the maximal number of linearly independent vectors. • In every vector space of dimension D one can find a set of basis vectors ek which are linearly independent and which make it possible to expand any vector D as v = fjej. Prominent examples of vector spaces are the Euclidean space, the solution space of linear differential and integral operators, the sets of N × M–matrices, and Hilbert spaces.
Algebra
A (linear) algebra A consists of a set V with elements vi, a field F together with three operations +,,. The algebra is a vector space with respect to (V,F, +,). The is a mapping : V × V → V with
(vi + vj)vk = vivk + vjvk
vi2(vj + vk)=vi2vj + vi2vk.
Prominent examples are Lie algebras, which aside from the algebra properties additionally fulfill
vi2(avj + bvk)=avi2vj + bvi2vj,a,b∈ F
vi2vj = −vj2vi
vi2(vj2vk)=(vi2vj)2vk + vj2(vi2vk), A.1 Basics 497 where the latter relation is the Jacobi identity, as it is known in physics for instance for the Poisson brackets or the generators of bosonic/Grassmann-even2 symmetry transformations.
A.1.2 Mapping of Groups
Group Homomorphism
Let f be a group mapping f : G → Gˆ . If the mapping respects the group structure, that is if ◦ ◦ f(g1) Gˆ f(g2)=f(g1 G g2),
(where ◦F denotes the operation in the respective group) it is called a (group) homo- morphism. The definition of a homomorphism can be generalized to fields, vector spaces, and algebras as structure–preserving maps between two of these algebraic structures. The kernel of the homomorphism f is defined as the subset of G for which each element is mapped to the neutral element in Gˆ :
Kerf := {g ∈ G | f(g)=ˆg0 ∈ Gˆ }.
The definition of homomorphism does not exclude that f(g1)=f(g2) for g1 = g2 (a so-called “many-to-one” relation). For instance, mapping all elements of an ar- bitrary group to the real number 1 is a homomorphism between the group and the group of real numbers. A “one-to-one” mapping is called an isomorphism. Isomor- phic groups are not distinguishable in their mathematical structure; one denotes ∼ G = Gˆ .If G = Gˆ the map f is called an automorphism.Aninner automorphism −1 is a mapping fh such that fh → g hg. For finite groups an isomorphism between two groups is easily detected in that both groups have identical multiplication tables. In the symmetry group of the square D4, for example, the group called C2 has the same multiplication table as all the other subgroups of order two (in the classification by crystallography these are called D1: ∼ ∼ ∼ C2 = D1 = {1, −1} = Z2 which also defines the group Z2, as it occurs in the context of C-,P-, and T-transformations. In general, the groups C2N are the cyclic groups: If their ele- ments are written as {1,a,...,a2N−1} their multiplication table can be generated compactly by the rule an ◦ am = a(n+m)mod2N . Therefore, the group of rotations ◦ by 90 is isomorphic to C4 (take a = i). The two other order–4 subgroups are isomorphic ∼ ∼ D2 = {1, −1,C,−C} = {1, −1,Ci,−Ci}.
2 to be explained in B.2.1. 498 A Group Theory
Indeed C2 is the only abstract group of order two, and C4 and D2 are the only groups of order four.
Representation of Groups
In fundamental physics, it is not the symmetry groups themselves that are of pri- mary significance, but–for reasons arising from quantum theory–the “irreducible unitary representations of their central extensions”. These terms are defined in Sect. 3 of this appendix, a section entirely devoted to representation theory. A (matrix)–representation D is a homomorphism D : G → GL(n, F), where n is called the dimension of the representation. Example: Rotations of the square, now denoted by {r0,r90,r180,r270}
• 1-dimensional complex representation of C4: r0 → 1,r90 → i, r180 →−1,r270 →−i.
• 2-dimensional real representation of C4: Since rotations in a plane can be written as x =Rx with a matrix cos θ − sin θ R= sin θ cos θ we get immediately the representation 10 0 −1 r0 → ,r90 → , 01 10 −10 01 r180 → ,r270 → . 0 −1 −10
A.1.3 Simple Groups
It is obvious to ask how many different (that is, not mutually isomorphic) groups there are. A first step towards an answer is the investigation of simple groups, where “simple” is to be understood in the sense of “prime”: The idea is to factorize a group into its simple subgroups. Before a definition can be given, we need some further group–theoretical terms and definitions.
Equivalence Classes
An equivalence relation ∼ on a set M = {a,b,...} is defined by its properties: (i) a ∼ a, (ii) a ∼ b ⇔ b ∼ a, (iii) a ∼ b, b ∼ c ⇒ a ∼ c. Every equivalence relation on M allows to subdivide the set into equivalence classes
[a]:={a ∼ bi | a, bi ∈ M}, A.1 Basics 499 i.e. the class [a] contains all those elements, which are equivalent to a. Thus M is divided in disjunct classes:
M = ∪i [ai] with [ai] ∩ [aj]=∅ if ai aj.
Cosets
If H is a subgroup of G, the set
gH:={g ◦ hi | g ∈ G,hi ∈ H} is called left coset. (A right coset Hg can be defined analogously.) This gives rise to the introduction of an equivalence relation
gi ∼ g ⇔ gi ∈ gH. Thus the group G can (as a set) be subdivided in disjunct cosets ∪p ∩ ∅ G= 1 giH with giH gjH= for gi = gj.
Example: Take H = {1,Ci} to be a subgroup of D4. Because of 1{1,Ci} = {1,Ci},i{1,Ci} = {i, C}, −1{1,Ci} = {−1, −Ci}, −i{1,Ci} = {−i, −C} the full set G is representable as G=1H ∪ iH ∪ (−1)H ∪ (−i)H. The quotient of a group w.r.t. to one of its left cosets is defined as
G/H = {g1H, g2H,...,gpH}. For finite groups, one can show, that if H is of order q, G is of order p ∗ q. (In the example, the subgroup is of order 2, the number of independent cosets is 4, the full group is of order 8=2∗ 4.) Thus the order of a subgroup must be a divisor of the order of the full group, and therefore groups of prime order (2, 3, 5, 7, 11, ...)do not have non–trivial subgroups.
Conjugate Classes and Conjugate Groups
An element g¯ ∈ G is said to be conjugate to the element g if one can find an element g˜ ∈ G such that gg˜ g˜−1 =¯g. This gives rise to another equivalence relation and to a separation of the group in a set of conjugacy classes. If the group is Abelian, each element forms a class by itself. The conjugate group Hg˜ with respect to a subgroup H ⊂ G and to a group element g˜ ∈ G is formed by all elements gH˜ g˜−1. In the example with H = {1,Ci}, we find for instance H(i) = {1, −Ci}. 500 A Group Theory
Invariant/Normal Subgroups
If it happens that the conjugate group with respect to H and all elements in G are identically the same, H is called an invariant or self-conjugate or normal subgroup. Definition: N ⊆ G is an invariant subgroup iff gN = Ng for all g ∈ G. This can be interpreted as if N commutes with all g ∈ G. By this definition (1) the trivial subgroups of G are invariant subgroups, (2) all subgroups of an Abelian group are invariant subgroups. If N is an invariant subgroup, the quotient G/N is itself a group, as can be seen from
(g1N) ◦ (g2N) = g1N ◦ Ng2 = g1 ◦ Ng2 =(g1 ◦ g2)N. This group is called factor group. Let us come back to the D4 example with the subgroup H = {1,Ci}. This is not an invariant subgroup, since for instance
iH = {i, iCi} = {i, −Ci2} = {i, C} but Hi = {i, Ci2} = {i, −C}.
On the other hand D2 = {1, −1,C,−C} is an invariant subgroup of D4. The full group can be written in terms of this subgroup as D4 =1D2 ∪iD2. The factor group D4/D2 = {1D2,iD2} is isomorphic to Z2 by the mappings 1D2 → 1,iD2 → −1.
Simple and Semi-Simple Groups
With the previous introduction to subgroup structures we are finally able to define “simple”: (1) A group is simple if it has no non-trivial invariant subgroup. (2) A group is semi-simple if it has no Abelian invariant subgroup. In other words: A semi-simple group may have a nontrivial invariant subgroup, but this is not allowed to be Abelian. All simple finite groups have been known since 1982. All other finite groups are “products” of these in the following sense: A group G is a direct product of its subgroups A, B written as G = A × B if
(1) for all ai ∈ A,bj ∈ B, it holds that ai ◦ bj = bj ◦ ai (2) every element g ∈ G can be uniquely expressed as g = a ◦ b. Some consequences of this definition are
• g1 ◦ g2 =(a1 ◦ b1) ◦ (a2 ◦ b2)=(a1 ◦ a2) ◦ (b1 ◦ b2). • Both A and B are invariant subgroups of G, e.g. for A
giA =(ai ◦ bi)A =(bi ◦ ai)A = biA and Agi = A(ai ◦ bi)=Abi = biA. • G can be written in terms of the subgroups A and B as ∼ ∼ G = ∪biA = ∪aiB suchthat G/A = B, G/B = A. A.2 Lie Groups 501
• G is not simple. For example D can be written as D =1C ∪ C C , i.e. D /C = C , and also ∼ 2 2 2 2 2 2 2 D2 = C2 × C2. Observe that in general a relation G1 = G2/G3 does not allow to conclude that G2 is a direct product of G1 and G3.
A.2 Lie Groups
A.2.1 Definitions and Examples
An r-parameter Lie group3 G is a group which at the same time is an r–dimensional differentiable manifold4. This means that the group operations C : G × G → G,C(g, g )=g ◦ g I : G → G I(g)=g−1 are differentiable maps. The group elements of a Lie-group have the generic form G g(ξ1,...ξr)=:g(ξ), where the {ξj} are (local) coordinates in the group manifold. If the group multipli- cation is written as g(ξ) ◦ g(ξ )=g(ξ (ξ,ξ )), the Lie group property implicates that the functions ξ (ξ,ξ ) are differentiable5 in the parameters/coordinates. All notions and results of abstract group theory as derived in the previous section do hold for Lie groups except those in which reference is made to finiteness and to the order of the group. This is especially true for the notions subgroups, cosets, conjugacy classes, invariant subgroups, quotient groups, etc. In the following, several examples of Lie groups will be given, many of them of utmost importance for describing symmetries in fundamental physics. Most of these groups are not just abstract structures, but can be interpreted/realized as transformations in geometric spaces; therefore being called transformation groups.
Transformations of the Straight Line
The translation group is realized by the set of all displacements Ta : x = x + aa∈ R.
3 named after Sophus Lie (1842–1899), a Norwegian mathematician. Interesting enough, he arrived at these notions by investigating solutions of differential equations and using symmetry arguments in this context. These techniques were mentioned in Sect. 2.2.4. 4 A Lie group is a subcategory of topological groups, namely as a topological space for which the group operation is a continuous mapping. 5 Remarkably, due to the group structure the manifold is even analytic. 502 A Group Theory
This is obviously an Abelian group with Tb ◦ Ta = Ta+b. The dilation group is defined by its elements DA : x = Ax A ∈ R,A=0 again an Abelian group. The condition A =0 is imposed to guarantee the invert- ibility. The group is a local symmetry group if A ∈ R+. Both the translations and the dilations may be combined to the one-dimensional coordinate transformations x = Ax + a constituting a two-parameter continuous group. In writing its elements as (A, a), the group multiplication becomes (A, a)◦(A ,a )=(AA ,a+Aa ). The neutral element is (1, 0), and the inverse is (A, a)−1 := A−1(1, −a). This group is a subgroup of the linear fractional transformations