Let $G$ be a group of order $pn$ , where $p$ is a prime and $p>n$ , then is it true that any subgroup of order $p$ is normal in $G$ ? ( I know that any subgroup of index smallest prime dividing order of the group would be normal , but this thing is far away from it . Please help . Thanks in advance )
2026-04-02 15:16:00.1775142960
On
$G$ be a group of order $pn$ , where $p$ is a prime and $p>n$ , then is it true that any subgroup of order $p$ is normal in $G$?
2.7k Views Asked by user228168 https://math.techqa.club/user/user228168/detail At
2
There are 2 best solutions below
0
On
The first theorem of Sylow says that there is a subgroup of order $p$.
The second theorem of Sylow says that all subgroups of $G$ of order $p$ are conjugates.
And most important, the third theorem of Sylow says that the number of subgroups of order $p$ divides $n$ and is congruent to $1$ mod $p$.
Since $n<p$ there can be only one subgroup $H$ of order $p$ and the second theorem of Sylow implies that $g^{-1}Hg=H$ for all $g\in G$. Thus, $H$ is normal.
So, not only "every subgroup of order $p$ is normal", but there is exactly one subgroup of order $p$ and it is normal.
Here is a very elementary proof, which uses Lagrange's Theorem, but not Sylow's Theorem.
It is enough to prove that any two subgroups $P,Q$ of order $p$ are equal, because then we must have $gPg^{-1}=P$ for all $g \in G$, so $P$ is normal.
So suppose that $P \ne Q$. Then $P \cap Q = \{1 \}$ by Lagrange. They are both cyclic so $P = \{x^i : 0 \le i < p \}$ and $Q = \{y^i : 0 \le i < p \}$ for some $x,y$.
Since $|G| = pn < p^2$, the elements $x^iy^j$ with $0 \le i,j < p$ cannot all be distinct, so there is an equality $x^iy^j=x^ky^l$ with $(i,j) \ne (k,l)$.
But then $x^{i-k} = y^{l-j}$, contradicting $P \cap Q = \{1 \}$.