Lemma 1 (Schreier).
Given a group , a subgroup , and transversal for , then the set
 We show that is generated by . We already know is contained in and we know every element is expressible as a word over , as generates . So where . Note that which is of the form for , and , where . We assume for induction that has this form for some . Now we perform the sleight-of-hand.
by letting which is in , and . At the end of the iteration we have replaced all the ’s with elements of and the last element . However, lies in so the product and as and we know . As , and we now use the fact that to assert that . So is a word in and thus generates . ∎
The lemma was discovered in the course of studying free groups as a way to produce generators for a subgroup of a free group. The Reidemeister-Schreier theorem strengthened this result to produce a presentation for given one for and a transversal of .
The lemma lead to an unexpected use in the 1970’s where it was rediscovered by various authors to solve certain problems in computational group theory. Sims used the result to find generators of the stabilizer of a point in a permutation group. This method could then be repeated to find generators for each stabilizer in a stabilizer chain of a base of the group. A naive approach can result in exponentially many generators, so Sims’ algorithm additionally removes unnecessary generators along the way. This is now called the Schreier-Sims algorithm.
Independently a version of this algorithm was developed by Frust, Hopcroft, and Luks as a means to prove the polynomial-time complexity of various problems in finite group theory and graph theory. Many improvements followed including versions by Knuth, Jerum, and even a probabilistic nearly linear time method by Seress.
The lemma still finds use in non-finite groups as Schreier had intended. The associated algorithms have been repeatedly improved principally by the work of George Havas and Colin Ramsay.
- 1 Seress, Ákos Permutation group algorithms, Cambridge Tracts in Mathematics, vol. 152, Cambridge University Press, Cambridge, 2003.
|Date of creation||2013-03-22 15:53:55|
|Last modified on||2013-03-22 15:53:55|
|Last modified by||Algeboy (12884)|