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 $\mathbb{Z}_p$ denote the $p$-adic integers.

I know that the groups $GL_n(\mathbb{Z})$ and $GL_n(\mathbb{Z}_p)$ are (topologically for the latter) finitely generated. My question is: what are the minimal number of generators needed to generate each of these groups (topologically for the latter)?

share|improve this question
add comment

1 Answer

up vote 2 down vote accepted

In 1932/3 B.H. Neumann found a presentation for the automorphism group of the free group of rank $n$ on two generators for $n \ge 4$ and 3 generators for $n=3$. These were based on earlier presentations on 4 generators due to Nielsen. A single additional relation gives a presentation of the quotient ${\rm GL}_n({\mathbb Z})$. You can find these results in the book on Combinatorial group Theory by Magnus, Karass and Solitar.

So, for ${\rm GL}_n({\mathbb Z})$, the answer is 2 for $n \ge 4$ and at most 3 for $n=3$. It is well-known to be 2 for $n=2$. It seems plausible that it is also 2 for $n=3$, and I am sure this must be known. I would expect similar results to hold for ${\rm GL}_n({\mathbb Z_p})$.

You could try asking this on MathOverflow.

share|improve this answer
1  
Thanks for the answer! Now that I think of it, since the map $SL_n(\mathbb{Z})\rightarrow SL_n(\mathbb{Z}/p^m\mathbb{Z})$ is surjective, $SL_n(\mathbb{Z})$ is dense in $SL_n(\mathbb{Z}_p)$, so to generate $GL_n(\mathbb{Z}_p)$, it's enough to tack on an element whose determinant topologically generates $\mathbb{Z}_p^\times/\{\pm 1\}$. –  Ian Malcolm Sep 25 '12 at 21:54
    
(I was mainly interested in whether the answer was uniformly bounded in $n$ and $p$) –  Ian Malcolm Sep 25 '12 at 21:59
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.