Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Suppose $G$ is a finite group and fix a prime $p$.

Let $H\leq G$ have the property that $C_G(x)\subseteq H$ whenever $x$ is an element of $H$ whose order is $p^\alpha, \alpha>0$ an integer. Then prove that $p$ cannot divide both $|H|$ and $|G:H|$.

I'm asking you to lend me an hand since it seems I'm stuck on the problem.

Thank you very much.

share|improve this question
    
Let $P$ be a Sylow subgroup of $G$ intersecting $H$ non-trivially. Let $x\in P\cap H$; what subgroup of $P$ are you certain is contained in $C_G(x)$? –  user641 Oct 27 '11 at 19:27

2 Answers 2

up vote 6 down vote accepted

If $p$ does not divide $H$, then the condition is satisfied vacuously, but the conclusion holds so there is nothing to do. So assume that $p|H$.

Let $P$ be a Sylow $p$-subgroup of $H$. If $P$ is not a Sylow $p$-subgroup of $G$, then there exists a subgroup $Q$ of $G$ that contains $P$, with $[Q:P]=p$. Now consider $Z(Q)$, which is nontrivial. If $Z(Q)\subseteq P\neq\{1\}$, then letting $x\in Z(Q)$, $x\neq 1$, gives an element of $P$ (hence of $H$) whose centralizer contains $Q$ (since $x\in Z(Q)$), so $Q\subseteq C_G(x)\subseteq H$, contradicting the fact that $P$ is a Sylow $p$-subgroup of $H$ and $Q$ is of order $p|P|$. Therefore, $Z(Q)\not\subseteq P = \{1\}$.

But since $Z(Q)$ is nontrivial, and $P$ is maximal in $Q$, this implies that $Q=PZ(Q)$. Therefore, if $x\in Z(P)$, then every element of $Q$ centralizes $x$; that is, $Z(P)=Z(Q)\cap P$. Since $P$ is a nontrivial $p$-group, $Z(P)\neq \{1\}$, so we can pick $x\in Z(P)\subseteq Z(Q)$, $x\neq 1$, and again we have $Q \subseteq C_G(x)\subseteq H$, contradicting the assumption that $P$ is a Sylow $p$-subgroup of $H$ and that $Q$ is a $p$-group properly containing $P$.

In either case, the assumption that $P$ is not a Sylow $p$-subgroup of $G$ leads to a contradiction, so if $p$ divides $|H|$, then the highest power of $p$ that divides $|H|$ equals the highest power of $p$ that divides $|G|$, so $|G:H|$ is not a multiple of $p$.

share|improve this answer
    
thanks arturo.. For what concerns your doubt, i assure you that what i've written is copied exactly as it stands in the book. The statement there is the same, so i'm afraid i can't help you. –  uforoboa Oct 27 '11 at 19:36
    
@uforoboa: I believe you; it's just weird because there can be no example where that happens: if $p||G|$, then the condition requires $p$ to divide $|H|$, since $H$ will contain elements of order $p$. –  Arturo Magidin Oct 27 '11 at 19:38
    
@Arturo, you seem to be assuming something slightly stronger than the conditions in the claim. Doesn't the condition in the claim only say that if $x \in H$ and $o(p)=p^k$ for some $k$ then $C_g(x) \subset H$? In particular if $H$ contains no elements of order $p^k$ then $p $ divides $ |G:H|$. –  JSchlather Oct 27 '11 at 21:44
    
@Jacob: Oh! That explains it! –  Arturo Magidin Oct 27 '11 at 21:45
    
@uforoboa: Please note that I misread the problem; I've added a solution to the actual problem. Still, it's probably best if you unaccept my answer for a while. –  Arturo Magidin Oct 27 '11 at 21:55

Here is what I was suggesting in my comment:

The problem is vacuous, as Arturo mentions, if $p$ does not divide $|H|$. So suppose it does, and let $P$ be a Sylow p-subgroup of $G$ intersecting $H$ non-trivially. Let $x\in P\cap H$ be a non-trivial element of the intersection. Then we have, by the hypothesis, $$ Z(P)\subset C_P(x)\subset C_G(x)\subset H.$$

Since $Z(P)$ is non-trivial, take a non-trivial $y\in Z(P)$; then again, since $Z(P)\subset H$, we have $$ P\subset C_P(y)\subset C_G(y)\subset H,$$

and so $H$ contains a Sylow p-subgroup of $G$, implying that $[G:H]$ is not divisible by $p$.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.