Uniform Yomdin-Gromov parametrizations and points of bounded height in valued fields
Raf Cluckers, Arthur Forey, Fran\c{c}ois Loeser

TL;DR
This paper establishes uniform parametrization results in non-Archimedean geometry, enabling bounds on algebraic points of bounded degree over finite fields and extending the Pila-Wilkie theorem to a uniform setting.
Contribution
It introduces a uniform non-Archimedean Yomdin-Gromov parametrization framework applicable across varying finite fields and degrees, generalizing prior fixed-field results.
Findings
Bound on the number of algebraic points of bounded degree in finite fields
A uniform non-Archimedean Pila-Wilkie theorem established
Extension of previous work to a more general, uniform setting
Abstract
We prove a uniform version of non-Archimedean Yomdin-Gromov parametrizations in a definable context with algebraic Skolem functions in the residue field. The parametrization result allows us to bound the number of F_q[t]-points of bounded degrees of algebraic varieties, uniformly in the cardinality q of the finite field F_q and the degree, generalizing work by Sedunova for fixed q. We also deduce a uniform non-Archimedean Pila-Wilkie theorem, generalizing work by Cluckers-Comte-Loeser.
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.
\urladdr
http://rcluckers.perso.math.cnrs.fr/
\urladdr
https://people.math.ethz.ch/$\sim$aforey/
\urladdr
https://webusers.imj-prg.fr/$\sim$francois.loeser/
Uniform Yomdin-Gromov parametrizations and points of bounded height in valued fields
Raf Cluckers
Université de Lille, Laboratoire Painlevé, CNRS - UMR 8524, Cité Scientifique, 59655 Villeneuve d’Ascq Cedex, France, and, KU Leuven, Department of Mathematics, Celestijnenlaan 200B, B-3001 Leuven, Belgium
Arthur Forey
ETH Zürich, D-Math, Rämistrasse 101, 8092 Zürich, Switzerland
François Loeser
Institut universitaire de France, Sorbonne Université, UMR 7586 CNRS, Institut Mathématique de Jussieu, F-75005 Paris, France
Abstract
We prove a uniform version of non-Archimedean Yomdin-Gromov parametrizations in a definable context with algebraic Skolem functions in the residue field. The parametrization result allows us to bound the number of -points of bounded degrees of algebraic varieties, uniformly in the cardinality of the finite field and the degree, generalizing work by Sedunova for fixed . We also deduce a uniform non-Archimedean Pila-Wilkie theorem, generalizing work by Cluckers-Comte-Loeser.
1 Introduction
Since the pioneering work [5], the determinant method of Bombieri and Pila has been used in various contexts to count integer and rational points of bounded height in algebraic or analytic varieties. Parametrization results, as initiated by Yomdin and Gromov, play a prominent role in some of the most fruitful applications of this method, such as the Pila and Wilkie counting theorem for definable sets in -minimal structures [22]. In the non-Archimedean setting, Cluckers, Comte and Loeser prove in [10] an analogue of the Pila-Wilkie counting theorem, but for subanalytic sets in , the field of -adic numbers. Their proof relies also on a Yomdin-Gromov type parametrization result. The aim of this paper is to extend their result to obtain bounds uniform in for some counting points of bounded height problems, over and over . Before discussing our parametrization result, we shall start by presenting the applications to point counting.
1.1 Point counting in function fields
For a prime power, consider the finite field with elements and for each positive integer , let be the set of polynomials with coefficients in and degree (strictly) less than . Cilleruelo and Shparlinski [8] have raised the question to bound the number of -points in plane curves. That question was settled by Sedunova [26]. A particular case of our main theorem is a uniform version of her results. We refer to Theorem 4.1.1 for a more general statement, namely for of arbitrary dimension. For an affine variety defined over a subring of , write for the subset of consisting of points whose coordinates lie in .
Theorem A**.**
Fix an integer . Then there exist real numbers and such that for each prime , each , each integer and each irreducible plane curve of degree one has
[TABLE]
A similar statement is proved by Sedunova [26], for fixed . More precisely, she proves that fixing , and , there exist a constant such that for each irreducible plane curve of degree and positive integer ,
[TABLE]
Observe that our result improves Sedunova’s one by replacing the factor by a polylogarithmic term. By the very nature of our methods, which are model-theoretic, we are however unable to establish such a result for a power of a small prime .
1.2 A uniform non-Archimedean point counting theorem
We state a uniform version of the Cluckers-Comte-Loeser non-Archimedean point counting theorem. A semi-algebraic set is a set defined by a first order formula in the language and parameters in , where is a relation interpreted by if and only if , with the valuation. As usual, we will identify definable sets with the formulas that define them. Subanalytic sets are definable sets in the language obtained by adding a new symbol for each analytic function with coefficients in to the language . For each local field of characteristic zero, we fix a choice of uniformizer and view it as a -ring by sending to . Hence, we can consider the -points of a semi-algebraic or subanalytic set, for a local field of any characteristic. The notion of semi-algebraic and subanalytic sets considered in Section 5 is slightly more general than the one considered here, see also Setting 3.1.1.
The dimension of a subanalytic set is the largest such that there exists a coordinate projection to a linear space of dimension such that contains an open ball. A subanalytic set is said to be of pure dimension if for each and every ball centered at , is of dimension . If , we denote by the union of all semi-algebraic curves of pure dimension 1 contained in . Observe that in general, is not semi-algebraic (nor subanalytic).
If and , with a field of characteristic zero, we denote by the set of that can be written as , with , (where is the Archimedean absolute value). If , where , we denote by the set of that can be written as , with of degree less or equal than .
The following result is a particular case of Theorem 5.2.2. It provides a uniform version of Theorem 4.2.4 of [10].
Theorem B**.**
Let be a subanalytic set of dimension in variables, with . Fix . Then there exists a , and a semi-algebraic set such that for each and each local field , with residue field of characteristic and cardinal , the following holds. We have and if is of characteristic zero,
[TABLE]
If is of positive characteristic, then
[TABLE]
An important step toward the proof of Theorem B is Proposition 5.1.4, which states that integer points of height at most and lying in a subanalytic set are contained in an algebraic hypersurface of a degree which depends polylogarithmically in .
1.3 Uniform Yomdin-Gromov parametrizations
The proofs of Theorems A and B rely on the following parametrization result.
Fix a positive integer . Let be a local field, or more generally a valued field endowed with its ultrametric absolute value . A function is said to satisfy -approximation if for each there is a polynomial of degree less than and coefficients in such that for each ,
[TABLE]
A -parametrization of a set is a finite partition of into pieces and for each , a subset and a surjective function that satisfies -approximation.
The following statement is a particular case of Theorem 3.1.4.
Theorem C**.**
Let be a subanalytic set included in some cartesian power of the valuation ring, and of dimension . Then there exist integers and such that if is a local field of residue characteristic , then for each integer , there is a partition of into pieces such that for each piece , there is a surjective function satisfying -approximation on .
Observe that in the preceding theorem, we do not claim that the and are subanalytic, and indeed they are not in general.
Theorem C is used to deduce Theorems A and B, using an analog of the Bombieri-Pila determinant method. To be more precise, we follow closely the approach by Marmon [18] in order to prove Theorem A.
Note also that from Theorem 3.1.3 of [10], we can deduce by compactness a result similar to Theorem C but for fixed and with the number of pieces depending polynomialy in the cardinal of the residue field. Such a result is however too weak to obtain a non-trivial bound in Theorem A.
The way we make Theorem C independent of the residue field is by adding algebraic Skolem functions in the residue field to the language. This enables us to work in a theory where the model-theoretic algebraic closure is equal to the definable closure. The functions involved in the parametrization are definable in such an extension of the language. Theorem C is then deduced from a -parametrization theorem 3.4.2, where the functions are required to satisfy an extra technical condition call condition , see Definition 3.2.1. Such a condition implies that the function (when interpreted in any local field of large enough residue characteristic) is analytic on any box contained in its domain. This allows us to deduce the -parametrization result by precomposing with power functions.
A first step toward Theorem C is Theorem 2.3.1, which states that the domain of a definable (in the above sense) function that is locally 1-Lipschitz can be partitioned into finitely many definable pieces on which the function is globally 1-Lipschitz. It is similar to Theorem 2.1.7 of [10], but there the domain is partitioned into infinitely many pieces parametrized (definably) by the residue field. The improvement is made possible by the fact that we work in a theory with algebraic Skolem functions in the residue field.
Let us finally observe that the number of pieces of the -parametrization is , where is the dimension. In the Archimedean setting, a similar result has recently been proven by Cluckers, Pila and Wilkie [16], but there the number of pieces of the -parametrization is a polynomial in of non-explicit degree in general; in the case of , this degree in has meanwhile been made explicit in Theorem 2 of [4].
The paper is organized as follows. Section 2 is devoted to the fact that one can go from local to global Lipschitz continuity. In Section 3, we prove our main parametrization result. Sections 4 and 5 are devoted to applications, the first to the counting of points of bounded degree in , the second to the uniform non-Archimedean Pila-Wilkie theorem.
1.4 Acknowledgements
The authors would like to thank I. Halupczok for sharing inspiring ideas towards the piecewise Lipschitz continuity results of this paper. We thank also Z. Chatzidakis and M. Hils for useful discussions and comments. R.C. was partially supported by the European Research Council under the European Community’s Seventh Framework Programme (FP7/2007-2013) with ERC Grant Agreement nr. 615722 MOTMELSUM, by the Labex CEMPI (ANR-11-LABX-0007-01), and by KU Leuven IF C14/17/083. A.F. was partially supported by ANR-15-CE40-0008 (Défigéo) and by DFG-SNF lead agency program grant number 200020L_175755. F.L. was partially supported by ANR-15-CE40-0008 (Défigéo) and by the Institut Universitaire de France.
2 Global Lipschitz continuity
For any function between sets and for , write for the set and write or for the function which sends to . We use similar notation and or when is a Cartesian product and for some coordinate projection .
2.1 Tame theories
We consider tame structures in the sense of [10], Section 2.1. We recall their definition here.
Let be the first order language with the sorts , and , and symbols for addition and a constant 0 on , for , , and for the order and the multiplication, and constant 0 on , and a constant 0 on . Let be any expansion of . By -definable we mean -definable in the language , and likewise for other languages than . By contrast, we will use the word ‘definable’ more flexibly in this paper and it may involve parameters from a structure. Write , , and , with a slight abuse of notation. Note that may have more sorts than , since it is an arbitrary expansion.
We assume that all the -structures we consider are models of , the -theory stating that is an abelian group, that , with a (multiplicatively written) ordered abelian group, a surjective ultrametric absolute value (for groups), is surjective and .
Consider an -structure with for the universe of the sort , for , and for . We usually denote this structure by .
Remark 2.1.1*.*
Most often, will be a valued field, its residue field and its value group (hence the sort names , and ), although here we just require to be a (valued) abelian group.
We define an open (resp. closed) ball as a subset of the form (resp. , for some and .
We define as . For and , we introduce the notation
[TABLE]
Observe that if and , then is an open ball.
We put on the valuation topology, that is, the topology with the collection of open balls as base and the product topology on Cartesian powers of .
For a tuple , set .
Definition 2.1.2**.**
Let be a function. The function is called -Lipschitz continuous (globally on ) or, in a short form, -Lipschitz if for all and in ,
[TABLE]
The function is called locally -Lipschitz if, locally around each point of , the function is -Lipschitz continuous.
For , a function is called -Lipschitz if for all and in ,
[TABLE]
Definition 2.1.3** (s-continuity).**
Let be a function for some set . We say that is s-continuous if for each open ball the set is either a singleton or an open ball, and there exists such that
[TABLE]
If a function on an open is -continuous in, say, the variable , by which we mean that is -continuous for each choice of then we write for the element witnessing the s-continuity of locally at , namely, is as in (2.1.1) for the function , where run over some ball containing and with .
Definition 2.1.4** (Tame configurations).**
Fix integers , , a set
[TABLE]
and some . We say that is in -config if there is such that equals the union over of sets
[TABLE]
for some . If moreover we speak of an open -config, and if we speak of a graph -config. If is non-empty and in -config, then and the sets with non-empty are uniquely determined by and .
We say that is in -tame config if there exist and -definable functions
[TABLE]
such that the range of contains no open ball, and, for each , the set
[TABLE]
is in -config.
For any -structure which is elementarily equivalent to and for any language which is obtained from by adding some elements of (of any sort) as constant symbols, call a test pair for .
Definition 2.1.5** (Tameness).**
We say that is weakly tame if the following conditions hold.
- (1)
Each -definable set with , is in -tame config. 2. (2)
For any -definable function there exist and an -definable function such that, for each , the restriction of to is s-continuous.
We say that is tame when each test pair for is weakly tame. Call an -theory tame if for each model of , the pair is tame.
Recall [10, Corollary 2.1.11], which states that a tame theory, restricted in the sorts , is -minimal, in the sense of [15]. In particular, one can make use of dimension theory for -minimal structures.
2.2 Skolem functions
Recall that an -structure has algebraic Skolem functions if for any every finite -definable set admits an -definable point. Observe that this condition is equivalent to the fact that the model theoretic algebraic closure is equal to the definable closure. More generally, for a multisorted language, we say that a structure has algebraic Skolem functions in the sort if for any and every finite -definable set there is an -definable point, with the universe for the sort in the structure .
We say that a theory has algebraic Skolem functions (in the sort ), if each model has. In any case, one can algebraically skolemize in the usual sense, that is, given a theory in a language , the algebraic skolemization of in the sort is the theory in an expansion of obtained by adding function symbols, such that has algebraic Skolem functions in the sort and such that is minimal with this property (where minimality is seen after identifying pairs with exactly the same models and definable sets), see also [19].
Lemma 2.2.1**.**
Let a countable language extending and a tame -theory. If has algebraic Skolem functions in the sort , then it also has algebraic Skolem functions in the sort . In any case, there is a countable extension of by function symbols on the sort and an -theory extending such that has algebraic Skolem functions in the sort and hence also in the sort . Moreover, every model of can be extended to an -structure that is a model of , and, is tame.
Proof.
Since is tame, every finite definable (with parameters) set in the sort is in definable bijection with a definable set in the sort. The first statement follows: If has algebraic Skolem functions in the sort , then also in the sort . In general, let us algebraically skolemize the theory in the sort . Denote by and the obtained language and theory. Clearly one may take to be countable. It remains to prove that is tame. One needs to check condition and of Definition 2.1.5. Assume that is a model of and let be some -definable set. Then there is an -definable set such that and for each , there is such that and . Indeed, an -formula for is made from one for by replacing each occurrence of a new function symbol by a formula for the definable set it lands in. The fact that is in -tame config then implies that is in -tame config. The reasoning for is similar. ∎
Remark 2.2.2*.*
Let be an extension of such that any local field can be endowed with an -structure. Let be an -theory such that any ultraproduct of local fields which is of residue characteristic zero is a model of . Consider the algebraic Skolemization , in the sort from Lemma 2.2.1. Then one can endow every local field with an -structure such that moreover any ultraproduct of such structures that is of residue characteristic zero is a model of . Indeed, for each new function symbol in set the function output to be [math] if the corresponding set is empty, and to be any point in the the set if non-empty. Such a choice of -structure is often highly non-canonical and is not required to be compatible among field extensions.
Remark 2.2.3*.*
Usually the Skolemization process breaks most of the model-theoretic properties of the theory. However, since we apply it only to the residue field many results such as cell decomposition are preserved. Moreover, since we add only algebraic Skolem functions in the sort , the situation is somehow controlled, for example, if the theory of the residue field is simple in the sense of model theory, then adding algebraic Skolem functions in the residue field preserves simplicity, see [19].
It also worth to note that we will apply our results in the case where the residue field is pseudo-finite, and that such fields almost always have algebraic Skolem functions, see Beyarslan-Hruskovski [2]. See also the work by Beyarslan-Chatzidakis [1] for a more concrete characterization.
2.3 Lipschitz continuity
We can now state our first main result on Lipschitz continuity, going from local to piecewise global (with finitely many pieces).
Theorem 2.3.1**.**
Suppose that is tame with algebraic Skolem functions in the sort . Let be an -definable function which is locally -Lipschitz. Then there exists a finite definable partition of such that the restriction of on each of the parts is -Lipschitz.
As in [10], Theorem 2.3.1 is complemented by Theorem 2.3.2 about simultaneous partitions of domain and range into parts with -Lipschitz centers. They are proved by a joint induction on .
Theorem 2.3.2** (Lipschitz continuous centers in domain and range).**
Suppose that is tame with algebraic Skolem functions in the sort . Let be an -definable function which is locally -Lipschitz. Then, for a finite partition of into definable parts, the following holds for each part . There exist , a coordinate projection and -definable functions
[TABLE]
such that, and are 1-Lipschitz, and for each and in , the set is in -config and the image of under is in -config.
Before proving Theorems 2.3.1 and 2.3.2, we establish in Lemma 2.3.5 a weaker version of Theorem 2.3.2, where the centers are only required to be locally 1-Lipschitz. It will itself rely on [10, Theorem 2.1.8], which looks similar but there the centers depend on auxiliary parameters.
Lemma 2.3.3**.**
Suppose that is tame with algebraic Skolem functions in the sort . Let be a definable set, be the canonical projection, , and be a definable function such that for each , the restriction of to is locally 1-Lipschitz. Then there is a finite definable partition of such that the restriction of on each of the pieces is locally 1-Lipschitz.
The proof of Lemma 2.3.3 is a joint induction with the following lemma.
Lemma 2.3.4**.**
Suppose that is tame with algebraic Skolem functions in the sort . Let be a definable set of dimension . Then there is a finite definable partition of such that for each part , there is an injective projection and its inverse is locally 1-Lipschitz.
Proof of Lemma 2.3.4.
Assume Lemma 2.3.3 holds for integers up to . We will use dimension theory for -minimal structures. We get a finite definable partition of such that on each piece , there is a projection which is finite-to-one. For each , the fiber is finite. By the existence of algebraic Skolem functions in the sort and hence also in by Lemma 2.2.1, each of the points of is definable. By compactness, we can find a finite definable partition of such that is injective on each of the pieces.
By [10, Corollary 2.1.14], up to changing the coordinate projection we see that the inverse of is locally 1-Lipschitz when restricted to fibers of some definable function . By Lemma 2.3.3, we can find a finite partition of such that the inverse of is locally 1-Lipschitz on each of the parts. ∎
Proof of Lemma 2.3.3.
We work by induction on . If there is nothing to prove. Assume now and that Lemmas 2.3.3 and 2.3.4 hold for integers up to . Assume first that is of dimension . By dimension theory, there is at least one such that is of dimension . Define to be the union of the interior of for all such . The function is locally 1-Lipschitz on . It remains to deal with . By dimension theory, is of dimension less than . Assume for simplicity. By Lemma 2.3.4, up to considering a finite definable partition of we can assume that there is an injective coordinate projection with inverse locally 1-Lipschitz. Then is locally 1-Lipschitz if and only if is. Now with the function satisfies the hypothesis of Lemma 2.3.3. By induction hypothesis, we have the result. ∎
Lemma 2.3.5**.**
Suppose that is tame with algebraic Skolem functions in the sort . Let be an -definable function which is locally -Lipschitz. Then, for a finite partition of into definable parts, the following holds for each part . There exist , a coordinate projection and -definable functions
[TABLE]
such that the functions and are locally -Lipschitz, and, for each in , the set is in -config and the image of under is in -config.
The proof uses [10, Theorem 2.1.8], but only a weaker version is actually needed: we only need to require the centers to be locally 1-Lipschitz.
Proof.
Apply Theorem [10, Theorem 2.1.8] to . Work on one of the definable pieces of and use notations from the application of Theorem [10, Theorem 2.1.8], which is similar to 2.3.2 except that the input of and may additionally depend on some -variables. We now show that these additional -variables are not needed as input for and . We first show (after possibly taking a finite definable partition of ) that and are constant.
Fix some . Since the range of the -definable function does not contain an open ball, it must be finite. By tameness, there is a -definable bijection between the range of and a subset of , for some . By the existence of algebraic Skolem functions in the sort and hence also in by Lemma 2.2.1, each of the points of is -definable. Taking the preimage of those points by leads to a -definable finite partition of . After taking preimages by , it itself leads to a finite -definable partition of . By compactness, we find a finite partition of such that on each piece, the function is independent of and can be (abusively) written . The argument for is similar.
By Lemma 2.3.3, we can refine the partition such that the functions are locally 1-Lipschitz. ∎
Proof of Theorem 2.3.2.
We proceed by induction on . Theorem 2.3.2 for is exactly Lemma 2.3.5 for since the Lipschitz condition is empty in this case. Assume now that Theorems 2.3.1 and 2.3.2 hold for integers up to . Apply Lemma 2.3.5. On each of the definable pieces obtained, one has a coordinate projection and definable functions that are locally 1-Lipschitz. By Theorem 2.3.1 for , we have a finite definable partition of such that and are 1-Lipschitz on each of the pieces. This induces a finite definable partition of satisfying the required properties. ∎
Proof of Theorem 2.3.1.
We work by induction on , assuming that Theorem 2.3.2 holds for integers up to and Theorem 2.3.1 holds for integers up to . For there is nothing to show, hence we assume . Write for the coordinate projection sending to , and define as the image of under the function sending to .
Up to taking a finite definable partition of , switching the variables, by induction on the number of variables on which depends, by Lemma 2.3.4 and Theorem 2.3.2, tameness and compactness, we may assume that the following holds :
- •
X is open in ,
- •
there is a definable function , and definable functions ,
- •
for each and , is in open -config, is in -config,
- •
the restriction of to is s-continuous for each and ,
- •
the functions and are 1-Lipschitz,
- •
the function is 1-Lipschitz for each .
We show that under these assumptions, is 1-Lipschitz. Since is 1-Lipschitz, we can replace by (and translate accordingly) in order to assume .
Let and assume first that both and lie in an open ball . Then , indeed otherwise , which would contradict that is in open -config for every . It follows that is -continuous on . Since is locally 1-Lipschitz, the constant involved in the definition of s-continuity on satisfies .
Thus, using the ultrametric inequality and the assumption about , we have :
[TABLE]
which settles this case.
Suppose now that and do not lie in an open ball included in , and by symmetry neither in an open ball included in . This implies that
[TABLE]
By s-continuity and the fact that is locally 1-Lipschitz, the image of a small enough open ball in of radius is either a point or an open ball of radius less or equal to . This implies that
[TABLE]
Recall that . Combining (2.3.1) and (2.3.2), we have by the ultrametric inequality
[TABLE]
which end the proof. ∎
Remark 2.3.6*.*
Let us recall that [9] and [11], with related results on Lipschitz continuity on -adic fields, are amended in Remark 2.1.16 of [10]. When making it is important to keep possibly nonzero in the proof of [10, Theorem 2.1.7] and in the above proof of Theorem 2.3.1; this was forgotten in the proofs of the corresponding results [9, Theorems 2.3] and [11, Theorem 3.5], where should also have been kept.
3 Analytic parametrizations
The goal of this section is to prove a uniform version of non-Archimedean Yomdin-Gromov parametrizations.
3.1 -approximation
Setting 3.1.1**.**
We fix for the whole section one of the two following settings, of , or, , both of which we now introduce. Let be the ring of integers of a number field. Recall that the Denef-Pas language is a three sorted language, with one sort for the valued field with the ring language, one sort for the residue field with the ring language, one sort for the value group with the Presburger language with an extra symbol for , and function symbols for the valuation (sometimes denoted multiplicatively ) and for an angular component map (namely a multiplicative map sending [math] to [math] and sending a unit of the valuation ring to its reduction modulo the maximal ideal). Consider the theory of henselian discretely valued fields of residue field characteristic zero in the Denef-Pas language, with constants symbols from and with as a uniformizer of the valuation ring. This theory is tame by Theorem 6.3.7 of [12]. Applying Lemma 2.2.1, one obtains a new language and a new theory which we denote by and , which thus has algebraic Skolem functions in each of the sorts.
We can also work in an analytic setting, as follows. Consider the expansion of the Denef-Pas language by adding function symbols for elements of
[TABLE]
Any complete discretely valued field over (namely, with a unital ring homomorphism from into the valued field) can be endowed with a structure for this expansion, by interpreting the new function symbols as the corresponding power series evaluated on the unit box and put equal to zero outside the unit box. Let and the resulting language, resp. the theory of these models. (For a shorter and explicit axiomatization for the analytic case, see the axioms of Definition 4.3.6(i) of [12].)
For now on, we work in a language that is either or and in the theory that is correspondingly or .
Let us summarize our theory once more: is the -theory which is the algebraic skolemization in the residue field sort of the theory of complete discrete valued fields, residue field of characteristic zero, with constants symbols from (as a subring) and where has valuation , and (in the subanalytic case), with the restricted analytic function symbols as the corresponding power series evaluated on the unit box and put equal to zero outside the unit box.
In any case, the theory is tame by Theorem 6.3.7 of [12], and, it has algebraic Skolem functions in each sort by Lemma 2.2.1 and by Example 4.4(1) with the homothecy with factor on the valuation ring to make the system strict instead of separated. Note that there is no need to algebraically skolemize again when going from to the larger theory by the elimination of valued field quantifiers from Theorem 6.3.7 of [12]. Definable means definable without parameters in the theory .
Definition 3.1.2** (-approximation).**
Let be any valued field. Consider a set , a function and an integer . We say that satisfies -approximation if is open in , and, for each , there is an -tuple of polynomials with coefficients in and of degree less than that satisfies, for all ,
[TABLE]
We say that a family of functions is a -parametrization of if each is surjective and satisfies -approximation.
Observe that if satisfies -approximation, then the polynomials are uniquely determined.
Observe also that if is a complete valued field of characteristic zero, if is of class and satisfies -approximation, then is just the tuple of Taylor polynomials of at of order .
Notation 3.1.3**.**
Let be the ring of integers of a number field. We denote by the collection of all local fields of characteristic zero over , the collection of all local field of positive characteristic over , and set . (By a local field over we mean a non-archimedean locally compact field, hence, a finite field extension of or of for a prime , allowing a unital homomorphism .) If , we denote by its valuation (normalized such that ), its valuation ring, its maximal ideal, a fixed choice of uniformizer, its residue field, the cardinal of and the characteristic of . If , we define (resp. , resp. ) to be the set of (resp. , resp. ) such that . By Remark 2.2.2, we can consider as an -structure, and any non-principal ultraproduct of such local fields is a model of .
Call a family of definable sets a definable family, if the index set and the total set are both definable, namely, a family of definable sets indexed by is called a definable family if and the total set are definable sets. Likewise, a family of definable functions is called a definable family if the family of graphs is a definable family of definable sets. We use notations like for the definable set which in any model is the valuation ring , and similarly for the maximal ideal, and so on. For a definable set and a structure , we will write for the -points on , and, for a definable function we will write for the corresponding function .111When we interpret definable sets or functions into local fields (or, more generally, -structures that are not models of our theory ), we implicitly assume that we have chosen some formula that defines the set and consider . This set may of course change with a different choice of formula for small values of the residue field characteristic of , but this is not a problem by Remark 2.2.2, and since we are interested only in the case of large residue field characteristic.
The main goal of this section is to prove the following two theorems on the existence of -parameterizations with rather few maps, in terms of . Even the mere finiteness of the parameterizing maps is new, as compared to [10] where ‘residue many’ maps were allowed, but we even get an upper bound which is polynomial in . Recall from Setting 3.1.1 that we work in a theory with algebraic Skolem functions.
Theorem 3.1.4** (Uniform -approximation in local fields).**
Let , be integers and let be a definable family of definable subsets , for running over a definable set . Suppose that has dimension for each (and in each model of ). Then there exist integers and such that for each and for each integer , there are a finite set of cardinality and a definable family of definable functions
[TABLE]
with such that for each , the family forms a -parametrization of .
The following result is uniform in all models of . Note that requires in particular the residue field to have characteristic zero, and the value group to be elementarily equivalent to .
Theorem 3.1.5** (Uniform -approximation for models of ).**
Let , be integers and let be a definable family of definable subsets , for running over a definable set . Suppose that has dimension for each and each model of . Then there exists an integer such that for each model of and for each integer such that the -th powers in the residue field have a finite number of cosets, there are a finite set of cardinality and a -definable family of -definable functions
[TABLE]
with such that for each , the family forms a -parametrization of and where is a set of lifts of representatives for the -th powers in .
Remark 3.1.6*.*
Observe that even if Theorems 3.1.4 and 3.1.5 are very similar, one cannot deduce the first from the second by compactness. The reason is the quantification over in the statement. They will however both be deduced from the upcoming Theorem 3.4.2, which is a -parametrization theorem with an extra technical condition. It will allow us to define a -parametrization by precomposing by power functions. Furthermore, note that in Theorem 3.1.4, the factor for the index of th powers in the residue field is not needed; this is because of an additional trick using a property true in finite fields.
Remark 3.1.7*.*
For most of the section, we could in fact work in a slightly more general setting (up to imposing some additional requirements for Theorem 3.1.4). Using resplendent relative quantifier elimination as in [23], we can add arbitrary constants symbols and allow an arbitrary residual extension (and an arbitrary extension on the value group) of the language and the theory before applying the algebraic Skolemization in the residue field sort. In particular, 3.1.5 holds in this more general setting. If the extended language and theory still have the property that any local field can be equipped with a structure for the extended language such that moreover any ultraproduct of such equipped local fields which is of residue characteristic zero is a model of the extended theory, then also Theorem 3.1.4 would go through.
Remark 3.1.8*.*
The condition that the value group be a Presburger group can probably be relaxed to any value group in which the index of the subgroup of -multiples is finite, by replacing by for the cardinality of and taking instead of with a set of lifts of representatives for the -multiples in the value group.
Note that an adaptation of Theorem 3.1.5 and its proof to mixed characteristic henselian valued fields may be possible too, with the adequate adaptations. For example, when going from local to piecewise Lipschitz continuous, the Lipschitz constant should be allowed to grow. (Indeed, look at the function on the valuation ring of .)
Before starting the proofs of Theorems 3.1.4 and 3.1.5, we need a few more definitions.
Definition 3.1.9** (Cell with center).**
Consider an integer . For non-empty definable sets and , the set is called a cell over with center if it is of the form
[TABLE]
for some set and some definable functions and , where . If moreover is a subset of , where , then is called an open cell over (with center ).
Definition 3.1.10** (Cell around zero).**
We say that is a cell around zero if it is of the form
[TABLE]
for some definable sets and . Similarly one can call a set a cell around zero for for some valued field with an angular component map, if it is of the corresponding form.
Definition 3.1.11** (Associated cell around zero).**
Let be a cell over with center, with notation from Definition 3.1.9. The cell around zero associated to is by definition the cell obtained by forgetting the centers, namely
[TABLE]
with associated bijection sending to . For a definable map there is the natural corresponding function from to .
We now define the term language. This is an expansion of , by joining division and witnesses for henselian zeros and roots.
Definition 3.1.12**.**
Let be the expansion of obtained by joining to function symbols and for integers , where on a henselian valued field of equicharacteristic zero and residue field these functions are the functions
[TABLE]
sending to the unique satisfying , , and , whenever is a unit, , , and
[TABLE]
with the derivative of , and to [math] otherwise. Likewise, is the function sending to the unique with and if there is such , and to zero otherwise.
Proposition 3.1.13** (Term structure of definable functions).**
Every -valued definable function is piecewise given by a term. More precisely, given a definable set and a definable function , there exists a finite partition of into definable parts and for each part an -term such that
[TABLE]
for all .
Proof.
By Theorem 7.5 of [14] there exists a definable function for some and an -term such that
[TABLE]
Since the terms (the henselian witnesses) and (the root functions) involve at most a finite choice in the residue field, one can reduce to the case that has finite image. The fibers of can then be taken as part of the partition to end the proof. ∎
3.2 Condition
We now introduce a technical condition, named , that will be used in Section 3.3 to show a strong form of analyticity of definable functions, named global analyticity in Definition 3.3.1.
Definition 3.2.1** (Condition ).**
We first define condition for -terms, inductively on the complexity of terms. Consider a definable set and let run over .
We say that a -valued -term satisfies condition on if the following holds.
If is a term of complexity 0 (i.e. a constant or a variable), then it satisfies condition on .
Suppose now that the term is either , , , , for some , or of the from , with one of the analytic functions of the language. In the first two cases, we just require that and satisfy condition on . In the remaining four cases, we require that satisfy condition on and moreover that for any box , the functions and are constant on .
We finally say that an -definable function for satisfies condition on if there is a tuple of -terms satisfying condition on and such that for .
The following lemma ensures existence of functions satisfying condition .
Lemma 3.2.2**.**
Let be a definable function for some and . Then there is a finite partition of into some open cells over with center and a set such that is of dimension less than for each , such that the function
[TABLE]
satisfies condition on for each , with notation from Definition 3.1.11.
Proof.
We proceed by induction on . By Proposition 3.1.13 for we may suppose that is given by a tuple of -terms. Let be the following definable function created from : has a component function of the form for each -valued subterm of and also of the forms and for each -valued subterm of . The proposition requires us to find a finite partition of into cells over such that for each open cell over , the map has condition on , with notation from Definition 3.1.11. Now apply the cell decomposition theorem adapted to and work on one of the open pieces . Thus, is an open cell over with some center adapted to , namely, there are definable functions for such that is constant on each box contained in , which is moreover an open cell around zero, where
[TABLE]
with notation from Definition 3.1.11. Note that and in that notation. ∎
Definition 3.2.3** (Associated box).**
Let be a valued field. By a box we mean a product of open balls in . Let be a box, with open balls
[TABLE]
with and nonzero . The box associated to is the box defined by
[TABLE]
where is an algebraic closure of , endowed with the canonical extension of the valuation of .
3.3 Global analyticity
To easier speak of analyticity in this section, we will work with complete discretely valued fields (a meaning of analyticity exists for all models of by [12]).
Definition 3.3.1** (Globally analytic map).**
Let be a complete discretely valued field. Let be a set and a function. We say that is globally analytic on is for each box , the restriction of to is given by a tuple of power series with coefficients in , (say, taken around some ), which converges on the associated box .222Here, converging on means that the partial sums obtained by evaluating at any element of form a Cauchy sequence (the limits actually lie inside by [12]).
The following proposition is the reason why we introduced condition . Observe that it applies also to local fields, and thus not only to models of our theory .
Proposition 3.3.2** (Analyticity, [12, Lemma 6.3.15]).**
Let be a definable function satisfying condition on some definable set . Then there is some such that for either a model of which is a complete discretely valued field, or, a local field with residue field cardinality at least , the following holds. For any box and , there is a power series centered at and converging on such that is equal to on . Moreover, can be taken uniformly in definable families of definable functions.
Proof.
We recall the strategy of the proof of [12, Lemma 6.3.15]. One works by induction on the complexity of the -term corresponding to the definition of condition , using compositions of power series as in Remark 4.5.2 of [12]. The only nontrivial cases are , , , and for some restricted analytic function from the language. If is a model of , we may assume by the definition of condition , that the terms satisfy condition on and that and are constant on . In the local field case, by compactness there is some such that if the residue field of is of cardinality at least , the functions and are constant on any box contained in . One finishes exactly as in the proof of [12, Lemma 6.3.11], where for the case , with one of the analytic functions of the language, condition ensures that either the function is interpreted as the zero function on a box , or, the image of the box by is strictly contained in the unit box, hence so is the image of , ensuring convergence of on it, hence analyticity of on . ∎
3.4 Strong approximation
We can now state a stronger notion of -approximation, for definable functions. The strong -approximation will be key for the proofs of Theorems 3.1.4 and 3.1.5. Strong -approximation for is not needed in this paper, but we include its definition for the sake of completeness.
Definition 3.4.1** (Strong -approximation).**
Let be definable, let be a definable function and be an integer.
We say that satisfies strong -approximation if is an open cell around zero, satisfies condition on and, for each model of , the function satisfies -approximation and moreover for each box , the -term associated to satisfies -approximation on . 2. 2.
A family for of definable functions is called a (strong) -parametrization of if each is a (strong) -approximation and
[TABLE]
The fact that is an open cell around zero in Definition 3.4.1 is particularly handy since it enables an easy description of the maximal boxes contained in which combines well with Condition and for composing with power maps. Global analyticity in complete models as given in Section 3.3 together with a calculation on the coefficients of the occurring power series will then complete the proofs of the parmeterization Theorems 3.1.4 and 3.1.5.
Theorem 3.4.2** (Strong -parametrization).**
Let , be integers and let be a definable family of definable subsets for running over a definable set . Suppose that has dimension for each . Then there exist a finite set and a definable family of definable functions
[TABLE]
such that and for each , forms a strong -parametrization of .
Proof.
We work by induction on . We will repeatedly throw away pieces of lower dimension and treat them by induction. We will work uniformly in . We will also successively consider finite definable partitions of without renaming. By Lemma 2.3.4, up to taking a finite definable partition of , we can find a locally 1-Lipschitz surjective function , with open for each . By Theorem 2.3.1, we can further assume that is globally 1-Lipschitz on , or equivalently, that satisfies -approximation on . By Lemma 3.1.13 we may moreover suppose that the component functions of are given by -terms. We still need to improve and in order to have that the satisfy strong -approximation, in particular, condition (*), -approximation holds on associated boxes of boxes in its domain, and, that is an open cell around zero.
First we ensure, as an auxiliary step, that the first partial derivatives of the are bounded by 1 on the associated box of any box in its domain , by passing to an algebraic closure of with the natural and structures. This passage to preserves well properties of quantifier free formulas and of terms by results from both [12] and [13] for the involved analytic structures on and on . This step is done by switching again the order of coordinates as in the proof of Lemma 2.3.4 where necessary. Since it is completely similar to the corresponding part of the proof of [10, Theorem 3.1.3], we skip the details.
Finally we show that we can ensure all remaining properties, using induction. Apply Lemma 3.2.2, uniformly in , to obtain a partition of into open cells over with center and an associated bijection in the notation of Definition 3.1.11, while neglecting a definable subset of where is of dimension less than . By induction on , we may apply Theorem 3.4.2 (for the value ) to the graph of to find a strong -parametrization for this graph. One obtains the required parametrization of by composing the parametrization of the graph of with and . Indeed, firstly one concludes as in the proof of Lemma 3.2.2 that property is satisfied for this composition and that the domain is an open cell around zero. Secondly, the composition of 1-Lipschitz functions is 1-Lipschitz, and, the first order partial derivatives are bounded by on associated boxes of its domain. Finally, the condition of -approximation on each associated box follows from Proposition 3.3.2 and [10, Corollary 3.2.12], since the derivative is bounded by 1 on associated boxes of its domain. ∎
The whole purpose of requiring the domains of strong -parametrizations to be cells around zero is to deduce existence of -parametrizations from strong -parametrizations by precomposing with power functions. This is enabled by the next two lemmas.
Lemma 3.4.3**.**
Let be a definable function on satisfying strong -approximation. Then there is some such that for either a model of which is a complete discretely valued field, or, a local field with residue field cardinality at least , the following holds for any integer and with be the -power map, sending in to . For any ball open ball with , and for any ball satisfying , the function
[TABLE]
satisfies -approximation on . Moreover, can be developed around any point as a power series which is converging on and whose coefficients satisfy
[TABLE]
Proof.
Observe first that since the choice of is arbitrary, it suffices to show the lemma for with . Since satisfies condition , there is a converging power series as given by Proposition 3.3.2. Since satisfies -approximation on , we have
[TABLE]
for all . By the relation between the Gauss norm and the supremum norm on , we then have
[TABLE]
for all . Fix with . Since is given by a power series on , by composition we can develop as a power series around . Using multinomial development, we find that for ,
[TABLE]
Note that we could also get an explicit expression for using the chain rule for Hasse derivatives.
Combining with Equation (3.4.1) yields
[TABLE]
In particular, we have for and for any ,
[TABLE]
which concludes the proof.∎
We now formulate a multidimensional version of Lemma 3.4.3. To do so we introduce the following notations. For a tuple and , recall that is and . Also define to be
[TABLE]
The idea is also to precompose with the -th power to achieve the -property on boxes. A naive approach to estimate the coefficients of the composite function, using the maximum modulus principle on the associated box, would lead to a bound for the coefficient of . This however is not optimal and not enough for our needs. By working one variable at a time, we will improve it.
Lemma 3.4.4**.**
Let be a definable function on satisfying strong -approximation. Then there is some such that for either a model of which is a complete discretely valued field, or, a local field with residue field cardinality at least , the following holds for any integer .
Let be in and suppose that is a subset of . For any in , write for the function . Then for any box such that , the function
[TABLE]
satisfies -approximation on . Moreover, can be developed around any point as a power series converging on with coefficients satisfying
[TABLE]
Proof.
Up to rescaling, we can assume . As in the proof of Lemma 3.4.3, we can fix , such that and develop as a power series that converges on . Fix and consider the function
[TABLE]
It is given by a power series around that converges on .
By the -property for on , we have that for any ,
[TABLE]
Hence by the relation between the Gauss norm and the supremum norm on , for each we have
[TABLE]
Now view as a function of , and by using again the relation between Gauss norm and sup norm, we find that for each such that ,
[TABLE]
By switching the numbering of the coordinates, we get that for each ,
[TABLE]
The end of the proof is now similar to that of Lemma 3.4.3. Indeed, we develop into a power series around , denoted by . Then by multinomial development and using the bound for we find that for ,
[TABLE]
It is now a direct consequence of this bound that for with .
Now fix and with . Choose some such that and for . We have :
[TABLE]
Hence satisfies -approximation on . ∎
Proof of Theorem 3.1.4.
First apply Theorem 3.4.2 to . We get a finite set and a family of definable functions
[TABLE]
such that and for each , forms a strong -parametrization of .
By Proposition 3.3.2, we find such that for any , any , any box and any , there is a power series centered at , converging on and equal on to . Fix such an and write for .
Observe that it is enough to prove the theorem for prime to . Indeed, a -parametrization is also a -parametrization. Hence up to enlarging the constant, if is not prime to one can apply the theorem with to obtain a -parametrization.
We fix an integer prime to and we partition into sets such that is a bijection from each to , the set of -th powers in . We choose representatives for cosets of and we fix lifts of them, denoted by . For , we set for such that .
Now define for the function
[TABLE]
where is our constant symbol for a unifomizer of .
Let . By compactness and up to making larger if necessary, we have that is a cell around zero. By Hensel’s lemma, the union over of the sets is equal to . We claim that the family is the desired -parametrization of . To lighten notations, let us skip for the rest of the proof the subscript . By Lemma 3.4.4 and up to making larger if necessary, satisfies -approximation on each box contained in . We will show using -approximation for and ultrametric computations that satisfies -approximation on the whole .
Fix . If and are in the same box contained in , then we are done. Assume then that they are not.
Choose such that and , and in the case we moreover have , set . Such a exists by Hensel’s lemma and the fact that is a cell around zero. Define such that if and if . We have that and lie in the same box contained in . There are also as prescribed by such that , , .
We then have
[TABLE]
The first inequality is by ultrametric triangular inequality, the second is by global -property for and -property on boxes for . The third one is because for each , we have . Indeed, there are three cases to consider. Either we have and and then . Or we have . In that case, and . Then by ultrametric property we have and . The last case is when and . In that case, , , . We then have and by the choice made in the definition of , hence .
The fourth inequality holds because by definition of , either , either , either and . In those three cases, we have .
To conclude the proof, it remains to prove the last inequality
[TABLE]
Suppose . For , introduce the notation
[TABLE]
Then set
[TABLE]
and let be its complement. The condition can be rephrased in writing that if . In particular, for we have , hence .
Hence it remains to show that
[TABLE]
We claim that
[TABLE]
which implies the preceding inequality.
Since for each , , it is enough to prove that for each such that ,
[TABLE]
From the definition of , there is some such that and . Suppose to lighten the notations that . Set with for and .
Recall the bound for obtained from Lemma 3.4.4. We now compute, using this bound and the definition of :
[TABLE]
This finishes the proof of the theorem. ∎
Proof of Theorem 3.1.5.
The proof is similar to the one of Theorem 3.1.4 above, using Theorem 3.4.2 and then precomposition by power functions. One just needs to delete the application of compactness, and, instead of using the map which chooses and exploits the lifts of cosets of -th powers in the residue field, one uses parameters from to paste pieces together. (That a factor comes in is because in this general case the pasting is more rough by the lack of equality between the number of cosets of the -th powers in the residue field equals the number of solutions of in the residue field, in general.) The rest of the proof is completely similar. ∎
4 Points of bounded degree in
4.1 A counting theorem
The goal of this section is to prove the following theorem, of which Theorem A is a particular case. Recall from the introduction that, for a prime power and a positive integer, is the set of polynomials with coefficients in and degree (strictly) less than , and, for an affine variety defined over a subring of , denotes the subset of consisting of points whose coordinates lie in . Also, for a subset of , write for the subset of consisting of points whose coordinates lie in .
For an affine (reduced) variety with an integral domain contained in an algebraically closed field , we define the degree of as the degree of the closure of in . For example, if is a hypersurface given by one (reduced) equation , then the degree of equals the (total) degree of .
Theorem 4.1.1**.**
Let , and be positive integers. Then there exist real numbers and such that for each prime , each power with an integer, each integer and each irreducible variety of degree and dimension one has
[TABLE]
We first give a bound for a so-called naive degree. Define the naive degree of a variety with an integral domain as the minimum, taken over all tuples of (nonzero) polynomials over with , of the product of the degrees of the .
Lemma 4.1.2**.**
Let , , and be positive integers. Then there exist numbers and such that for each prime , each power with an integer, and each geometrically irreducible variety of degree and dimension , one has that the naive degree of is bounded by .
Proof.
From the theory of Chow forms, see [25] or [6], a variety of degree and dimension is determined set-theoretically by a hypersurface of degree in the Grasmanniann of of -dimensional vector subspaces of the -dimensional space. As explained for example in [6], one can construct from such a hypersurface a system of equations of degrees at most such that their zero set coincide set-theoretically with . Hence the naive degree of is bounded by . ∎
The following trivial bound for points of bounded height is typical.
Lemma 4.1.3**.**
Let , , and be positive integers. Then there exist real numbers and such that for each prime , each power with an integer, each integer and each irreducible variety of degree and dimension , one has
[TABLE]
Proof.
The lemma follows easily from Noether’s normalization lemma and Lemma 4.1.2. ∎
Let us first reduce the statement of Theorem 4.1.1 to the case of planar curves, similarly as in [20]. In this section, definable means definable in the language of Setting 3.1.1 and with .
Reduction of Theorem 4.1.1 to the case and ..
Fix positive integers . By Lemma 4.1.2, irreducible varieties in of dimension and of degree form a definable family of definable sets, say, with parameter in a definable (and Zariski-constructible) set ; write for the variety in corresponding to the parameter . Assume first that and . Consider the family of linear projections written in coordinates and and with parameters . Then, for each , there is a non-empty Zariski open subset of parameters such that first of all is surjective and secondly, the varieties and have the same degree (and are both irreducible of dimension ) for all . Clearly the opens form a definable family of definable sets with parameter .
Now suppose that the prime is large enough and that for some . Since the complement of is of dimension less than by Lemma 4.1.3, and since the form a definable family, we can find for each a point in (hence, so to say, a tuple of polynomials in over and of degree [math]). Hence, maps points in to points in . Furthermore, the fibers of on are finite, uniformly in , say, bounded by . We thus have that for each large enough , each in , and each , that
[TABLE]
Hence the result for and general follows from the case and .
Assume now that and . By a projection argument as above, we can assume that . Consider the family of hyperplanes with equation and parameters and . Then for each there is a non-empty Zariski open subset of such that if lies in , then is irreducible, of degree and dimension . Hence, similarly as above, for large enough primes and with , we can find, for each in a point in . Now consider the family of hyperplanes of equations with parameter running over . Since belongs to , and by construction, there are at most finitely many values for such that , say, . In any case we can assume that is of dimension at most for each , and hence that
[TABLE]
for some which is independent of and , by Lemma 4.1.3. To treat the remaining part, we apply the induction hypothesis to for outside , and we take the sum of the bounds over all values of in . ∎
4.2 Determinant lemma
We fix the following notations for the rest of the paper. For in , set . Set also
[TABLE]
[TABLE]
Lemma 4.2.1** ([10, Lemma 3.3.1]).**
Let be a discretely valued henselian field. Fix , and an open subset of contained in a box that is a product of closed balls of valuative radius . Fix , and functions .
Assume the following :
- •
the integer satisfies
[TABLE]
- •
the functions satisfy on .
Then
[TABLE]
where .
4.3 Hilbert functions
Fix a field . For a positive integer, denote the space of homogenous polynomials of degree . Let a homogenous ideal of , associated to an irreducible variety of dimension and degree of . Let and the (projective) Hilbert function of . The Hilbert polynomial of is a polynomial such that for big enough, . It is a polynomial of degree and leading coefficient .
Fix some monomial ordering in the sense of [17]. Denote by the ideal generated by leading terms of elements of . By [17], the Hilbert functions of and are equal. It follows that
[TABLE]
Define also for ,
[TABLE]
Hence, we have . The function is also equal to a polynomial function of degree at most , for large enough. It follows that there exist non-negative real numbers such that
[TABLE]
when goes to .
We will also use the following lemma of Salberger [24], which is the reason why we will use a projective embedding in the proof of Theorem 4.1.1.
Lemma 4.3.1** ([24]).**
Let be a closed equidimensional subscheme of dimension of . Assume that no irreducible component of is contained in the hyperplane at infinity defined by . Let be the monomial ordering defined by if or and for some , and for . Then
[TABLE]
4.4 Proof of Theorem 4.1.1 for and
Fix a positive integer . Clearly all irreducible curves in of degree form a definable family of definable sets, say, with parameter in a definable (and Zariski-constructible) set ; write for the curve in corresponding to the parameter .
Apply Theorem 3.1.4 to the definable family of the definable sets . It gives some constant and, for some , for all local fields in and all integers prime to , a -parametrization of with many pieces. Fix such a and a parameter corresponding to an irreducible curve of degree .
Consider the map
[TABLE]
and the corresponding embedding
[TABLE]
Denote by the homogenous ideal associated to the closure of .
Fix some positive integer , set
[TABLE]
and .
Now consider the given -parametrization of with and work on one of the pieces with function satisfying on .
Fix a closed ball of valuative radius . Fix some points in and consider the determinant
[TABLE]
Since the composition of functions satisfying also satisfies , we can apply Lemma 4.2.1, with , to get that
[TABLE]
On the other hand, since the points are of degree less than as polynomials in over , we also have
[TABLE]
where are defined by Equation (4.3.1). Hence, if is not zero, then
[TABLE]
It follows that whenever
[TABLE]
When such an inequality holds, the matrix is of rank less than . Fix a minor of maximal rank and some . Then the polynomial
[TABLE]
is of total degree at most and nonzero, since the coefficient of is . Moreover, it vanishes at all points in but does not vanish on the whole , since its exponents lie in and is irreducible. Hence by Bézout’s theorem, there are at most points in .
We now show how to choose and in terms of such that inequality (4.4.1) holds. Recall that . By properties of Hilbert polynomials and equation (4.3.2), we have
[TABLE]
and
[TABLE]
Combining those two equations, we get
[TABLE]
and
[TABLE]
and finally, by applying Lemma 4.3.1,
[TABLE]
Hence there is some and such that for every ,
[TABLE]
Recall that the coefficients of Hilbert polynomials can be bounded in terms of the degree of the curve and that the characteristic is assumed to be large. Hence and depend only on the degree of the curve .
If follows that for
[TABLE]
we have
[TABLE]
We can thus set to satisfy inequality (4.4.1). It follows from the preceding discussion that there are at most points in . From Equation (4.4.2), we have , for some constant , and from (4.4.3) that for some constant , with independent of . Since we need closed balls of valuative radius to cover , and that we have a -parametrization of involving pieces, we find that (after enlarging ) there are at most
[TABLE]
points in . ∎
Remark 4.4.1*.*
In their preprint [3], Bhargava et al. use Sedunova’s result [26] to bound the 2-torsion of class groups of function fields over finite fields, see their Theorem 7.1. One can use instead our Theorem 4.1.1 in the special case of Theorem A to obtain a uniform version of their result. We thank Peter Nelson for directing us to the reference [3].
5 Uniform non-Archimedean Pila-Wilkie counting theorem
In this section we provide uniform versions in the -adic fields for large and also in the fields of large characteristic of several of the main counting results of [10] (on rational points on -adic subanalytic sets). To achieve this we use the uniform parameterization result of Theorem 3.1.4. Furthermore, Proposition 5.1.4 is new in all senses, and is a (uniform) non-archimedean variant of recent results of [16], [4]; it should be put in contrast with Proposition 4.1.3 of [10].
5.1 Hypersurface coverings
We begin with fixing some terminology.
Consider the language as described in Setting 3.1.1. We will from now on only consider definable sets which are subsets of the Cartesian powers of the valued field sort (sometimes in a concrete -structure, and sometimes for the theory ).
Definition 5.1.1**.**
Let be an -structure. An -definable set is said to be of dimension at if for every small enough box containing , is of dimension . An -definable set is said to be of pure dimension if it is of dimension at all points in .
For an -definable set , define the algebraic part of to be the union of all quantifier free -definable sets of pure positive dimension and contained in . Note that the set is in general neither semi-algebraic nor subanalytic.
By subanalytic we mean from now on -definable, or -definable if we are in a fixed -structure, and we speak about definable families in the sense explained just below 3.1.3. Likewise, by semi-algebraic we mean definable set in the language , or -definable if we are in a fixed structure (see section 3.1.1). Write for .
Remark 5.1.2*.*
Observe that the definition of the algebraic part is insensitive to having or not having algebraic Skolem functions on the residue field. Indeed, its definition is local and allows parameters from the structure.
If , set , the absolute value of . If , set . If is a local field of characteristic zero, and , we set
[TABLE]
If , we set
[TABLE]
with the degree in of the polynomial over . For , put . We now set for and
[TABLE]
Recall the notations at the beginning of Section 4.1. For every integers , , , set and let be the smallest integer such that . Then set , .
The following result refines Lemma 4.1.2 of [10] and has a similar proof.
Lemma 5.1.3**.**
For every integers , , with , consider the integers , , as defined above. Fix a local field , a subanalytic subset and subanalytic functions that satisfy -approximation and . Then if is of characteristic zero, the set is contained into at most
[TABLE]
hypersurfaces of degree at most . If is of positive characteristic, the set is contained into at most
[TABLE]
hypersurfaces of degree at most . Moreover, when goes to infinity, goes to [math].
Proof.
Troughout the proof, we use the notations introduced at the beginning of Section 4.1. Under the hypothesis of the lemma, fix a closed box of valuative radius . Then fix points (or ) and consider such that . Consider the determinant . Since satisfies -approximation, it follows from Lemma 4.2.1 that .
In the positive characteristic case, since the are in , of degree less or equal than , if , then . Hence if , then .
In the characteristic zero case, since the are in of height at most , it follows that is of (Archimedean) absolute value at most . If , this implies that . Hence if , then .
We now assume that is chosen such that . As in the Bombieri-Pila case, by considering minors of maximal rank, we can produce a hypersurface of degree such that all the are contained in . See the proof of Theorem 4.1.1 for details.
Since we need boxes of radius to cover , in the characteristic zero case, we find that we can cover by hypersurfaces of degree . In the positive characteristic case, we can cover by hypersurfaces of degree at most .
By an explicit computation, see [21, page 212] for details, we have and , the equivalents being for . Hence since , goes to zero when . ∎
Proposition 5.1.4**.**
Let integers and be given. Let be an -definable family of subanalytic sets with of dimension in each model of and each in . Then there are a constant depending only on , a constant depending only on and , and an integer such that for each and each local field , the following holds.
For and , the set (resp. for the positive characteristic case) is covered by at most
[TABLE]
hypersurfaces of degree at most .
Moreover, we have if and if .
Proof.
We work inductively on . The case being clear, since the cardinal of the fibers is then uniformly bounded in . Assume now that . Apply the parametrization theorem 3.1.4 to the definable family .
We keep notations from the proof of Lemma 5.1.3. Choose in function of such that is bounded (say by 2). From the computations at the end of the proof of Lemma 5.1.3, we can choose
We have , and since is the smallest integer such that , we have if , and if , . From Theorem 3.1.4, we find a -parametrization of involving pieces. From Lemma 5.1.3, the points of height at most on one of the pieces are included in at most (if ) or (if ) hypersurfaces of degree at most . From the Stirling formula, we see that is bounded. Hence overall, up to enlarging , we find that or is contained in
[TABLE]
hypersurfaces of degree at most , with if and if . ∎
5.2 Blocks
In this final section, we provide uniform versions of results of [10, Section 4.2] for local fields of large residue characteristic, in particular of Theorems 4.2.3 and 4.2.4 of [10]. We thus obtain analogues of Pila-Wilkie counting results, uniformly for local fields of large enough positive characteristic. We will leave proofs, which are analogous to the ones for Theorems 4.2.3 and 4.2.4 of [10], to the reader.
Definition 5.2.1**.**
A subset , with an -structure, is called a block if it is either a singleton, or, it is a smooth subanalytic set of pure dimension contained in a smooth semi-algebraic set of pure dimension .
A family of blocks , with parameters running over , is a subanalytic set such that there exists an integer and a semi-algebraic set such that for each model of , for each there is an such that both and are smooth of the same pure dimension and such that .
Note that if is a block of positive dimension, then .
Note that our notion of family of blocks, which corresponds to the one in [7], is a strengthening of the one in [10] which solely ask that a family of blocks is such that is a block for each . However, all the results in Section 4.2 of [10] hold with this strengthened definition.
Let be in and let be an integer. We define the -height of as
[TABLE]
and for .
Let and be an integer. We define the -height of as
[TABLE]
and for .
If , we set
[TABLE]
The following result is a generalized and uniform version of Theorems 4.2.3 and 4.2.4 of [10].
Theorem 5.2.2**.**
Let be a subanalytic family of subanalytic sets of dimension in each model of . Fix . Then there are a positive constant , integers , , , and a family of blocks such that the following holds.
For each , and , there is a subset of cardinal at most such that
[TABLE]
In particular, if we denote by the union over of the of positive dimension, we have and
[TABLE]
The proof of Theorem 5.2.2 is completely similar to those of [10, Section 4.2] (namely to the proofs of Proposition 4.2.2 and Theorems 4.2.3 and 4.2.4), where instead of using [10, Proposition 4.2], one uses Proposition 5.1.4. We skip the proofs and refer to [10] for details.
Remark 5.2.3*.*
Note also that the bound in Proposition 5.1.4 is polylogarithmic, whereas the bound of [10, Proposition 4.2] is subpolynomial. However, this improvement does not guarantee a polylogarithmic bound in the counting theorems. As in the o-minimal case, such a bound is not expected to hold in general, but might be true in some specific situations, similar to the context of Wilkie’s conjecture for -definable sets.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] O. Beyarslan and Z. Chatzidakis. Geometric representation in the theory of pseudo-finite fields. The Journal of Symbolic Logic , 82(3):1132–1139, 2017.
- 2[2] O. Beyarslan and E. Hrushovski. On algebraic closure in pseudofinite fields. J. Symbolic Logic , 77(4):1057–1066, 2012.
- 3[3] M. Bhargava, A. Shankar, T. Taniguchi, F. Thorne, J. Tsimerman, and Y. Zhao. Bounds on 2-torsion in class groups of number fields and integral points on elliptic curves. ar Xiv:1701.02458 , 2017.
- 4[4] G. Binyamini and D. Novikov. Complex cellular structures. ar Xiv:1802.07577 , 2018.
- 5[5] E. Bombieri and J. Pila. The number of integral points on arcs and ovals. Duke Math. J. , 59(2):337–357, 1989.
- 6[6] F. Catanese. Chow varieties, Hilbert schemes, and moduli spaces of surfaces of general type. Journal of Algebraic Geometry , 1(4):561–595, 1992.
- 7[7] A. Chambert-Loir and F. Loeser. A nonarchimedean Ax-Lindemann theorem. Algebra Number Theory , 11(9):1967–1999, 2017.
- 8[8] J. Cilleruelo and I. Shparlinski. Concentration of points on curves in finite fields. Monatsh Math , 171(3):315–327, 2013.
