Abstract Algebra- homomorphisms and Isomorphisms, proving not cyclic

eruth
Messages
2
Reaction score
0
1. Suppose that H and K are distinct subgroups of G of index 2. Prove that H intersect K is a normal subgroup of G of index 4 and that G/(H intersect K) is not cyclic.


2. Homework Equations - the back of my book says to use the Second Isomorphism Theorem for the first part which is... If K is a subgroup of G and N is a normal subgroup of G, then K/(K intersect N) is isomorphic to KN/N

3. The Attempt at a Solution - I know that any subgroup with order 2 is normal and that the intersection of 2 normal subgroups is normal. I just wasn't sure how to show it was index 4. Also, I wasn't what to do for the second part.
 
Physics news on Phys.org
Hint: what do you know about the product HK?
 
Alright, I think I got the first part of the proof. Now to show that the quotient group isn't cyclic, the back of my book says to observe that it has 2 subgroups of order 2... I'm not seeing what these 2 subgroups are, maybe just because quotients groups confuse me.
 
eruth said:
Alright, I think I got the first part of the proof. Now to show that the quotient group isn't cyclic, the back of my book says to observe that it has 2 subgroups of order 2... I'm not seeing what these 2 subgroups are, maybe just because quotients groups confuse me.

Define L=HnK. You should know that the quotient group is defined by the products of cosets. Take h to be an element of H that's not in L. What coset could (hL)(hL) be?
 
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