652
23.
GROUP
THEORY
transformation theory. Eugene Wigner, in his seminal paper! of 1939 in which he
applied group theoretical ideas to Lorentz transformations, paved the way for the
marriage
of
group theory and quantum mechanics. Today, in every application
of
quantum theory, be it to atoms, molecules, solids, or elementary particles such as
quarks and leptons, group-theoretical techuiques are indispensable.
23.1 Groups
The prototype of a group is a transformation group, the set of invertible mappings
of a set onto itself. Let us elaborateon this. First,we take mappingsbecausethey are
the most general operations performed between sets. From a physical standpoint,
mappings are essential in understanding the symmetries and otherbasic properties
of
a theory. For instance, rotations and translations are mappings of space. Second,
the mappings oughtto be on a single set, becausewe want tobe able to composeany
given two mappings. We cannot compose
f : A
--->
B and g : A
--->
B, because,
by necessity, the domain of the second must be a subset
of
the image of the first.
With three sets, and
A
J..
B, B
.!,
C, even
if
the composition
fog
is defined,
g 0 f will not be. Third, we want to be able to undo the mapping. Physically, this
means that we should be able to retrace
our
pathto our original positionin the set.
This can happen only if all mappings
of
interesthave an inverse. Finally, we note
that composing a mapping with its inverse yields identity. Therefore, the identity
map must also be included in the set of mappings.
We shall come back to transformation groups frequently.
In fact, almost all
groups considered in this book are transformation groups. However, as in our
study
of
vector spaces in Chapter I, it is convenient to give a general description
of (abstract) groups. .
Group
defined
23.1.1. Definition. A group is a set G together with an associative binary oper-
ation
G x G
--->
G called multiplication---<lnddenoted generically by *-""aving
thefollowing properties:
1. There exists a unique
eiemenr e E G called the Ulentiry such that e *g =
g*e=g.
2. For every element g E G, there exists an element
g-l,
called the inverse
of
g, such that g *
g-I
=
g-I
*g =e.
Toemphasize the binary operation
ofa
group, we designate it as (G, *).
order
ofa
group
If
the underlying set G has a finite number of elements, the group is called
finite, and its number of elements, denoted by
1GI,is called the
order
of G. We
can also have an infinite group whosecardinality can be countable or continuous.
~E.
P. Wigner, "On the UnitaTf Representations
of
the Inhomogeneous Lorentz Group,"Ann. afMath. 40 (1939) 149-204.
To distinguish between
identities
of
different groups, we sometimes write
ec
for the identity
of
the group G.