Proposition (Left multiplication action). Let GG be a . The formula

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

defines a of GG on its underlying set.

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.

Remarks

This action is the input for : it sends each element of GG to a permutation of GG, producing an injective homomorphism into a symmetric group.