1 - Maps on Groups

Group homomorphism

let G1,G2 be groups and f:G1G2 be a map. f is a group homomorphism if for each x,yG1, f(xG1y)=f(x)G2f(y).

furthermore, we will suppress any notation to indicate that xy is a product in G1 and f(x)(fy) is a product in G2.

Properties of homomorphisms

For the following discussion, let G1,G2 be groups, with identities e1 and e2 and f a homomorphism from G1 to G2.

  1. f(e1)=e2 (under a homomorphism, the image of the identity of the domain group, is the identity of the target group).
  2. for each xG1, f(x)1G2 is f(x1) where x1 is the inverse x in G1.
  3. Let G1,G2,G3 all be groups, and let f be a homomorphism from G1 to G2, h a homomorphism from G2 to G3, then hf is a homomorphism from G1 to G3.(the composition of homomorphisms, is itself a homomorphism).
    ![[diagram-20240712 (1).svg#invert_B]]

\begin{proof}

  1. We will use The unqiue property of the identity element of a group. Notice that f(e1e1)=f(e1)f(e1)=f(e1). Hence it must be that f(e1)=e2.
  2. Notice that for any xG1, f(xx1)=f(x)f(x1) but xx1=e1. Therefore, e2=f(x)f(x1) Hence f(x1) is the unique inverse of f(x) in G2. In notation, f(x)1=f(x1).
  3. let x,y be arbitrary elements of G1. Then, h(f(xy))=h(f(x)f(y))=h(f(x)) h(f(y)).

\end{proof}


Group isomorphism

let G1, G2 be groups. a map f:G1G2 is an isomorphism, if it is a bijective homomorphism. An isomorphism from G onto itself is called an automorphism.

The inverse of an isomorphism is an isomorphism

if f:G1G2 is an isomorphism, then f1:G2G1 is an isomorphism, where G1,G2 are groups.

\begin{proof}
The inverse of a bijection, is also a bijection. Hence, it is sufficient to prove that f1 is a homomorphism. let u,v be arbitrary elements of G2. Then, since f is bijective, there exists unique x,yG1 such that u=f(x),v=f(y). hence uv=f(x)f(y)=f(xy). Now, f1(uv)=f1f(xy)=xy=f1(u)f1(v). Hence f1 is a homomorphism.

\end{proof}


The collection of all automorphisms on a group, is itself a group

Let G be a group, and let Aut(G) be the collection of all automorphisms on G. Then this set, with map composition as the operator, forms a group.

\begin{proof}
notice that the identity map id(x)=x from G to G is an automorphism (it is both bijective and homomorphic). And acts as the group identity under composition. for any two maps f,hAut(G). Then hf is bijective, moreover due to [[#^3f5f3f]] hf is a homomorphism, hence hfAut(G). Associativity follows as a property of function composition, and due to [[#^e12bc0]], for each fAut(G), f1Aut(G) : the inverse map, acts as the group inverse element.
\end{proof}


The left coset map:
left coset maps on a group

Let G be a group, and g an arbitrary element of G. then the left coset map fg:GG is the map fg(x)=gx for each xG.

left coset maps are bijective

Let G be a group, and L(G) be the collection of left coset maps from G to G. Then, every element fgL(G) is a bijection on G.

\begin{proof}
Let g be an arbitrary element of G. We claim that fg is a bijection. suppose for x,yG, fg(x)=fg(y). Then, gx=gy hence x=y, showing injectivity.
Now, suppose y is an arbitrary element in G. Notice that fg(g1y)=g(g1y)=y. Showing Surjectivity.

\end{proof}


the collection of left coset maps, is a group

Let G be a group, then the collection of left coset maps L(G) is a group under map composition. Moreover, L(G) is isomorphic to G.

\begin{proof}
The identity map on G is fe=ex for all xG, feL(G) is the group identity as fefg=fgfe=fg for any fgL(G). Associativity follows as a property of map composition, of course, the composition of two left coset maps fg ,fhL(G) . is fgfh=fgh , because for all xG fg(fh(x))=g(hx)=(gh)x=fgh(x). Hence, L(G) is closed under composition, moreover the map gfg is a homomorphism, as ghfgh=fgfh .
For each fgL(G) the unique fg1 is given by fg1. This is because for each xG, fg(fg1(x))=fg1(fg(x))=gg1x=g1gx=ex. Hence fgfg1=fg1fg=fe.
We claim that the map gfg is bijective. Surjectivity is obvious. now suppose that fg1=fg2 then for each xG, g1x=g2x hence g1=g2. Hence we produce the desired isomorphism from G to L(G).

\end{proof}


two distinct left coset maps never agree on the image of a particular element.

Let G be a group, and fg,fhL(G) be two distinct left coset maps. Then there is no xG such that fg(x)=fh(x)
Otherwise, this would imply that gx=hx hence g=h (multiplying x1 on both the sides), meaning that fg and fh are identical maps.


Warning!!

A left coset map not NOT a homomorphism

Let G be a group. Then a map fgL(G) if ge then fg is not a homomorphism from G to G .
fg(xy)=g(xy) , fg(x)fg(y)=gxgy. Even if G is abelian, gxgy=g2xy and g2=g only if g=e. See The unique property of the identity of a group.