p-Prüfer Group – Characterizations and Properties

abstract-algebragroup-theoryp-groups

I'm an undergrad student fairly keen on algebra. Over the different algebra courses I've taken, I've often encountered the so-called $p$-Prüfer group on exercises but somehow never got around to them. Now I'm trying to take care of that, but there are some statements I've seen about this group which I don't know how to prove (maybe because I lack some more background in group theory, especially in the study of infinite abelian groups?)

Definition A $p$-group is a $p$-Prüfer group if it is isomorphic to $$C_{p^\infty}=\{e^{\frac{2k\pi i}{p^n}}:k\in \mathbb{Z}, n\in\mathbb{Z}^+\} \subset (\mathbb{C}^\times, \cdot)$$

What I'm having trouble to prove is:

The following are $p$-Prüfer groups:

1) An infinite $p$-group whose subgroups are totally ordered by inclusion,

2) An infinite $p$-group such that every finite subset generates a cyclic group,

3) An infinite abelian $p$-group such that $G$ is isomorphic to every proper quotient,

4) An infinite abelian $p$-group such that every subgroup is finite

Just for the record, what I (think I) could prove was that the following are $p$-Prüfer groups:

5) An injective envelope of $C_{p^n}$, for any $n\geq 1$,

6) A Sylow $p$-subgroup of $\frac{\mathbb{Q}}{\mathbb{Z}}$,

7) The direct limit of $0\subset C_p \subset C_{p^2}\subset …$

Here $C_{p^n}$ denotes a cyclic group of order $p^n$.

Any other characterizations of the $p$-Prüfer group are welcome.

Best Answer

How one procedes to prove these probably depends a bit on which description of the $p$-Prüfer group one is most comfortable with. So my particular arguments may not seem very natural to you, in which case this will probably not help much.

  1. Because the subgroups are ordered by inclusion, given any $x,y\in G$, either $x\in\langle y\rangle$ or $y\in\langle x\rangle$. Take an element $x_1\in G$. The subgroup it generates cannot be all of $G$ (it is finite, since $G$ is a $p$-group), so there exists $x_2\in G$ with $x_2\notin\langle x_1\rangle$. Therefore, $x_1\in\langle x_2\rangle$. But $x_2$ cannot generate all of $G$. So there exists $x_3\in G$, $x_3\notin \langle x_2\rangle$.

    Continuing this way, you obtain a (countably infinite) collection of elements of $G$, $x_1,x_2,\ldots,$ such that $x_n\in\langle x_{n+1}\rangle$, $x_{n+1}\notin\langle x_n\rangle$. By introducing suitable elements into the sequence, we may assume that $[\langle x_{n+1}\rangle\colon\langle x_n\rangle]=p$.

    Now prove that the subgroup generated by all the $x_i$ is isomorphic to the $p$-Prüfer group, and that it is equal to $G$.

  2. Let $x_1\in G$. It does not generate all of $G$, so let $y\in G$ that is not in $\langle x_1\rangle$. Then $\langle x_1,y\rangle$ is cyclic, strictly larger than $\langle x_1\rangle$; let $x_2$ be a generator of this cyclic group. Since $x_2$ does not generate all of $G$, there exists $y\in G$ not in $\langle x_2\rangle$; but $\langle x_2,y\rangle$ is cyclic, so let $x_3$ be a generator. Lather, rinse, repeat, to get an infinite sequence as above, adding elements if necessary to get each step to increase the size of the cyclic group by $p$; that is, $x_n$ is of order $p^n$.

    Again, prove the group generated by the $x_i$ is the $p$-Prüfer group and equal to all of $G$.

I'd written suitable arguments for 3 and 4, but Jack has posted them as well and they are essentially the same, so I'll defer to him on them.

Related Question