- #1

- 662

- 1

I am given two groups G,G', and their respective presentations:

G=<g1,..,gn| R1,..,Rm> ;

G'=<g1,..,gn| R1,..,Rm, R_(m+1),...,Rj >

i.e., every relation in G is a relation in G', and they both have the same generating

set.

Does this relation (as a S.E.Sequence) between G,G' follow:

0---> Gp{ R_(m+1),...,Rj }--->G'--->G-->0 ,

where Gp{R_(m+1),...,Rj} is the group generated by the relations (more precisely, by

elements defining the relations) ?

Thanks.