A remark on Ax's theorem on solvability modulo primes (Q1183069)

Let \(f_ 1,\dots,f_ k\in \mathbb{Z}[X]\), \(X=(X_ 1,\dots,X_ m)\), \(p\) ranges over prime numbers and \(P(f_ 1,\dots,f_ k)=\{p: \hbox{ there is }x\in \mathbb{Z}^ m \hbox{ such that }f_ 1(x)\equiv\dots\equiv f_ k(x)\equiv 0\pmod p\}\). Theorem: The set \(P(f_ 1,\dots,f_ k)\) is an intersection of finitely many sets of the form \(P(g)\) with \(g(T)\in\mathbb{Z}(T)\) a polynomial in the single variable \(T\). The theorem strengthens the main result in [\textit{J. Ax}, Ann. Math., II. Ser. 85, 161-183 (1967; Zbl 0239.10032)]. The proof of the theorem depends on Weil's Theorem on curves over finite fields. The author's theorem is extended to take into account the dependence on parameters.