Regular Action

An action that is both free and transitive
Regular Action

A of a group GG on a set XX is regular if it is both and . Equivalently, for every pair x,yXx,y\in X there exists a unique gGg\in G such that gx=yg\cdot x = y.

Regular actions identify the set XX with the underlying set of GG (non-canonically, after choosing a basepoint), and are a standard way to model GG as permutations of a set.

Examples:

  • The left translation action of GG on itself is regular.
  • The action of GG on G/HG/H is regular iff HH is trivial.
  • Any group acting on itself by left multiplication provides a regular action, hence a faithful permutation representation.