On Computably Enumerable Sets over Function Fields

Transcription

1 On Computably Enumerable Sets over Function Fields Alexandra Shlapentokh East Carolina University Joint Meetings 2017 Atlanta January 2017

2 Some History Outline 1 Some History A Question and the Answer 2 Function Fields 3 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions 4 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants

3 Some History A Question and the Answer Hilbert s Question about Polynomial Equations Is there an algorithm which can determine whether or not an arbitrary polynomial equation in several variables has solutions in integers? Using modern terms one can ask if there exists a program taking coefficients of a polynomial equation as input and producing yes or no answer to the question Are there integer solutions?. This problem became known as Hilbert s Tenth Problem

4 Some History A Question and the Answer The Answer This question was answered negatively (with the final piece in place in 1970) in the work of Martin Davis, Hilary Putnam, Julia Robinson and Yuri Matiyasevich. Actually a much stronger result was proved. It was shown that the recursively enumerable subsets of Z are the same as the Diophantine subsets of Z.

5 Some History A Question and the Answer Diophantine Sets: a Number-Theoretic Definition Let R be a ring and let m Z >0. A subset A R m is called Diophantine over R if there exists a polynomial p(t 1,... T m, X 1,..., X k ) with coefficients in R such that for any element (t 1,..., t m ) R m we have that x 1,..., x k R : p(t 1,..., t m, x 1,..., x k ) = 0 (t 1,..., t m ) A. In this case we call p(t 1,..., T m, X 1,..., X k ) a Diophantine definition of A over R.

6 Some History A Question and the Answer Diophantine Sets: a Number-Theoretic Definition Let R be a ring and let m Z >0. A subset A R m is called Diophantine over R if there exists a polynomial p(t 1,... T m, X 1,..., X k ) with coefficients in R such that for any element (t 1,..., t m ) R m we have that x 1,..., x k R : p(t 1,..., t m, x 1,..., x k ) = 0 (t 1,..., t m ) A. In this case we call p(t 1,..., T m, X 1,..., X k ) a Diophantine definition of A over R. Remark Diophantine sets can also be described as the sets existentially definable in the language of rings or as projections of algebraic sets.

7 Some History A Question and the Answer Diophantine Sets: a Number-Theoretic Definition Let R be a ring and let m Z >0. A subset A R m is called Diophantine over R if there exists a polynomial p(t 1,... T m, X 1,..., X k ) with coefficients in R such that for any element (t 1,..., t m ) R m we have that x 1,..., x k R : p(t 1,..., t m, x 1,..., x k ) = 0 (t 1,..., t m ) A. In this case we call p(t 1,..., T m, X 1,..., X k ) a Diophantine definition of A over R. Remark Diophantine sets can also be described as the sets existentially definable in the language of rings or as projections of algebraic sets. A consequence of the MDRP result There are undecidable Diophantine subsets of Z.

8 Some History A Question and the Answer Some observations For any ring R, m Z >0 and any Diophantine subset A of R m, a Diophantine definition of A is not unique. For example, if R is an integral domain and f ( t, x) is a Diophantine definition of a set A, then so is f ( t, x) l for any l Z >0.

9 Some History A Question and the Answer Some observations For any ring R, m Z >0 and any Diophantine subset A of R m, a Diophantine definition of A is not unique. For example, if R is an integral domain and f ( t, x) is a Diophantine definition of a set A, then so is f ( t, x) l for any l Z >0. It is often the case that given R, A and f as above, for any t A the polynomial equation f ( t, x) = 0 has many solutions x R k, possibly infinitely many solutions.

10 Some History A Question and the Answer Single-fold and Finite-fold Definitions Let R be a ring and let m Z >0. A subset A R m is called single-fold (finite-fold) Diophantine over R if there exists a polynomial p(t 1,... T m, X 1,..., X k ) with coefficients in R such that for any element (t 1,..., t m ) R m we have that a unique (resp. finitely many) x R k such that p(t 1,..., t m, x 1,..., x k ) = 0 (t 1,..., t m ) A. In this case we call p(t 1,..., T m, X 1,..., X k ) a single-fold (finite-fold) Diophantine definition of A over R.

11 Some History A Question and the Answer A Question of Yu. Matiyasevich Is every Diophantine subset of Z single-fold (or at least finite-fold) Diophantine?

12 Some History A Question and the Answer A Question of Yu. Matiyasevich Is every Diophantine subset of Z single-fold (or at least finite-fold) Diophantine? Who cares?

13 Some History A Question and the Answer A Question of Yu. Matiyasevich Is every Diophantine subset of Z single-fold (or at least finite-fold) Diophantine? Who cares? What makes you think that the answer might be positive?

14 Some History A Question and the Answer Exponential Single-fold Definitions Proposition (Yu. Matiyasevich 1977) Let A Z m 0 be a c.e. set. In this case there exist P( Z, X ) Z[ Z, X ] such that (a 1,..., a m ) A unique (y, x 1,..., x k ) Z k+1 0 : P(ā, x) = y + 4y.

15 Some History A Question and the Answer Exponential Single-fold Definitions Proposition (Yu. Matiyasevich 1977) Let A Z m 0 be a c.e. set. In this case there exist P( Z, X ) Z[ Z, X ] such that Corollary (a 1,..., a m ) A unique (y, x 1,..., x k ) Z k+1 0 : P(ā, x) = y + 4y. Every c.e. set of non-negative integers is single-fold (finite-fold) Diophantine over Z 0 if and only if the set {(y, 2 y ) y Z 0 } is single-fold (finite-fold) Diophantine over Z.

16 Some History A Question and the Answer A problem of effective solution sizes Let P(T, X 1,..., X m ) be a polynomial with coefficients in Z and assume that for some suitably chosen functions σ : Z Z 0, ν : Z Z 0, we have that for every a Z, the number of integer m-tuples with P(a, x) = 0 is at most ν(a) and max x i < σ(a). If we can compute σ(x), then we can compute (some version of) ν(x). The question is whether, given ν(x), it is always possible to compute (some version of) σ(x). If all Diophantine subsets of Z have a single-fold representation, then the answer is no.

17 Some History A Question and the Answer A consequence of existence of a single-fold definitions for all c.e. sets Proposition Let A Z be c.e. but non-computable and assume that P(Z, X 1,..., X m ) is a single-fold definition of A over Z. Then for any total computable function σ : Z Z there exists a A such that P(a, x 1,..., x k ) = 0 max( x 1,..., x k ) > σ(a).

18 Some History A Question and the Answer A consequence of existence of a single-fold definitions for all c.e. sets Proposition Let A Z be c.e. but non-computable and assume that P(Z, X 1,..., X m ) is a single-fold definition of A over Z. Then for any total computable function σ : Z Z there exists a A such that P(a, x 1,..., x k ) = 0 max( x 1,..., x k ) > σ(a). Proof. Suppose there exists a total computable σ : Z Z such that for all a A we have that P(a, x 1,..., x k ) = 0 max( x 1,..., x k ) < σ(a). Then given any b Z we can compute σ(b) and check whether there exist x 1,..., x k with x i < σ(b) and P(b, x 1,..., x k ) = 0. If the answer is yes, then b A. Otherwise, b A. Hence we would have an algorithm to check membership in A in contradiction of our assumption on A.

19 Function Fields Outline 1 Some History A Question and the Answer 2 Function Fields 3 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions 4 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants

20 Function Fields Rings of Integral Functions Definition (Integral Closure) Let R 1 R 2 be integral domains and let Int(R 1 ) R 2 be the set of all elements of R 2 satisfying monic irreducible polynomials with coefficients in R 1. Then Int(R 1 ) is called the the integral closure of R 1 in R 2. (It can be shown that Int(R 1 ) is also a ring.)

21 Function Fields Rings of Integral Functions Definition (Integral Closure) Let R 1 R 2 be integral domains and let Int(R 1 ) R 2 be the set of all elements of R 2 satisfying monic irreducible polynomials with coefficients in R 1. Then Int(R 1 ) is called the the integral closure of R 1 in R 2. (It can be shown that Int(R 1 ) is also a ring.) Definition (Integral Functions) Let k be a field, let t be transcendental over k, and let K be a finite extension of k(t). Then a ring of integral functions of K is the integral closure of k[t] in K.

22 Function Fields The Main Results Theorem (Joint work with R. Miller) 1 Rational integers have a single-fold Diophantine definition over any ring of integral functions of any function field of characteristic 0. 2 Every c.e. set of integers has a single-fold Diophantine definition over any ring of integral functions of any function field of characteristic 0. 3 All c.e. subsets of polynomial rings over rings of integers of totally real number fields have finite-fold Diophantine definitions.

23 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions Outline 1 Some History A Question and the Answer 2 Function Fields 3 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions 4 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants

24 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions One vs. Finitely Many Lemma (Replacing Finitely Many by One) Let R be any integral domain such that its fraction field K is not algebraically closed. In this case, any finite system of equations over R can be effectively replaced by a single polynomial equation over R with the identical R-solution set.

25 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions One vs. Finitely Many Lemma (Replacing Finitely Many by One) Let R be any integral domain such that its fraction field K is not algebraically closed. In this case, any finite system of equations over R can be effectively replaced by a single polynomial equation over R with the identical R-solution set. Proof. It is enough to consider the case of two equations: f (x 1,..., x n ) = 0 and g(x 1,..., x n ) = 0. If h(x) = k i=0 a ix i, a k 0 is a polynomial over R without any roots in K, then t(x 1,..., x n ) = k a i f i (x 1,..., x n )g k i (x 1,..., x n ) = 0 (1) i=0 has solutions in K if and only if both f (x 1,..., x n ) = 0 and g(x 1,..., x n ) = 0 have solutions in K.

26 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions Single-fold and Finite-fold Definitions of Intersections of Diophantine Sets Corollary Let R be an integral domain and let A and B be subsets of R single-fold (finite-fold) over R. Then A B is single-fold (finite-fold) over R.

27 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions An Old Friend Lemma (Denef 1978) Let R be an integral domain of characteristic 0 and x transcendental over R. Let s R[x] \ R. Let (f n (s), g n (s)) R[x] be such that In this case f n (s) (s 2 1) 1/2 g n (s) = (s (s 2 1) 1/2 ) n. 1 deg f n = n deg s, deg g n = (n 1) deg s, 2 l dividing n is equivalent to g l dividing g n, 3 The pairs (f n, g n ) are all the solutions to f 2 (s 2 1)g 2 = 1 in R[x]

28 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions In the Ring of Integral Functions Lemma (S. 1992) Let R be an integral domain of characteristic 0 and let x be transcendental over R. Let k be the fraction field of R and let K be a finite extension of k(x). Let I be the integral closure of R[x] in K. Then there exists s I, such that s is not algebraic over R and the set of pairs (f n (s), g n (s)) R[s] satisfying f n (s) (s 2 1) 1/2 g n (s) = (s (s 2 1) 1/2 ) n. also has the following properties. 1 deg f n (s) = n, deg g n = (n 1) as polynomials in s, 2 l dividing n is equivalent to g l dividing g n, 3 The pairs (f n, g n ) are all the solutions to f 2 (s 2 1)g 2 = 1 in I.

29 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions Generating Positive Integers Some basic algebra ε n 1 ε 1 = εn 1 + ε n n mod (ε 1) in Z[ε]. Now set ε = s s 2 1, ε n = f n g n s 2 1, f n, g n Z[s] and rewrite the equivalence above as f n 1 g n s 2 1 n(s s 2 1) mod (s 1 s 2 1) 2, f n 1 g n s 2 1 n(s s 2 1) = (s 1 s 2 1) 2 (a + b s 2 1), a, b Z[s], f n 1 g n s 2 1 n(s s 2 1) = (2s 2 2s 2(s 1) s 2 1)(a + b s 2 1), a, b Z[s], g n + n = 2a(s 1) + b(2s 2 2s) = 2(s 1)(a + bs).

30 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions Generating Negative Integers More basic algebra Now set ε 1 = s + s 2 1, ε n = f n + g n s 2 1, f n, g n Z[s] and rewrite the equivalence above as f n 1 + g n s 2 1 n(s + s 2 1) mod (s 1 + s 2 1) 2, f n 1 + g n s 2 1 n(s + s 2 1) = (s 1 + s 2 1) 2 (a + b s 2 1), a, b Z[s], f n 1 + g n s 2 1 n(s + s 2 1) = (2s 2 2s 2(s 1) s 2 1)(a + b s 2 1), a, b Z[s], g n n = 2a(s 1) + b(2s 2 2s) = 2(s 1)(a + bs).

31 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions The Main Part of the Definition of Z Proposition The system below is satisfied over Q[s] if and only if x is a non-zero integer. f 2 (s 2 1)g 2 = 1, x is a non-zero constant, g x mod (s 1). Proof. If the system is satisfied then g = ±g n ±n mod (s 1) for some n Z >0. Therefore x ±n mod (s 1) or s 1 divides x ± n. Since x ± n is a constant, it can be divisible by a polynomial of positive degree only if it is 0, i.e. x = ±n. If x = ±n, n Z >0, then for some g = ±g n, we have that x ±g mod (s 1). Note that given a choice of the sign for x, the choice of the sign for g is fixed.

32 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions Defining constants We don t have a uniform definition of constants. Rings of integral functions contain the constant field. We can use the fact that all non-zero constants have inverses in the ring to separate constants from non-constant elements. In the case of a polynomial ring over a field it would be sufficient to require for an element to be invertible, since no non-constant polynomial has an inverse. In the case of a ring of integral functions, one might have to require for x, x + 1,..., x + k to be invertible. The number k will depend on the ring. If the ring of constants does not have enough invertible elements, we can use divisibility to define constants.

33 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions The Main Results Theorem (Joint work with R. Miller) 1 Rational integers have a single-fold Diophantine definition over any ring of integral functions of any function field of characteristic 0. 2 Every c.e. set of integers has a single-fold Diophantine definition over any ring of integral functions of any function field of characteristic 0. 3 All c.e. subsets of polynomial rings over rings of integers of totally real number fields have finite-fold Diophantine definitions.

34 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions Units and Constants in Q[s, s 2 1] Proof. ε = s s 2 1 is a unit in Q[s, s 2 1] since ε 1 = s + s 2 1. ε b, b 0 is not a unit in this ring and in particular if c 0 is a constant, then ε b does not divide c in Q[s, s 2 1]. The map σ : Q[s, s 2 1] Q[s, s 2 1] sending s 2 1 to s 2 1 and not moving Q[s] is an isomorphism. If s s 2 1 b is a unit, then s + s 2 1 b is also a unit. The map N : Q[s, s 2 1] Q[s] sending a + b s 2 1, a, b Q[s] to (a + b s 2 1)(a b s 2 1) is a homomorphism sending units to units. (s s 2 1 b)(s + s 2 1 b) = (s b) 2 (s 2 1) = 2bs + b is a linear polynomial and so not a unit in Q[s].

35 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions Defining exponentiation Theorem The following set has a single-fold definitions over Q[s]: EXP = {(b, c, d) b, c, d Z b = c d }.

36 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions Defining exponentiation Proof. Let ε = s s 2 1. Consider the following equations and conditions: b, c, d Z, b 0 and n Z 0, x, y, Q[ε, s] : ε n ± c = (ε b)x d ± εn 1 ε 1 = y(ε 1). (2) From (2) we conclude that (ε b) divides ±b n c in Q[ε, s] = Q[s, s 2 1]. Since b 0, we conclude that ±b n = c, and n 0. At the same time, also from (2) we have that d = ±n. Conversely, assuming b, c, d Z 0, b 0, it is easy to see that (2) can be satisfied with only one choice for the sign.

37 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions Complications: from Z to Z 0. Lagrange Four-Square Theorem does not produce single-fold definitions, only finite-fold. For any y Z we have y Z 0 y = x x x x 2 4, x i Z. This definition of non-negative integers is finite-fold because each x i can take at most 2 y i + 1 values.

38 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions A Single-fold Definition of Non-negative Integers over Rings of Functions Let (b, d 4 + 1, 2d) EXP, where 2d b 1 d 4 we know that b 1 d 4 = (d4 +1) 2 d 1 d 4 = mod d 4. In this case 2 d d 4 + d (2 d 1)d ( multiples of higher powers of d) d 4 2 d mod d 4 and 2d 2 d mod d 4. Assuming d 1 and d < 0, we have that d 3 4 leading to a contradiction.

39 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions The Main Results Theorem (Joint work with R. Miller) 1 Rational integers have a single-fold Diophantine definition over any ring of integral functions of any function field of characteristic 0. 2 Every c.e. set of integers has a single-fold Diophantine definition over any ring of integral functions of any function field of characteristic 0. 3 All c.e. subsets of polynomial rings over rings of integers of totally real number fields have finite-fold Diophantine definitions.

40 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants Outline 1 Some History A Question and the Answer 2 Function Fields 3 Constructing Single-fold Diophantine Definitions of Z over Rings of Integral Functions 4 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants

41 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants The Predecessors Martin Davis M and Hilary Putnam, Diophantine sets over polynomial rings, Illinois Journal of Mathematics, 7 (1963), Jan Denef, Diophantine sets over Z[T ], Proc. Amer. Math. Soc., 69(1): , Karim Zahidi, On Diophantine sets over polynomial rings, Proc. Amer. Math. Soc., 128(3): , Jeroen Demeyer, Diophantine Sets of Polynomials over Number Fields, Proc. Amer. Math. Soc., Volume 138(8), 2010,

42 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants The Predecessors Martin Davis M and Hilary Putnam, Diophantine sets over polynomial rings, Illinois Journal of Mathematics, 7 (1963), Jan Denef, Diophantine sets over Z[T ], Proc. Amer. Math. Soc., 69(1): , Karim Zahidi, On Diophantine sets over polynomial rings, Proc. Amer. Math. Soc., 128(3): , Jeroen Demeyer, Diophantine Sets of Polynomials over Number Fields, Proc. Amer. Math. Soc., Volume 138(8), 2010, Definition A finite extension of Q is called totally real if all of its embedding into the algebraic closure of Q are real.

43 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants Effective indexing or enumeration of polynomials By an effective enumeration of polynomials over a chosen countable formally real field we mean a bijection from a ring into positive integers such that given a usual presentation of a polynomial (or an integral function in general) we can effectively compute the image of this polynomial (or this integral function), and conversely, given a positive integer, we can determine what polynomial (or integral function) was mapped to it.

44 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants Notation Let k be a totally real number field. Let O k be the ring of integers of k the integral closure of Z in k. Let α 1,..., α r be an integral basis of O k over Z. Let θ : Z >0 O k [T ] be the effective bijection discussed above. Denote θ(n) = P n (T ). Let (X n (T ), Y n (T )) O k [T ] be such that X n (T ) (T 2 1) 1/2 Y n (T ) = (T (T 2 1) 1/2 ) n.

45 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants θ-c.e. subsets of O k [T ] m Definition For any positive integer m and any set A O k [T ] m, let θ 1 (A) = {(r 1,..., r m ) Z m >0 (P r 1,..., P rm ) A}. We say that a subset A of O k [T ] m is c.e. if θ 1 (A) is a c.e. subset of Z m.

46 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants θ-c.e. subsets of O k [T ] m Definition For any positive integer m and any set A O k [T ] m, let θ 1 (A) = {(r 1,..., r m ) Z m >0 (P r 1,..., P rm ) A}. We say that a subset A of O k [T ] m is c.e. if θ 1 (A) is a c.e. subset of Z m. Theorem Let R be the ring of integers in a totally real number field k. Let θ be an effective indexing of R[T ]; then every θ-computably enumerable relation over R[T ] is a finite-fold Diophantine relation over R[T ].

47 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants What is needed for the proof? It is enough to show that all c.e. subsets of Z are finite-fold Diophantine over the polynomial ring in question, and the indexing is finite-fold Diophantine or, in other words, the set I = {(n, P n ) n Z >0 } is finite-fold Diophantine over O k [T ].

48 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants How would it work? If A Ok m is a c.e. set, then θ 1 (A) Z m is a c.e. subset over Z and hence finite-fold Diophantine over O k [T ]. Thus a Diophantine definition of A will look like the following system of equations: (Q 1,..., Q m ) A if and only if { (r1,..., r m ) θ 1 (A) (r j, Q j ) I, j = 1,..., m

49 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants Totally Positive Polynomials Definition If F is a polynomial in O k [T ], then F is positive-definite on k (denoted by Pos(F )) if and only if σ(f (t)) 0 for all t k and for all real embeddings σ of k into its algebraic closure. Lemma The relation Pos is Diophantine over O k [t].

50 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants The relation Pos is Diophantine Zahidi. We claim that the following equivalence holds: Pos(F ) if and only if there exist F 1,..., F 5 O k [t], g Z \ {0} g 2 F = F F 2 5. (3) If (3) holds, then clearly Pos(F ) holds. Conversely suppose that F is positive definite on k. In this case it follows from a theorem of Pourchet that F can be written as a sum of five squares in k[t]. Now multiplying by a suitable positive integer constant g 2 these polynomials can be taken to be in O k [t], and hence (3) has solutions.

51 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants The relation Pos is Finite-fold Diophantine We now show that the for a given g and F there can be only finitely many solutions to (3). First of all, the degrees of F 1,..., F 5 are bounded by the degree of F. Secondly, observe that for any a O k we have that σ(f i (a)) σ(f (a)) for all i and all embeddings sigma. Since F i (a) is an algebraic integer of k of bounded height, there are only finitely many b k such that F i (a) can be equal to b. Thus, there are only finitely many possible values for the coefficients of any F i.

52 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants A c.e. relation on Z Definition Define the relation Par(n, b, c, d, v 1,..., v r ) on the rational integers as follows: Par(n, b, c, d, g, v 1,..., v r ) if and only if the following conditions hold: 1 n is the enumeration index of a polynomial P n O k [T ]; 2 b, c, d, g Z 0, v 1,..., v r Z; 3 d = deg P n ; 4 c is the smallest possible positive integer so that Pos(Y 2 d+2 + c P2 n 1) 5 g is the smallest possible positive integer so that there exist F 1,..., F 5 O k [T ] satisfying g 2 (Y 2 d+2 + c P2 n 1) = F F x Z : if 0 x d then Y d+2 (x) b; 7 P n (2b + 2c + d) = v 1 α v r α r.

53 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants The last bit Lemma (Zahidi) F O k [T ] F = P n is equivalent to b, c, d, v 1,..., v r O k [T ] : 1 Par(n, b, c, d, g, v 1,..., v r ); 2 Yd c F 2 1 Pos; 3 F (2b + 2c + d) = v 1 α v r α r.

54 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants The Main Results Theorem (Joint work with R. Miller) 1 Rational integers have a single-fold Diophantine definition over any ring of integral functions of any function field of characteristic 0. 2 Every c.e. set of integers has a single-fold Diophantine definition over any ring of integral functions of any function field of characteristic 0. 3 All c.e. subsets of polynomial rings over rings of integers of totally real number fields have finite-fold Diophantine definitions.

55 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants Without the Finite-fold Requirement Theorem (Joint work with R. Miller) Let R be a ring of integral functions over the field of constants that is a finite extension of Q. Then all c.e. subsets of R are Diophantine over R.

56 Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over (Countable) Totally Real Fields of Constants Without the Finite-fold Requirement Theorem (Joint work with R. Miller) Let R be a ring of integral functions over the field of constants that is a finite extension of Q. Then all c.e. subsets of R are Diophantine over R. Corollary Any polynomial ring contained in R is Diophantine over R.