Proving |H intersect K| = q for subgroup H and K in G of order pqr.

mykayla10
Messages
7
Reaction score
0

Homework Statement


Suppose |G| = pqr where p, q, and r are distinct primes. If H is a subgroup of G and K is a subgroup of G with |H| = pq and |K| = qr, then |H intersect K| = q.


Homework Equations


NA


The Attempt at a Solution


I have so far:
Let a be an element of H intersect K. Therefore, |a| divides |H| and divides |K|. Therefore, |a| divides pq and qr. Since p, q, and r are distinct primes, we know that the gcd( pq,qr)=q. Since |a| divides both pq and qr, |a| divides the gcd of these two, so |a| divides q. Since q is prime, |a|= 1 or q.

I am now stuck as to how to prove that |a| is not 1. If I do this, by process of elimination I have proven that |H intersects K|=q.
 
Physics news on Phys.org
let one subgroup act on the other by translation. i.e. show all the cosets of form hK with h in H are different. then think about that. i hope this helps. in general everything in group studying theory is done by these sorts of "actions".
 
is there any way I can eliminate |H intersect K|=1 by assuming it does and finding a contradiction? I am not sure I am at the ability level to do what you suggested.
 
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