Loading [MathJax]/jax/output/HTML-CSS/jax.js

Friday, April 12, 2013

Normalizers of Sylow Intersections (6.2.13)

Dummit and Foote Abstract Algebra, section 6.2, exercise 13:

MathJax TeX Test Page Let G be a group with more than one Sylow p-subgroup. Choose P,QSylp(G) such that |PQ| is maximal. Prove that NG(PQ) has more than one Sylow p-subgroup, any two distinct Sylow p-subgroups intersect in PQ, and pq|PQ| divides |NG(PQ)| for some prime q other than p.

Proof: Note that since p-groups are nilpotent, PQ<NP(PQ) and PQ<NQ(PQ), so that p|PQ| divides |NG(PQ)|. Prove that NP(PQ) and NQ(PQ) are distinct Sylow p-subgroups of NG(PQ). If NP(PQ) is not a Sylow subgroup, then place it in one, and call this group P. This is a p-group in G, so place P in a Sylow p-subgroup P. Note that if P=P, then since PNG(PQ) we have PP=PNP(PQ), a contradiction. Therefore P and P are distinct Sylow p-subgroups of G and PQ<NP(PQ)PP, a contradiction by the maximality of PQ. The case for NQ(PQ)Sylp(NG(PQ)) is similar. Now prove that NP(PQ)NQ(PQ): Assuming the contrary, we have PQ<NP(PQ)PQ, a clear impossibility.

Assume NG(PQ) is a p-group, and thus place it in a Sylow p-subgroup of G, calling it M. If M=P, then NQ(PQ)P, so that NQ(PQ)PQ, untenable. Therefore MP and PQ<NP(PQ)MP, another contradiction. Therefore q divides |NG(PQ)|.

Finally, let A,BSylp(NG(PQ)) with AB, and prove AB=PQ. () Let PQC for some Sylow p-subgroup of NG(PQ) with gCg1=A for some gNG(PQ). We have g(PQ)g1=PQA. The case is parallel for PQB. () A and B are p-subgroups of G, so let AD and BE for some D,ESylp(G). Assume D=E: Since AB and A,BD, we have  A, B  is a p-subgroup (because it is in D) properly containing A and B, a contradiction (since  A, B NG(PQ) and A and B are supposed to be Sylow in NG(PQ)). So DE. We have ABDE so that |AB||DE||PQ| and now AB=PQ. 

No comments:

Post a Comment