Is f a Surjective and Injective Isomorphism from HxN to HN in G?

  • Thread starter Thread starter mathmajor2013
  • Start date Start date
  • Tags Tags
    Isomorphism
mathmajor2013
Messages
26
Reaction score
0
Let G be a group, H a normal subgroup, N a normal subgroup, and H intersect N = {e}. Let H x N be the direct product of H and N. Prove that f: HxN->G given by f((h,n))=hn is an isomorphism from HxN to the subgroup HN of G.
Hint: For all h in H and n in N, hn=nh.
 
Physics news on Phys.org
This looks a lot like a homework/coursework question. This really should belong there instead of the main forums...

To the point: what have you tried already?
 
I am confused how to start this problem. To first show it is a homomorphism, is f((h,n)(h',n'))=f((hh',nn'))?
 
mathmajor2013 said:
I am confused how to start this problem. To first show it is a homomorphism, is f((h,n)(h',n'))=f((hh',nn'))?

Yes, that step is already correct. Now apply the definition of f...
 
Right the homomorphism part is easy now. Am I able to use the pigeonhole principle for the isomorphic part? That is, are HxN and HN the same size? It seems like they are since H intersect N is only the identity.
 
It might be tricky to see that they are thesame size. Isn't easier to show that f is surjective and injective?
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top