A left group action of on a set is a function , written , satisfyingfor all , . The orbit of a group action through and the stabilizer subgroup of are, respectively,The identity element belongs to . If , then , so . If , applying to gives , so . These facts prove that the stabilizer subgroup is a subgroup of .
The orbit-stabilizer theorem identifies the orbit of a group action of with the set of left cosets of . Explicitly, there is a bijectionHere denotes a set of cosets; it is not asserted to be a quotient group. To prove the identification, observe thatThis equivalence proves both well-definedness and injectivity. Every element of the orbit of a group action has the form , proving surjectivity.
In particular, for a finite group, the cardinalities satisfyThe last equality follows from Lagrange's theorem applied to the stabilizer subgroup.
The orbits of a group action form a partition of a set : every element lies in its own orbit of a group action, and two intersecting orbits of a group action coincide because each point can be moved back and then forward using inverse elements. By the orbit-stabilizer theorem, each orbit of a group action has cardinality dividing , so its size is or .
If every orbit of a group action had size or , their sizes would add to an even number, contrary to . Therefore there is a one-element orbit of a group action, say . Every sends into this same singleton, soThus is a fixed point of a group action. In fact the number of fixed points of a group action is odd, since all other orbits of a group action have even cardinality.
For a free group action, every stabilizer subgroup is . By the orbit-stabilizer theorem, every orbit of a group action has cardinality . Hence the two free group actions have the same numberof orbits of a group action. Choose one representative from each orbit of a group action and one representative from each orbit of a group action, and match them using .
Every has a unique expression . The orbit of a group action determines , and the free group action property determines : if , then , forcing . Therefore the ruledefines a function without ambiguity. For ,which proves the required identity for every .
Indeed, is a bijection: its inverse is , well defined because the second is also a free group action. If is empty, the unique empty function already satisfies the identity. Thus the result holds in every case, and proves the stronger statement that free finite actions with equal cardinality are isomorphic.
Articles by others on the same topic
There are currently no matching articles.