Simultaneous approximation to values of the exponential function over the adeles
Damien Roy

TL;DR
This paper demonstrates that Hermite's approximations to exponential function values at algebraic numbers are nearly optimal from an adelic viewpoint, considering all completions of a number field.
Contribution
It introduces an adelic framework to evaluate the optimality of Hermite's approximations across different completions of number fields.
Findings
Hermite's approximations are nearly optimal adelically.
The approach accounts for both Archimedean and p-adic valuations.
Provides a unified adelic perspective on exponential value approximations.
Abstract
We show that Hermite's approximations to values of the exponential function at given algebraic numbers are nearly optimal when considered from an adelic perspective. We achieve this by taking into account the ratio of these values whenever they make sense in the various completions (Archimedean or -adic) of a number field containing these algebraic numbers.
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.
Simultaneous approximation to values of the exponential function over the adeles
Damien Roy
Abstract.
We show that Hermite’s approximations to values of the exponential function at given algebraic numbers are nearly optimal when considered from an adelic perspective. We achieve this by taking into account the ratio of these values whenever they make sense in the various completions (Archimedean or -adic) of a number field containing these algebraic numbers.
Key words and phrases:
adeles, exponential function, geometry of numbers, Hermite approximations, measures of approximation, roots of polynomials, semi-resultant, steepest ascent, volumes.
2010 Mathematics Subject Classification:
Primary 11J13; Secondary 11J61, 11J82, 11H06.
Research partially supported by NSERC
1. Introduction
We know by Euler that the number admits a continued fraction expansion consisting of intertwined arithmetic progressions
[TABLE]
Euler, Sundman and Hurwitz also obtained similar expansions for the numbers where is a non-zero integer [13, §§31-32]. Consequently, one may derive very good measures of rational approximations to these numbres (see for example the fully explicit results of Bundschuch [6, Satz 2], is the case where is even). This is the aspect that interests us here. We propose the following heuristic explanation: the ratios with are the only non-zero rational numbers for which the usual power series
[TABLE]
converges only as a real number. Indeed, let be a prime number and let denote the completion of the algebraic closure of for the -adic absolute value of extended to , with . We know that, for , the series (1.1) converges in if and only if . In particular, for a rational number , viewed as an element of , this series converges if and only if the numerator of is divisible by when , and by when .
This phenomenon also extends to algebraic numbers. Indeed, let be a number field, namely an algebraic extension of of finite degree. Then any absolute value on induces the same topology on as an absolute value coming from an embedding from into or into for a prime number . We say that such embeddings define the same place of if they induce the same absolute value on denoted . We then denote by the completion of for this absolute value. When the place comes from an embedding of into , the place is called Archimedean and we write . Otherwise it is called ultrametric, and we write if it comes from an embedding of into . When , the series for converges in each Archimedian completion of but only in a finite number of ultrametric completions. In particular, when admits a single Archimedean place, which happens when or when is quadratic imaginary, then it may occur that has a meaning only for this place. Then, we obtain the following estimate where denotes the ring of integers of .
Proposition 1.1**.**
Let be the field or a quadratic imaginary extension of , and let be a non-zero element of such that for each prime number and each place of with . Then, for any with , we have
[TABLE]
where stands for the number of places of with or , and where is a constant depending only on and .
For example if , we may take where . If , we may take where . In some cases, admits a generalized continued fraction expansion similar to the one of (with partial quotients in ) but we do not consider this question here.
More generally, let be distinct elements of a number field . Lindemann-Weierstrass theorem [18] tells us that their exponentials are linearly independent over and the classical proof, in all variants (see [11, Appendix]), is based on Hermite’s approximations which we recall in the next section. Our goal is to show that these approximations are nearly optimal in the context of geometry of numbers in the adeles of , when taking into account all places of and all pairs of indices with for which the series for converges in . It is possible that this observation reflects a much wider property of the values of the exponential function.
For example the series for converges in and in but not in any for a prime number . Then our approach leads to the following result.
Proposition 1.2**.**
For any integer , we define a convex body of and a lattice of by
[TABLE]
For , let denote the -th minimum of with respect to , that is the smallest such that contains at least -linearly independent elements of . Then we have
[TABLE]
for a constant that does not depend on .
Using the fact that , one deduces that for any integer . Consequently, for each , there exists a constant such that
[TABLE]
for all with . One may even derive slightly sharper estimates (see [6, Satz 1]). However, numerical computations described in section 12 yield
[TABLE]
More involved computations which we do not describe here even suggest the existence of a real number such that
[TABLE]
for any with large enough. Finally, an important result of Baker [2] shows that if are distinct non-zero rational numbers then, for each , there also exists a constant such that
[TABLE]
for each with . The properties of Hermite’s approximations suggest that the right hand side in this inequality could be remplaced by for a constant depending only on , when is large enough.
In this paper, stands for the set of non-negative integers and for the set of positive integers.
Acknowledgments: I warmly thank Michel Waldschmidt for numerous exchanges on these questions. In particular, his course notes [17] were a source of inspiration.
2. Statement of the main result
Let be a number field, let be its ring of integers, let be its degree over , and let . For any ultrametric place of , we denote by the ring of integers of and by the local degree of , where stands for the prime number below (notation ), namely the prime number for which extends the -adic absolute value on . Following McFeat [12, §2.2], we denote by the Haar measure on normalized so that . For an Archimedean place (notation ), we again denote by the local degree of , and define as the Lebesgue measure on (this field is or ). We denote by (resp. ) the number of places with (resp. ), so that .
The ring of adeles of is the product running over all places of , with the restricted topology. This is a locally compact ring that we equip with the Haar measure , product of the . We identify as a subfield of via the diagonal embedding. Then becomes a discrete subgroup of and, with the above normalization, we have
[TABLE]
where stands for the discriminant of . By abuse of notation, we also write for the product measure of copies of on . Similarly, for each place of , we also write for the product measure of copies of on . With our normalization of the absolute value on , if is a -linear map and if is a measurable subset of , the set is measurable with measure .
2.1. Minima of adelic convex bodies
An adelic convex body of is a product
[TABLE]
indexed by all places of , which satisfies the following properties:
- (i)
if , then is a convex body of , namely a compact connected neighborhood of [math] in such that for any with ;
- (ii)
if , then is a finite type (thus free) sub--module of of rank ;
- (iii)
for all but finitely many places of with .
Suppose that is such a product. For each , we define its -th minimum as the smallest for which the adelic convex body
[TABLE]
contains at least linearly independent elements of over . With this notation and our normalization of measures, the adelic version of Minkowski’s theorem reads as follows.
Theorem 2.1** (McFeat, Bombieri et Vaaler).**
For any adelic convex body of , we have
[TABLE]
We refer the reader to [12, Theorem 5] and [4, Theorem 3] for the upper bound on the product of the minima (see also the upper bound of Thunder in [16, Theorem 1 and Corollary]). The lower bound given here is taken from [12, Theorem 6]; it is slightly weaker than the one of [4, Theorem 6].
2.2. Hermite’s approximations
Let be distinct elements of . For each -tuple , we define polynomials of by
[TABLE]
where
[TABLE]
represents the degree of , and where denotes the -th derivative of for each integer . We then form the point
[TABLE]
We call it the Hermite approximation of order for the -tuple . Our goal is to give a precise meaning to the term “approximation”, by working in the adeles of .
We first recall some properties of these points. For simplicity, we start by assuming that . We find
[TABLE]
So, for any pair , we obtain
[TABLE]
independently of the path of integration from to in . Upon integrating along the line segment joining those two points and observing that
[TABLE]
we deduce that
[TABLE]
for a constant that is independent of the choice of , and . Similarly, for , the formula (2.1) yields
[TABLE]
by integrating along . Since for all , we deduce that
[TABLE]
More generally, let be any Archimedean place of . Put
[TABLE]
and choose an embedding such that for all . Then, for any pair of indices , the above computations yield
[TABLE]
where denotes the image of under the ring homomorphism from to which fixes and coincides with on , and where depends only on and . Thus, is a projective approximation to at each Archimedean place of .
In this paper, we establish an upper bound for the integral in (2.3) which is sharper than for each Archimedean place of . We also provide analogs of (2.3) and of (2.4) for the ultrametric places of whenever their left hand side makes sense in . More precisely, as could make sense in without and making sense, we consider instead the quantities . Here again, we will need sharp estimates while usually the ultrametric places are treated in an expeditious manner. In general, one chooses a common denominator of , that is an integer such that . Then the polynomial has coefficients in and, for each , we find
[TABLE]
For example, if , this implies that .
The above estimates are key-ingredients in the classical proof of the Lindemann-Weiertrass theorem asserting that are linearly independent over . However, two more ingredients are missing. The first one is a reduction step of Weierstrass which is explained in [11, Appendix, §3] (see also [3, Chapter 1, §3]). The second one is the existence of families of linearly independent approximations over . Hermite himself noticed this problem and solved it in order to prove the transcendence of . We will use here the following remarkable result of Mahler.
Theorem 2.2** (Mahler).**
Suppose that has positive coordinates. Let denote the canonical basis elements of . Then, we have
[TABLE]
The proof of Mahler is clever. It is presented in [10, §8] and again in [11, Appendix, §16]. In the case where , the result is due to Hermite [9]. Hermite’s proof is different. It is based on the recurrence relations satisfied by the points points which we generalize in Appendix A.
2.3. Statement of the main result
With the above notation, let be the finite set consisting of all Archimedean places of together with the ultrametric places of such that for at least one pair of indices with . For each -tuple , we let denote its sum and we define an adelic convex body of as follows.
- (i)
If is the place attached to an embedding , we define by (2.2). Then is the set of points which satisfy
[TABLE]
for each pair of indices with .
- (ii)
If and if for a prime number , then is the set of points in which satisfy
[TABLE]
for , as well as
[TABLE]
for each pair of integers such that .
- (iii)
Finally, if , then is the set of points satisfying
[TABLE]
for .
The crucial feature of these adelic convex bodies is that the linear forms which define them involve only the complex or -adic values of the exponential function at the points or . In view of the estimates in §2.2, their component contains the points for each Archimedean place of . We will show in the next section that this holds in fact for all places of , yielding the first assertion in the following result.
Theorem 2.3**.**
Let . Then the adelic convex body contains the points . Moreover, upon setting , we have the following volume estimates.
- (i)
If , then
[TABLE]
for a constant depending only on and .
- (ii)
If and if for a prime number , then
[TABLE]
- (iii)
If , then .
Note that, for each place of , these estimates enclose the volume of between limits whose ratio is a polynomial in while these limits themselves grow like , that is roughly like an exponential in if or like if . When , we give an explicit value for the constant in Theorem 8.1.
The lower bounds for follow easily from the definition of as a determinant in (2.5), if we take for granted the fact that contains the points for . Indeed, let be the -linear map defined by
[TABLE]
for each . Then contains where is given by
[TABLE]
As , we have . If , we also have , thus . If , we simply have , thus .
Our main contribution therefore lies in the upper bounds for the volume of the components , and we explain our strategy below. These upper bounds in turn yield an upper bound for the volume of from which we derive the following conclusion thanks to the adelic Minkowski theorem.
Corollary 2.4**.**
In the notation of Theorem 2.3, we have
[TABLE]
and where is a constant depending only on .
Proof.
Since and since contains all Archimedean places of , we find
[TABLE]
where is independent of . Since contains the points of and since, by Theorem 2.2, these points are linearly independent over , we also have
[TABLE]
Thus, by Theorem 2.1, we obtain
[TABLE]
so with . ∎
The proof of Theorem 2.3 uses general results on univariate polynomials which we could not find in the literature. Suppose that has degree . Let be its set of roots in and let be the set of roots of its derivative which do not belong to . In section 5, we consider the paths of steepest descent for starting from an arbitrary point of . These paths necessarily end in an element of . We show that they are contained in the convex hull of , with length at most where is the radius of any disk containing . In section 6, for each , we denote by the multiplicity of as a root of and, starting from , we choose paths of steepest descent for which are locally distinct in a neighborhood of . These paths draw a graph on and we show that this graph is in fact a tree. We extract from it a sub-graph on which is also a tree with edges indexed by . Then, for each edge of with end points , indexed by , we obtain a path joining to passing through , with length at most , along which is maximal at the point .
For the proof of Theorem 2.3 (i), we may assume that the given place comes from an inclusion . We then apply the above construction, choosing to be the gcd of the polynomials . If the coordinates of are all , we thus obtain a tree on . Then, for each edge of with end points , we bound from above the integrals in (2.6) as a function of where is the corresponding root of . From this, we deduce in section 8 an upper bound for the volume of the convex body in terms of the product of the values with , this being the Chudnovsky semi-resultant of and . The upper bound for then follows thanks to the computation of this semi-resultant in section 7. The general case where at least one coordinate of is equal to requires a slight adjustment.
The treatment of the ultrametric places is simpler. In section 3, we show that contains the points . Afterwards, in section 9, we construct a rooted forest on associated with the place . This allows us to select inequalities among (2.7) and (2.8) and to deduce from them the required upper bound on the volume of in section 10. The relevant notions from graph theory are recalled in section 4.
In section 11, we restrict to “diagonal” approximations to two exponentials, namely to the case and . In this situation, we provide a refined form of our main result whose proof relies only on the estimates from sections 2.2 and 3. We then use it to prove Propositions 1.1 and 1.2 from the introduction.
We conclude in section 12 by explaining how Hermite’s recurrence formulas recalled in Appendix A can be used to compute efficiently the partial quotients in the continued fraction expansion of . This in turn permits to validate the inequalities (1.2) in less than two hours of computation on a small desk computer.
3. Ultrametric estimates
Let be a place of above a prime number . In this section, we complete the proof of the first assertion in Theorem 2.3 by showing that the component of contains the points for each . To this end, we use the following notation and results.
For each and each , we denote by
[TABLE]
the closed disk of with center and radius (both closed and open in ). For such a disk and for any analytic function , we define
[TABLE]
This quantity can also be computed from the Taylor series expansion of around the point via the formula
[TABLE]
which yields the -adic form of Cauchy’s inequalities
[TABLE]
(see [14, §1.5]). For the computations, we also use the estimates
[TABLE]
which follow from the formula where .
Lemma 3.1**.**
Let , let , and let . Then, we have
[TABLE]
If for , we also have
[TABLE]
Finally, if satisfies , we have
[TABLE]
Proof.
To simplify, we may assume that and that for each . Then, the polynomial can be viewed as an analytic function . To estimate , we set
[TABLE]
For , Cauchy’s inequalities together with (3.1) yield
[TABLE]
thus
[TABLE]
This proves (3.2) since
[TABLE]
If for each , a similar computation yields with . Then Cauchy’s inequalities give for each . Since we have for , we deduce that for each and the upper bound (3.3) follows.
Suppose now that . To prove (3.4), we use instead
[TABLE]
Since , the function given by
[TABLE]
is analytic with and
[TABLE]
For each integer , we have
[TABLE]
Since for , this remains valid for each . Then, by (3.5), Leibniz formula for the derivative of a product yields, for each integer ,
[TABLE]
Since and , we deduce that
[TABLE]
The upper bound (3.4) follows since
[TABLE]
Theorem 3.2**.**
Let . Then the subset of defined in Section 2.3 contains the points .
Proof.
Fix an integer and put . To show that contains the point , we fix arbitrary . Since , the inequality (3.2) of Lemma 3.1 provides
[TABLE]
If for each with , the inequality (3.3) of the same lemma also provides
[TABLE]
Finally, if satisfies , then, since , the inequality (3.4) yields
[TABLE]
4. Preliminaries of graph theory
A graph is a pair of finite sets where consists of subsets of with two elements. The elements of are called the vertices of and those of the edges of in agreement with the usual graphic representation.
Let be a graph. An elementary chain in is a sequence of distinct elements of such that for . We say that is connected if, for each pair of distinct elements of , there exists at least one elementary chain in with and . We say that is a tree if there exists exactly one such chain for each choice of with . When is connected, we have with equality if and only if is a tree.
In general, for a graph , there exists one and only one choice of integer and partitions and of and into disjoint subsets such that is a connected graph for . We say that are the connected components of . If these are trees, we say that is a forest. When admits connected components, we have with equality if and only if is a forest.
A rooted forest is a triple where is a forest and where is a subset of containing exactly one vertex from each connected component of . We say that is the set of roots of . Then, for each , there is a unique elementary chain with and . So we obtain a partial ordering on by defining if and if the elementary chain which links to an element of contains . In particular, any edge can be ordered so that . The resulting pairs are called the directed edges of . For fixed , we say that is the set of descendants of . The set of minimal elements of is called the set of successors of . Note that the pairs with are exactly the directed edges of . Moreover, any is the successor of a unique . This allows us to formulate the following result.
Proposition 4.1**.**
Let be a rooted tree, let be a field, let be a family of indeterminates over indexed by , and let be a function. For each , we define
[TABLE]
Then, upon extending the partial ordering on to a total ordering, the matrix of the linear forms with respect to the basis is lower triangular with everywhere on the diagonal.
5. Paths of steepest ascent
In this section, we fix a non-constant monic polynomial , a compact convex subset of containing all the roots of , and a closed disk of containing . We denote by the degree of , and by the radius of . The main goal of this section is to prove the following result.
Theorem 5.1**.**
Let . There exists a root of and a path linking to , such that for each . The image of such a path is contained in , with length at most .
By a path we mean here a continuous piecewise differentiable map on a closed subinterval of . For a path as in the statement of the theorem, is necessarily a root of and we have . We will see that, in fact, is a path of steepest ascent for .
For the proof, we consider the polynomial as a covering of Riemann surfaces of degree , ramified in a finite number of points. Then any path lifts into paths such that for all . The latter are not unique in general, because of ramification, and are constructed by pasting as in the proof of [8, Theorem 4.14]. For a path of the form with , this leads to the following statement.
Lemma 5.2**.**
Let with , and let denote the order of the derivative of at . Then, there exist and paths from to such that
- (i)
,
- (ii)
* for each ,*
- (iii)
* are distinct numbers for each .*
Moreover, for each and each such that , the function is analytic at and its derivative heads in the direction where the norm of grows fastest.
The last assertion of the lemma means that are paths of steepest ascent for the norm of . This is true in fact for any path such that () with a fixed because the image of the map with is a half line that is orthogonal to the circles centered at the origin. As the map is conformal outside of the ramification points, the preimage of this curve is orthogonal to the level curves of outside of these points. We will revisit the construction of the paths in Lemma 6.3.
Proof of Theorem 5.1
If , the constant path for each is the only possible choice and it has the required properties. Suppose from now on that . Then the preceding lemma provides a path of the required type linking to a root of . Fix such a path. For the computations, we denote by the distinct roots of in and by their respective multiplicities so that
[TABLE]
We also denote by the set of zeros of the derivative of .
By Gauss-Lucas theorem the set is contained in the convex hull of the roots of , thus . The fact that the image of is contained in admits a similar proof. Indeed, suppose by contradiction that the image escapes from . Then, since is convex, there exists a half-plane containing but not the image of . More precisely, there exist with such that for each and for at least one . Choose for which is maximal, and set . Since , we have , thus and . Therefore is differentiable at with . However, by differentiating both sides of the equality at , we obtain
[TABLE]
As for , we deduce that , a contradiction.
To estimate the length of , we use the Cauchy-Crofton formula
[TABLE]
(see for example the beautiful proof of [1]). Fix and consider the polynomial
[TABLE]
If satisfies , we may write for some . Then we have and consequently . As is injective on (because is), this means that is at most equal to the number of real roots of . But, as has degree , the polynomial has degree at most and its coefficient of is . Thus, except possibly for the values of for which this coefficient vanishes, we have and thus .
For fixed , the set is an interval of of length . As the image of is contained in , we have if . We conclude that except for at most values of , and thus .
6. A tree of paths between complex roots
As in the preceding section, we fix a non-constant monic polynomial . We denote by its degree, by the set of its complex roots, by the convex hull of , and by the radius of a closed disk containing . We also denote by the set of roots of which are not roots of , that is the set of zeros of the logarithmic derivative . Then we may write
[TABLE]
for integers with sum , and integers with sum .
For each , we denote by the order of at . With this notation, we have for . The goal of this section is to prove the following result.
Theorem 6.1**.**
There exists a tree with the following properties:
- (i)
Its set of vertices is .
- (ii)
It has edges, each one indexed by an element of .
- (iii)
For each , there are exactly edges indexed by .
- (iv)
If is an edge of indexed by , there exists a path of length at most , contained in , linking to , such that
[TABLE]
When all the roots of are real, we have and we can give a very simple proof of the theorem. To this end, we may assume that the roots are labelled in increasing order . Then, in each interval with , the function achieves its maximum in a zero of with . Since has cardinality , this exhausts all the elements of : we have and . We take for the graph with set of vertices , whose edges are the pairs indexed by for . Then is a tree and, for each , the piecewise affine linear path with , and fulfills the conditions in (iv). Moreover its length is .
Step 1
The proof of the general case requires several lemmas. For each , we choose once for all paths with end point as in Lemma 5.2. Then we have for . Our goal is to show that these points of are distinct and that the graph with vertices and edges with and satisfies the properties (i) to (iv) from the theorem. We start with property (iv).
Lemma 6.2**.**
Let and . Then the path from to given by
[TABLE]
is contained in , with length at most . Moreover, it satisfies
[TABLE]
Proof.
We have by Gauss-Lucas theorem. Then, for each , Theorem 5.1 shows that the paths and are contained in with length at most . The conclusion follows since these are path of steepest ascent for . ∎
Step 2
We first prove the following result where stands for the Riemann sphere with its usual topology. Afterwards, we use it to construct a tree on .
Lemma 6.3**.**
Let and let . There exist and continuous functions from to such that
- (i)
,
- (ii)
* for each ,*
- (iii)
* are distinct numbers for each .*
Then, the curves meet only at the points and on . Moreover, their complement is the union of disjoint connected open subsets of such that for .
The proof is based on Jordan curve theorem and is illustrated in Figure 1.
Proof.
Upon putting , we may write where is a polynomial with . Then, for sufficiently small , there exist an open neighborhood of and a biholomorphic function from to satisfying and
[TABLE]
for each . Fix such a choice of , and , and set and . For , we define a continous function by
[TABLE]
Then, for fixed , the numbers are the distinct solutions of with . In particular, satisfy Conditions (i) and (iii) of the lemma, as well as (ii) for each . For , we extend to a continuous function satisfying for each .
Similarly, for , we define a continuous function by
[TABLE]
For fixed , the numbers are the distinct solutions of with , thus they form a permutation of . This permutation being independent of , there is no loss of generality in assuming that is the restriction of to for . Then we extend each to a continuous function such that for each .
Put and for , and fix . The curves and meet only at the points and because if for some and , then , thus or . Suppose now that . As the curves and meet at infinity, there exists a smallest such that . For this choice of , the union is a simple closed curve . By Jordan curve theorem, its complement in is thus the union of two connected open sets and with boundary . On the other hand, we have
[TABLE]
Moreover, is the union of two disjoint connected open sets and (open sectors of the disk ), where contains the rays with and those with or . As is a homeomorphism, and are disjoint connected open subsets of whose union is . We may assume that and . Then, we obtain
[TABLE]
However, and share the same boundary, contained in . Thus none of the sets meet this boundary. As these are connected curves, we conclude that is contained in if and in otherwise. In particular, none of the open subsets and of is bounded and consequently we must have . This means that and meet only at and .
With the above notation, we define for the choice of and . We also define for the choice of and . These are connected open subsets of with for . It remains to show that pairwise disjoint. To this end, we first note that if , then since is contained in but not in . So if and intersect, then meets the boundary of . Then contains at least one point of for some . However, by the choice of , we have for each . Thus the curve is not fully contained in and, as it is a connected set, it meets the boundary of without being fully contained in it. This is impossible because that boundary is the union of two curves among . ∎
Lemma 6.4**.**
For each , the points with are distinct. Moreover, let be the graph whose set of vertices is and whose edges are the pairs with and . Then is a tree.
Proof.
The first assertion is a direct consequence of the preceding lemma because, for and , this lemma provides disjoint connected open sets such that for .
Suppose that is not a forest. Then contains a simple cycle: an elementary chain with such that is an edge of . Then, is an even integer and the ’s belong alternatively to or according to the parity of . By permuting cyclicly the elements of this chain if necessary, we may assume that and that for . Let and let be the connected open sets associated to the point by Lemma 6.3. For each point outside of these open sets, we have for a real number , thus . We set and, for , we denote by the path of the form which links and . For each , we have if is odd and if is even. In both cases, this yields , with the strict inequality if . As are distinct and as when , we deduce that the curve
[TABLE]
is contained in . As this is a connected subset of , it is therefore fully contained in for some . Since , this implies that , thus , which is impossible.
So is a forest. Therefore, its number of connected components is equal to its number of vertices minus its number of edges, that is
[TABLE]
Thus is in fact a tree. ∎
Step 4. Proof of Theorem 6.1
Let be the graph whose set of vertices is and whose edges are the pairs
[TABLE]
Since is connected, so is the graph . Since possesses vertices and since , we deduce that the edges (6.3) are distinct and that is a tree. In particular, for each , there are exactly edges of indexed by and Lemma 6.2 shows that, for each of them, there exists a path satisfying Condition (iv) of the theorem.
7. Computation of a semi-resultant
We first prove the following formula.
Proposition 7.1**.**
With the notation of the preceding section, we have
[TABLE]
The left hand side of this equality is the semi-resultant of and in the sense of Chudnovsky [5, 7].
Proof.
The formula for the derivative of a product applied to the factorization (6.1) of yields
[TABLE]
where
[TABLE]
By comparison with the factorization (6.2) of , we also find that
[TABLE]
Upon evaluating both expressions for at , we obtain
[TABLE]
Since , these equalities may be rewritten as
[TABLE]
As stated, this yields
[TABLE]
Corollary 7.2**.**
With the same notation, we have
[TABLE]
Proof.
Since , we find
[TABLE]
This yields , and the conclusion follows. ∎
8. Volume of the Archimedean components
We are now ready to prove the upper bound estimate in Theorem 2.3 (i). The notation is as in Section 2.
Theorem 8.1**.**
Let be an Archimedean place of and let be the convex body of defined in Section 2.3 for the choice of an -tuple . Then, we have
[TABLE]
where , , and .
Proof.
To simplify, we may assume that and that for each . By permuting if necessary, we may also assume that form a decreasing sequence. We denote by the closed disk of radius and center in . As this disk contains , it also contains the convex hull of these points.
Suppose first that and let be the largest index such that . We form the polynomial
[TABLE]
The set of its roots is and its degree is . Its derivative factors as
[TABLE]
where is the set of roots of outside of , and where is the multiplicity of for . We choose a tree as in Theorem 6.1 for this polynomial . By construction, the set of vertices of is . We now extend to a graph on in the following way. For each , we choose a path such that and as in Theorem 5.1. Then is a root of , thus an element of , and we add the edge to the graph . Finally, we choose as a root of the resulting tree . Then, is contained in the set of all points satisfying
[TABLE]
as well as
[TABLE]
for each directed edge of with . Since is a rooted tree, Proposition 4.1 shows that the linear forms defining are linearly independent, with determinant . Thus is a convex body of with
[TABLE]
where stands for the set of directed edges of .
For now, fix and . By construction, we have , that is . If , we also have , and is an edge of . Then, Theorem 6.1 associates to this edge a point and a path of length at most , contained in , joining and , such that
[TABLE]
This yields
[TABLE]
since for any and . Finally, if , we have for the path chosen earlier. By Theorem 5.1, the image of is contained in , of length at most . Thus the same computation as above yields
[TABLE]
Since each is associated to edges of and since , we deduce from (8.1) that
[TABLE]
As for , Corollary 7.2 gives
[TABLE]
For , we also find that
[TABLE]
This implies that
[TABLE]
Substituting this upper bound in (8.2), we conclude that , as in the statement of the theorem. ∎
9. A forest at ultrametric places
Let be an ultrametric place of . In this section we use the terminology for graphs explained in section 4 to build a rooted forest on an arbitrary non-empty finite subset of . We start with a preliminary construction.
Proposition 9.1**.**
Let be a non-empty finite subset of and let . There exists a tree rooted in having as its set of vertices, such that, for each with , we have
[TABLE]
Proof.
We proceed by induction on the cardinality of . If , there is nothing to prove. Suppose that . Let be the largest distance between two elements de , and let be a maximal subset of containing , whose elements are at mutual distance for . Since is ultrametric, we have and the sets
[TABLE]
form a partition of . For , we have and , thus we may assume the existence of a rooted tree which fulfils Condition (9.1) for each choice of with . We set
[TABLE]
Then is a rooted tree. Let with , and let be the index for which . If , then and , thus
[TABLE]
If instead for some , then we must have , and . Then and . So we find
[TABLE]
Thus has the required property. ∎
As the proof shows, the graph constructed in this way is not unique in general (since the choice is not unique). This leads to the following construction which in general is not unique either.
Theorem 9.2**.**
Let be a non-empty finite subset of , let , and let be a maximal subset of whose elements are at mutual distance at least . Then, there exists a rooted forest having as its set of vertices and as its set of roots, which satisfies the following properties:
- (i)
for any and , we have
[TABLE]
- (ii)
for any with , we have
[TABLE]
Proof.
For each , we define
[TABLE]
and we choose a rooted tree as in Proposition 9.1. Since the sets with form a partition of , the union of these graphs constitute a rooted forest where . By construction, it satisfies Condition (i). To show that Condition (ii) is also fulfilled, fix with , and let such that . Since , we have and . Moreover, if satisfies then and so . Thus Condition (ii) for is satisfied in since it is satisfied in . ∎
In terms of elementary chains, Conditions (i) et (ii) of the theorem can be reformulated as follows: given , a sequence in , with and , starting on a root , can be extended to an elementary chain ending on if and only if either we have and or the sequence is an elementary chain with and .
10. Volume of the ultrametric components
We now complete the proof of Theorem 2.3 by proving the remaining estimates in parts (ii) and (iii). The notation is as in Section 2.
Theorem 10.1**.**
Let be a place of above a prime number , let and let . Then the sub--module of defined in Section 2.3 satisfies
[TABLE]
Moreover, if for each with , then we also have
[TABLE]
Proof.
We apply Theorem 9.2 to the set with . It provides a rooted forest with roots , vertices , and edges . For each , we define and where is the index for which . Then, is contained in the set of points satisfying
[TABLE]
for each root , as well as
[TABLE]
for each directed edge or equivalently for each pair with (since we then have ). By Proposition 4.1, the above linear forms are linearly independent, with determinant . So is a free sub--module of of rank with
[TABLE]
where
[TABLE]
Let . If , Theorem 9.2 (i) yields
[TABLE]
Otherwise, there exists a unique such that and, since
[TABLE]
Theorem 9.2 (ii) yields
[TABLE]
Since runs through all connected components of as runs through and since we have , the equality (10.1) implies that
[TABLE]
Furthermore, the equality (10.2) implies that
[TABLE]
As a result we obtain
[TABLE]
Since , we conclude that
[TABLE]
Finally, if for each with , then consists of all points satisfying
[TABLE]
for , thus
[TABLE]
11. A special case
The adelic convex bodies associated to a point depend only on the differences with . So, we may always assume that . Then for , we simply have a point . The proposition below is an explicit form of Corollary 2.4 for such a point and for diagonal pairs . In this statement, the adelic convex body is rescaled so that its -adic component is contained in for each ultrametric place of . We use it afterwards to prove Propositions 1.1 and 1.2 from the introduction. The notation is the same as in Section 2.
Proposition 11.1**.**
Let , and let be the finite set of places of with or . For each place of with , we set B_{v}=\min\big{\{}1,p^{1/(p-1)}|\alpha|_{v}\big{\}} where is the prime number below . We also set
[TABLE]
Finally, for each , we denote by the adelic convex body of whose components are defined as follows.
- (i)
If , then is the set of points such that
[TABLE]
- (ii)
If for a prime number and if , then consists of the points such that
[TABLE]
- (iii)
If for a prime number and if , then .
Then we have
[TABLE]
for constants that depend only on and .
Proof.
Let . We consider the adelic convex body constructed in Section 2.3 for the choice of , and . For an Archimedean place of associated to an embedding and for , we find
[TABLE]
Thus the points of satisfy
[TABLE]
This implies that for
[TABLE]
For each prime number and each place of with , we also find that for
[TABLE]
where is the integer for which
[TABLE]
if , and otherwise. This computation is based simply on the fact that . Thus we obtain for the idele .
The product is an adelic convex body of . By the product formula applied to the principal idele , we find that the volume of is
[TABLE]
Since , this can be rewritten as
[TABLE]
with . Since if and if and , this yields
[TABLE]
where and . By Theorem 2.1 (with ), we thus have where . This means that there exists satisfying for all Archimedean places of and for all other places. So, we obtain
[TABLE]
which yields
[TABLE]
since contains the -linearly independent points of . By Theorem 2.1 (with ), this implies that
[TABLE]
Finally, for each place of , we find that
[TABLE]
Since , this implies that , and so (11.1) follows with . ∎
Proof of Proposition
1.1.
Under the hypotheses of this proposition, the field admits a single Archimedean place , induced by the inclusion . Moreover, in the notation of Proposition 11.1, the choice of leads to for any other place of . Thus, for each , we obtain
[TABLE]
where consists of all points of satisfying
[TABLE]
Moreover, by (11.1), we have for a constant depending only on and .
Let with . The above implies that, for each ,
[TABLE]
If is large enough, we can find an integer such that . Then we have and we obtain
[TABLE]
with . Since is a discret subset of , this leaves out a finite number of values of . To include them in the final lower bound, it suffices to replace by a sufficiently small constant . ∎
Proof of Proposition 1.2.
We apply Proposition 11.1 with and . In this context, we have and . For a given , a simple computation shows that the Archimedean component of the adelic convex body satisfies
[TABLE]
where is the convex body of defined in Proposition 1.2. For its ultrametric components, we find that
[TABLE]
and for each prime number . Thus the points of which belong to the latter components are exactly those of the lattice in Proposition 1.2. Therefore, the minima of with respect to in the adelic sense are also the minima of with respect to in the classical sense. In view of the inclusions (11.2), this implies that for the constants and given by Proposition 11.1. ∎
12. Numerical computations
The formulas in Appendix A allow us to compute recursively the diagonal Hermite approximations to . In this last section, we explain how they can be used to compute efficiently the partial quotients in the continued fraction expansion of , and then to verify the inequalities (1.2) from the introduction. Our reference for continued fractions is [15, Ch. I].
Let denote the continued fraction expansion of . Its first terms are
[TABLE]
without any noticeable regularity. For each integer , we form the -th convergent of
[TABLE]
with , and . The table below lists all integers with for which
[TABLE]
For each of those integers, it provides the corresponding value of as well as the value of truncated at the first decimal place.
[TABLE]
[TABLE]
To show how this implies the estimations (1.2), define for each . For each pair with , there exists an integer such that . By a theorem of Lagrange [15, Chapter I, Theorem 5E], we have
[TABLE]
Assuming , this implies that
[TABLE]
It is easy to check that the right hand side of (12.1) is for all entries of the table with . Thus it is also for each integer with . A quick computation shows that this is also true for . Thus the left hand side of (12.1) is if . Finally, one checks that this is still true when .
To compute the partial quotients , put
[TABLE]
for each . By Corollary A.3 in the Appendix, the rows of are Hermite’s approximations and to . Thus we have
[TABLE]
We also note that, for each , the matrices and belong to the set
[TABLE]
This is clear for the matrices . For the matrices , this follows from the fact that is closed under matrix multiplication.
In general, if , the ratios and admit unique continued fraction expansions
[TABLE]
with , if , and if . Let be the common initial part of the sequences and . When , that is when or or , we say that is reduced. Then, we find that
[TABLE]
where is reduced, with the convention that the right hand side is when . In particular, for each , we obtain
[TABLE]
for a reduced matrix , integers and positive integers such that
[TABLE]
with the convention that the product on the right is when . By (12.2), the integers go to infinity with and so we conclude that
[TABLE]
are the respective continued fraction expansions of and . Therefore, to compute their partial quotients , it suffices to compute recursively the matrices whose coefficients are in practice much smaller then those of (we may also at each step factor out the power of dividing ). To further save computation time we do not compute exactly the integers but keep only a floating point approximation of them (in practice we use 10 significative decimal digits). In this way, it takes slightly above an hour of CPU time to produce the tables using MAPLE software with a 64 bits intel i5 processor.
Appendix A Recurrence relations
The notation being as in Section 2.2 we extend the definition of , and to any -tuple by setting
[TABLE]
For each , we denote by the matrix whose -th row is for . In [9, §§IX-X], Hermite provides a recurrence formula linking to where . Here we give more general recurrence relations based on the same principle. The formula (A.1) below is due to Hermite [9, §IX, p. 230] when .
Proposition A.1**.**
Let . We have
[TABLE]
Moreover, if with , we also have
[TABLE]
Proof.
Leibniz formula for the derivative of a product gives
[TABLE]
Taking the sum of all derivatives on both sides of this equality, we obtain
[TABLE]
and (A.1) follows. The formula (A.2) is trivial if . Suppose that and so that . Then we find
[TABLE]
Taking again the sum of the derivatives, this yields
[TABLE]
and (A.2) follows. ∎
Corollary A.2**.**
Let and . Then we have
[TABLE]
where
[TABLE]
Proof.
As the entries of are positive, the polynomial vanishes at all points and the formulas of Proposition A.1 yield
[TABLE]
When , this provides a quick way of computing the matrices .
Corollary A.3**.**
Suppose that , and . Then, for each , we have
[TABLE]
where
[TABLE]
Proof.
We find that and , thus . In general, for an integer , the formulas of the preceding corollary give
[TABLE]
and the conclusion follows by induction on . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. Ayarai and S. Dubuc, La formule de Cauchy sur la longueur d’une courbe, Canad. Math. Bull. 40 (1997), 3–9.
- 2[2] A. Baker, On some Diophantine inequalities involving the exponential function, Canad. J. Math. 17 (1965), 616–626.
- 3[3] A. Baker, Transcendental number theory , Cambridge University Press, London-New York, 1975, x+147 pp.
- 4[4] E. Bombieri and J. Vaaler, On Siegel’s Lemma, Invent. Math. 73 (1983), 11–32.
- 5[5] W. D. Brownawell, Some remarks on semi-resultants, Transcendence Theory: Advances and Applications , Chapter 14 (A. Baker and D. W. Masser, eds.), New York, Academic Press, 1977.
- 6[6] P. Bundschuh, Irrationalitätsmaße für e a superscript 𝑒 𝑎 e^{a} , a ≠ 0 𝑎 0 a\neq 0 , rational oder Liouville-Zahl, Math. Ann. 192 (1971), 229–242.
- 7[7] G. V. Chudnovsky, Some analytic methods in the theory of transcendental numbers, Chapter 1 in Math. Surveys Monogr. , Vol. 19, Amer. Math. Soc., Providence, R. I., 1984.
- 8[8] O. Forster, Lectures on Riemann surfaces , Graduate texts in Math. Vol. 81, Springer-Verlag, New York, 1981.
