Proving Normality of Subgroups in Factor Groups: A Step-by-Step Approach

  • Thread starter Thread starter tiger4
  • Start date Start date
  • Tags Tags
    Normal Proof
tiger4
Messages
6
Reaction score
0

Homework Statement



Let G be and group and let N and H be normal subgroups of G with $N \subset H \subset G. Prove that H/N is a subgroup of G/N, and that it is a normal subgroup. Note that aKa^{-1} = {aKa^{-1} | k in K}.

Homework Equations


The Attempt at a Solution



I understand that since H is contained in G and N is contained in H that it would make sense that the factor group H/N is not only a subgroup, but a normal subgroup. However, I am struggling trying to figure out a way to transition from aKa^{-1} to either H or N. We've also learned the 2-step check of closure and inverses for proving subgroups, but I'm not quite sure how to apply that to factor groups. If I could get some suggestions where to start that would be great.
 
Last edited:
Physics news on Phys.org
Have you covered in your class that the elements of H / N and G / N are the cosets N in H and G? I might try this problem by taking an arbitrary element h' \in H / N and g' \in G / N and showing that g' h' g'^{-1} \in H / N. Since the elements chosen were arbitrary, H / N \triangleleft G / N.
 
let x,y be in aKa^-1.

thus x = aka^-1, for some k in K, and y = ak'a^-1 for some k' in K.

then xy^-1 = (aka^-1)(ak'a^-1)^-1 = (aka^-1)(ak'^-1a^-1) = a(kk'^-1)a^-1,

and since K is a subgroup kk'^-1 is in K whenever k,k' are, so xy^-1 is in aKa^-1.

thus aKa^-1 is certainly a subgroup of G.

what we need to do is show that aKa^-1 must be a subset of H.

note that K is a subgroup of H, hence aKa^-1 is a subset of aHa^-1. but H is normal in G, so aHa^-1 = H.

thus aKa^-1 is contained in H.


How does this look?
 
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