8
$\begingroup$

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$.

$\endgroup$

1 Answer 1

17
$\begingroup$

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

$\endgroup$
2
  • 2
    $\begingroup$ You can find both theorems in Kargapolov-Merzljakov, as well as Segal's Polycyclic Groups. $\endgroup$
    – Steve D
    Oct 25, 2011 at 16:28
  • $\begingroup$ Does the same thing holds for arithmetic groups? $\endgroup$
    – Xiaolei Wu
    Feb 12, 2020 at 9:11

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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