In mathematics, particularly in the field of group theory, a **group action** is a formal way that a group operates on a set. More specifically, a group action is a way of describing how the elements of a group interact with the elements of a set in a way that respects the group structure. ### Definition: Let \( G \) be a group and \( X \) be a set.
Articles by others on the same topic
A left group action of a group on a set is a function satisfyingwhere is the identity element of . The second rule means that moves the point first and moves it next. These rules let group multiplication describe consistent rearrangements of a set; see Ackerman's algebra notes, definition 0.4.1.1.
For each , the function is a bijection: its inverse is , using the inverse element of . Equivalently, a group action is a group homomorphism into the symmetric group of all permutations of , with and . See MIT's group-action notes, definition 23.1.
For a concrete group action, put the vertices of a polygon of a square at , , and . Let be a counterclockwise quarter-turn rotation and let be a reflection. Their eight permutations of the vertices of a polygon form the dihedral groupHere means the symmetry group of a four-sided polygon, with group order eight; the alternative convention calls this same group . Products apply the rightmost operation first. For example, and . The same group also has separate group actions on the sides of a polygon, the diagonals of a polygon, and the singleton set containing the centroid of the square. Specifying matters: changing what is moved changes the orbits of a group action and the stabilizer subgroups.
A group action need not be a faithful group action. For example, the cyclic group acts on by , using modular arithmetic. Only the parity of matters: fix both points and exchange them. The associated group homomorphism has group kernel , of group order two. Either point has a group orbit of size two and a stabilizer subgroup of group order two, so the orbit-stabilizer theorem gives .
The useful questions are which positions can be exchanged, and which transformations survive after imposing a constraint such as keeping one marked point fixed. An orbit of a group action answers the first question; a stabilizer subgroup answers the second. This turns a list of transformations into a count of distinct configurations, and explains why several transformations can produce the same configuration.
