Formalizing a Diophantine Representation of the Set of Prime Numbers

Abstract

The DPRM (Davis-Putnam-Robinson-Matiyasevich) theorem is the main step in the negative resolution of Hilbert's 10th problem. Almost three decades of work on the problem have resulted in several equally surprising results. These include the existence of diophantine equations with a reduced number of variables, as well as the explicit construction of polynomials that represent specific sets, in particular the set of primes. In this work, we formalize these constructions in the Mizar system. We focus on the set of prime numbers and its explicit representation using 10 variables. It is the smallest representation known today. For this, we show that the exponential function is diophantine, together with the same properties for the binomial coefficient and factorial. This formalization is the next step in the research on formal approaches to diophantine sets following the DPRM theorem. ACM Subject Classification Theory of computation → Interactive proof systems Keywords and phrases DPRM theorem, Polynomial reduction, prime numbersSupplementary Material Formalization can be found at: Formalization: http://cl-informatik.uibk.ac.at/cek/itp2022/ Funding ERC starting grant no. 714034 SMART and Cost action CA20111 EuroProofNet 1 1 Today interpreted as an adequate RAM program or equivalently a Turing machine searching for solutions.