Normal Subgroups intersection = <e>

kathrynag
Messages
595
Reaction score
0
Let H and K be normal subgroups of G such that H intersect K=<e>. Show that hk=kh for all h in H and k in K.
H and K are normal so ghg^-1 is in H and gkg^-1 is in K.
want to show hk=kh. So basically I'm showing this is abelian.
Can I do ghg^-1=gkg^-1?
ghg^-1g=gkg^-1g
gh=gk
so that works if g=h
 
Physics news on Phys.org
Let h\in\ H with h\neq e, and let k\in\ K with k\neq e.

Then what can you say about khk^{-1}?
 
kathrynag said:
Let H and K be normal subgroups of G such that H intersect K=<e>. Show that hk=kh for all h in H and k in K.
H and K are normal so ghg^-1 is in H and gkg^-1 is in K.
want to show hk=kh. So basically I'm showing this is abelian.
Can I do ghg^-1=gkg^-1?
ghg^-1g=gkg^-1g
gh=gk
so that works if g=h

Hi kathrynag! :smile:

I don't see how what you did could be correct.

When showing commutativity it is often useful to look at the commutator.
The commutator of h and k is [h,k]=hkh-1k-1.
If the commutator of h and k is equal to e, than h and k commute (why?).

Suppose you write hk=k1h, which should be true for some k1 in K.
What do you get?
 
Oh, I just noticed that this is a pretty old thread.
I suspect that the OP is not interested in the answer anymore. :wink:
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top