3

I am trying to show that for a given prime $p$ and a finite Abelian $p$-group $G$ that if $G$ has an unique subgroup of order $p$, then $G$ is necessarily cyclic.

I am trying to prove the statement, by arguing by contradiction. Of course, the statement would be easy to prove if one knows the Fundamental Theorem of Finitely Generated Abelian Groups, but I was trying to prove the statement without invoking this Theorem, and I am having trouble proving the statement.

I know that by Cauchy's Theorem, one can find an element $x$ in $G$ of order $p$; how does one then produce an element $y\in G\backslash\langle x\rangle$ of order $p$?

yoshi
  • 1,061
  • You have to demand the finiteness for $G$. – Boris Novikov Aug 24 '13 at 16:51
  • I don't know if it works, but maybe induction on $n$ for groups of order $p^n$? The first case is trivial, each case after that you can mod out by the cyclic group $\langle x\rangle$, and use induction there? Just thinking out loud. – Clayton Aug 24 '13 at 16:52
  • Cauchy's theorem is hardly necessary when the hypotheses dictate a subgroup of order $p$. Also don't they further dictate there is no $y\in G\setminus\langle x\rangle$ of order $p$ by uniqueness? – anon Aug 24 '13 at 16:53
  • The goal is to arrive at a contradiction by finding a $y\in G\backslash\langle x\rangle$. – yoshi Aug 24 '13 at 17:01

3 Answers3

3

Let $G$ contain an unique cyclic subgroup of order $p^k$ and $a$ be an element of order $p^k$. Prove that it contains an unique cyclic subgroup of order $p^{k+1}$.

Let $x,y$ be elements of order $p^{k+1}$ and $x^{p^k}=y^{p^k}=a$. Then $(xy^{-1})^{p^k}=1$, so $x=ya^m=y^{mp^k+1}$. Further use the induction.

Boris Novikov
  • 17,470
1

I assume that $G$ is finite (sometimes the term "$p$-group" is used for infinite groups as well, but for infinite abelian $p$-groups the statement is false).

If it is undesirable to use FTFGAG, then I would proceed as follows.

  1. Introduce the endomorphism $\varphi: G \to G,\ g \to p g$. I write $G$ additively, so $pg$ means $g+g+\ldots+g$ ($p$ times).

  2. Introduce subgroups $G_i = \ker \varphi^i$. Clearly, $G_0 = 1$. Also, $G_1 \simeq \mathbb{Z}_p$ is the unique subgroup of order $p$. Since $G$ is finite, $G = G_i$ for large enough $i$. Let $n$ be the minimal such $i$.

  3. Note that $\varphi$ induces an injective homomorphism from $G_{i+1}/G_i$ to $G_i/G_{i-1}$ for every $i \geq 1$. It follows using induction that $G_{i+1}/G_{i} \simeq \mathbb{Z}_p$ for every $0 \leq i < n$.

  4. Now it is quite easy to see that any element from $G_n \setminus G_{n-1}$ generates $G_n$, so $G=G_n$ is cyclic.

Dan Shved
  • 15,862
  • 39
  • 55
0

Lemma. A non-cyclic finite abelian group contains a subgroup isomorphic to $C_q\times C_q$, for some prime $q$.

Proof. This proof doesn't use the structure theorem for finite(ly generated) abelian groups, as requested in the OP. $\space\Box$

A finite abelian $p$-group $G$ with a unique subgroup of order $p$ doesn't contain a subgroup $K\cong C_p\times C_p$. Since $p$ is the only prime dividing $|G|$, by the lemma $G$ is cyclic.

citadel
  • 2,940