MHB Prove One-to-One Correspondence Conjugate Subgroups & Cosets N

  • Thread starter Thread starter Kiwi1
  • Start date Start date
  • Tags Tags
    Conjugate
Kiwi1
Messages
106
Reaction score
0
Q. Prove there is a one-to-one correspondence between the set of conjugates of H and the set of cosets of N.

I have a solution to this below but am not sure if it is correct. In particular I am not sure if my definition 'f' is satisfactory. This is self study and not any kind of homework.

I have:
aHa^{-1}=\{axa^{-1}:x\epsilon H\}
N=\{a \epsilon G: axa^{-1} \epsilon H for every x \epsilon H \}

I have proven as part of the previous question:
Q7. For any a,b \epsilon G, aHa^{-1}= bHb^{-1} iff b^{-1}a \epsilon N iff aN=bN

SOLUTION
define the set of conjugates: X=\{aHa^{-1}:a \epsilon G \}
define the set of cosets of N: Y=\{aN:a \epsilon G \}

define f:X \rightarrow Y by f(aHa^{-1})=aN

f is well defined because if aHa^{-1}=bHb^{-1} then aN = bN by Q7.

Surjectivity:
for any aN \epsilon Y
f(aHa^{-1})=aN
where aHa^{-1} \epsilon X
therefore f is surjective

Injectivity:
suppose aN = bN
\therefore f(aHa^{-1})=f(bHb^{-1})
where aHa^{-1}=bHb^{-1} by Q7.
therefore f is injective

There is a bijection f from X to Y so there is a 1:1 correspondence between the members of X and Y.

Is this solution reasonably rigorous?
 
Physics news on Phys.org
Kiwi said:
Q. Prove there is a one-to-one correspondence between the set of conjugates of H and the set of cosets of N.

I have a solution to this below but am not sure if it is correct. In particular I am not sure if my definition 'f' is satisfactory. This is self study and not any kind of homework.

I have:
aHa^{-1}=\{axa^{-1}:x\epsilon H\}
N=\{a \epsilon G: axa^{-1} \epsilon H for every x \epsilon H \}

I have proven as part of the previous question:
Q7. For any a,b \epsilon G, aHa^{-1}= bHb^{-1} iff b^{-1}a \epsilon N iff aN=bN

SOLUTION
define the set of conjugates: X=\{aHa^{-1}:a \epsilon G \}
define the set of cosets of N: Y=\{aN:a \epsilon G \}

define f:X \rightarrow Y by f(aHa^{-1})=aN

f is well defined because if aHa^{-1}=bHb^{-1} then aN = bN by Q7.

Surjectivity:
for any aN \epsilon Y
f(aHa^{-1})=aN
where aHa^{-1} \epsilon X
therefore f is surjective

Injectivity:
suppose aN = bN
\therefore f(aHa^{-1})=f(bHb^{-1})
where aHa^{-1}=bHb^{-1} by Q7.
therefore f is injective

There is a bijection f from X to Y so there is a 1:1 correspondence between the members of X and Y.

Is this solution reasonably rigorous?
Your solution is fine. If you know group actions, then I can tell you a shorter solution.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Replies
13
Views
575
Replies
2
Views
2K
Replies
7
Views
2K
Replies
0
Views
403
Replies
23
Views
3K
Replies
3
Views
440
Back
Top