Skip to Content
Math4302Modern Algebra (Lecture 10)

Math4302 Modern Algebra (Lecture 10)

Groups

Group homomorphism

Recall the kernel of a group homomorphism is the set

ker(ϕ)={aGϕ(a)=e}\operatorname{ker}(\phi)=\{a\in G|\phi(a)=e'\}

Example

Let ϕ:(Z,+)(Zn,+)\phi:(\mathbb{Z},+)\to (\mathbb{Z}_n,+) where ϕ(k)=kmodn\phi(k)=k\mod n.

The kernel of ϕ\phi is the set of all multiples of nn.

Theorem for one-to-one group homomorphism

ϕ:GG\phi:G\to G' is one-to-one if and only if ker(ϕ)={e}\operatorname{ker}(\phi)=\{e\}

If ϕ\phi is one-to-one, then ϕ(G)G\phi(G)\leq G', GG is isomorphic ot ϕ(G)\phi(G) (onto automatically).

If AA is a set, then a permutation of AA is a bijection f:AAf:A\to A.

Cayley’s Theorem

Every group GG is isomorphic to a subgroup of SAS_A for some AA (and if GG is finite then AA can be taken to be finite.)

Example

DnSnD_n\leq S_n, so A={1,2,,n}A=\{1,2,\cdots,n\}


ZnSn\mathbb{Z}_n\leq S_n, (use the set of rotations) so A={1,2,,n}A=\{1,2,\cdots,n\} ϕ(i)=ρi\phi(i)=\rho^i where iZni\in \mathbb{Z}_n and ρDn\rho\in D_n


GL(2,R)GL(2,\mathbb{R}). Set A=R2A=\mathbb{R}^2, for every AGL(2,R)A\in GL(2,\mathbb{R}), let ϕ(A)\phi(A) be the permutation of R2\mathbb{R}^2 induced by AA, so ϕ(A)=fA:R2R2\phi(A)=f_A:\mathbb{R}^2\to \mathbb{R}^2, fA((xy))=A(xy)f_A(\begin{pmatrix}x\\y\end{pmatrix})=A\begin{pmatrix}x\\y\end{pmatrix}

We want to show that this is a group homomorphism.

  • ϕ(AB)=ϕ(A)ϕ(B)\phi(AB)=\phi(A)\phi(B) (it is a homomorphism)
fAB((xy))=AB(xy)=fA(B(xy))=fA(fB((xy)))=(fAfB)((xy))\begin{aligned} f_{AB}(\begin{pmatrix}x\\y\end{pmatrix})&=AB\begin{pmatrix}x\\y\end{pmatrix}\\ &=f_A(B\begin{pmatrix}x\\y\end{pmatrix})\\ &=f_A(f_B(\begin{pmatrix}x\\y\end{pmatrix}))\\ &=(f_A\circ f_B)(\begin{pmatrix}x\\y\end{pmatrix})\\ \end{aligned}
  • Then we need to show that ϕ\phi is one-to-one.

It is sufficient to show that ker(ϕ)={e}\operatorname{ker}(\phi)=\{e\}.

Solve fA((xy))=(xy)f_A(\begin{pmatrix}x\\y\end{pmatrix})=\begin{pmatrix}x\\y\end{pmatrix}, the only choice for AA is the identity matrix.

Therefore ker(ϕ)={e}\operatorname{ker}(\phi)=\{e\}.

Proof for Cayley's Theorem

Let A=GA=G, for every gGg\in G, define λg:GG\lambda_g:G\to G by λg(x)=gx\lambda_g(x)=gx.

Then λg\lambda_g is a permutation of GG. (not homomorphism)

  • λg\lambda_g is one-to-one by cancellation on the left.
  • λg\lambda_g is onto since λg(g1y)=y\lambda_g(g^{-1}y)=y for every yGy\in G.

We claim ϕ:GSG\phi: G\to S_G define by ϕ(g)=λg\phi(g)=\lambda_g is a group homomorphism that is one-to-one.

First we show that ϕ\phi is homomorphism.

xG\forall x\in G

ϕ(g1)ϕ(g2)=λg1(λg2(x))=λg1g2(x)=ϕ(g1g2)x\begin{aligned} \phi(g_1)\phi(g_2)&=\lambda_{g_1}(\lambda_{g_2}(x))\\ &=\lambda_{g_1g_2}(x)\\ &=\phi(g_1g_2)x\\ \end{aligned}

This is one to one since if ϕ(g1)=ϕ(g2)\phi(g_1)=\phi(g_2), then λg1=λg2x\lambda_{g_1}=\lambda_{g_2}\forall x, therefore g1=g2g_1=g_2.

Odd and even permutations

Definition of transposition

A σSn\sigma\in S_n is a transposition is a two cycle σ=(ij)\sigma=(i j)

Fact: Every permutation in SnS_n can be written as a product of transpositions. (may not be disjoint transpositions)

Example of a product of transpositions

Consider (1234)=(14)(13)(12)(1234)=(14)(13)(12).

In general, (i1,i2,,im)=(i1im)(i2im1)(i3im2)(i1i2)(i_1,i_2,\cdots,i_m)=(i_1i_m)(i_2i_{m-1})(i_3i_{m-2})\cdots(i_1i_2)

This is not the unique way.

(12)(34)=(42)(34)(23)(12)(12)(34)=(42)(34)(23)(12)

But the parity of the number of transpositions is unique.

Theorem for parity of transpositions

If σSn\sigma\in S_n is written as a product of transposition, then the number of transpositions is either always odd or even.

Definition of odd and even permutations

σ\sigma is an even permutation if the number of transpositions is even.

σ\sigma is an odd permutation if the number of transpositions is odd.

Last updated on