Is the Image of a Homomorphism f(G) Always a Subgroup of H?

  • Thread starter Thread starter steroidjunkie
  • Start date Start date
steroidjunkie
Messages
16
Reaction score
1
1. Show that image of homomorphism f of group G into group H is a subgroup of H.



2. f(G) \equiv { f(g) | g \in G } \subset H



The Attempt at a Solution



The problem is I don't know how to start. So if I could get a hint it would be great...
 
Physics news on Phys.org


steroidjunkie said:
1. Show that image of homomorphism f of group G into group H is a subgroup of H.



2. f(G) \equiv { f(g) | g \in G } \subset H



The Attempt at a Solution



The problem is I don't know how to start. So if I could get a hint it would be great...

You need to show f(G) is nonempty and if h1 and h2 are in f(G), then h1*h2-1 is in f(G), where * is the group operation in H.
 


steroidjunkie said:
The problem is I don't know how to start. So if I could get a hint it would be great...
Definitions are usually a good place to start. Most "simple" problems like this are trivial exercises in naive set theory after the translation.
 


Thank you for your guidelines. This is what I came up with: (click on the picture to show it and again to see it clearly)
 

Attachments

  • CodeCogsEqn.gif
    CodeCogsEqn.gif
    5.5 KB · Views: 481
Last edited:


steroidjunkie said:
Thank you for your guidelines. This is what I came up with: (click on the picture to show it and again to see it clearly)

It will be much easier to have a discussion if you put your equations here. Use the X2 button for superscripts. So it is easy to write a-1.

You might start by answering this: What is the test for a subset M of a group G to be a subgroup?

What do homomorphisms do to the identity and to inverses?
 


I think i found the solution. I need to show that f(G) is a nonempty set and that for every g1 and g2 element f(G): g1*g2-1 element f(G) by prooving four axioms of group.

And the answer to the second question is: homomorphism of an identity is an identity and homomorphism of an inverse is an inverse.

Thank you to both of you.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top