On existential definitions of C.E. subsets of rings of functions of characteristic 0
Russell Miller, Alexandra Shlapentokh

TL;DR
This paper extends Diophantine definability results to rings of functions of characteristic 0, showing that various c.e. sets and valuation rings are definable, advancing understanding of number theory and logic in algebraic structures.
Contribution
It provides the first examples of infinite rings with finite-fold Diophantine definitions and extends definability results to valuation rings and rings of S-integers in function fields.
Findings
Rational integers have a single-fold Diophantine definition over integral functions.
Every c.e. set of integers has a finite-fold Diophantine definition.
All c.e. subsets of polynomial rings over totally real number fields are definable.
Abstract
We extend results of Denef, Zahidi, Demeyer and the second author to show the following. (1) Rational integers have a single-fold Diophantine definition over the ring of integral functions of any function field of characteristic 0. (2) Every c.e. set of integers has a finite-fold Diophantine definition over the ring of integral functions of any function field of characteristic . (3) All c.e. subsets of polynomial rings over totally real number fields have finite-fold Diophantine definitions. (These are the first examples of infinite rings with this property.) (4) If is algebraic over and is embeddable into a finite extension of for odd , and is a one-variable function field over , then the valuation ring of any function field valuation of has a Diophantine definition over . (5) If is algebraic over and is embeddable into , and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Commutative Algebra and Its Applications · Polynomial and algebraic computation
On existential definitions of c.e. subsets of rings of functions of characteristic 0
Russell Miller & Alexandra Shlapentokh
Abstract.
We extend results of Denef, Zahidi, Demeyer and the second author to show the following.
- (1)
Every c.e. set of integers has a single-fold Diophantine definition over the ring of integral functions of any function field of characteristic 0. 2. (2)
Every c.e. set of integers has a single-fold Diophantine definition over a polynomial ring over integral domain characteristic 0. 3. (3)
All c.e. subsets of polynomial rings over rings of totally real integers have finite-fold Diophantine definitions. (These are the first examples of infinite rings with this property.) 4. (4)
Let be a one-variable function field over a field of constants , and let be any prime of . If is algebraic over and for some odd prime embeddable into a finite extension of , then the valuation ring of has a Diophantine definition over . If is embeddable into a real field, then valuation rings are existentially definable for “almost all” primes. 5. (5)
Let be a one-variable function field over a number field and let be a finite non-empty set of its primes. Then all c.e. subsets of are Diophantine over . (Here is the ring of -integers or a ring of integral functions.)
The first author was partially supported by Grant # DMS – 1362206 from the National Science Foundation, by Grant # 581896 from the Simons Foundation, by the Queens College Research Enhancement Program, and by several grants from The City University of New York PSC-CUNY Research Award Program. The second author was partially supported by Grant # DMS – 1161456 from the National Science Foundation.
1. Introduction
In 1969, building on earlier work by Martin Davis, Hilary Putnam and Julia Robinson, Yuri Matiyasevich demonstrated the impossibility of solving Hilbert’s Tenth Problem. In doing so, he also completed a proof of the theorem asserting that Diophantine (or existentially definable in the language of rings) sets and computably enumerable sets of integers were the same. In other words, it was proved that for every positive integer , every computably enumerable subset of had a Diophantine definition over . We describe the notions of a Diophantine definition and a Diophantine set in a more general setting.
Definition 1.1**.**
Let be a commutative ring and let be a positive integer. In this case a set is called Diophantine over if for some and some polynomial
[TABLE]
we have that for all it is the case that
[TABLE]
The polynomial is called a Diophantine definition of over .
If a set is Diophantine over and for every we have that as above is unique, we say that is a single-fold definition of . If for every we have that there are only finitely many as above, we say that is a finite-fold definition of .
Question 1.2**.**
Does every c.e. set of integers have a finite-fold Diophantine definition over ?
The answer to this question, raised by Yuri Matiyasevich almost immediately after his solution to Hilbert’s Tenth Problem, is unknown to this day. The issue of finite-fold representation is of more than just esoteric interest because of its connection to many other questions. For an extensive survey of these connections we refer the reader to a paper of Matiyasevich ([9]). Here we would like to give just one example that can be considered a generalization of Hilbert’s Tenth Problem.
Let and let be any nonempty proper subset of . Let be the set of polynomials with integer coefficients such that the number of solutions to the equation is in . Martin Davis showed in [2] that is undecidable. If we ask whether is c.e, then the answer is currently unknown. At the same time, if we replace polynomials by exponential Diophantine equations, then we can answer the question. Craig Smoryńsky in [17] proved that is c.e. if and only if for some finite . (Here is a collection of exponential Diophantine polynomials with positive integer coefficients such that if an exponential Diophantine polynomial , then the number of solutions to the equation is in .) Smoryńsky’s proof relied on a result obtained by Matiyasevich in [10] that every computably enumerable set has a single-fold exponential Diophantine definition. One would expect a similar result for (non-exponential) Diophantine equations if the finite-fold question is answered affirmatively.
Matiyasevich also proved that to show that all c.e. sets of integers have single-fold (or finite-fold) Diophantine definitions it is enough to show that the set of pairs has a single-fold (finite-fold) Diophantine definition. (This will not be surprising to readers familiar with the history of Hilbert’s Tenth Problem.)
Unfortunately, the finite-fold question over remains out of reach at the moment, as with many other Diophantine questions. In Section 3 of this paper, we take some first timid steps in the investigation of this issue by considering it in a more hospitable environment over function fields of characteristic 0, as described in Section 2. We extend the results of the second author from [14] to show that over any ring of integral functions (otherwise known as a ring of -integers) any c.e. set of rational integers has a single-fold Diophantine definition (see Theorem 3.8). We also show that over any polynomial ring over an integral domain of characteristic 0 it is possible to give a single-fold Diophantine definition for every c.e. set of integers (see Theorem 4.9).
Using these results on single-fold definability of and c.e. sets of integers, following results of Jan Denef from [5] and Karim Zahidi from [20], we show in Section 5 that all computably enumerable subsets of a polynomial ring over a ring of integers of a totally real number field are finite-fold existentially definable. As far as we know, this is the first example of this kind. (See Theorem 5.2.)
In Section 7 we generalize results of Jeroen Demeyer from [3] to show that all c.e. subsets of rings of integral functions over number fields are Diophantine (see Theorem 7.1). In order to do so, we needed to generalize the earlier treatments (given in the papers [11] of Laurent Moret-Bailly and [6] of Kirsten Eisentraeger) of definability of integrality at a degree one valuation over a function field of characteristic zero where the constant field is a number field. Both of those papers in turn extend results of H. K. Kim and Fred Roush from [7] where the two authors give a Diophantine definition of integrality at a valuation of degree 1 over a rational function field with a constant field embeddable into a -adic field. (Such constant fields include all number fields.) The papers of Moret-Bailly and Eisentraeger are primarily concerned with extending results pertaining to Hilbert’s Tenth Problem and so they extend the results of Kim and Roush just enough for their arguments to go through, by showing the following for a function field over a field of constants as described above: if is a non-constant element of and the pole of splits completely into distinct primes in the extension , then there exists a Diophantine subset of such that all rational functions in that subset are integral at .
In contrast, our proof required a Diophantine definition of the valuation ring of a single factor of in . In order to obtain such a definition we reworked the original construction of Kim and Roush. In this paper we show that the valuation ring of “almost” any prime of a function field of characteristic 0 is existentially definable over a function field with a constant field algebraic over and embeddable into a finite extension of for or . The "almost" part applies only to the case where we have to use the fact that the constant field under consideration is embeddable into . If the constant field is embeddable into a finite extension of , with , then we can give an existential definition (with a parameter, of course) of any valuation ring. We also should note here that the class of constant fields described above contains an infinite subset of non-finitely generated fields. (See Section 6.)
2. Number Fields, Function Fields and Rings
Throughout this paper, by a function field we will mean a finite extension of a rational function field , where is transcendental over a field of characteristic 0. By the constant field of we will mean the algebraic closure of in . (In our case we will often have a situation where the algebraic closure of in is equal to by construction.)
By a prime of , we will mean the maximal ideal of the valuation ring corresponding to one of the valuations defined on . (See [1] for more details on valuations of function fields.) Given , we define to be the largest non-negative integer such that . If , then , and we define . We define the order of 0 to be infinity.
For the field of constants we will most often select some algebraic extension of . When such an extension is finite, the field is called a number field. One can also consider all the possible embeddings of into , the algebraic closure of inside . If all the embeddings are contained in , then the field is called totally real. If a field is algebraic over and has an embedding into , then we will call it formally real.
3. Single-fold Diophantine Representations of C.E. Sets of Integers over Rings of -integers of Function Fields of Characteristic 0
In this section we describe a finite-fold Diophantine definition of c.e. sets of integers over rings of integral functions. Before we do that, we have to reconsider certain old methods of defining sets to make sure they produce single-fold definitions. We start with the issue of intersection of Diophantine sets.
3.1. Single-Fold and Finite-Fold Definition of “And”
As long as we consider rings whose fraction fields are not algebraically closed, we can continue to use the “old” method of combining several equations into a single one without introducing extra solutions, as in Lemma 1.2.3 of [14]. More specifically we have the following proposition.
Proposition 3.1**.**
Let be an integral domain such that its fraction field is not algebraically closed. Let and be Diophantine subsets of such that the sets and have single (finite) fold definitions, and . Then has a single (finite) fold definition.
More specifically, if we let be a polynomial without roots in the fraction field of , let , let be a single (finite) fold definition of , and let be a single (finite) fold definition of , then
[TABLE]
*is a single (finite) fold definition of . *
The proof of this proposition is the same as for Lemma 1.2.3 of [14].
3.2. Pell Equations over Rings of Functions of Characteristic 0
Next we take a look at the old workhorse of Diophantine definitions: the Pell equation. It turns out that in the context of defining integers over rings of functions this equation produces “naturally” single-fold definitions.
Lemma 3.2**.**
*(Essentially Lemma 2.1 of [4], or Lemma 2.2 of [15] )
Let be an integral domain of characteristic not equal to 2. Let transcendental over . Let be such that (In [15] there is a typographical error in this equation: the “square” is misplaced on the right-hand side.) In this case*
- (1)
, 2. (2)
, 3. (3)
The pairs are all the solutions to in
Below we use the following notation.
Notation 3.3*.*
- •
Let denote a function field of characteristic 0 over the constant field .
- •
Let be a finite non-empty set of primes of .
- •
Let be the ring of -integers of .
- •
For such that is not a square in , let
[TABLE]
The next proposition follows from Lemmas 2.3,2.4, 2.5, 3.1–3.3 of [16].
Proposition 3.4**.**
There exists satisfying the following conditions.
- •
,
- •
* and is odd for .*
- •
In , the prime splits into the product .
- •
The element of has a zero at , a pole at , and no other zeros or poles.
- •
For , we have that is a cyclic group generated by modulo , and and (for any ) are not units of .
- •
Let be as in Lemma 3.2. Then , , and
[TABLE]
in the ring . (Note that .)
Remark 3.5*.*
Let , let be as in Proposition 3.4. Finally assume . Then what can we say about ? By Proposition 3.4, there exists such that , where
[TABLE]
Thus, we have four possibilities:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Alternatively,
[TABLE]
Lemma 3.6**.**
*(Essentially Lemma 3.4 of [16].)
Let be any subring of containing a local subring of . (In particular, can be equal to .) Then there exists a subset of that contains only constants, includes , and is single-fold Diophantine over .*
Proof.
We remind the reader that the contains primes. Let be the product of all non-invertible rational primes (or 1, if contains ), and let be the set defined by the following equations over :
[TABLE]
We claim that System (3.1) has solutions in only if is a constant, while conversely, if , then these equations have solutions in . Indeed, if is not a constant, neither are . Therefore, since they are invertible in , they all must have zeros at valuations of . However, these elements do not share any zeros, and there are valuations in and elements under consideration. This implies that two of them must share the same zero, which is impossible since their differences are constant. The converse is obvious: if , then is invertible for each . Please note that given , if System (3.1) has solutions, then these solutions are unique. ∎
Notation 3.7*.*
Let denote the system of equations (3.1).
We will use this system to give a single-fold Diophantine definition of over .
Theorem 3.8**.**
* has a single-fold Diophantine definition over .*
Proof.
There are several ways to state this proof. We choose the way that we will later use to produce a single-fold definition of exponentiation for . Let be as in Proposition 3.4 and consider the following equations and conditions:
[TABLE]
[TABLE]
in ;
[TABLE]
Supposed now that Equations (3.2)–(3.4) are satisfied with variables ranging over . Then, by Proposition 3.4 and Lemma 3.2, for some . Thus, in . Since is not a unit of , we have that is a constant with a zero at some valuation of . Hence .
Conversely, given , set and observe that all the equations are satisfied. Note also, that this is the only solution to the equations. ∎
Notation 3.9*.*
Let denote the system of equations (3.2)–(3.4).
We now give a single-fold Diophantine definition of exponentiation.
Theorem 3.10**.**
The following set has a single-fold definition over :
[TABLE]
Proof.
Consider the following system of equations:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We start with noting that (3.9) implies that divides in . Note that by Proposition 3.2, we also have that is not a unit of . If we choose the “minus” option, then we have that divides . Since divides , it follows that divides , and thus is a unit of . Hence “minus” option cannot occur. Consequently, (3.9) can be rewritten as:
[TABLE]
From (3.10) we deduce that in . At the same time in . Therefore, . By Proposition 3.4 we conclude that is not a unit, and therefore has a zero at a valuation of . Since are integers, we must infer that , and . At the same time, also from (3.10), we have that in . By the same argument as above we conclude that .
Conversely, assuming , it is easy to see that (3.9) can be satisfied with only one choice for the sign in front of .
We now rewrite (3.9) over :
[TABLE]
Thus System (3.11), with all the variables ranging over , is equivalent to Conjunction (3.9). ∎
Notation 3.11*.*
For future reference we will denote the equations (3.5)–(3.8) together with (3.11) by
[TABLE]
Corollary 3.12** (Single fold definition of positive integers over ).**
Let be as in Proposition 3.4, and let
[TABLE]
Then Plus, and this Diophantine definition is single-fold.
Proof.
Given Theorem 3.10, the only point that needs a proof is the single-fold property of the definition. Given a , to satisfy the system, we must have that
[TABLE]
[TABLE]
[TABLE]
Thus the values of all variables are uniquely determined by .
∎
We also have another corollary to be used in Section 7.
Corollary 3.13**.**
The set is single-fold Diophantine over .
Proof.
Consider the set
[TABLE]
By the same argument as in the proof of Corollary 3.12, the set consists of all the triple in the required form, and given such a triple, the values of all the other variables are determined uniquely. ∎
Combining Theorem 3.8, Corollary 3.12 with a result of Matiyasevich from [10] we now have the following theorem.
Theorem 3.14**.**
Every c.e. set of integers has a single-fold Diophantine definition over .
4. Single-Fold Diophantine Representations of C.E. Sets of Rational Integers over Polynomial Rings of Characteristic 0.
In this section we prove the analog of Theorem 3.14, but for polynomial rings over arbitrary commutative rings with unity of characteristic 0. If the ring of constants contains , then the proof of Theorem 3.14 can be used verbatim. So the only case that we need to consider is the situation where the ring of constants does not contain . If the constant ring does not contain , it can contain infinitely many non-invertible primes, and therefore we cannot use the definition of a constant set containing all integers from Lemma 3.6. For exactly same reason, we cannot use multiplicative inverses to define the set of non-zero elements. Thus, we will have to modify some parts of the proof of Theorem 3.14.
First we need the following basic fact.
Lemma 4.1**.**
If are non-zero relatively prime integers, then .
Proof.
Since we have that for some it is the case that . Thus .
∎
Next we deal with the question of saying that an element is not 0.
Lemma 4.2**.**
Let be a ring of characteristic [math] such that a rational prime does not have an inverse in the ring. In this case, there exists a set such that , , and if , then .
Proof.
Let . Then . Indeed, if then , and we have a contradiction. Suppose now that for some we have that . We claim that . Observe that if then and . If , then , and has an inverse in by Lemma 4.1, in contradiction of our assumptions. Finally, clearly . ∎
Theorem 4.3**.**
*(Similar to Theorem 5.1 of [15])
If is an integral domain of characteristic 0 and is transcendental over , then is single-fold Diophantine over .*
Proof.
As we explained above, without loss of generality, we can assume that , and therefore, by Lemma 4.1, contains at least one non-inverted prime. Consider the following set of equations,
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We show that these equations can be satisfied with some values of variables
[TABLE]
only if we choose to be an odd integer. First of all, we note that for any choice of , we have that . Indeed, if and , then as a polynomial in is bigger or equal to 0. Therefore, the degree of is bigger or equal to 2. By Lemma 3.2 we have from (4.13) that for some . Alternatively, . Let . Then for some . (See Remark 3.5 for the discussion of signs.) Next by Proposition 3.4, we deduce that is not a unit. So, from (4.14), as in the proof of Theorem 3.10, we conclude that , . Further, from (4.17) we obtain that , implying that is odd. (From the binomial expansion, it is easy to see that divides in the polynomial ring only if is odd.) Hence, is odd. From Lemma 3.2 we also have that
[TABLE]
where “” corresponds to . Thus . Additionally, we have that . Since is even, we now deduce . Thus, we conclude using (4.16) that or equivalently
[TABLE]
From (4.15) we have so that , and . Therefore (4.19) implies that , , that is, is an odd integer.
Conversely, suppose is an odd integer and let . Then . To satisfy (4.13) and (4.14) we need to set , where . Further, (4.14) requires that . To satisfy (4.16), we need to arrange for , or in other words, we need to be satisfied. As before, (4.17) implies is an odd number. So we have to set , where is odd. Thus, again as above we have that . Therefore, we have to choose . But since both , and , the only way to satisfy the equivalence is to set . Now (4.12)–(4.14), (4.16) and (4.17) are satisfied. Since , and we set , we can conclude that t\Big{|}g_{3}(rx)g_{2}(rx), and (4.15) and (4.18) are satisfied. Observe, that given an odd integer , the remaining variables have to take the values described above.
We now show how to state the assumption that . Let be a rational prime without a multiplicative inverse in . We replace the condition by . By Lemma 4.2, the added equation will imply that .
Now, if Equations (4.12)–(4.18) together with the new equation are satisfied, by Lemma 4.2, we conclude that is an odd integer, i. e. for some . Therefore or . Since , the only prime that can divide the denominator of is . But by Lemma 4.1, we have that cannot appear in a reduced denominator of an element in . Therefore, we conclude that . Hence, Equations (4.12)–(4.18) together with the new equation are satisfiable over if and only if .
∎
Notation 4.4*.*
We denote Equations (4.12) – (4.18), together with the equation by . Thus,
[TABLE]
In this formula is a fixed parameter corresponding to a prime not inverted in .
In this section, as in the section concerning rings of -integers, we will need to know that for any we have that is not a unit of . There is a similar statement in Proposition 3.4. The difference between that statement and the statement below is that over we fixed , while here ranges over .
Lemma 4.5**.**
Let . Then we have that is not a unit in .
Proof.
Let be the fraction field of . Let . The monic irreducible polynomial of over is of the form . Therefore, for any , we have that . Here we note that the only units of are some elements of . So, if , then we conclude that is not a unit. Since , we conclude that is not a unit in , and, therefore, is not a unit in .
∎
Now that we have a single fold Diophantine definition of integers, we can produce a single-fold definition of non-zero integers, and then positive integers and exponentiation.
Lemma 4.6**.**
If is an integral domain of characteristic 0 and is transcendental over , then is single-fold Diophantine over .
Proof.
Let be given and consider the following sequence of equations:
[TABLE]
[TABLE]
[TABLE]
From (4.20) via Notation 4.4, we conclude that . If we set , then by Lemma 3.2 and Remark 3.5 we deduce from (4.22) that that . By Lemma 4.5 we also know that is not a unit of . So, as in the proof of Theorem 3.10 again, , and . Finally, we have that in , implying .
To see that this definition is single-fold, let . Then by Theorem 4.3, there is a uniques set of values that can be taken by variables . Finally, given , Equation (4.21) forces . Thus, are determined uniquely. ∎
The next theorem will show existence of single-fold definitions for all c.e. subsets of rational integers in polynomial rings. The proofs will proceed via Diophantine definitions of exponentiation with arguments similar to the ones used in the proof of Theorem 3.10.
Notation 4.7*.*
Let denote Equations (4.20)-(4.22). So that over
[TABLE]
and this definition is single-fold.
Theorem 4.8**.**
Let be an integral domain of characteristic 0, and assume is transcendental over the fraction field of and . Then every c.e. set of rational integers has a single-fold Diophantine definition over .
Proof.
We can now proceed as in the case of the rings of integral functions. Consider the following system of equations:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
By the same argument, as in the case of integral functions, this system gives a single-fold definition of the set
[TABLE]
Finally, if we set , we get the set . Using Matiyasevich’s result, we now conclude that the assertion of the theorem holds. ∎
Finally, putting the result above together with our observation about the case when , we obtain the following result.
Theorem 4.9**.**
Let be an integral domain of characteristic 0, and assume is transcendental over the fraction field of . Then every c.e. set of rational integers has a single-fold Diophantine definition over .
5. Finite-fold Diophantine Definition of C.E. Sets of Polynomial Rings over Totally Real Fields of Constants
So far we have produced single-fold definitions of certain c.e. subsets of a ring. We now construct our first examples of rings where all c.e. sets have finite-fold definitions. To do this we combine the arguments above with the proof of Zahidi from [20] showing that over a polynomial ring with coefficients in a ring of integers of a totally real number field, all c.e. sets were Diophantine. Zahidi’s result was in turn an extension of a result of Denef from [5] in which the coefficients of the polynomial ring came from .
Any discussion of c.e. sets of a polynomial ring and a ring of integral functions to be discussed later, must of course involve some discussion of indexing of the ring. In other words we will need a bijection from a ring into the positive integers such that given a “usual” presentation of a polynomial (or an integral function in the future) 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. For a discussion of an effective indexing map in the case of a rational function field we refer the reader to the paper of Zahidi. A discussion of indexing for function fields can be found in [14]. In this paper we will assume that such an indexing is given and, following Zahidi, will denote it by going from positive integers to polynomials. Below we describe the rest of our notation and assumptions.
Notation and Assumptions 5.1*.*
- •
Let be a totally real number field.
- •
Let be the ring of integers of .
- •
Let be an integral basis of over .
- •
Let be the effective bijection discussed above.
- •
Define .
- •
Let be such that
[TABLE]
As we indicated before, our intention is to follow the plan laid out by Zahidi and Denef, just making sure that all the definitions in that plan are finite-fold. This plan entails showing (a) that all c.e. subsets of are (finite-fold) Diophantine over the polynomial ring in question and (b) that the indexing is (finite-fold) Diophantine or, in other words, the set
[TABLE]
is (finite-fold) Diophantine over . Zahidi provides a brief argument in his paper that we apply to our situation, given that we have a finite-fold way of combining equations, to see that (a) and (b) imply the following theorem.
Theorem 5.2**.**
Let be the ring of integers in a totally real number field . Let be an effective indexing of ; then every -computably enumerable relation over is a finite-fold Diophantine relation over .
Thus we concentrate on proving the following proposition.
Proposition 5.3**.**
The set
[TABLE]
is finite-fold Diophantine over .
The lemmas below constitute a proof of the proposition. Like the earlier authors, we will make use of a theorem of Y. Pourchet representing positive-definite polynomials as sums of five squares. We start with an auxiliary lemma.
Lemma 5.4**.**
Fix a positive integer and algebraic integers . Then there is exacly one polynomial of degree such that .
Proof.
Let and observe that our requirement on the values of implies that the coefficients of must be the solutions of a linear system , where . (Here “” denotes transposition.) Note that is a van der Monde determinant, and therfore not equal to 0. Thus, the system has a unique solution. ∎
Corollary 5.5**.**
Let be a fixed positive integer, let , let be the set of all embeddings of into its algebraic closure, let
[TABLE]
Then is finite.
Proof.
Let be the set of elements of such that for any we have that . Let , and let . Then any coefficient of the monic irreducible polynomial of over must be an integer of absolute value less or equal to . Thus is a finite set.
Now let . Then . Next we note that for . Thus, . So that the set of possible -tuples of values is finite. By Lemma 5.4, for each -tuple , there exists only one polynomial of degree less or equal to such that . Thus we now conclude that the number of polynomials in is finite. ∎
Definition 5.6**.**
- •
If is a polynomial in , then is positive-definite on (denoted by ) if and only if for all and for all real embeddings of into its algebraic closure.
- •
If is a polynomial in , then is strictly positive-definite on if and only if for all and for all real embeddings of into its algebraic closure.
- •
Let Pos, contain pairs such that for some .
Lemma 5.7**.**
For any we have that Pos if and only if there exists such that Pos.
Proof.
Suppose there exists such that for some . Then, clearly Pos is true. Conversely, suppose Pos is true. Then by a theorem of Pourchet (see [12]), we have that , for some . Let be such that for any coefficient of , we have that . Then Pos. ∎
Lemma 5.8**.**
The relation Pos2 is finite-fold Diophantine over .
Proof.
By definition of Pos2 we have that if and only if there exist such that
[TABLE]
We now show that the for a given and , there can be only finitely many solutions to (5.27). First of all, the degrees of are bounded by the degree of . Secondly, observe that for we have that for all embeddings . (See Corollary 5.5 for definition of .) Let , where is taken over and all . Then if (5.27) holds, we have that . By Corollary 5.5, we have that is finite. ∎
Definition 5.9**.**
The relation on the rational integers is defined to be the conjunction of the following conditions:
- (1)
, (); 2. (2)
; 3. (3)
; 4. (4)
is the smallest possible non-negative integer such that that is strictly positive; 5. (5)
is the smallest possible positive integer such that Pos. 6. (6)
; 7. (7)
.
Lemma 5.10**.**
Par is a recursive relation on integers.
Proof.
Given our assumption that is effective, that is we can effectively determine the degree and coefficients of , the first three conditions can be checked algorithmically over . So, we may start with describing an algorithm for computing and .
We start by calculating . For every we will determine the smallest non-negative integer such that for all values of the variable. Then we will set .
We compute first. The degree of is , and the degree of is by Lemma 3.2. (We can compute algorithmically, since ). Thus the polynomial is of degree with a leading coefficient equal to the square of an element of , and therefore has an absolute minimum. By Corollary 8.7, there is an algorithm to verify whether this minimum is positive. If the answer is “yes”, then we set . If the answer is “no”, then we consider and check whether is strictly positive for all values of the variable. If the answer is “yes”, we set . If the answer is “no”, we consider , etc. If is the minimum value of , then the process will terminate in at most steps.
We now calculate for some . We note that since the leading coefficient of is a square, the leading coefficient of is positive. Thus, we can proceed as in the case of .
We can now determine . By a result of Pourchet cited above, we can write the polynomial , where . By examining coefficients of these polynomials, we can determine an integer such that . The value is an upper bound on the set of ’s we have to search to find . Let
[TABLE]
where . Then , and for and all embeddings of into , we have that
[TABLE]
where . Hence, by Corollary 5.5, there are only finitely many polynomials satisfying these inequalities, and we can determine them all. Once we determine all the possible , starting with and continuing through , we can check if any quintuple of possible polynomials works with any particular , and thus determine .
We now consider Condition (6). By checking all the values of for , we can determine the maximum value of the set. Finally, to determine , we can start running through all linear combinations with integer coefficents of the basis vectors until we hit .
∎
The final piece of proof comes from the lemma below, which is taken essentially verbatim from Zahidi’s paper.
Lemma 5.11**.**
* is equivalent to :*
- (1)
; 2. (2)
Pos; 3. (3)
.
Proof.
Suppose for some natural number . Then one can easily find natural numbers and rational integers such that the relation (1) is satisfied. (2) can be satisfied because .
Conversely suppose Conditions (1)-(3) are satisfied for some natural numbers and integers . In this case we have to prove that . From conditions (1) and (3) it follows that
[TABLE]
Thus, if , there is some such that
[TABLE]
Now by Condition (2), it is the case that has degree at most , while has degree (by Condition (1)), and hence, has degree at most . So for some integer with , we have . Now for at least one real embedding we have
[TABLE]
(since and the fact that given an algebraic integer in a totally real number field, , there is at least one real embedding such that ). At the same time, again by Condition (2) of the lemma and by Part (6) of the definition of the relation Par, for any real embedding we have, for all integers with :
[TABLE]
and
[TABLE]
and hence
[TABLE]
leading to a contradiction. ∎
The last lemma completes the proof of Proposition 5.3 and Theorem 5.2.
One reason for our emphasis on finite-fold Diophantine definitions is that they allow us to determine the difficulty of deciding whether a polynomial has infinitely many solutions in a given ring , an infinite version of Hilbert’s Tenth Problem:
[TABLE]
The following corollary is a good example of the connection between these topics: Theorem 5.2 actually proves that for the rings involved, has the greatest complexity possible.
Corollary 5.12**.**
Let be the ring of integers in a totally real number field . Assume has an effective indexing with domain for which is decidable. Then, for some fixed , the set of polynomials in variables over with infinitely many solutions there,
[TABLE]
is -complete, and thus computably isomorphic to , the complement of the Turing jump of the Halting Problem.
Proof.
The assumption that is decidable allows us to build an effective injective index, so assume that itself is injective. By Theorem 5.2, there is a polynomial over such that, for all , if fails to halt, then has no solution in ; whereas if does halt, then has at least one solution in , but only finitely many. It follows that, for each fixed , has infinitely many solutions in if is infinite, but only finitely many if is finite. It is well known that the set Inf of indices for which has infinite domain is a -complete set ([18], Theorem IV.3.2), computably isomorphic to , and we have just described a -reduction from Inf to , by . On the other hand, itself is , hence -reducible to Inf, so by Myhill’s Theorem (see [18, I.5.4]), the two are computably isomorphic. ∎
The computability-theoretic notation used here is standard; e.g. see [18]. Computable isomorphism is the strongest equivalence in general use in computability, so the corollary gives a very precise measurement of the complexity of . The value of is simply one greater than the least number of variables required for a polynomial giving a finite-fold Diophantine definition of the Halting Problem in . Notice that we not only have proven the -completeness of , the general question of whether a polynomial has infinitely many solutions in , but in fact have established -completeness for its restriction to polynomials with at most variables.
6. Defining Valuation Rings over Function Fields of Characteristic 0
In this section we give an existential definition of valuation rings for function fields of characteristic 0 over some classes of fields of constants including all number fields. More specifically, we will assume the constant field to be a field algebraic over with an embedding into a finite extension of for some odd rational prime or into (making formally real). Note that number fields satisfy these assumptions on .
The method we use below is extendible to a much larger class of fields of characteristic 0 and to higher transcendence degree fields of positive characteristic. We intend to describe these extensions in future papers.
We now state the two main theorems of the section.
Theorem 6.1**.**
Let be a field algebraic over , and such that has an embedding into a field , a finite extension of for some odd prime . Let be a function field over , and let be a prime of . Then the set is Diophantine over .
Theorem 6.2**.**
Let be a field algebraic over , and such that has an embedding into . Let be a function field over , and let be a prime of such that its residue field is embeddable into . (For example, can be a prime of odd degree.) Then the set is Diophantine over .
In this section we
We will need a sequence of lemmas and propositions below before completing the proof. The first lemma describes a general property of Diophantine definitions.
Lemma 6.3**.**
Let be a finite field extension. Let and assume is Diophantine over . Then is Diophantine over .
Proof.
The proof follows from Lemma 2.1.17 of [14] and the fact that . (See Definition 2.1.5 of [14]). ∎
Lemma 6.4**.**
Let be a finite extension of , let be a prime of above a prime of , and let be the set of all elements of with non-negative order at . Assume further that is Diophantine over . Then is Diophantine over and consists of all elements of with non-negative order at .
Proof.
Let . Then , where . Therefore, if and only if . ∎
Remark 6.5*.*
If has an embedding into a finite extension of , the same is true of any finite extension of .
In view of Lemma 6.4 and Remark 6.5, we can assume that if has an embedding into a finite extension of , has no real embeddings. (For example, we can adjoin to the original field.)
Proposition 6.6**.**
Let be any field of characteristic 0 such that the following form:
[TABLE]
is anisotropic over for some values . If is a function field over , is a prime (or a valuation) of of degree 1 and is such that is odd, then
[TABLE]
has no solution in .
Proof.
Assume the opposite and observe that due to the fact that function field valuations are non-archimedean and is odd,
[TABLE]
Next let be such that and divide every variable in (6.2) by
[TABLE]
Observe that has a zero at , while at least one of is equal to 1. Thus considering (6.3) mod , taking into account that is a degree one prime, we conclude that the form (6.1) is isotropic over in contradiction of our assumption. ∎
Notation 6.7*.*
Since is embeddable into a finite extension of , we will sometimes identify with a subfield of . Let lie above in . We identify with the ideal of containing all elements of positive order at . Let be the set of elements of non-negative order at . Let be the residue field of . Since is complete under the valuation generated by , we must have . Thus, we can assume, without loss of generality, that . Let be a number field. Then is a valuation ring of some prime of .
Lemma 6.8**.**
There exist a number field containing algebraic integers such that is not a square in , and is odd.
Proof.
First of all, we claim that there exists a number field such that the residue field . Indeed, since we have that is a finite field, and for any we have that is a finite extension. Let generate over . Since , there exists such that the residue class of is . If , since , we have that there exists with . Hence the residue class of is also . Therefore, in , the residue field of is isomorphic to .
Now let and be such that , and is not a square modulo . Such an element exists in , because not all residue classes of a finite field are squares of other residue classes. Then the number field contains an element such that . Further, any residue class of the prime contains algebraic integers. Therefore, we can assume . The existence of such that is odd can be proved in a similar fashion.
∎
Lemma 6.9**.**
If is not a square in , then the form (6.1) is isotropic over if and only if there exists such that .
Proof.
Suppose we have a non-trivial representation of 0 by the form
[TABLE]
Then without loss of generality, we can assume that and are not simultaneously 0. Otherwise, we are looking at the equation
[TABLE]
while is not a square in . The only solution to (6.5) is . So we get a trivial representation of 0.
Assuming that and are not simultaneously 0, we note that , and we can rewrite (6.1) as
[TABLE]
or
[TABLE]
Conversely, suppose (6.6) is true. Then , where either , or . Thus we have that . Let , and we have a non-trivial representation of 0 by the form (6.4) over .
∎
Lemma 6.10**.**
Let be a number field. Let be such that , is not a square in and is odd. (Such a number field and elements exist by Lemma 6.8.) Then (6.1) is anisotropic over and .
Proof.
Suppose (6.4) is isotropic. Then by Lemma 6.9, we have that (6.6) is true. Since is not a square in , , is not a dyadic prime, we have that the extension is an unramified extension of degree 2 of -adically complete fields. Since is a complete field, there is only one prime above in . If is the prime of above , then the relative degree of over satisfies . Thus,
[TABLE]
But is odd. So (6.6) cannot hold, and the form (6.4) is anisotropic. ∎
Lemma 6.11**.**
Let be a number field. Let be any prime of . Let be units at . Assume further that . Then in the form (6.4) is isotropic.
Proof.
If is not dyadic, and is a unit at , then is unramified in the extensions and . If is a dyadic prime, then given our assumption that , we also have that is unramified in the extensions and . Further, since is a unit at also, it is a norm in the extension of , by local class field theory. Hence (6.6) can be solved in . ∎
Corollary 6.12**.**
Let be as above, but assume is a unit at while is even. Then in the form (6.2) is isotropic.
Proof.
Let be a local uniformizing parameter with respect to in . If is even, then we can replace in the quadratic form by , where and without changing the status of the form with respect to being isotropic or anisotropic. Observe that is a unit at , and the Lemma follows from Lemma 6.11. ∎
Lemma 6.13** (Essentially Eisenstein Irreducibility Criteria).**
Let be as above. Let , be such that , , for with . Let
[TABLE]
In this case is irreducible over and adjoining a root of produces a totally ramified extension of .
Proof.
Let be a root of in the algebraic closure of . Let be a prime above in . If , then, since , we have that
[TABLE]
Let , and note that
[TABLE]
Thus,
[TABLE]
Since , we conclude that , and the polynomial is irreducible.
Suppose now . Then for any we have
[TABLE]
Therefore,
[TABLE]
so that once again we have that , and is irreducible.
∎
We now establish existence of an element of with a particular pole divisor.
Lemma 6.14**.**
For any valuation of , for all sufficiently large , there exists such that is the only valuation where has a pole, and .
Proof.
One can use the same proof as in Lemma 3.5 of [16], except that one should replace by . ∎
For the convenience of the reader we state a proposition due to Y. Pourchet (see [12], Proposition 3) concerning representation of polynomials by quadratic forms over rational function fields.
Proposition 6.15**.**
Let be a field of characteristic . Let , where is transcendental over . Then there exist such that if and only if the following conditions are satisfied
- •
For every prime factor of over of odd multiplicity, we have that the form is isotropic in the residue field of modulo .
- •
The form represents the leading coefficient of over .
Proposition 6.16**.**
Let be a field such that has an embedding into a finite extension of for an odd rational prime . Let , let be the ring of algebraic integers of , and let be relatively prime. Let lie above a prime in , assume that is not a square at and is odd. Assume further that . (These assumptions can be realized since can be embedded into a finite extension of for an odd , and by the Strong Approximation Theorem.) Let be a prime of of degree 1, let be transcendental over , and let be a finite extension of , so that is relatively algebraically closed in . Assume further that , and has no other poles. Let .
- (1)
If and is odd, then for any , the equation
[TABLE]
has no solution in . 2. (2)
Let be a number field containing . If , and is even (or in other words is even), then there exist such that (6.7) has a solution in . 3. (3)
For each , there exists a finite set of primes of and a positive constant such that if and are such that for all , then
[TABLE]
has a solution .
Proof.
Suppose and is odd. In this case, for any we know that and it is odd. So, by Proposition 6.6 applied to we conclude that (6.7) has no solutions in .
If we consider the form over , then we note that any four dimensional form is universal locally at any non-archimedean prime , i.e. it represents every element of the field. Without loss of generality, by Lemma 6.3 we can assume that , and therefore have no real embeddings. By the Hasse-Minkowski local-global principle, we can conclude that the form is universal over . Thus, if , (and therefore ), the equation (6.7) can be satisfied.
Now assume that , and is even (or in other words is even). We now show that for some constants the quadratic form equation (6.7) has solutions in .
We start with examining the isotropic/anisotropic status of (6.4) over . If the form is isotropic in , then by Proposition 6.15, we are done, since the form can represent any constant in . Suppose the form is anisotropic over . Then, by the Hasse-Minkowski Theorem, for some prime of , the form is anisotropic over . Further, since for all but finitely many primes of we have that are units at , we have that the form (6.4) is isotropic over for all but finately many , by Lemma 6.11.
We now describe the set of conditions on and making sure that
- (1)
is irreducible over , and 2. (2)
if is a prime of corresponding to , then in the residue field of , the norm (6.4) becomes isotropic.
Let be a prime of such that is odd, and is not a square (in other words, is one of finitely many primes where the quadratic form (6.4) is anisotropic in ). Let be an element of order 1 at . (Such an element exists by the Weak Approximation Theorem.) Let and assume
[TABLE]
[TABLE]
where is a non-negative integer such that for any coefficient , and . Now set and let . (Observe that as required.) Let
[TABLE]
Then
[TABLE]
Thus,
[TABLE]
for , and .
Next let and observe that is irreducible by Lemma 6.13, and adjoining a root of to will ramify with even ramification degree. This will make the quadratic form in (6.2) isotropic at the factors above in by Corollary 6.12.
Let be the set of all primes of such that the form (6.4) is anisotropic over . Let be such that for all . Now let , where is a non-negative integer such that for all we have that for any coefficient . Let be such that for all . Such elements exist in by the Weak Approximation Theorem, once again. Now, by the argument above, we see that in the form (6.4) is isotropic locally at all primes of , and therefore the form is isotropic over , by the Hasse-Minkowski Theorem.
As discussed above, we can assume that has no real embeddings and therefore a four-dimensional quadratic form is universal over . So the leading coefficient of is represented by the form. We now apply Proposition 6.15 to reach the desired conclusion.
Now let , let . Then . Let and note that . Let be large enough so that
[TABLE]
Pick such that for all and observe that for all , we now have that . Then for all , we get that
[TABLE]
for , and . Now let be such that for all we have that
[TABLE]
Then by the same argument as for . Thus, . We now can apply Lemma 6.13 to the polynomial to conclude that all primes in ramify in the residue field of extension generated by ramification degree divisible by and the proceed in the same manner as we did for polynomial . ∎
We now consider the case of with a real embedding. First we prove the following lemma.
Lemma 6.17**.**
Let be a number field such that . Let be a dyadic prime of . Then , and therefore the extension is unramified at all primes of .
Proof.
Note that . So if we set , then , while . Thus, by Hensel’s Lemma, has a root in . Hence, in the extension the local degree at is 1, and therefore is not ramified in this extension.
Since dyadic primes are the only primes possibly ramified in the extension , we see that no prime of is ramified in the extension .
∎
Without loss of generality, by Lemma 6.3, we can assume that contains the square root of . (Adjoining the square root of will not change the existence of a real embedding.) Let , as above. Let be a number field containing a square root of 2. We now prove an analog of Proposition 6.16 for fields with a real embeddings.
Proposition 6.18**.**
Let be a field with a real embedding and containing a square root of 2. Let be transcendental over and let be a finite extension of so that is relatively algebraically closed in . Let be a prime of of degree 1, and assume , and has no other poles. Let .
- (1)
If and is odd, then for any , the equation
[TABLE]
has no solution in . 2. (2)
If for some number field containing , we have that and is even (or in other words is even), then there exist such that (6.9) has a solution. 3. (3)
If are as above, then there exists such that for all with for all archimidean absolute values of , then
[TABLE]
has solutions in .
Proof.
We first note that the quadratic form in 6.9 is anisotropic over , and therefore anisotropic over . Thus, if is odd, then the proposition holds by the same argument as in Proposition 6.16. The same is true if . (By the Weak Approximation Theorem, we can always pick so that the image of under any real embedding is positive.)
So, assume now that is even and is not a constant. It is enough to show that (6.9) can be satisfied in . We again start by examining anisotropic/isotropic status of the form in question over . As in Lemma 6.3, it is easy to see that the quadratic form in (6.9) is isotropic if and only if is a norm in the extension . By the Hasse-Minkowski Theorem, it is enough to have that is a norm in all completions of . Since, contains , by Lemma 6.17, we have that the extension is unramified for all primes of , and therefore is a norm by local class field theory at all primes of . Thus, the only completion, where is not a norm is the real one.
We choose so that the leading coefficient of is positive under all real embeddings. Such a exists by the Weak Approximation Theorem, once again. This step will also make sure that the leading coefficient of is representable by the form over . We also choose large enough so that has no roots in under all real embeddings. Let , and let be an irreducible factor of . Then has no roots in under any real embedding of , and therefore must be of even degree. Further if we adjoin a root of to , the extended field will have no real embeddings, and the left side of (6.9) will become isotropic. Thus we can apply Proposition 6.15 again to reach the desired conclusion.
If is sufficiently close to under all archimedean absolute values of , then the leading coefficient of is also positive under all real embeddings. Similarly, if is sufficiently close to under all archimedean valuations of , then has no real roots under all real embeddings of . ∎
We now address the issue of giving a Diophantine definition of a set of constants guaranteed to contain constants we used in Propositions 6.16 and 6.18.
Proposition 6.19**.**
The following statements are true.
- (1)
There exists a Diophantine over set of constants such that for any number field and any finite collection of primes of , the set is dense in under the product topology. 2. (2)
There exists a Diophantine over set of constants such that for any number field and all real embeddings of , the set is dense in under the product topology.
Proof.
For the -adic case the proof follows from Theorem 5.5 of [6]. For the Archimedean case, we use Lemma 3.6 and Section 3.6 of [13] together with Proposition 5.1 of [6]. ∎
Before completing the proof of Theorems 6.1 and 6.2, we need the following lemmas.
Lemma 6.20**.**
Let be a prime divisor of of degree greater than 1. Then there exists a finite constant field extension of such that in the divisor has at least one factor of degree 1.
Proof.
Let be the residue field of . Then is isomorphic to a finite extension of , and we can identify with this extension. Let be the monic irreducible polynomial of a generator of over . Let be a factor of in . Let be the residue field of . Since the power basis of is an integral basis with respect to , we can determine the factorization of in by considering the factorization of over (see [8], Chapter I, Section 8, Proposition 25). By assumption on we have that over it has at least one factor of degree 1. ∎
Lemma 6.21**.**
Let be such that for some prime of , it is the case that , and is either non-negative or even, Then, , and .
Proof.
First assume that . Then , contradicting our assumptions. Thus , and . Consequently, , and the conclusion of the lemma holds. ∎
We now complete the proof of Theorem 6.1.
6.1. Proof of Theorem 6.1
6.1.1. A special element
Let be algebraic over and embeddable into a finite extension of . Without loss of generality we can assume that does not embed into , by adjoining, if necessary, a square root of to . A finite extension of will continue to be embeddable into a finite extension of . Further, by Lemma 6.3, we can translate Diophantine definitions obtained for the extended field into Diophantine definitions over the original field.
Next let be a prime of . By Lemmas 6.3 and 6.20, using the same reasoning as above, we can assume that is of degree 1. Let . For all sufficiently large , by Lemma 6.14, we can find a that has a pole at of order , and no other poles. Note that is totally ramified over with the ramification degree . Hence, for any we have that , and if and only if .
6.1.2. Defining a subset of containing all polynomials in of even degree, and no element of with an odd degree pole at
Let . Then by Proposition 6.16 and Proposition 6.19, Part 1, we have that or equivalently if and only if there exists such that
[TABLE]
We remind the reader that is Diophantine over . At the same time, if satisfies (6.11), then either has no pole at or this pole is of even order.
6.1.3. Defining a subset of containing all rational functions in of even degree and no element of of odd order at
Please note that for any , we have that if and only if , where , and . Indeed, suppose , . If is even, then is even. Suppose . Then note that , where we can set to reach the desired conclusion. If either or is a constant, then let to reach the desired conclusion once again.
Therefore, if and only if there exists such that
[TABLE]
where , and . Indeed, by Proposition 6.6, we have that is either even or non-positive. By Lemma 6.21, we then conclude that and is even. Consequently, is even. Conversely, if is even, we can write as a ratio of two polynomials of positive even degrees. If is positive and even, then is also positive and even, and therefore we can satisfy (6.13) over by Proposition 6.16. Finally, Proposition 6.16 and Lemma 6.21 imply that for any , we have that (6.13) implies that have an even order pole at .
6.1.4. Defining a subset of containing all rational functions of integral at (or of non-positive degree) and no functions of with a pole at
Let be such that . We claim that in this case . Suppose not. Then , and
[TABLE]
At the same time, if , then , and
[TABLE]
Consider now the set of satisfying the following equations.
[TABLE]
By Proposition 6.6 and Lemma 6.21, we have that . Therefore,
[TABLE]
and thus . At the same time, if , and is even, then we can choose to be of even positive degree, and by Proposition 6.16, we can satisfy (6.15)–(6.17).
6.1.5. Defining the valuation ring of in
Let . We claim that can be defined as follows: if and only if there exist
[TABLE]
with such that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
First suppose that Equations (6.18)–(6.21) are satisfied. Then, since , and , by Proposition 6.2, for any degree 1 prime of , we have that is even. Therefore, is either bigger or equal to 0, or is even. In particular, we have that or . Now by Lemma 6.21, we conclude that (and ). Thus, is even, and we now have that .
Suppose now that . In this case,
[TABLE]
contradicting the fact that
[TABLE]
Therefore, if for some we have that Equations (6.18)–(6.21) can be satisfied over , then .
Conversely, suppose . Then is integral over the local subring of containing all functions without a pole at the valuation that is the pole of in . In other words, consists of all rational functions with , or, equivalently . Hence, will be a root of a polynomial in (6.18), such that . If , then is a rational function in of even degree. Consequently, we can write each , where are polynomials in of even degrees. Thus, is a polynomial in of even degree, and we can find constants in so that (6.20) can be satisfied over . This concludes the proof of Theorem 6.1.
We now proceed to prove Theorem 6.2.
6.2. Proof of Theorem 6.2
In almost every way the proof of Theorem 6.2 is the same as the proof of Theorem 6.1. So we confine ourselves to discussing only those parts where there are differences. We will consider every part of the proof of Theorem 6.1 and indicate what changes, if any, are required.
We start with examining Subsection 6.1.1. In this part of the proof we consider a prime and determine whether we can assume that is of degree 1. For Theorem 6.2, we consider only primes with residue fields embeddable into . If is not of degree 1, then its residue field is isomorphic to a finite extension of . By Lemma 6.20, in the extension of the prime will have a factor of degree 1. As in Subsection 6.1.1, we can extend our field of constants , but the extended field must still be embeddable into . This condition will be satisfied for , given our assumptions on . Thus, as in the proof of Theorem 6.1, we can assume that is of degree 1. We can again produce an element such that is the only pole of and .
From this point on, the proof of Theorem 6.2 is exactly the same as the proof of Theorem 6.1 with (6.11) replacing (6.9), and the set defined to satisfy the conditions of Proposition 6.18. The existence of such a set follows from Proposition 6.19(2).
7. Diophantine Definition of C.E. Sets over Rings of Integral Functions
In this section we extend results of J. Demeyer to show that c.e. sets are definable over any ring of integral functions, assuming the constant field is a number field. Since Demeyer showed that such a result holds over polynomial rings over number fields, and since rings of integral functions are finitely generated modules over polynomial rings, it is enough to show that we can give a Diophantine definition of polynomial rings over the rings of integral functions to achieve the desired result. Below we state the main theorem of the section.
Theorem 7.1**.**
Let be a function field over a field of constants that is a finite extension of , and let be a finite non-empty collection of its valuations. Then every c.e. subset of is Diophantine over .
7.1. Arbitrary powers of a ring element
In this section we again turn our attention to the rings of -integers of function fields, discussed in Sections 2 and 3, and consider the case where the field is not necessarily rational. We recall the notation and assumptions we used in these sections and add new ones.
Notation and Assumptions 7.2*.*
- •
Let , , be as in Proposition 3.4.
- •
Let . Since satisfies a monic polynomial of degree 2 over , every element of is of the form , where .
- •
Let be the set of primes of lying above primes of .
- •
Let be the prime below in . In other words corresponds to the infinite valuation of . Observe that is the only prime above in .
- •
Let .
- •
Let be the Galois closure of over .
- •
Let .
- •
Let generate over . Since , we have that .
- •
Let be all the factors of and in .
- •
For each positive integer let be a primitive -th root of unity.
- •
For each positive integer let be the monic irreducible polynomial of over . We refer to polynomials of this form as “cyclotomic” polynomials.
7.2. Outline of the proof
For the results below we need to construct a Diophantine definition of arbitrary powers of a non-constant element of the ring. It turns out that it is more convenient to construct this definition for an element of a quadratic extension of the ring . We will proceed as follows.
- (1)
Using Proposition 3.4 we show that the set
[TABLE]
is Diophantine over . 2. (2)
Next we use the set to show that the set
[TABLE]
is Diophantine over . This is the main technical result of the section. 3. (3)
At this point, using results of J. Denef, we deduce that for any c.e. set , the set of the form
[TABLE]
is Diophantine over . 4. (4)
Let . Now observe that the set of -tuples
[TABLE]
such that and is computable, and therefore c.e. Hence, the set
[TABLE]
is Diophantine over , and therefore over . We can replace by with , since . Further, using the fact that the conjugate of over is , and , we can rewrite
[TABLE]
[TABLE]
where are polynomials in with coefficients in depending on and only.
Then, multiplying out all the products, using the monic irreducible polynomial of over to replace all powers of greater than 1, and since the sum has to be in , at the end we will obtain that
[TABLE]
where are fixed polynomials with coefficients in in with coefficients depending on and only. Finally, since , we conclude that consists of all elements such that for some , we have that
[TABLE]
[TABLE]
and range over a Diophantine subset of . Hence is Diophantine over . Now using the result of Denef one more time, we can assert that all c.e. subsets of are Diophantine.
To simplify the proof, we will have -variables range not over but over a subring of , where only one valuation is allowed as a pole of non-constant elements of the ring. The following lemma shows that this restriction is a Diophantine condition relative to .
Lemma 7.3**.**
The set has a Diophantine definition over .
Proof.
Observe that once we fix an element , the field is fixed. The constant field of is a number field. Therefore, by Theorem 6.1, for each we have that the valuation ring of has a Diophantine definition over . Hence, has a Diophantine definition over . Thus, is existentially definable over . Consequently, there exists a polynomial with coefficients in such that for any the equation has solutions if and only if . Using the fact that and are linearly independent over , and , we can replace by a polynomial such that for any pair the equation has solutions if and only if . ∎
7.3. Defining Polynomials over Using Root-of-Unity Polynomials
In this section review a set polynomials from [3] and show how to adapt these polynomials algebraic extensions of rational function fields. In his paper J. Demeyer defined a set of root-of-unity polynomials to be the set of polynomials satisfying one of the following three equivalent conditions:
- (1)
is a divisor of for some . 2. (2)
or is a product of distinct cyclotomic polynomials. 3. (3)
, is squarefree, and all the zeros of are roots of unity.
Observe that the constant polynomials satisfy the conditions above.
The following property of polynomials in will serve as a foundation for applying the "weak vertical method" later on in this section. The description of the method can be found in [14].
Proposition 7.4**.**
Let with , and let . In this case there exists a polynomial such that in .
Proof.
Proposition 2.7 of [3]. ∎
We will now prove a technical lemma to be used in determining the value of polynomials for some values of variables.
Lemma 7.5**.**
Let and assume that in with . Then , and .
Proof.
First, is contained in the integral closure of in . Therefore, all coefficients of the monic irreducible polynomial of over are polynomials in . Hence,
[TABLE]
Let be the integral closure of in (the Galois closure of over ). Next consider the congruence in . Let be all the conjugates of over . Since , we have that in . Thus,
[TABLE]
in . Further,
[TABLE]
Therefore, , and . Consequently, , where where is a root of unity. Since , we conclude that . ∎
In what follows we will need some well-known facts about roots of unity and function fields that the reader can find in the appendix.
Lemma 7.6**.**
Suppose , and let be defined as in Lemma 8.2. Let be such that . Let be such that . Suppose now that Equations (1)–(4) below hold with variables ranging over .
- (1)
* in ,* 2. (2)
. 3. (3)
. 4. (4)
* in .*
In this case , and . Conversely, if , then (1) – (4) can be satisfied in the remaining variables over .
Proof.
Let be the prime below in . By Corollary 8.4, the prime is the only prime above in , and the ramification degree of over is equal to . Therefore, by Proposition 8.3, we have that
[TABLE]
where is the relative degree of over . Next observe that since has a pole at only, is integral with respect to , and therefore is a polynomial over in . Further, using the assumption that and by Proposition 8.3 again, we have that
[TABLE]
[TABLE]
Second, since in , we have that N_{K(T)/\mathbb{Q}(T)}(\alpha)\big{|}(T^{\ell}-1)^{d} in . The polynomial does not have any multiple roots in , the algebraic closure of . Thus, the roots of in are of multiplicity at most and are -th roots of unity.
Let . Then
[TABLE]
where and . By Lemma 7.5 and Assumption (2), we have that . By Lemma 8.1 we also have that . Thus, we conclude that . We now note that by the assumption on .
From Assumption (4) and Lemma 7.5, we have that . Consequently, for all , we have that . Thus, and d\Big{|}a_{n_{i}}. But . Hence, and
[TABLE]
Consequently,
[TABLE]
implying that
[TABLE]
is a unit of . But the only units of this ring are elements of the constant field . Hence for some . But by Assumption 2, we have that , and thus , implying as before that .
It is clear that satisfies (1) – (4). ∎
We now show that all conditions in Lemma 7.6 are Diophantine over , and therefore the set has a Diophantine description over .
Lemma 7.7**.**
* is Diophantine over .*
Proof.
We need to convert our assumptions on and Conditions (1) – (4) of Lemma 7.6 into a Diophantine definition of the set . First consider a recursive subset of satisfying the following condition.
[TABLE]
if and only if
- (1)
there exist such that , , 2. (2)
there exist , where for each we have that is a prime number, and . 3. (3)
, 4. (4)
For all , for all such that , it is the case that implies . 5. (5)
, 6. (6)
For all , we have that .
By the MDRP theorem is Diophantine over and therefore over . Further, as we noted above, the set where , is Diophantine over by Corollary 3.13. Thus Condition (1) is Diophantine. Next we note that , and we can replace Condition (2) with
[TABLE]
Further, Condition (3) can be replaced with
[TABLE]
The order conditions are Diophantine over as explained in Section 6. We replace Condition (4) with the following Diophantine condition: . ∎
We will now use Proposition 7.4 to give an existential definition of all polynomials in over . We use what elsewhere we called the “Weak Vertical Method” (see [14]).
Lemma 7.8**.**
Let , and let . Then there exist dependent on only, such that and for all we have that
[TABLE]
Proof.
We proceed via a “Linear Algebra” proof of the sort described in Chapter 9 of [14]. Let , as above, be the Galois closure of over . Let be the set of all distinct factors of in . Since is the only factor of the infinite prime of in , we have that also contains all factors of in .
Claim: For any and any , it is the case that
[TABLE]
Proof of the claim: Since are conjugates over and , the Galois group acts transitively on the set , and all elements of permute . So, fix and . For some , we have that . Let be such that . Then . Similarly, for all .
Let be such that the set contains all distinct conjugates of over .
Now consider the following system of linear equations.
[TABLE]
where
[TABLE]
[TABLE]
(Here “” denotes transpose.) Since for all , we have that as a Vandermonde determinant. Using Kramer’s Rule, we can solve for in terms of with . We obtain that
[TABLE]
where is the matrix obtained from by replacing its -th column by the column .
Since , all entries of and have poles at all factors of in , and no other poles. (This is so because and have the same factorization in . ) Therefore, if we set , then . Thus, we have that . Let be the -th minor of . Then and these orders depend on only. Let .
We now make the following observation we will use in our calculations below. Let . Assume , and for all we have that . Let be such that . Then , and . Since , it follows that .
Using co-factors along the -th column, we see that . Further, using the observation above and the fact , we also conclude that
[TABLE]
Thus
[TABLE]
Thus,
[TABLE]
where depends on only. ∎
We now prove our main technical result of this section.
Proposition 7.9**.**
The set is Diophantine over .
Proof.
Let be such that . We start with the following claim.
Claim: Given , the following system of equations and conditions can be satisfied over if only if , and .
[TABLE]
[TABLE]
[TABLE]
Proof of the claim:
First we assume that the Equations (7.22)–(7.24) are satisfied. As in Lemma 7.8, we write , where . Further, by Lemma 7.8, we know that , and , Next, we observe that
[TABLE]
and
[TABLE]
by Equation 7.24. Further,
[TABLE]
where by Lemma 7.8. Since -coordinates of elements of with respect to the power basis of are unique, we conclude that for , , and . Thus,
[TABLE]
or . If Inequality (7.25) holds, then by Inequality (7.23) we have that
[TABLE]
so that . The last inequality contradicts our assumptions on . Consequently, we have to conclude that for , and .
We now return to Inequality (7.23) and use the fact that we now know that . We can therefore rephrase this inequality as saying
[TABLE]
Thus from Equation (7.24) we conclude that all coefficients of are the same as the first coefficients of . However, , and . Hence the same must be true of .
We now assume that and . Let . Then , and Inequality (7.23) will be satisfied. By Proposition 7.4, we can find to satisfy Equation (7.24). This completes the proof of the Claim.
A few quick observations now complete the proof of the proposition. First, we note that if a polynomial , then there exists such that has its constant term equal to 1. Second, we remind the reader that we have a Diophantine definition of elements of from Lemma 3.6. We also have a definition of non-constant elements of . The non-constant elements must have a negative order at . Third, we remind the reader that by Lemma 7.3, the set is Diophantine over . Finally, we remind the reader that the set is Diophantine over by Lemma 7.7. ∎
From this point on, to complete the proof of Theorem 7.1, we proceed as in the proof outline starting with Part 3.
8. Appendix
This section contains some facts about roots of unity, function fields and real roots of polynomial equations collected here for the convenience of the reader.
8.1. Roots of Unity
Below, for , the polynomial denotes the monic irreducible polynomial of a primitive -th root of unity .
Lemma 8.1**.**
For every positive integer , it is the case that .
Proof.
Observe that \Phi_{t}(X)\Big{|}(1+X+\ldots+X^{t-1}) in , and therefore for some we have that . Hence, , where . So, . ∎
Lemma 8.2**.**
Let . Let where are pairwise relatively prime positive integers. Then there exists a set of distinct prime numbers satisfying the following conditions:
- (1)
For all we have that . 2. (2)
For any such that and , it is the case that in the ring of algebraic integers of .
Further, there exists such that , and for all we have that .
Proof.
First of all, we note that the arithmetic sequence contains infinitely many primes by the Dirichlet Density Theorem. Therefore, we can pick so that none of these prime divides for all dividing .
Since , for all , by Hensel’s Lemma, we have that a primitive root of unity - the field of -adic numbers, for all positive integers dividing . In other words, splits completely in . Thus, there is an embedding of into that maps the ideal generated by a factor of in the ring of integers of into the ideal generated by in the ring of integers of . If for some positive integers dividing , then by assumption is not contained in any ideal generated by a factor of in the ring of integers of . Thus, in , we have that .
For each we pick such that . Observe that this choice of implies that
[TABLE]
At the same time, if and is a positive integer dividing , then by assumption on we have that
[TABLE]
By the Weak Approximation Theorem, we can find such that
[TABLE]
Then . Finally, if divides , then we have
[TABLE]
∎
8.2. Function Fields in One Variable
Proposition 8.3**.**
Let be a finite extension of function fields. Let be a prime (valuation) of , and let be primes of lying above (or valuations of extending ). Let be the ramification index of over and let be the relative degree of over . Then the following statements are true.
- (1)
. (See Chapter 4, §1, Theorem 1 of **[1]**.) 2. (2)
If , then . (See Chapter 4, §5, Corollary 2 (of Theorem 6) of **[1]**).
Corollary 8.4**.**
Let be a function field extension, where is a rational function field in over a constant field . Suppose in we have that has a pole at one prime only. Let be the infinite valuation of . Then is the only prime of lying above , and .
Proof.
Suppose is another prime of lying above . Then in , contradicting assumptions on . Further, .
∎
Proposition 8.5**.**
8.3. Real Roots
Proposition 8.6**.**
Let be a polynomial of degree irreducible over such that all of its roots are real. Let be all the roots of in . Let . Then there is an algorithm to determine wether has any real roots for any .
Proof.
We can write , where . Since , where , we can now rewrite
[TABLE]
Fix and consider the following system
[TABLE]
We claim that System 8.26 has a solution if and only if has a root in . Indeed, suppose the system has solutions in . Then , and has a real root. Conversely, suppose has a real root . Then we can set , and to obtain a solution for the system.
By a result of A. Tarski ([19]) there is an algorithm to decide whether System (8.26) has real solutions. ∎
Corollary 8.7**.**
Let be as in Proposition 8.6. Let . Assume further that is even and the leading coefficient is positive. Then there is an algorithm to determine whether there exists such that .
Proof.
Since , if there exists such that , then has real roots. Conversely, if has real roots, then for some we have that . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Chevalley, C., Introduction to the theory of algebraic functions of one variable , Mathematical Surveys, AMS, Providence, RI, 1951, vol. 6,
- 2[2] Davis, M., On the number of solutions of Diophantine equations, Proc. Amer. Math. Soc. 35, 1972, 562-564
- 3[3] Demeyer, J., “Diophantine sets of polynomials over number fields”, Proc. Amer. Math. Soc. 138 (2010), no. 8, 2715-2728.
- 4[4] Denef, J., “The diophantine problem for polynomial rings of positive characteristic”, 1979, Logic colloquium 78, Boffa, M., van Dalen, D., Mac Aloon, K. editors, North Holland, 131 –145.
- 5[5] Denef, J., Diophantine sets over 𝐙 [ T ] 𝐙 delimited-[] 𝑇 {\bf Z}[T] , Proc. Amer. Math. Soc., 69(1), 1978, 148-150
- 6[6] Eisenträger, K., “Hilbert’s Tenth Problem for function fields of varieties over number fields and p-adic fields”, 2007, Journal of Algebra, 2007, volume 310, 775–792.
- 7[7] Kim, H., Roush, F. W., “Diophantine unsolvability over p 𝑝 p -adic function fields”, 1995, Journal of Algebra, 176, 83–110.
- 8[8] Lang, S., Algebraic number theory , Addison Wesley, Reading, MA, 1970.
