Isomorphic Subgroup Action on a Group: Proving the Isomorphism between H^g and H

  • Thread starter Thread starter lion8172
  • Start date Start date
  • Tags Tags
    Group Subgroup
lion8172
Messages
27
Reaction score
0

Homework Statement



I'm trying to prove that, if H is a subgroup of an arbitrary group G, then H^g, the action of a given element in G on H, is isomorphic to H.


Homework Equations





The Attempt at a Solution



Let \sigma denote a given action of G on H. We are considering the map \sigma(g, *) : H -> H^g (where g is fixed and * denotes a variable element of H). I think that the kernel of this map is the set of all elements x in H such that \sigma(g, x) = g (this is the part I'm not sure of). Since x lies in H and H is a subgroup of G, it follows that x must be equal to e, the identity element of G. Thus, ker{\sigma(g, x)} is trivial, and, as a result,
H^g \cong G/ \mbox{ker}(\sigma(g, *)) = G,
by the first isomorphism theorem.
Does this seem correct? If so, can you please justify the statement that
\mbox{ker} \sigma(g, *) = \{ x| \sigma(g, x) = g \ \forall x \in H \}?
 
Last edited:
Physics news on Phys.org
lion8172 said:
H^g, the action of a given element in G on H, is isomorphic to H.
This doesn't make sense - an action is not a group. To have any chance of solving this problem correctly, you should write down what H^g actually is.
 
H^g would be a group in certain cases (i.e. conjugation), but not in others. So the proof above certainly does not apply in general.
 
Last edited:
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