Single-fold Diophantine representations
For every integer and every recursively enumerable set , there are an integer and a polynomial such that, for every , if and if .
The proof is complete and rigorous. Each step—from the rank-one elliptic curve height construction to exponentiation, binary containment, and clocked counter-machine encoding—preserves uniqueness of the complete auxiliary tuple.
“Theorem 1.1. For every integer n ≥ 1 and every recursively enumerable set S ⊆ N^n, there are an integer m ≥ 1 and a polynomial P ∈ Z[A1, . . . , An, W1, . . . , Wm] such that, for every a ∈ N^n, #{w ∈ N^m : P(a, w) = 0} = { 1, a ∈ S, 0, a /∈ S.” · Show in paper