Schreier's lemma

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Template:Short description In group theory, Schreier's lemma is a theorem used in the Schreier–Sims algorithm and also for finding a presentation of a subgroup.

Statement

Suppose H is a subgroup of G, which is finitely generated with generating set S, that is, G=S.

Let R be a right transversal of H in G with the neutral element e in R. In other words, let R be a set containing exactly one element from each right coset of H in G.

For each gG, we define g as the chosen representative of the coset Hg in the transversal R.

Then H is generated by the set

{rs(rs)1|rR,sS}.[1][2]

Hence, in particular, Schreier's lemma implies that every subgroup of finite index of a finitely generated group is again finitely generated.[3]

Example

The group 3=/3 is cyclic. Via Cayley's theorem, 3 is isomorphic to a subgroup of the symmetric group S3. Now,

3={e,(1 2 3),(1 3 2)}
S3={e,(1 2),(1 3),(2 3),(1 2 3),(1 3 2)}

where e is the identity permutation. Note that S3 is generated by S={s1=(1 2),s2=(1 2 3)}.

3 has just two right cosets in S3, namely 3 and S33={(1 2),(1 3),(2 3)}, so we select the right transversal R={r1=e,r2=(1 2)}, and we have

r1s1=(1 2),sor1s1=(1 2)r1s2=(1 2 3),sor1s2=er2s1=e,sor2s1=er2s2=(2 3),sor2s2=(1 2).

Finally,

r1s1(r1s1)1=e
r1s2(r1s2)1=(1 2 3)
r2s1(r2s1)1=e
r2s2(r2s2)1=(1 2 3).

Thus, by Schreier's lemma, {e,(1 2 3)} generates 3, but having the identity in the generating set is redundant, so it can be removed to obtain another generating set for 3, {(1 2 3)}.

References

<templatestyles src="Reflist/styles.css" />

  1. Script error: No such module "citation/CS1".
  2. Script error: No such module "citation/CS1".
  3. Script error: No such module "citation/CS1".  Erratum: "|Z| Template:Font |X|·|U|" should read "|Z| Template:Font |X|·|U|"

Script error: No such module "Check for unknown parameters".