Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. 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

Suppose I have a finite set of elements of the modular group $\operatorname{SL}_2(\mathbf{Z})$. Is there a finite procedure that will determine whether or not the group they generate has finite index, and if so, calculate this index?

Similarly, if the group they generate does have finite index, is there a finite procedure to determine whether some $g \in \operatorname{SL}_2(\mathbf{Z})$ lies in this group?

(Note: This question has been reposted at MathOverflow.)

share|cite|improve this question
This question seem to be answered at MathOverflow. May we post a CW answer here with a link to MO to remove this question from the unanswered queue? – Alexander Konovalov Jul 4 '13 at 14:32
up vote 1 down vote accepted

The below is a minutely adjusted copy of Mark Sapir's excellent answer to this question on MathOverflow:

Yes, there is an algorithm. First find the intersection $U$ of $H=\langle x_1,..., x_n\rangle$ with the free subgroup of index 12 in $SL_2(\mathbb{Z})$ (the free group has two generators $a,b$). Let it be generated by words $u_1,...,u_m$. Consider the Stallings graph associated with $U$. It is a finite labeled graph where every edge is labeled by $a,b,a^{-1}$ or $b^{-1}$ and no two edges sharing the initial/termnal vertex have the same label. The index is finite if and only if every vertex of that graph has degree 4. See, for example:

Margolis, S.; Sapir, M.; Weil, P. Closed subgroups in pro-V topologies and the extension problem for inverse automata. Internat. J. Algebra Comput. 11 (2001), no. 4, 405–445 and the references there.

share|cite|improve this answer

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.