Prove map σ:y→xyx⁻¹ is bijective

  • Thread starter Thread starter catherinenanc
  • Start date Start date
  • Tags Tags
    Map
catherinenanc
Messages
49
Reaction score
0
1. Let G be any group and x∈G. Let σ be the map σ:y→xyx⁻¹. Prove that this map is bijective.
It seems to be written strangely, since it never really says anywhere that y is in G, but I guess that must be an assumption.2. bijective=injective+surjective.
in order to prove injective, we need to show that y1≠y2→xy1x⁻¹≠xy2x⁻¹
and in order to prove surjective, we need to show that for every g in G, there exists a y in G such that xyx^-1=g.

3. I think that I can say: Let y=x^-1gx. Then xyx-1=g and we are done for surjective.
I don't really know how to "show" injective, since it seems obvious.
 
Physics news on Phys.org
Instead of showing ##y_1\ne y_2 \to xy_1x^{-1}\ne xy_2x^{-1}## try showing the contrapositive.
 
So I show that xy1x-1=xy2x-1→y1=y2 by simply left-multiplyng both sides by x-1 and right-multiplying both sides by x? Is that too simple?

Also, does my thinking on surjective work?
 
Yes, it all looks OK to me.
 
Ok, thanks!
 
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