MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is every solvable subgroup of $GL(n,\mathbb{Z})$ polycyclic?

The first solvable group that is not polycyclic is $\mathbb{Z}[1/2]\rtimes \mathbb{Z}$ (where the automorphism is given by multiplication with 2) and I do not see a way of embedding it into $GL_n(\mathbb{Z})$ for some $n$.

share|cite|improve this question
up vote 16 down vote accepted

It is a theorem of Mal'cev that all solvable subgroups of $GL(n,\mathbb Z)$ are polycyclic, and a theorem of Auslander that every polycyclic group is isomorphically embeddable in $GL(n,\mathbb Z)$, for some $n$. Auslander's theorem was later reproved by Swan purely algebraically by adapting the proof of Ado's theorem.

A. I. Mal’cev, "On certain classes of infinite solvable groups", Mat. Sb. 28 (1951) 567–588; Amer. Math. Soc. Transl. (2) 2 (1956) 1–21

R.G. Swan, "Representations of polycyclic groups", Proc. Amer. Math. Soc, 1967

L. Auslander, "On a problem of Philip Hall", The Annals of Mathematics, 1967

share|cite|improve this answer
You can find both theorems in Kargapolov-Merzljakov, as well as Segal's Polycyclic Groups. – Steve D Oct 25 '11 at 16:28

Your Answer


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.