Escolar Documentos
Profissional Documentos
Cultura Documentos
GROUPS
2.1. Groups
element of G.
(ii) Associativity: For all a,b,c G, we have
a (b c) = (a b) c.
(iii) Identity: There exists an identity element e G such that
e a = a and a e = a
for all a G.
(iv) Inverses: For each a G there exists an inverse element a-1
such that
a a-1 = e and a-1 a = e.
Example 1. If G is a group and a,b,c G, then ba = ca implies b = c and
ab = ac implies b = c.
This proposition tells us that the right and left cancellation laws
are true in groups. We leave the proof as an exercise. We can use
exponential notation for groups just as we do in ordinary algebra. If G is
a group and g G, then we define g0 = e. For n N, we define gn =
ggg | {z } n times and gn = g1 g1g1 | {z }
Example 2. Let G be a group. If a,b G, then (ab)1 = b1a1. Proof.
Let a,b G. Then abb1a1 = aea1 = aa1 = e. Similarly, b1a1ab = e.
But by the previous proposition, inverses are unique; hence, (ab)1 =
b1a1.
A group G is abelian if its binary operation is commutative.
CHAPTER 2
11
CHAPTER 2
is said
to be a group isomorphism if
(i) is one-to-one and onto and
(ii) (ab) = (a) (b) for all a,b G1.
In this case, G1 is said to be isomorphic to G2, and this is denoted by
G1
G2.
12