TITLE: Maximal $p$-subgroups in nilpotent groups
QUESTION [5 upvotes]: By using Zorn's Lemma one can establish the existence of maximal $p$-subgroups in any group, even infinite. Using this existence, exactly as in the finite case, it is easy to show that in a nilpotent group the set of $p$-elements form a subgroup (take the normalizer of the normalizer etc.) But then the maximal $p$-subgroup is unique and therefore one should not need to use Zorn's Lemma to prove that the set of $p$-elements in a nilpotent group form a subgroup. In fact there are proofs of this fact that do not use Zorn's Lemma. But none is easy. I am looking for an easy proof, using induction on the nilpotency class for example, or using some commutator calculus. Does anyone have an accessible (by undergraduates) proof of this fact that does not use Zorn's Lemma? Thanks a lot.

REPLY [2 votes]: Very nice. Of course... Thanks a lot. In the mean time I found another proof.
Let $P$ be the set of prime elements of the group $G$. Let $P_1=P\cap G'$. By induction on the nilpotency class of $G$ we may assume that $P_1 \leq G$. 
To prove that $P$ is a subgroup I proceed by induction on the nilpotency class of $P_1$. The trick is to divide the group $G$ by $Z(P_1)$, which is of course a normal subgroup of $G$. The inductive step is easy. The initial case where $P_1=1$ is handled as follows: It is easy to show that if $G/Z(G)$ has an element of order $p$, then $G'\cap Z(G)$ has an element of order $p$. Therefore $G/Z(G)$ does not have elements of order $p$, meaning that $P\subseteq Z(G)$. Therefore $P\leq G$. Thanks again.