E3 - application of cosets to permutation groups

stabiliser

  • let G be a group of permutations of a set S, then for each i in S, the stabiliser of i in G is defined as:
stabG(i)={ϕGϕ(i)=i}

orbit

orbG(i)={ϕ(i)ϕG}

  • the set orbG(i) is a subset of S, called the orbit of i under G

orbG(1)={1,3,2},stabG(1)={(1),(78)},orbG(2)={2,1,3},stabG(2)={(1),(78)},orbG(4)={4,5,6},stabG(4)={(1),(78)},orbG(5)={7,8},stabG(7)={(1),(132)(465)},
orbit-stabiliser theorem

  • let G be a finite group of permutations of a set S, then for any i from S:
|G|=|orbG(i)||stabG(i)|

the rotation grop of a cube

  • the group of rotations of a cube is isomorphic to S4

diagonals of a cube.png|500
image: J. Gallian