Proof. To label the elements of
, we choose the bijection
given by
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
For each
,
is defined by
or equivalently,
, where
is the homomorphism afforded by the action of
on itself.
Then
therefore
Similarly
therefore
Since
, this gives all the maps
for
. For instance
More generally
□
Verification with Sagemath:
sage: a , b = [(1,5,6),(2,4,3)], [(1,2),(3,5),(4,6)]
sage: G = PermutationGroup([a,b])
sage: G.list()
[(),
(1,2)(3,5)(4,6),
(1,5,6)(2,4,3),
(1,6,5)(2,3,4),
(1,3)(2,6)(4,5),
(1,4)(2,5)(3,6)]
sage: G.stabilizer(1).list()
[()]