A Group Homomorphism: Verifying ø(gh) = ø(g) + ø(h) for ø: Z → Z

  • Thread starter Thread starter PsychonautQQ
  • Start date Start date
  • Tags Tags
    Group
PsychonautQQ
Messages
781
Reaction score
10

Homework Statement


For any integer K, the map ø_k: Z → Z given by ø_k(n) = kn is a homomorpism. Verify this

Homework Equations


if ø(gh) = ø(g)ø(h) for all g,h in G then the map ø: G → H is a group homomorpism


The Attempt at a Solution


So I have barely any linear algebra so many taking this summer course wasn't the best idea, but I have PF so I'm good.
So...
if ø(xy) = ø(x)ø(y) for all x,y in Z then the map ø: Z → Z is a group homomorphism. ø_k(x) = kx and ø_k(y) = ky

but then
ø(xy) = kxy and ø(x)ø(y) = (xy)k^2

i'm new to this type of thinking, can anyone help me out here?
 
Physics news on Phys.org
PsychonautQQ said:

Homework Statement


For any integer K, the map ø_k: Z → Z given by ø_k(n) = kn is a homomorpism. Verify this

Homework Equations


if ø(gh) = ø(g)ø(h) for all g,h in G then the map ø: G → H is a group homomorpism


The Attempt at a Solution


So I have barely any linear algebra so many taking this summer course wasn't the best idea, but I have PF so I'm good.
So...
if ø(xy) = ø(x)ø(y) for all x,y in Z then the map ø: Z → Z is a group homomorphism. ø_k(x) = kx and ø_k(y) = ky

but then
ø(xy) = kxy and ø(x)ø(y) = (xy)k^2

i'm new to this type of thinking, can anyone help me out here?

The group operation for the integers is addition, not multiplication.
 
pasmith said:
The group operation for the integers is addition, not multiplication.

So you are saying it should read ø(gh) = ø(g) + ø(h)
?
 
PsychonautQQ said:
So you are saying it should read ø(gh) = ø(g) + ø(h)
?
No, he meant ##\phi(g + h) = \phi(g) + \phi(h)##. The + in ##\phi(g+h)## is the group operation of the domain (here Z) and the + in ##\phi(g) + \phi(h)## is the group operation of the codomain (here also Z).
 
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

Replies
6
Views
5K
Replies
11
Views
2K
Replies
5
Views
929
Replies
5
Views
2K
Back
Top