Nilpotent Group
Lemma
Suppose is a group homomorphism and . Then .
\begin{proof}
Note that for any , and so .
\end{proof}
Definition
Let be a finite group. Let . Let . Inductively, define for . This gives an increasing series . We say is nilpotent if for some .
Theorem
A finite -group is nilpotent.
\begin{proof}
Note that center of -group is non-trivial.
\end{proof}
Theorem
Direct product of nilpotent groups is also nilpotent.
\begin{proof}
Note that .
\end{proof}
Lemma
Let be a nilpotent group. If , then .
\begin{proof}
Write . Let be the largest number such that . Choose some . We claim that . Note that is in the center, that is, for all . Therefore, . For all , we have that and so .
\end{proof}
Proposition
Let be a finite group. Then is nilpotent iff is the inner direct product of its Sylow subgroups.
\begin{proof}
One direction is easy.
Now assume that is nilpotent. First, pick any Sylow subgroup . If , we have done. Otherwise . If , then . However, by ^cb650b, , which contradicts with ^b84lpf. Therefore, .
If are distinct prime divisor of , then for Sylow -subgroup and Sylow -subgroup we have and by this lemma. Therefore, is the inner direct product of its Sylow subgroups.
\end{proof}
Corollary
Let be a nilpotent group. If , then there exists subgroup of order .
\begin{proof}
By ^a9c9ed and Sylow theorems.
\end{proof}
Solvable Group
Proposition
If is nilpotent, then is solvable.
\begin{proof}
Since is nilpotent, we have . Note that , then is abelian and so . Consider . Since , we have that is abelian and so . Repeat this procedure and we finish the proof.
\end{proof}
Example. is solvable, but it is not nilpotent.
Theorem
The followings hold:
- If is solvable, then its subgroups and quotient groups are solvable.
- Let . Then is solvable iff and are solvable.
\begin{proof}
i) Since yields that and is solvable. For any , we have that and is solvable.
ii) One direction is easy. Define . Then and . Thus, .
\end{proof}
Remark. If and are nilpotent, then may NOT nilpotent. For example, and are nilpotent, but not for .