Page 79 - DMTH403_ABSTRACT_ALGEBRA
P. 79

Abstract Algebra




                    Notes          In Examples 1 and 2 we observed that the homomorphisms carried the identity to the identity
                                   and  the  inverse  to  the  inverse.  In  fact,  these  observations  can  be  proved  for  any  group
                                   homomorphism.
                                   Theorem 1: Let f ; (G , * )  (G , * ) be a group homomorphism.
                                                    1
                                                      1
                                                              2
                                                            2
                                   Then
                                   (a)  f(e ) = e , where e  is the identity of G  and e  is the identity of G .
                                                                     1
                                                                           2
                                         l
                                                                                           2
                                             2
                                                     1
                                   (b)  f(x ) = [f(x)]  for all x in G .
                                                 -1
                                          -1
                                                            1
                                   Proof: (a) Let x  G . Then we have e  * 1x = x. Hence,
                                                                1
                                                  1
                                   f(x) = f(e  *  x) = f(e ) *  f(x), since f is a homomorphism. But
                                           1
                                         l
                                                  1
                                                    2
                                   f(x) = e  *  f(x) in G .
                                          2
                                        2
                                                  2
                                   Thus, f(e ) *  f(x)= e  *  f(x).
                                            2
                                          1
                                                  2
                                                    2
                                   So, by the right cancellation law in G , f(e ) =e .
                                                                 2  1   2
                                   (b) Now, for any x  G , f(x) *  f(x ) = f(x * x ) = f(e ) = e .
                                                             -1
                                                                      -1
                                                     1
                                                                           1
                                                                               2
                                                                    1
                                                          2
                                   Similarly, f(x ) *  f(x) = e .
                                             -1
                                                2
                                                       2
                                   Hence, f(x ) = [f(x)]     x E G .
                                                  -1
                                           -1
                                                          1
                                   Note that the converse of Theorem 1 is false. That is, if f : G   G  is a function such that f(e ) = e 2
                                                                                                          1
                                                                                      2
                                                                                 1
                                   and [f(x)]  = f(x ) = f(x )    x  G , then f need not be a homomorphism. For example, consider
                                                     -1
                                               -l
                                          -1
                                                             1
                                   f : Z  Z : f(0) = 0 and ,
                                          
                                         n 1   n  0
                                   f(n)        0
                                          
                                         n 1   n 
                                   Since f(l + 1)  f(1) + f(l), f is not a homomorphism. But f(e ) = e  and f(n) = - f(- n)    n  Z.
                                                                                     2
                                                                                 1
                                   Let us look at a few more examples of homomorphisms now. We can get one important class of
                                   homomorphisms from quotient groups.
                                         Example: Let H    G. Consider  the map p :  G  G/H  :  p(x) =  Hx.  Show  that p  is a
                                   homomorphism. Also show that p is onto. What is Ker p?
                                   Solution: For x, y  G, p(xy) = Hxy = Hx Hy = p(x) p(y). Therefore, p is a homomorphism.
                                   Now, Im p = { p(x) ( x  G} = ( Hx | x  G } = G/H. Therefore, p is onto.
                                       Ker p = { x  G | p(x) = H ). (Remember, H is the identity of G/H.)
                                            = ( x  G | H x = H }
                                            = { x  G | x H ), by Theorem 1 of Unit 4.
                                            = H.
                                   In this example you can see that Ker p    G. You can also check that Theorem 1 is true here.
                                         Example: Let H be a subgroup of a group G. Show that the map i : H  G, i(h) = h is a
                                   homomorphism. This function is called the inclusion map.
          72                                LOVELY PROFESSIONAL UNIVERSITY
   74   75   76   77   78   79   80   81   82   83   84