Relations bet. Groups, from Relations between Resp. Presentations.

  • Thread starter Thread starter Bacle
  • Start date Start date
  • Tags Tags
    Groups Relations
Bacle
Messages
656
Reaction score
1
Hi, All:

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.
 
Physics news on Phys.org
I believe this is true, but you'll have to switch G and G' around in you short exact sequence.

The reason is, if you have a group G and a normal subgroup N, then there is a short exact sequence

0\rightarrow N\rightarrow G\rightarrow G/N\rightarrow 0

What you do in your case is work with the free group. A quotient of the free group is exactly a presentation of the group.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Back
Top