Regular Action
An action that is both free and transitive
Regular Action
A group action of a group on a set is regular if it is both free and transitive . Equivalently, for every pair there exists a unique such that .
Regular actions identify the set with the underlying set of (non-canonically, after choosing a basepoint), and are a standard way to model as permutations of a set.
Examples:
- The left translation action of on itself is regular.
- The action of on is regular iff is trivial.
- Any group acting on itself by left multiplication provides a regular action, hence a faithful permutation representation.