 
  
  
  
  
Since
each cycle, and hence every element of  , can be written as a product 
of transpositions. Thus
, can be written as a product 
of transpositions. Thus  is generated by its subset of transpositions 
(if this is empty, then
 is generated by its subset of transpositions 
(if this is empty, then  , and both
, and both  are generated by the empty set
 are generated by the empty set 
 ). But, except for the case when
). But, except for the case when  , we do not need every 
transposition in order to generate the symmetric group, since, for
, we do not need every 
transposition in order to generate the symmetric group, since, for 
 , we derive from
, we derive from  that
 that

Thus the transposition  can be obtained from
 can be obtained from  by 
conjugation with the transposition
 by 
conjugation with the transposition  of adjacent points. Therefore 
the subset
 of adjacent points. Therefore 
the subset

consisting of the  elementary transpositions
 , generates
, generates
 . A further system of generators of
. A further system of generators of  is obtained from
 is obtained from 
 
so that we have proved
