On homogeneous and inhomogeneous Diophantine approximation over the fields of formal power series
Yann Bugeaud, Zhenliang Zhang

TL;DR
This paper extends classical Diophantine approximation results to fields of power series, establishing analogues of Kronecker's theorem and exploring approximation properties with full Hausdorff dimension in the one-dimensional case.
Contribution
It introduces the first analogues of key Diophantine approximation theorems over fields of power series, including a quantitative transference inequality and conditions for full Hausdorff dimension.
Findings
Established power series analogue of Kronecker's theorem.
Derived a quantitative transference inequality.
Identified conditions for full Hausdorff dimension in one dimension.
Abstract
We prove over fields of power series the analogues of several Diophantine approximation results obtained over the field of real numbers. In particular we establish the power series analogue of Kronecker's theorem for matrices, together with a quantitative form of it, which can also be seen as a transference inequality between uniform approximation and inhomogeneous approximation. Special attention is devoted to the one dimensional case. Namely, we give a necessary and sufficient condition on an irrational power series which ensures that, for some positive , the set has full Hausdorff dimension.
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.
On homogeneous and inhomogeneous Diophantine approximation over the fields of formal
power series
YANN BUGEAUD, ZHENLIANG ZHANG
Abstract
We prove over fields of power series the analogues of several Diophantine approximation results obtained over the field of real numbers. In particular we establish the power series analogue of Kronecker’s theorem for matrices, together with a quantitative form of it, which can also be seen as a transference inequality between uniform approximation and inhomogeneous approximation. Special attention is devoted to the one dimensional case. Namely, we give a necessary and sufficient condition on an irrational power series which ensures that, for some positive , the set
[TABLE]
has full Hausdorff dimension.
††2010 Mathematics Subject Classification: 11K55, 11J04, 28A80.††Key words and phrases: Diophantine approximation, exponent of homogeneous approximation, exponent of inhomogeneous approximation, Hausdorff dimension.
1 Introduction
Let be a power of a prime number and the finite field of order . Recall that and denote the ring of polynomials and the field of rational functions over , respectively. Let denote the field of formal power series over the field . We equip with the norm , where is the first non-zero coefficient in the expansion of the non-zero power series . This integer is called the degree of and denoted by .
The sets , , and play the roles of and , respectively. A power series in but not in is called irrational. We denote by and the “integral part” and the “fractional part” of the power series in , defined as
[TABLE]
In particular, is a polynomial in .
Let be the open unit ball. A natural measure on is the normalized Haar measure on , which we denote by . Observe that . If is the open ball of center in and radius , namely
[TABLE]
then . Since the norm is non-Archimedean, any two balls and satisfy either , , or . This is sometimes referred to as the ball intersection property. Moreover, the distance between any two disjoint balls is not less than the maximal radius of the two balls.
For any (column) vector in , we denote by the maximum of the norm of its coordinates and by
[TABLE]
the maximum of the distances of its coordinates to their integral parts.
There are numerous results on Diophantine approximation in the fields of formal power series, see [22] and Chapter 9 of [5] for references; more recent works include [3, 13, 14, 19, 26, 27]. However, only few results are known on the relation between homogenous and inhomogeneous Diophantine approximation. Our first result is the analogue of Kronecker’s theorem over fields of formal power series. As far as we are aware, it has not yet been proved in such a generality (see, however, [8, 24] for the case of column matrices). The transposed matrix of a matrix is denoted by .
Theorem 1.1**.**
Let be positive integers. Let be in and in . Then the following two statements are equivalent:
- (1)
For every , there exists a polynomial vector in such that
[TABLE]
- (2)
If is any polynomial vector such that is in , then
[TABLE]
As in [7], which deals with the real case, our aim is to give a quantitative version of Theorem 1.1. Following [7], we introduce several exponents of homogeneous and inhomogeneous Diophantine approximation. Let and be positive integers and a matrix in . Let be in . We denote by the supremum of the real numbers for which, for arbitrarily large real numbers , the inequalities
[TABLE]
have a solution in . Let be the supremum of the real numbers for which, for all sufficiently large positive real numbers , the inequalities (1) have a solution in . It is obvious that
[TABLE]
We define furthermore two homogeneous exponent and as in (1) when is the zero vector, requiring moreover that the polynomial solution should be non-zero.
Our second result is the power series analogue of the main result of [7]. Throughout this paper, the quantity is understood to be [math].
Theorem 1.2**.**
Let be positive integers. Let be in and in . Then, we have the lower bounds
[TABLE]
with equalities in (2) for almost all with respect to the Haar measure on .If is not in , then we also have the upper bound
[TABLE]
If the subgroup of has rank smaller than , then there exists in with arbitrarily large norm such that and we have
[TABLE]
Throughout the paper, we avoid this degenerate case and consider only matrices for which .
Kim and Nakada [16] proved that, for any in , we have
[TABLE]
for almost all in . In a subsequent paper [18], the authors complemented this result in showing that, for any irrational power series in , the set
[TABLE]
has full Hausdorff dimension. Our next result generalizes this statement to matrices of arbitrary dimension. Before stating it, we introduce the following notations.
Let be positive integers and in . For , we define the set
[TABLE]
and we put
[TABLE]
When and we simply write and instead of and .
Theorem 1.3**.**
Let be positive integers. For any matrix in , the set has full Hausdorff dimension. More precisely, there exists a continuous function such that and the Hausdorff dimension of the set is at least , for every positive .
If the sequence of the norms of the best approximation vectors associated to (see Definition 3.1) increases sufficiently rapidly, then the above results can be strengthened as follows. Similar results in the real case have been established in [6].
Theorem 1.4**.**
Let be positive integers. Let be in and the sequence of best approximation vectors associated to . If tends to infinity with , then there exists a positive real number such that the set has full Hausdorff dimension. More precisely, can be taken to be any positive real number less than . Moreover, if , , and the degree of the partial quotients in the continued fraction expansion of in tends to infinity, then the set has full Hausdorff dimension for every .
Except for (see the next section), we do not know whether the condition “ tends to infinity with ” is necessary to ensure that has full Hausdorff dimension for some positive .
The present paper is organized as follows. In Section 2, we give additional results in the one dimensional case, including necessary and sufficient conditions to ensure that the set has full Hausdorff dimension. In Section 3, we present some auxiliary results. A transference lemma is established in Section 4, where we also give the proof of Theorem 1.1. The proofs of Theorem 1.2, Theorem 1.3, and Theorem 1.4 are given in Section 5, Section 6, and Section 7, respectively. We use similar arguments as in the real case. In Section 8, we prove Theorem 2.3. The proofs of Theorem 2.1 and Theorem 2.2 are postponed to the last two sections.
2 One dimensional case
In the one dimensional case, Theorem 1.4 can be complemented as follows.
Theorem 2.1**.**
Let be an irrational power series in and the denominator of its -th convergent for . Then, there exists such that the set has full Hausdorff dimension if and only if .
In addition, we give a third condition equivalent to those occurring in Theorem 2.1. For an irrational power series in and a positive real number , let denote the number of integers in for which the inequality has a solution in with . Then, the power series is called singular on average if, for every , we have . As far as we are aware, this notion has been introduced in [15].
Theorem 2.2**.**
Let be an irrational power series. There exists such that the set has full Hausdorff dimension if and only if is singular on average.
Theorems 2.1 and 2.2 are the power series analogues of Theorem 1.1 of [6]. In the proof of Theorem 2.1, our method is different: we replace the use of the three distance theorem in [6] by that of Ostrowski expansions, see Theorem 9.1 and its proof. Theorem 2.2 is proved in a similar way as in the real case.
Our last result gives additional information about the relation between the exponents of homogeneous and inhomogeneous Diophantine approximation in dimension one. Its first statement has already been established in Theorem 1.2.
Theorem 2.3**.**
Let in be an irrational power series. For any element in not in , we have
[TABLE]
Let denote or a real number greater than or equal 1, then there exists a in for which and the set of values taken by the function is equal to the interval .
Theorem 2.3 is the power series analogue of Proposition 8 of [7] and its proof uses similar arguments.
3 Preliminaries
In this section, we briefly recall some notations and classical results which will be used later in the proofs of our theorems.
In the setting of formal power series, every irrational element in has a unique infinite continued fraction expansion over the field , which is induced by the map
[TABLE]
The reader is referred to Artin [2] or Berthé and Nakada [4] for more details. For every irrational power series in , we denote by its continued fraction expansion, where is called the -th partial quotient of . For each , is the -th convergent of . This defines and up to a common multiplicative factor. To define numerator and denominator of the -th convergent of , we set and , and, for any ,
[TABLE]
The following elementary properties of continued fraction expansions of formal power series are well-known (see Fuchs [12] for details).
Lemma 3.1** ([12]).**
Under the above notation, we have for :
- (1)
, 2. (2)
, 3. (3)
, 4. (4)
.
We also need a version of Dirichlet’s theorem in the fields of formal power series. The next statement follows from Theorem 2.1 of [13].
Theorem 3.1**.**
Let be positive integers. Let be in . Then, for any positive integer , there is a non-zero polynomial vector such that
[TABLE]
In dimension greater than one, we deal with sequences of vectors having similar properties as the sequence of convergents in dimension one. For this purpose, for a matrix , we denote by
[TABLE]
the linear forms determined by its columns. Then, for in , we set
[TABLE]
Definition 3.1**.**
For a sequence of polynomial vectors , write
[TABLE]
If the sequence satisfies
[TABLE]
and for all non-zero polynomial vectors of norm , then it is called a sequence of best approximations related to the matrix (or to the linear forms .
Now we construct inductively a sequence of best approximations related to the matrix .
Let , and for any polynomial vector in with .
Suppose that have already been constructed in such a way that for all non-zero polynomial vectors with . Let be the smallest integer power of greater than and for which there exists a polynomial vector with and . Since is positive, the integer does exist by Theorem 3.1. Among those points , we select an element for which is minimal. Then we set
[TABLE]
The sequence constructed in this way enjoys the desired properties.
The following two lemmas collect some properties of the sequence of best approximations.
Lemma 3.2**.**
Let be the sequence of best approximations related to the linear forms . Then we have
- (i)
, for .
- (ii)
, for .
- (iii)
For , holds for any sufficiently large .
- (iv)
For , holds for infinitely many .
Remark. In the special case , can be replaced by the large inequality .
Proof.
is immediate since .
. It follows from Theorem 3.1 that the system of inequalities
[TABLE]
has a non-zero polynomial for . This implies that , as asserted.
. Let with . Then, the system of inequalities
[TABLE]
has a non-zero solution for any sufficiently large real number . In particular, for every sufficiently large integer , the system of inequalities
[TABLE]
has a non-zero solution , satisfying
[TABLE]
. For , there are infinitely many polynomial vectors in such that . For every such in , there exists an index such that . Then, . ∎
Lemma 3.3**.**
Let be the sequence of best approximations related to the linear forms . Then, for almost all in , we have
[TABLE]
for any and any index which is sufficiently large in terms of and .
Proof.
For any and any , consider the set
[TABLE]
It follows from equality (2.3) in [19] that the Haar measure of is bounded from above by times some absolute, positive constant. Combined with the fact that for , which ensures that the series converges, we deduce from the Borel–Cantelli Lemma that the set of which belong to infinitely many sets has Haar measure zero. This implies the lemma. ∎
Let be in . Denote by its continued fraction expansion and by its -th convergent, for . Set
[TABLE]
Lemma 3.4** ([12]).**
Under the above notation, we have
- (1)
** 2. (2)
**
In addition to continued fractions, we also make use of the Ostrowski expansion of the elements of with respect to an irrational power series .
.
Lemma 3.5** ([16]).**
Under the above notation, for every positive integer and every in with , there is a unique decomposition
[TABLE]
where is in and for .
Lemma 3.6** ([18]).**
Under the above notation, for every in , there is a representation of under the form
[TABLE]
where is in and for . The representation (3) is called the Ostrowski expansion of with respect to or an -expansion for .
For simplicity, we write
[TABLE]
and call the sequence the sequence of digits of . To facilitate the exposition, we make use of a kind of symbolic space defined as follows.
For any , set
[TABLE]
and
[TABLE]
Then, for any in , there exists an element in whose sequence of digits begins with .
For an -tuple in , we call
[TABLE]
a cylinder of order ; this is the set of formal power series in which have an -expansion beginning with .
For the size of the cylinder, we have the following lemma.
Lemma 3.7** ([18]).**
For any in , the -th cylinder is a closed disc centered at and of diameter .
4 A transference lemma and the proof of Theorem 1.1
Recall that
[TABLE]
are the linear forms determined by the columns of the matrix , and
[TABLE]
are the linear forms determined by its rows.
In this section, by using a similar method as in the real case (see [9]), we prove a transference lemma, which establishes a relation between inhomogeneous simultaneous approximation and homogeneous approximation. To give the proof, we need some auxiliary results. We first state a power series analogue of Theorem XVI on page 97 of [9].
Theorem 4.1**.**
Let be a positive integer and , for be linear forms in and , respectively. Suppose that
[TABLE]
identically. Let be a vector in . If
[TABLE]
holds for all polynomial vectors , then there exists a polynomial vector in such that
[TABLE]
Proof.
We regard as a row vector and , as column vectors. Let be the square matrix whose -th column is the coefficients of and be the square matrix whose -th row is the coefficients of . Then, equality (4) becomes
[TABLE]
This implies that
[TABLE]
By the analogue of Minkowski’s Theorem in proved by Mahler in Section 9 of [24] and applied to the convex body , there is a polynomial matrix with whose -th row satisfies
[TABLE]
where the positive real numbers , , are the successive minima for the function .
By (5), (8), and the definition of , we have
[TABLE]
where is polynomial vector and
[TABLE]
Hence, by (7), we get
[TABLE]
where and . Here, is also a polynomial vector since . By the matrix operation on the ring of matrices whose coordinates are in the fields of power series, we get
[TABLE]
where
[TABLE]
By (8), the norm of the -th row of the is at most . Combined with (9), we get
[TABLE]
which gives
[TABLE]
∎
Corollary 4.1**.**
Let , be as above and set . Let in , and be positive integers. Suppose that
[TABLE]
holds for all polynomial vectors . Then, there exists a polynomial vector with
[TABLE]
Proof.
This is a special case of Theorem 4.1. Let be in with , . Let
[TABLE]
and . The corollary then follows from Theorem 4.1. ∎
Lemma 4.1** (Transference lemma).**
Let and be positive integers. Suppose that the inequality
[TABLE]
holds for any non-zero polynomial -tuple of norm . Then, for all -tuples in , there exists a polynomial vector with such that
[TABLE]
Proof.
We apply Corollary 4.1 with and . If , then the inequality (12) holds, since the left hand side of inequality (12) is not greater than . If , then, since , the right hand side of inequality (12) is greater than 1 and the inequality (12) also holds. By Corollary 4.1, the proof is established. ∎
Proof of Theorem 1.1.
First of all, we suppose that for every , there is a polynomial vector such that simultaneously , If is any polynomial vector such that is in , then
[TABLE]
It follows that
[TABLE]
Since is arbitrary, we have
[TABLE]
Thus
[TABLE]
Now we turn to prove that (2) implies (1), with the help of Corollary 4.1.
For every , there is a positive integer such that .
If , then the inequality (12) obviously holds. Otherwise, we have by the assumption.
Since , inequality (12) is satisfied if . For the finitely many polynomial vectors whose norm is less than , inequality (12) still holds if we choose the integer large enough. Then the proof is completed by using Corollary 4.1. ∎
5 Proof of the Theorem 1.2
We begin by proving that the inequalities
[TABLE]
hold for all vectors in .
For the first inequality, we can clearly assume that is finite. Let be a real number. By the definition of the exponent , there exists a real number , which may be chosen arbitrarily large, such that
[TABLE]
for any non-zero polynomial vector of norm at most equal to . Let be positive integers such that and . Then we have for any non-zero polynomial vector of norm at most equal to . By Lemma 4.1, there exists a polynomial -tuple with such that
[TABLE]
This shows that .
For the second inequality of (13), we can clearly assume that is finite. For and all real number with sufficiently large, the inequality (14) is satisfied for any non-zero polynomial vector of norm . We argue in a similar way as in the proof of the first inequality. We omit the details.
We now prove that
[TABLE]
hold for almost all vectors in .
By the formula , it is easily seen that
[TABLE]
from which it follows that
[TABLE]
for all polynomial vectors and .
We follow the notations in Section 3 and denote by
[TABLE]
the sequence of best approximations associated with the matrix .
By Lemma 3.3, for almost all in , the inequality
[TABLE]
holds for all and any index large enough. Let us fix two real numbers and such that
[TABLE]
Let be a polynomial -tuple with sufficiently large norm , and let be the index defined by the inequality
[TABLE]
This gives
[TABLE]
By (iii) of Lemma 3.2, we have
[TABLE]
Using (16) with and (17) with , we deduce that
[TABLE]
which gives
[TABLE]
This implies
[TABLE]
Let and be arbitrarily close to [math] and to , respectively. Then, it is immediate that the first inequality of (15) holds.
The second upper bound can be handled in the same manner. Let us fix now two real numbers and such that
[TABLE]
Let be a polynomial -tuple with . By (iv) of Lemma 3.2, there exist infinitely many integers such that , thus, for which,
[TABLE]
Applying again inequality (16), we obtain
[TABLE]
which yields
[TABLE]
Since the above lower bound holds for any polynomial whose norm is less than and for infinitely many , noting that the sequence tends to infinity, it follows that
[TABLE]
Choosing and arbitrarily close to [math] and to respectively, we get the second inequality of (15), and the proof of first assertion is completed.
It only remains to prove that
[TABLE]
when is not in .
For any in , set . By the denseness of in (which is implied by Theorem 1.1) and following the same method as in the homogeneous case, we can construct a sequence of polynomial vectors , , in associated with which satisfy the following properties. Set and , then we have
[TABLE]
and for all polynomial vectors with . Here we also call the above sequence a sequence of best approximations related to . By definition of and best approximation, for any , the inequality
[TABLE]
holds for any index sufficiently large in terms of . By using the triangle inequality, we conclude that
[TABLE]
which gives that . Choosing arbitrarily close to , we complete the proof.
6 Proof of Theorem 1.3
Before proving Theorem 1.3 we establish an auxiliary lemma.
Lemma 6.1**.**
Let be an integer. For a sequence of polynomial vectors such that for , set
[TABLE]
Then we have .
Proof.
Our strategy to prove this lemma is as follows. First, we define some partitions of and construct a family of balls covering the points which do not satisfy the condition in the definition of the set . Then we delete the family of balls from the partitions to construct a Cantor subset contained in .
For any , define by and set
[TABLE]
It is clear that all distinct elements in satisfy
[TABLE]
Now we define a partition of . For each , let be the family of balls centered at some point in , i.e.,
[TABLE]
By (18) and the ball intersection property, any two distinct balls in have empty intersection. Each ball in has measure . Since there are exactly of these balls, they do indeed define a partition of .
For any , we consider the resonant set
[TABLE]
Since is in , each resonant set is contained in one of the affine spaces
[TABLE]
In each , we choose a subset such that the distance between any two different points in is at least and such that, for any point in , there is a point in at a distance to less than . Let be the union of the sets where . Set
[TABLE]
If in satisfies , then we have
[TABLE]
where denotes the distance associated with the supremum norm. Then,
[TABLE]
which implies that there exists in such that
[TABLE]
and, consequently, is contained in some ball which belongs to .
Let . Define
[TABLE]
Then, .
Now we determine the Hausdorff dimension of the set . By the ball intersection property, the distance between any two balls in is . Since is a partition of , for any ball in , the number of balls of contained in is .
For any in , in , where are in , we obtain
[TABLE]
hence
[TABLE]
Consequently, the number of affine spaces which can intersect a ball in is at most . Since every such affine space contains points of , the number of balls of contained in the ball is at least
[TABLE]
Since for , we have . By this fact and Example 4.6 of [11], we have
[TABLE]
The proof is complete.
∎
Now we prove Theorem 1.3.
For a positive integer , we extract a subsequence from the sequence of best approximations , where the index function is an increasing function satisfying and, for any integer ,
[TABLE]
Let
[TABLE]
To define the function we distinguish two cases, according to whether the set is finite or not.
If is an infinite set, then set . Suppose that has already been defined for , and define to be the smallest element of greater than . We let be the largest index for which , we let be the largest index for which , and so on until an index as above does not exist. We have just defined . Then, we set , and the inequalities (19) are satisfied for .
If is a finite set, we denote by the largest of its elements, putting if is empty. We apply the above process to construct the initial values of the function up to . Then, we define as the smallest index for which . We observe that and , as required. We continue in this way, by defining as the smallest index for which , and so on. The inequalities (19) are then satisfied.
By Lemma 6.1, for any in , it follows that
[TABLE]
Let be a non-zero polynomial -tuple whose norm is sufficiently large and let be the index defined by the inequalities
[TABLE]
By Lemma 3.2 and inequality (16) with , we have
[TABLE]
By construction of the subsequence , we have , so
[TABLE]
then
[TABLE]
which gives
[TABLE]
From this, we deduce that with , and then
[TABLE]
which implies the second assertion.
Recall that
[TABLE]
We have just proved that, for any integer , we have
[TABLE]
Letting tend to infinity, we obtain
[TABLE]
This completes the proof of the theorem.
7 Proof of Theorem 1.4
We use the same method as in the last section. The next lemma can be seen as a sharpening of Lemma 6.1 when the sequence of norms of the polynomial vectors increase very rapidly.
Lemma 7.1**.**
For any in , let be a sequence of polynomial vectors such that for and . Then, the set
[TABLE]
has full Hausdorff dimension.
Proof.
Since the proof is very similar to that of Lemma 6.1, we just give the necessary modifications here.
Let be in . For any , set . We note that plays the role of in the proof of Lemma 6.1. The remaining part of the construction of a suitable subset can be done in a similar way. Notice that, since tends to infinity with , we have
[TABLE]
which completes the proof.
∎
Let us begin the proof of Theorem 1.4.
Let
[TABLE]
be the sequence of best approximations associated to the matrix , and set for .
Let be in and set . Since tends to infinity with , the set
[TABLE]
is an infinite set. In the same way as in the proof of Theorem 1.3, we can extract a subsequence of with the property that
[TABLE]
We apply Lemma 7.1 to and take in the corresponding set , that is, satisfying
[TABLE]
Let be a non-zero polynomial -tuple whose norm is sufficiently large and let be the index defined by the inequality
[TABLE]
By (16), (20), and (ii) of Lemma 3.2 with and , since
[TABLE]
we have
[TABLE]
Consequently, we get
[TABLE]
By letting , this gives the first assertion of Theorem 1.4.
If , , and the degrees of the partial quotients of tend to infinity, then the assumption of Lemma 7.1 is satisfied for for some constant . For any , the set has full Hausdorff dimension. Let be in , let be a polynomial. Then, for every in , we have
[TABLE]
Now we assume that is large enough and let be the integer with . For any in , letting and in the inequality (22), since , we have
[TABLE]
This gives . Setting , the proof is complete.
8 Proof of Theorem 2.3
Since we always have for any irrational power series whose partial quotients have bounded degree, we may assume that .
If is finite and equal to , then let let be the constant sequence equal to , otherwise, put for any . Let be an element in such that the sequence of the denominators of its convergents satisfies the growth condition
[TABLE]
By Theorem 1.2, we have for almost all in . Let be a non-negative real number. If is finite, then assume furthermore that . We construct an element in for which . When , our process furnishes moreover some not in with .
Let be a sequence of polynomials with
[TABLE]
Set
[TABLE]
For any , set
[TABLE]
Then we have
[TABLE]
so
[TABLE]
and
[TABLE]
hence
[TABLE]
which implies that . When , we construct in not in and with exactly in the same way, by taking for any .
Next we prove that for infinitely many and all polynomials and with , we have
[TABLE]
It follows that , and therefore that .
To obtain a contradiction, we suppose inequality (24) does not hold for some polynomials and with . Then we deduce from (23) and the triangle inequality that
[TABLE]
Set and , if is even (the case is odd can be handled in the same way). Then we have
[TABLE]
A trivial verification shows that
[TABLE]
This gives
[TABLE]
Now we use the formula
[TABLE]
When , we bound from below
[TABLE]
When , we obtain
[TABLE]
We have reached the expected contradiction.
9 Proof of Theorem 2.1
We only need to establish the implication “” in Theorem 2.1 and it can be restated as follows.
Theorem 9.1**.**
Under the assumption that , we have
[TABLE]
Proof.
For positive integers , set
[TABLE]
For , set .
We define a sequence as follows. Set and, for , let be the smallest integer for which . Since , the sequence is uniformly bounded from above by an absolute constant and we deduce from our assumption on the growth of the sequence that
[TABLE]
Setting , we have
[TABLE]
Write
[TABLE]
where is the cylinder of order with respect to the -expansion (see at the end of Section 3), and
[TABLE]
Let
[TABLE]
Then we have
[TABLE]
Every ball in can be written as for some in . For any with where , it follows from Lemma 3.5 that
[TABLE]
where is defined by . Then, the element of such contained in the ball is at least , which is greater than . In the same way as one gets equality (25), we deduce that, for any distinct in with , we have
[TABLE]
Thus the number of balls with and which are contained in the ball is at least .
Then the number of balls in contained in a ball of is at most
[TABLE]
For a real number in , let denote the Hausdorff -measure. For any satisfying , for any with , we have
[TABLE]
Then , this completes the proof.
∎
10 Proof of Theorem 2.2
By Theorem 2.1, we only need to prove the following statement.
Theorem 10.1**.**
Let in be an irrational power series and the sequence of its convergents. Then is singular on average if and only if tends to infinity with .
Proof.
First, we prove that is singular on average under the condition that tends to infinity with .
Let and be an integer. By Lemma 3.4 and Lemma 3.5, for any in with , we have . Then
[TABLE]
which gives
[TABLE]
In this way, for each integer with , the inequalities
[TABLE]
have a solution in if and only if .
Thus for each integer in , inequalities (26) have no solution for if and only if
[TABLE]
Since , the number of integers in such that inequalities (26) have no solution for is at most
[TABLE]
Therefore, for an integer with , the number of integer in such that inequalities (26) have no solution for is not greater than . Recalling that denote the number of integers in for which the inequality has a solution with , we have
[TABLE]
By the assumption that tends to infinity with , we deduce that converges to [math]. Therefore, is singular on average.
Suppose that is singular on average, choose . Let be an integer satisfying for some . Then, we have
[TABLE]
Since for any polynomial with , we conclude that inequalities (26) have no solution for , if is an integer in .
By Lemma 3.4, and , we have that , which implies that and are disjoint for . Let be an integer with , it follows that the number of integers in such that inequalities (26) have no solution for and is at least . In this way,
[TABLE]
The condition of singularity on average implies that the right hand side of the above inequality goes to [math] as tends to infinity. By the monotonicity of , we conclude that tends to infinity.
∎
Acknowledgements
The authors are grateful to the referee for a careful reading. The second author was supported by NSFC (Grant Nos. 11501168) and the China Scholarship Council.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[2] E. Artin, Quadratische Körper im Gebiete der höheren Kongruenzen , I-II. Math. Z. 19 (1924), 153–246.
- 3[3] E. Bank, E. Nesharim, S. Højris Pedersen, Solution of Cassels’ Problem on a Diophantine Constant over Function Fields . Int. Math. Res. Not. IMRN 18 (2017), 5451–5474.
- 4[4] V. Berthé and H. Nakada, On continued fraction expansions in positive characteristic: Equivalence relations and some metric properties , Expo. Math. 18 (4) (2000), 257–284.
- 5[5] Y. Bugeaud, Approximation by Algebraic Numbers , Cambridge Tracts in Math, 160, Cambridge University Press, 2004.
- 6[6] Y. Bugeaud, D. H. Kim, S. Lim, and M. Rams, Hausdorff dimension in inhomogeneous Diophantine approximation , Int. Math. Res. Not. IMRN. To appear.
- 7[7] Y. Bugeaud, M. Laurent, On exponents of homogeneous and inhomogeneous Diophantine approximation , Moscow Math. J. 5(4) 2005, 747–766.
- 8[8] L. Carlitz, Diophantine approximation in fields of characteristic p 𝑝 p , Trans. Amer. Math. Soc. 72 (1952). 187–208.
