Proving Abelian Property of (G,°) with f(a) = a^(-1)

  • Thread starter Thread starter okeen
  • Start date Start date
  • Tags Tags
    Property
okeen
Messages
2
Reaction score
0

Homework Statement



Let (G, °) be a group such that the mapping f from G into G defined by f(a) = a^(-1) is a homomorphism. Show that (G, °) is abelian.


The Attempt at a Solution



f(a) = a^(-1)
f(a^(-1)) = f(a)^(-1) = (a^-1)^-1 = a

in order for a group to be abelian it needs to meet the requirement a(i)*a(j) = a(j) * a(i)
° 1 a a^-1
1 1 a a^-1
a a a^2 1
a^-1 a^-1 1 a

since each side of the diagonal are the same then (G, °) is abelian.
 
Physics news on Phys.org
You are assuming that G has only three members? Of course, every group containing 3 members is isomorphic to the rotatation group of a triangle which is abelian.

What if G contained six or more members?
 
I realize that my answer only takes into account for 3 members but I am having trouble coming up with a solution for all possible amounts of members
 
(ab)-1= a-1b-1 if and only if a and b commute.
 
Interestingly enough, such a homomorphism must be an automorphism...not that I think it helps for this problem. HallsOfIvy is dead on with his hint.
 
HallsofIvy said:
(ab)-1= a-1b-1 if and only if a and b commute.

So to follow up on that hint, see where f maps a, b and ab
 
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...
Back
Top