[summary: A group action of a group acting on a set describes how sends elements of to other elements of . Given a specific element , the stabiliser is all those elements of the group which send back to itself, and the orbit of is all the elements to which can get sent.
This theorem tells you that is divided into equal-sized pieces using . Each piece "looks like" the stabilizer of (and is the same size), and the orbit of tells you how to "move the piece around" over in order to cover it.
Put another way, each element in the orbit of is transformed "in the same way" by relative to .
This theorem is closely related to Lagrange's Theorem. ]
[summary(Technical): Let be a finite Group, acting on a set . Let . Writing for the stabiliser of , and for the orbit of , we have where refers to the size of a set.]
Let be a finite Group, acting on a set . Let . Writing for the stabiliser of , and for the orbit of , we have where refers to the size of a set.
This statement generalises to infinite groups, where the same proof goes through to show that there is a bijection between the left cosets of the group and the orbit .
Proof
Recall that the Stabiliser is a subgroup of the parent group.
Firstly, it is enough to show that there is a bijection between the left cosets of the stabiliser, and the orbit. Indeed, then but the right-hand side is simply because an element of is specified exactly by specifying an element of the stabiliser and a coset. (This follows because the cosets partition the group.)
Finding the bijection
Define , by
This map is well-defined: note that any element of is given by for some , so we need to show that if , then . This follows: so .
The map is injective: if then we need . But this is true: and so , from which .
The map is surjective: let be a left coset. Then by definition of the orbit, so gets taken to as required.
Hence is a well-defined bijection.