Proof. As the index
, it is sufficient to verify that the 6 permutations
are in distinct coset, by verifying that the 15 permutations
, where
Sage instructions
S5 = SymmetricGroup(5)
a = S5([(1,2,3,4,5)])
b = S5([(1,2,4,3)])
G = PermutationGroup([a,b])
l = [S5([]),S5([(1,2,3)]),S5([(2,3,4)]),S5([(3,4,5)]),S5([(1,4,5)]),S5([(1,2,5)])]
[u*v^(-1) in G for u in l for v in l if u< v]
So
is a set of coset representatives of
in
. □