Is it decidable whether two given elements of ${\rm GL}(n,{\mathbb Z})$ generate a free group of rank 2?

This is a simple question that I have been asking people for the past couple of years, but nobody has known the answer, so I thought I would try here.

The Tits alternative is known to be (effectively) decidable for finitely generated subgroups of ${\rm GL}(n,{\mathbb Z})$, but that is not helpful here.

Added: From what Misha says, the answer to the general problem might be unknown, but it is likely to be undecidable. An easier question would be, assuming that the group in question is not virtually solvable, can we find a nonabelian free subgroup (with proof). I think the answer to that might be yes, using pingpong.

This second question is answered positively here

  • 7
    $\begingroup$ I am quite sure that this is an open problem (even if n=3). Non-freedom is, of course, semi-decidable. Proving freedom in all known to me cases requires getting hold of some geometry, e.g. finding a quadruple of domains allowing for ping-pong. The trouble is that while every free subgroup will have such domains (in a flag-manifold or in the symmetric space), their boundaries are not guaranteed to be finitely-definable. This is already apparent in the case of subgroups of $O(3,1, {\mathbb Z})$. My personal feeling is that freedom is undecidable but we are lucking tools for proving this. $\endgroup$ – Misha Apr 16 '19 at 2:16
  • 3
    $\begingroup$ Derek: Your second question is much easier, this is the area known as "quantitative Tits' alternative". $\endgroup$ – Misha Apr 16 '19 at 2:28
  • 3
    $\begingroup$ Some evidence that such questions might be undecidable: see Corollary D of this paper ems-ph.org/journals/… $\endgroup$ – Ian Agol Apr 16 '19 at 5:23
  • 3
    $\begingroup$ Just a trivial restatement of the question. For a non-free pair $(u,v)$ in a group, let $N(u,v)$ be the smallest length of a nontrivial group word $w$ such that $w(u,v)=1$. In $\mathrm{GL}_d(\mathbf{Z})$, define $s_d(n)$ as the min of $N(u,v)$ over all non-free pairs $(u,v)$ with $\|u\|,\|v\|\le n$ (sup norm of matrices). Then the decidability problem is equivalent to whether $n\mapsto s_d(n)$ is computable, and it's equivalent to whether it's bounded above by a computable function. $\endgroup$ – YCor Apr 16 '19 at 6:56
  • 3
    $\begingroup$ It was shown in Klarner, Birget and Satterfield that freeness of the semigroup generated by 3x3 integer matrices is undecidable. Probably this is a bad sign for groups thought it doesn't really imply it. $\endgroup$ – Benjamin Steinberg Apr 16 '19 at 18:51

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.