The Diophantine problem in finitely generated commutative rings
Abstract
We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring we obtain an interpretation by systems of equations of a ring of integers of a finite field extension of either or , for some prime and variable . This implies that the Diophantine problem (decidability of systems of polynomial equations) in is reducible to the same problem in . If, in particular, has positive characteristic or, more generally, if has infinite rank, then we further obtain an interpretation by systems of equations of the ring in . This implies that the Diophantine problem in is undecidable in this case. In the remaining case where has finite rank and zero characteristic, we see that is a ring of algebraic integers, and then the long-standing conjecture that is always interpretable by systems of equations in a ring of algebraic integers carries over to . If true, it implies that the Diophantine problem in is also undecidable. Thus, in this case the Diophantine problem in every infinite finitely generated commutative unitary ring is undecidable. The present is the first in a series of papers were we study the Diophantine problem in different types of rings and algebras.
Cite
@article{arxiv.2012.09787,
title = {The Diophantine problem in finitely generated commutative rings},
author = {Albert Garreta and Alexei Miasnikov and Denis Ovchinnikov},
journal= {arXiv preprint arXiv:2012.09787},
year = {2021}
}
Comments
We were informed that an almost identical result to the main result of our preprint is already present in Kirsten Eisentraeger's PhD thesis (Theorem 7.1), which is available in her website. For this reason we are withdrawing this preprint. Part of the arguments in this preprint will appear in a forthcoming paper of ours concerning the Diophantine problem in non-commutative rings