Take the 2-minute tour ×
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.

Let $p$ a prime number. Let $G$ be a $p$-group finitely generated, say, $G = \left<x_1, x_2, \ldots, x_m \right>$. Denote by $\gamma_i(G)$ the $ith$ term of the lower central series of $G$. Then, is true that $\gamma_i(G)$ is generated by a number of elements that depends only $m$ and $i$?

share|improve this question
    
In general, we have that if $G$ is a nilpotent and finitely generated group then, all subgroups of $G$ there are finitely generated. More, if $G = \left<x_1, \ldots, x_m \right>$ is finitely generated then $\gamma_i(G)$ is the normal closure of the subgroup of $G$ generated by all the commutators in the form $[b_1, \ldots, b_i]$, where $b_j \in \{x_1, \ldots, x_m\}, 1 \leq j \leq i$. But even with this information I could not still conclude my question is whether true or not. –  Agenor Andrade Apr 11 '13 at 15:20
    
You may want to check here: math.stackexchange.com/questions/40985/… , The nilpotency class $\,c\,$ seems to be key in this problem, but of course you can always argue that $\,c\le m\,$ ... –  DonAntonio Apr 11 '13 at 16:10
    
Are you assuming that $G$ is finite? –  Derek Holt Apr 11 '13 at 18:39
    
I'm not sure whom your asking, @DerekHolt, but the OP's title states "finite p-group" –  DonAntonio Apr 11 '13 at 18:59
    
@DerekHolt Yes. I supose $G$ a finite group. –  Agenor Andrade Apr 12 '13 at 22:11
show 3 more comments

1 Answer

I think the answer is no. Let $G$ be a wreath product of a cyclic group of order $p$ with a cyclic group of order $p^k$. Then the derived group $\gamma_2(G)$ is elementary abelian of rank $p^k-1$. There is of course a bound as a function of $m$, $i$ and the nilpotency class $c$.

share|improve this answer
add 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.