- #1
NeoInTheMatrix
- 9
- 0
The problem is as follows:-
Statement of the problem: Given group G, show that the automorphism group of G is a subgroup of the permutation group of G.
I can show that Auto(G) is a subset of Perm(G) easily. So I have to show that subgroup conditions hold: (1) for each x in Auto(G), x inverse is also in Auto(G), (2) the identity is in Auto(G), and (3) Auto(G) is closed under composition.
2&3 are very easy. For part 1, I have to show that given f(x)^-1, it is bijective and homomorphic. Showing that the inverse is bijective is easy. The only problem I have is showing that it's a homomorphism. I start with the following relation on the inverse:-
Relevant Equation:-
f(x)^-1 = f(x^-1)
Attempt at solution:-
So given x,y in G, f(xy)^-1 = f((xy)^-1) = f(y^-1 x^-1) = f(y^-1)f(x^-1) = f(y)^-1f(x)^-1.
But the multiplicands are reversed from what I want to show a homomorphism, namely:-
f(xy) = f(x)f(y).
any ideas? Am I missing another obvious way to approach this?
Statement of the problem: Given group G, show that the automorphism group of G is a subgroup of the permutation group of G.
I can show that Auto(G) is a subset of Perm(G) easily. So I have to show that subgroup conditions hold: (1) for each x in Auto(G), x inverse is also in Auto(G), (2) the identity is in Auto(G), and (3) Auto(G) is closed under composition.
2&3 are very easy. For part 1, I have to show that given f(x)^-1, it is bijective and homomorphic. Showing that the inverse is bijective is easy. The only problem I have is showing that it's a homomorphism. I start with the following relation on the inverse:-
Relevant Equation:-
f(x)^-1 = f(x^-1)
Attempt at solution:-
So given x,y in G, f(xy)^-1 = f((xy)^-1) = f(y^-1 x^-1) = f(y^-1)f(x^-1) = f(y)^-1f(x)^-1.
But the multiplicands are reversed from what I want to show a homomorphism, namely:-
f(xy) = f(x)f(y).
any ideas? Am I missing another obvious way to approach this?
Last edited: