Left multiplication action

A group acts on itself by left translation
Left multiplication action

Proposition (Left multiplication action). Let GG be a . Define a map G×GGG\times G\to G by

gx:=gx. g\cdot x := gx.

Then this defines a of GG on the underlying set of GG.

Moreover, this action is:

  • transitive (there is one orbit), and
  • free (only the identity fixes any element),

hence it is a , often called the left regular action.

Context. This action is the input for : it produces an injective homomorphism from GG into a symmetric group by viewing elements as permutations of GG.

Proof sketch. Check the two action axioms: ex=ex=xe\cdot x=ex=x and (g1g2)x=g1(g2x)(g_1g_2)\cdot x=g_1\cdot(g_2\cdot x) by associativity. Transitivity: given x,yGx,y\in G, take g=yx1g=yx^{-1} so that gx=yg\cdot x=y. Freeness: if gx=xg\cdot x=x then gx=xgx=x, so multiplying by x1x^{-1} gives g=eg=e.