Determine is endomorphism, kernel, epimorphism, monomorphism

  • Thread starter Thread starter Shackleford
  • Start date Start date
  • Tags Tags
    Kernel
Shackleford
Messages
1,649
Reaction score
2
I'm reasonably certain I did 1b correctly. I'm not sure about 1h. In both cases, since phi is the transformation from the multiplicative group G to the multiplicative group G, the identity is 1.

http://i111.photobucket.com/albums/n149/camarolt4z28/IMG_20110729_200311.jpg?t=1311988303

http://i111.photobucket.com/albums/n149/camarolt4z28/IMG_20110729_200408.jpg?t=1311988318

http://i111.photobucket.com/albums/n149/camarolt4z28/IMG_20110729_200704.jpg?t=1311988336
 
Last edited by a moderator:
Physics news on Phys.org
Seems to be entirely correct! :smile:

One small detail, though. You checked that 1b was a monomorphism directly with the definition. This is unnecessary work as you also calculated the kernel. Knowing that the kernel is {1} is good enough for showing it's a mono.
 
Yup, looks good.
 
micromass said:
Seems to be entirely correct! :smile:

One small detail, though. You checked that 1b was a monomorphism directly with the definition. This is unnecessary work as you also calculated the kernel. Knowing that the kernel is {1} is good enough for showing it's a mono.

Thanks for checking my work.

How does the kernel = {1} show one-to-one?
 
SammyS said:
Yup, looks good.

Thanks.

According to the definition, a homomorphism is an endomorphism if the mapping is to itself, i.e. G = G'. So, in this problem, since G = G (R - {0}), you just have to show it's a homomorphism or not.
 
Shackleford said:
How does the kernel = {1} show one-to-one?

You could try showing this! It only requires the definition of a group homomorphism. And it's actually both a necessary and sufficient condition (it'll be an "if and only if" proof).
 
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