Uniform parameterization of subanalytic sets and diophantine applications

2016/05/19 by Cluckers, Raf, Pila, Jonathan, Wilkie, Alex · 1 citation
#Algebraic Geometry (math.AG) #Complex Variables (math.CV) #FOS: Mathematics #Logic (math.LO) #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1605.05916

Abstract

We prove new parameterization theorems for sets definable in the structure ℝ_an (i.e. for globally subanalytic sets) which are uniform for definable families of such sets. We treat both C^r-parameterization and (mild) analytic parameterization. In the former case we establish a polynomial (in r) bound (depending only on the given family) for the number of parameterizing functions. However, since uniformity is impossible in the latter case (as was shown by Yomdin via a very simple family of algebraic sets), we introduce a new notion, analytic quasi-parameterization (where many-valued complex analytic functions are used), which allows us to recover a uniform result. We then give some diophantine applications motivated by the question as to whether the H^o(1) bound in the Pila-Wilkie counting theorem can be improved, at least for certain reducts of ℝ_an. Both parameterization results are shown to give uniform (log H)^O(1) bounds for the number of rational points of height at most H on ℝ_an-definable Pfaffian surfaces. The quasi-parameterization technique produces the sharper result, but the uniform C^r-parametrization theorem has the advantage of also applying to ℝ_an^pow-definable families.

Cited by

• Stratifications and term description over valued fields with analytic structure, uniform Yomdin-Gromov parametrizations

Related

• An effective Pila-Wilkie theorem for sets definable using Pfaffian functions, with some diophantine applications
• Diophantine Approximations on Definable Sets
• Rational points of rigid-analytic sets: a Pila-Wilkie type theorem
• Effective Pila--Wilkie bounds for unrestricted Pfaffian surfaces
• UPC condition with parameter for subanalytic sets