Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Prove that for every odd prime number $p$ there is a non-commutative group of order $p^3$ such that $a^p = e$, $\forall a \in G$.

share|improve this question
hint: can you write down a non-trivial map from $\mathbb{Z}/p$ to Aut$((\mathbb{Z}/p)^2)$? – countinghaus Dec 9 '12 at 7:25

1 Answer

up vote 1 down vote accepted

Here is the outline, you fill in the details:

Note that $\text{Aut}(\mathbb{Z}_p^2)\cong\text{GL}_2(\mathbb{F}_p)$, and since $|\text{GL}_2(\mathbb{F}_p)|=(p^2-1)(p^2-p)$ we see in particular, $p\mid |\text{Aut}(\mathbb{Z}_p)|$. Thus, there exists a non-trivial homomorphism $\varphi:\mathbb{Z}_p\to\text{Aut}(\mathbb{Z}_p^2)$. Consider then $G=\mathbb{Z}_p^2\rtimes_\varphi\mathbb{Z}_p$. Prove that this is the group you seek.

share|improve this answer
How exactly is $\text{GL}_2(\mathbb{F}_p)$ defined? We haven't learned about it. However, I think I can try to prove that the group $G$ that you provided is the group I seek. – chubbycantorset Dec 9 '12 at 7:30
$2 \times 2$ matrices with nonzero determinant over $\mathbb{F}_p$, who you may know by his psuedonym $\mathbb{Z}_p$ or $\mathbb{Z}/p\mathbb{Z}$. The $\mathbb{F}$ is to emphasize that it is a field. – andybenji Dec 9 '12 at 7:31
It's just $2\times 2$ invertible matrices over the field of $p$ elements. – Alex Youcis Dec 9 '12 at 7:32
And how exactly does it imply that there exists a nontrivial homomorphism $\varphi:\mathbb{Z}_p\to\text{Aut}(\mathbb{Z}_p^2)$ ? – chubbycantorset Dec 9 '12 at 7:39
Because you can just send the generator of $\mathbb{Z}_p$ to the element an element of order $p$ in $\text{Aut}(\mathbb{Z}_p^2)$--one exists by Cauchy's theorem. – Alex Youcis Dec 9 '12 at 7:40
show 1 more comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.