Abstract
Let be a monic integral polynomial of degree n and p a prime number, for which is fully decomposable modulo p. Let be the roots of with . We have conjectured that the sequence of is uniformly distributed in some sense. We provide a clear explanation of this and generalize the Weyl criterion.
MSC:
11C08; 11J71; 11K31; 11K36
1. Introduction and Conjectures
For a monic polynomial , we proposed several conjectures about the distribution of roots of for a prime number p ([1,2,3,4,5]). Very roughly speaking, they predict that the distribution is uniform. In order to explain the aim of this paper, we review them to some extent. Let a polynomial
be of degree n with complex roots . We fix the numbering of roots once and for all and define vector spaces over the rational number field by
The non-zero vector is always in . Hence, we see clearly that
We say that a polynomial has a non-trivial linear relation among roots if . We know that if there is only a trivial linear relation, then the polynomial is irreducible, and that if is irreducible and is prime or the Galois group of is isomorphic to the symmetric group , then there is only a trivial linear relation among roots (cf. [1]).
We take and fix a -basis of
and write
We may take .
We introduce the following two groups associated with them:
where the action of a permutation for is defined by the following.
If has only a trivial linear relation among roots, then is a basis of , hence .
Next, in this paper, it is assumed that the letter p denotes a prime number, and put
for a positive number X and .
We require the following two conditions on the local roots of for a prime :
We are concerned with the distribution of the vectors and for .
To state conjectures, we need to introduce the following notation.
We note that
where the set is non-empty only for a finite number of . Furthermore, for integers we put
and we define densities by
where for the last two, the denominators of the right-hand sides are supposed to tend to infinity, and the existence of the above three limits is the basic conjecture.
If there is only a trivial linear relation among roots, then , i.e., and is independent of the permutation .
Next, we introduce the following geometric objects:
We note that and
and so is disconnected, in general.
If the set is an infinite set, every accumulation point of for is in by . If holds for every j , then is in . Otherwise, it is not in . This is troublesome. The dimension of is and that of and is less than or equal to . In the following, the volume of sets and means that as a subset of an -dimensional set , that is, for a subset S in with orthonormal vectors , we identify with a point . So, holds if .
If there is only a trivial linear relation among roots, then is equal to for every permutation , and is equal to
The first conjecture is the following:
Conjecture 1.
For a permutation with , the ratio
is independent of . If holds, then two conditions and are equivalent.
We note that if has no rational root and for any distinct , then the condition implies , in particular if , and that under the following three conditions: (i) is not a product of linear forms, (ii) if , and (iii) holds for every , we have
If has only a trivial linear relation among roots, then is equal to 1, and by property for all Conjecture 1 is obviously true with (cf. Proposition 2).
The second is as follows:
Conjecture 2.
Let a set D be of the form such that all are rational and holds for all and . Then for a permutation such that and , we have
Next, to state the conjecture on for integers , as above, we introduce the following condition to , which is a necessary condition for :
: , say) for and there is an integer q which satisfies (i) q is independent of j, (ii) q is relatively prime to L, (iii) and on for every .
- Here, denotes a primitive lth root of unity, and for a subfield F in and an integer q relatively prime to l, denotes the automorphism of F induced by . The condition on is trivially satisfied if . To see that condition is necessary, it is sufficient to take a prime with as q in , noting .
By writing
the last conjecture is the following.
Conjecture 3.
Under the assumption ,
When , Conjectures 1 and 2 have no meaning, but it is easy to see that Conjecture 3 is equivalent to Dirichlet’s prime number theorem on arithmetic progressions.
Conjectures 2 and 3 are a kind of equi-distribution.
The author has no idea how to prove Conjectures, much less when the second and the third are combined together.
In this paper, we try to approach Weyl’s criterion for Conjecture 2. As shown in the next section, Weyl’s criterion in the theory of the traditional equi-distribution of a sequence of points on the interval states that step functions can be approximated by trigonometric functions via continuous functions. The difference between the traditional case and ours is that the sequence of points accumulates a convex hull in a lower dimensional plane , but no points are in S. We will show how to confine the points in S and how to calculate the trigonometric functions on a simplex-a component of the convex hull.
With respect to Conjecture 3, there is nothing to say.
Conjectures with numerical examples were proposed in [1,3]. In [2,4], we proved Theorem 2 below, which shows that Conjectures imply the classical conjecture for 1-dimensional uniformity of the sequnece of , and in [5], we confirmed that Conjectures appear to be true for a complicated domain by evaluating the volume, where means the decimal part of x.
2. Weyl’s Criterion
Let us review the original Weyl criterion for a uniformly distributed sequence modulo 1 (see [6]): the Weyl criterion states that a sequence , , is uniformly distributed modulo 1 if and only if the following equation
is satisfied for . Usually, the right-hand side is replaced by “0 for ”, omitting the trivial case . The proof proceeds as follows:
- A sequence , , is uniformly distributed modulo 1 if and only if the Equation (2) holds for the characteristic function of every interval in , which is identified with the compact space .
- Approximating a continuous function on by step functions from above and below by the supremum norm, one proves that Equation (2) is true for step functions if and only if it is true for continuous functions.
To apply the idea to a general case, the following Stone-Weierstrass theorem may be helpful.
Theorem 1.
Let T be a compact set and let be the algebra of all -valued continuous functions on T. Suppose that is a subalgebra of such that contains every constant function, for distinct points , there is a function such that . Then a continuous function f on T is approximated by functions in by the supremum norm .
The proof in [7] is simple and easy.
Our target space for Conjecture 2 is not but or its component .
3. Geometry of
In this section, we suppose that the polynomial has no rational root and is not of the form , and write simply
First, we note that the matrix whose rows are defined in Section 1 is primitive, that is, elementary divisors of the -matrix with the ith row are 1 only, hence we can supplement the bases of linear relations among roots by integral vectors such that the -matrix with the ith row is in , and put
that is, its i-th row is . Then, writing
we have
and by the transformation we see that, noting
The dimension of the set is at most , which is the dimension of the supporting space . Noting that, via
with , the set is the convex hull with vertices and the origin , that is
hence, we see that is also a convex hull, so a finite union of simplexes.
Denote the i-th row of the matrix by , that is,
and put
Lemma 1.
Write for local roots for ; then we have
and
holds only for a finite number of primes under the assumption at the beginning of this section to the polynomial f.
Proof.
The first is already given above, the second identity follows from (3) and the definition of , and the third comes from and by the definition of the vector of local roots for . Write . If happens for infinitely many primes p, then one of conditions , or occurs for infinitely many primes, hence one of , or for some constant c occurs for infinitely many primes. This means , , , respectively. The first or third condition easily implies that the polynomial has a rational root c. The second implies that the polynomial f is of the form . Because, if the identity holds for infinitely many primes, then holds for infinitely many primes, which implies (resp. ) for (resp. ), Hence, in the case of , there is a decomposition for an irreducible polynomial , i.e., is divisible by . If , then is of the form . □
Proposition 1.
Let D be the set of the form referred to in Conjecture 2, that is,
with all being rational and suppose that holds for all and all permutations μ. Write
then two sets and are finite sets, in particular, there exists a constant dependent on D such that
is true for the set D.
Proof.
Write , and let d be a positive integer such that all are integers. Let us show the contradiction under the supposition , that is, there are infinitely many primes such that and ; then the supposition implies for all i and for some k, hence , where is a constant independent of p and is an integer. Therefore, there are infinitely many primes such that for some integer satisfying . Taking a prime ideal of over p, we see that there are infinitely many prime ideals and a permutation such that , hence , which implies , i.e., , that is a contradiction. The case of and is similarly proved. □
If a polynomial has no rational root, then the typical example of the set D in the proposition is
with all being rational, since vectors in Proposition 1 are , which is in if and only if has a rational root.
In case of for some , every vector for is not in , but every accumulation point is in . So, Conjecture 2 is not within the scope of a traditional uniform distribution, and we need a reduction step. The condition on the set D in Proposition 1 is a sufficient condition to the following.
where the error term depends on D by Proposition 1, and every vector and every accumulation point are in the same set by Proposition 1.
Thus, for the set D in Proposition 1, Equation (1) in Conjecture 2 is equivalent to
where it should be emphasized that the vector is on except for a finite number of primes in that depend not on D but only on the polynomial , according to Lemma 1. So, it is equivalent to
for the characteristic function F of the set , hence, for a continuous function F on . The reduction step (4) seems to be unavoidable.
Applying Conjecture 2 to , we have the following theorem (cf. [2,4]).
Theorem 2.
If a polynomial has no rational root, holds for any distinct , and the conditions and are equivalent, then Conjectures 1 and 2 imply the equi-distribution of for local roots of the polynomial.
For a polynomial with no non-trivial linear relations among roots, the above can be proved by evaluating the density
explicitly, and the graph of the difference in the above density and the approximate values at for is also provided in [2]. Some numerical data of Conjectures are also provided in [1,3].
The equi-distribution of for an irreducible polynomial in Theorem 2 has been proven to hold without the assumptions of Conjectures 1, 2, but only for ([8,9]). For , however, it remains a difficult problem.
The condition on D in Proposition 1 is a sufficient condition for (4). How can one weaken the condition?
4. Integration
Let us rewrite the integral (5) on the set in a straightforward way to see. To perform this, let us restate the definitions:
Writing
we have
and since is the j-th entry of , we see
To specify the vector , we introduce the following matrix.
where means , we have
Here, the matrices , are regular, since the matrix is positive definite.
Using the above matrices, let us specify the vector as follows:
Thus, we have , which implies . Let us see , which is equivalent to
which follows from
Next, let the vectors be an orthonormal basis of , hence, there is a matrix such that
therefore,
since the above matrix is the submatrix of
Hence, we have
Let the vertices of be , hence, , and in view of (6) we write
and define the bijective mapping from X to by
Then, we see that for
and the vector satisfying is the vertex of X, that is, .
Thus, for a function F on , we see
hence, Equation (5) becomes
where is the jth row of the matrix and as before.
Writing for the simplexes with vertices , we have the following:
Here, we may suppose that the vertices of are those of
The aim is to evaluate the integral for a trigonometric function as F on simplexes . Let and be a simplex with vertices for which m vectors , are linearly independent. Then, we have
Writing , we see that, first of all,
because, putting , we see that the integral is equal to
transforming from to
Hereafter, we will specify the function using the exponential function as follows:
and we will evaluate the integral on the simplex in the last section. Then, the integral
is
writing , we see ,
Therefore, Equation (9) is, furthermore,
where the simplex and the vertex are those given at (9) and
for .
If Equation (10) is true for every , then Equation (8) is true for every continuous function F on by the Stone–Weierstrass theorem, and so is Conjecture 2. By Lemma 2 below, we see that the above integral vanishes if are mutually distinct and all differences are integers. Note that every vertex can be chosen in the set of vertices of X. Denote by the set of vectors such that for and the vertices of X, all inner products are mutually distinct and is an integer for every . If the restrictions of functions () on and the constant functions approximate all continuous functions on , then we may say that the Weyl criterion is generalized. Unfortunately, they are not an algebra in the Stone–Weierstrass Theorem 1 and even if they approximate all continuous functions, the proof of (10) is another problem.
5. Example of
In this section, we will study explicitly in the special case. Since is a convex hull, the set is also a convex hull, hence a finite union of simplexes.
First of all, we note that a point is not a vertex if and only if there is a non-zero vector such that holds for any in a short open interval containing 0, that is, the following two hold for :
Hence a point is not a vertex if and only if there is a non-zero vector satisfying the following.
Another approach is as follows: Since the set is the convex hull of , , and , the vertices of are the set of the intersection of the line segment connecting the points and , and the -dimensional plane S. Hence, for , a vector on is on if and only if . Note that
The shape of is highly dependent on the polynomial . We will give two examples.
Example 1.
Suppose that the polynomial has only a trivial linear relation among roots, i.e., , and write
then
The vertices of are the following vectors:
with non-negative integers satisfying and
Because, if satisfies three strict inequalities , then for any η sufficiently close to 0, the vector , replacing by , respectively, is still in , that is, a short segment containing is in , thus is not a vertex. Therefore, if is a vertex, then we have . Suppose that a point ( and ) is a vertex. If , then the vector satisfies condition (11), therefore, is not a vertex. Thus, we have , and similarly , hence . These are the cases of , , . Next, suppose is a vertex with and . In case of , is not a vertex, since the vector satisfies (11). Thus, is of the form or , hence with , with or with . Lastly, in the case of , with is obvious.
The convex hull is a simplex if and only if , and vertices of are
and those of are
Assume that the permutation is the identity and . We can take , , …, , thus,
and
Then, we have
and for and , we see
and so by (7).
In case of , the vertices of X are
In case of , the vertices of X are
To describe the volume of , let us introduce the Eulerian numbers for . They are defined recursively by
more explicitly
and the volume of
is given by , where is the integer satisfying ([10]).
Proposition 2.
We see that
and for an integer k ,
Proof.
We note that is the -dimensional volume here. Let be the angle between two hyperplanes defined by and , respectively, that is, the angle between the vectors and , hence . Since a permutation acts on and on the set as an orthogonal transformation and the dimension of the set defined by and is , is equal to the volume of the set
hence, we see that
and the projection from to is bijective by , we have Now, we have
□
Last, letting for integers , we see that Conjecture 2 means
When the polynomial has only a trivial linear relation among roots, Proposition 2 gives the above ratio.
Example 2.
Suppose that an irreducible polynomial is of degree 4 and has a non-trivial linear relations among roots, then it is of the form for quadratic polynomials ([1]). For roots of , take the complex numbers such that , . Then, are the roots of which satisfy relations . They are the basis of , i.e., , . Hence, we may take ; then we have
It is easy to see that , and then the vertices are , , .
Assume and ; then we find
and
Then we see that
and
The vertices corresponding to are , , .
Here, let us discuss the topic mentioned at the end of the third section.
We have
and
hence,
Thus, the condition that are mutually distinct and is an integer for every is , , and . And we see by
where with and . Do these functions under the above restrictions on with constant functions approximate continuous functions on ?
6. Calculation of the Integral
Finally, we will evaluate the integral in (10).
Lemma 2.
Let m be a positive integer. For mutually distinct real numbers , write , we have
and the integral vanishes if all are integers. Moreover, we have
i.e.,
and for a polynomial
Proof.
Denote the integral by . We use induction on m. It is easy to see that and is equal to
The assumption of induction easily completes the proof of the first equality. With respect to the transform to , we use the Vandermonde determinant:
For the second identities, replace by , then we have
Therefore, the coefficient of vanishes if and is if .
□
Theorem 3.
Let and let be their distinct numbers, i.e., and . Then, we have
where the indexes run over .
Proof.
Let be mutually distinct numbers and put ; then we see that is not 0 for a non-zero number is sufficiently close to 0 if . By Lemma 2, we have
where
and
From now on, the notations and will mean the sum and the product on under the condition . First, we see that
where .
Next, we see that
where . Here, we note that depends only on containing j by the equation . Moreover, by
we see
where , and
where , therefore, we have
Thus, we have
Here, by the equality
the product is equal to
hence,
The partial sum on is
applying (12) to the sum on with for there, which is equal to
Thus, we have
which completes the proof. □
Funding
This research received no external funding.
Data Availability Statement
The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.
Conflicts of Interest
The author declares no conflicts of interest.
References
- Kitaoka, Y. Notes on the distribution of roots modulo a prime of a polynomial. Unif. Distrib. Theory 2017, 12, 91–116. [Google Scholar] [CrossRef] [Scilit]
- Kitaoka, Y. Statistical distribution of roots of a polynomial modulo primes III. Int. J. Stat. Probab. 2018, 7, 115–124. [Google Scholar] [CrossRef] [Scilit]
- Kitaoka, Y. Notes on the distribution of roots modulo a prime of a polynomial II. Unif. Distrib. Theory 2019, 14, 87–104. [Google Scholar] [CrossRef] [Scilit]
- Kitaoka, Y. Notes on the distribution of roots modulo a prime of a polynomial III. Unif. Distrib. Theory 2020, 15, 93–104. [Google Scholar] [CrossRef] [Scilit]
- Kitaoka, Y. Notes on the distribution of roots modulo a prime of a polynomial IV. Unif. Distrib. Theory 2023, 18, 9–30. [Google Scholar] [CrossRef] [Scilit]
- Kuipers, L.; Niederreiter, H. Uniform Distribution of Sequences; John Wiley & Sons: Hoboken, NJ, USA, 1974. [Google Scholar]
- Brosowski, B.; Deutsch, F. An elementary proof of Stone-Weierstrass theorem. Proc. Amer. Math. Soc. 1981, 81, 89–92. [Google Scholar] [CrossRef]
- Duke, W.; Friedlander, J.B.; Iwaniec, H. Equidistribution of roots of a quadratic congruence to prime moduli. Ann. Math. 1995, 141, 423–441. [Google Scholar] [CrossRef] [Scilit]
- Tóth, Á. Roots of Quadratic congruences. Int. Math. Res. Not. 2000, 719–739. [Google Scholar] [CrossRef]
- Feller, W. An Introduction to Probability Theory and Its Applications; John Wiley & Sons: New York, NY, USA, 1966; Volume 2. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).