Prime Representing Polynomial

The main purpose of formalization is to prove that the set of prime numbers is diophantine, i.e., is representable by a polynomial formula. We formalize this problem, using the Mizar system [1], [2], in two independent ways, proving the existence of a polynomial without formulating it explicitly as well as with its indication.

First, we reuse nearly all the techniques invented to prove the MRDP-theorem [11]. Applying a trick with Mizar schemes that go beyond first-order logic we give a short sophisticated proof for the existence of such a polynomial but without formulating it explicitly. Then we formulate the polynomial proposed in [6] that has 26 variables in the Mizar language as follows (w·z+h+j−q)²+((g·k+g+k)·(h+j)+h−z)²+(2 · k³·(2·k+2)·(n + 1)²+1−f²)²+ (p + q + z + 2 · n − e)² + (e³ · (e + 2) · (a + 1)² + 1 − o²)² + (x² − (a² −′ 1) · y² − 1)² + (16 · (a² − 1) · r² · y² · y² + 1 − u²)² + (((a + u² · (u² − a))² − 1) · (n + 4 · d · y)² + 1 − (x + c · u)²)² + (m² − (a² −′ 1) · l² − 1)² + (k + i · (a − 1) − l)² + (n + l + v − y)² + (p + l · (a − n − 1) + b · (2 · a · (n + 1) − (n + 1)² − 1) − m)² + (q + y · (a − p − 1) + s · (2 · a · (p + 1) − (p + 1)² − 1) − x)² + (z + p · l · (a − p) + t · (2 · a · p − p² − 1) − p · m)² and we prove that that for any positive integer k so that k + 1 is prime it is necessary and sufficient that there exist other natural variables a-z for which the polynomial equals zero. 26 variables is not the best known result in relation to the set of prime numbers, since any diophantine equation over ℕ can be reduced to one in 13 unknowns [8] or even less [5], [13]. The best currently known result for all prime numbers, where the polynomial is explicitly constructed is 10 [7] or even 7 in the case of Fermat as well as Mersenne prime number [4]. We are currently focusing our formalization efforts in this direction.