Finite p-groups have subgroups of all p-power orders

If |G|=p^n then for each k there is a subgroup of order p^k
Finite p-groups have subgroups of all p-power orders

Proposition (Subgroups of all orders in a finite p-group). Let pp be a prime and let GG be a finite with G=pn|G|=p^n. Then for every integer kk with 0kn0\le k\le n there exists a HGH\le G such that H=pk|H|=p^k.

Context. This is a structural strengthening of Lagrange’s theorem for pp-groups: not only do subgroup orders divide G|G|, all intermediate pp-powers actually occur. It is proved by induction using the existence of nontrivial center.

Proof sketch. Induct on nn. The cases n=0,1n=0,1 are immediate. For n1n\ge 1, by pick an element zZ(G)z\in Z(G) of order pp (existence also follows from ). Let Z=zZ(G)Z=\langle z\rangle\le Z(G), so Z=p|Z|=p and ZGZ\lhd G. Then G/ZG/Z is a pp-group of order pn1p^{n-1}. By the induction hypothesis, for each 0jn10\le j\le n-1 there is a subgroup HG/Z\overline H\le G/Z with H=pj|\overline H|=p^j. Let HH be the full preimage of H\overline H under the quotient map GG/ZG\to G/Z; then HH has order pj+1p^{j+1}. Together with the trivial subgroup (order p0p^0), this yields all orders pkp^k.