Decidability of the Membership Problem for $2\times 2$ integer matrices

The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\times 2$ integer matrices $M_1,\dots,M_n$ and $M$ decides whether $M$ belongs to the semigroup generated by $\{M_1,\dots,M_n\}$. Our algorithm relies on a translation of the numerical problem on matrices into combinatorial problems on words. It also makes use of some algebraical properties of well-known subgroups of $\mathrm{GL}(2,\mathbb{Z})$ and various new techniques and constructions that help to limit an infinite number of possibilities by reducing them to the membership problem for regular languages.

[1]  Igor Potapov,et al.  On the Computational Complexity of Matrix Semigroup Problems , 2012, Fundam. Informaticae.

[2]  A. Gerrard,et al.  Introduction to Matrix Methods in Optics , 1975 .

[3]  Paul E. Schupp,et al.  Membership Problem for the Modular Group , 2007, SIAM J. Comput..

[4]  R. Rankin.  Modular Forms and Functions , 1977 .

[5]  Igor Potapov,et al.  Reachability problems in quaternion matrix and rotation semigroups , 2008, Inf. Comput..

[6]  Igor Potapov,et al.  On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups , 2010, Int. J. Found. Comput. Sci..

[7]  Joël Ouaknine,et al.  On the Positivity Problem for Simple Linear Recurrence Sequences, , 2013, ICALP.

[8]  Christian Choffrut,et al.  Some decision problems on integer matrices , 2005, RAIRO Theor. Informatics Appl..

[9]  Ravi Kannan,et al.  Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..

[10]  Juhani Karhumäki,et al.  On the Undecidability of Freeness of Matrix Semigroups , 1999, Int. J. Algebra Comput..

[11]  Joël Ouaknine,et al.  On the Complexity of the Orbit Problem , 2013, J. ACM.

[12]  Joël Ouaknine,et al.  Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences , 2013, ICALP.

[13]  Jin-Yi Cai,et al.  Multiplicative equations over commuting matrices , 1996, SODA '96.

[14]  Joël Ouaknine,et al.  On Matrix Powering in Low Dimensions , 2015, STACS.

[15]  Igor Potapov,et al.  On undecidability bounds for matrix decision problems , 2008, Theor. Comput. Sci..

[16]  Tero Harju,et al.  Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More , 2014, ArXiv.

[17]  Richard J. Lipton,et al.  Polynomial-time algorithm for the orbit problem , 1986, JACM.

[18]  Igor Potapov,et al.  Vector Reachability Problem in SL(2, Z) , 2016, MFCS.

[19]  R. Lyndon,et al.  Combinatorial Group Theory , 1977 .

[20]  Joël Ouaknine,et al.  The orbit problem in higher dimensions , 2013, STOC '13.

[21]  Vincent D. Blondel,et al.  Decidable and Undecidable Problems about Quantum Automata , 2005, SIAM J. Comput..