Next Article in Journal
Efficient Evaluation of Sobol’ Sensitivity Indices via Polynomial Lattice Rules and Modified Sobol’ Sequences
Previous Article in Journal
Estimating the Number of Junta Variables for Optimizing Boolean Functions in Quantum Memories
Previous Article in Special Issue
On the Product of Zeta-Functions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Notes on the Distribution of Roots Modulo a Prime of a Polynomial V: Weyl’s Criterion

by
Yoshiyuki Kitaoka
Independent Researcher, Nagoya 468-0073, Aichi, Japan
Mathematics 2025, 13(21), 3401; https://doi.org/10.3390/math13213401
Submission received: 3 September 2025 / Revised: 26 September 2025 / Accepted: 20 October 2025 / Published: 25 October 2025
(This article belongs to the Special Issue Analytic Methods in Number Theory and Allied Fields)

Abstract

Let f ( x ) be a monic integral polynomial of degree n and p a prime number, for which f ( x ) is fully decomposable modulo p. Let r 1 , , r n be the roots of f ( x ) mod p with 0 r 1 r n < p . We have conjectured that the sequence of ( r 1 , , r n ) / p 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 f ( x ) Z [ x ] , we proposed several conjectures about the distribution of roots of f ( x ) 0 mod p 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
f ( x ) = x n + a n 1 x n 1 + + a 0 ( a 0 , , a n 1 Z )
be of degree n with complex roots α 1 , , α n . We fix the numbering of roots once and for all and define vector spaces L R 0 , L R over the rational number field Q by
L R 0 : = { ( l 1 , , l n ) Q n i = 1 n l i α i Q } , L R : = { ( l 1 , , l n + 1 ) Q n + 1 i = 1 n l i α i = l n + 1 } .
The non-zero vector ( 1 , , 1 , a n 1 ) is always in L R . Hence, we see clearly that
1 t : = dim Q L R 0 = dim Q L R n .
We say that a polynomial f ( x ) has a non-trivial linear relation among roots if t > 1 . We know that if there is only a trivial linear relation, then the polynomial f ( x ) is irreducible, and that if f ( x ) is irreducible and deg f ( x ) = n is prime or the Galois group of f ( x ) is isomorphic to the symmetric group S n , then there is only a trivial linear relation among roots (cf. [1]).
We take and fix a Z -basis of L R 0 Z n
m j : = ( m j , 1 , , m j , n ) ( j = 1 , , t ) ,
and write
m j : = i = 1 n m j , i α i ( Z ) ( j = 1 , , t ) .
We may take m 1 = ( 1 , , 1 ) , m 1 = a n 1 .
We introduce the following two groups associated with them:
G ^ : = { σ S n σ ( L R ) L R } , G : = { σ S n σ ( L R 0 ) L R 0 } ,
where the action of a permutation σ S n for x = ( x 1 , , x n ) R n , x R is defined by the following.
σ ( x ) : = ( x σ 1 ( 1 ) , , x σ 1 ( n ) ) , σ ( ( x , x ) ) : = ( σ ( x ) , x ) .
If f ( x ) has only a trivial linear relation among roots, then ( 1 , , 1 , a n 1 ) is a basis of L R Z n + 1 , hence G ^ = G = S n .
Next, in this paper, it is assumed that the letter p denotes a prime number, and put
Spl X ( f ) : = p X f ( x ) is fully splitting modulo p
for a positive number X and Spl ( f ) : = Spl ( f ) .
We require the following two conditions on the local roots r 1 , , r n ( Z ) of f ( x ) 0 mod p for a prime p Spl ( f ) :
f ( x ) i = 1 n ( x r i ) mod p , 0 r 1 r 2 r n < p .
We are concerned with the distribution of the vectors ( r 1 / p , , r n / p ) and ( r 1 , , r n ) for p Spl ( f ) .
To state conjectures, we need to introduce the following notation.
Spl X ( f , σ ) : = p Spl X ( f ) i = 1 n m j , i r σ ( i ) m j mod p ( 1 j t ) , Spl X ( f , σ , { k j } ) : = p Spl X ( f , σ ) i = 1 n m j , i r σ ( i ) = m j + k j p ( 1 j t ) .
We note that
Spl X ( f ) = σ S n Spl X ( f , σ ) , Spl X ( f , σ ) = { k j } Z t Spl X ( f , σ , { k j } ) ,
where the set Spl X ( f , σ , { k j } ) is non-empty only for a finite number of { k j } Z t . Furthermore, for integers L ( > 1 ) , R 1 , , R n we put
Spl X ( f , σ , { k j } , L , { R i } ) : = { p Spl X ( f , σ , { k j } ) r i R i mod L ( 1 i n ) }
and we define densities by
Pr ( f , σ ) : = lim X # Spl X ( f , σ ) # Spl X ( f ) , Pr ( f , σ , { k j } ) : = lim X # Spl X ( f , σ , { k j } ) # Spl X ( f , σ ) , Pr ( f , σ , { k j } , L , { R i } ) : = lim X # Spl X ( f , σ , { k j } , L , { R i } ) # Spl X ( f , σ , { k j } ) ,
where for the last two, the denominators # Spl X ( f , σ ) , # Spl X ( f , σ , { k j } ) 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 Spl X ( f , σ ) = Spl X ( f ) , i.e., Pr ( f , σ ) = 1 and Spl X ( f , σ , { k j } ) is independent of the permutation σ .
Next, we introduce the following geometric objects:
Δ : = x = ( x 1 , , x n ) R n 0 x 1 x n 1 , D ^ n : = ( x 1 , x n ) Δ i = 1 n x i Z , D ( f , σ ) : = ( x 1 , x n ) Δ i = 1 n m j , i x σ ( i ) Z ( 1 j t ) , D ( f , σ , { k j } ) : = ( x 1 , , x n ) Δ i = 1 n m j , i x σ ( i ) = k j ( 1 j t ) .
We note that D ( f , σ , { k j } ) D ( f , σ ) D ^ n Δ and
D ( f , σ ) = { k j } Z t D ( f , σ , { k j } ) ( a finite union ) ,
and so D ( f , σ ) is disconnected, in general.
If the set Spl ( f , σ , { k j } ) is an infinite set, every accumulation point x = ( x 1 , , x n ) of ( r 1 / p , , r n / p ) [ 0 , 1 ) n for p Spl ( f , σ , { k j } ) is in D ( f , σ , { k j } ) by i m j , i r σ ( i ) = m j + k j p . If m j = 0 holds for every j  ( 1 j t ) , then ( r 1 / p , , r n / p ) is in D ( f , σ , { k j } ) . Otherwise, it is not in D ( f , σ , { k j } ) . This is troublesome. The dimension of D ^ n is n 1 and that of D ( f , σ ) and D ( f , σ , { k j } ) is less than or equal to n t . In the following, the volume vol of sets D ( f , σ ) and D ( f , σ , { k j } ) means that as a subset of an ( n t ) -dimensional set ( x 1 , x n ) R n i = 1 n m j , i x σ ( i ) Z ( 1 j t ) , that is, for a subset S in v + R [ v 1 , , v n t ] ( R n ) with orthonormal vectors v 1 , , v n t R n , we identify v + y i v i S with a point ( y 1 , , y n t ) R n t . So, vol ( D ( f , σ ) ) = 0 holds if dim D ( f , σ ) < n t .
If there is only a trivial linear relation among roots, then D ( f , σ ) is equal to D ^ n for every permutation σ , and D ^ n is equal to
{ ( 0 , , 0 ) , ( 1 , , 1 ) } k = 1 n 1 { x Δ x i = k } .
The first conjecture is the following:
Conjecture 1. 
For a permutation  σ S n  with  Pr ( f , σ ) > 0 , the ratio
c = vol ( D ( f , σ ) ) Pr ( f , σ )
is independent of  σ . If  G = G ^  holds, then two conditions  Pr ( f , σ ) > 0  and  vol ( D ( f , σ ) ) > 0  are equivalent.
We note that if f ( x ) has no rational root and α i α j Q for any distinct i , j , then the condition # Spl ( f , σ , { k j } ) = implies vol ( D ( f , σ , { k j } ) ) > 0 , in particular vol ( D ( f , σ ) ) > 0 if Pr ( f , σ ) > 0 , and that under the following three conditions: (i) f ( x ) is not a product of linear forms, (ii) α i α j Q if i j , and (iii) vol ( D ( f , σ ) ) = c Pr ( f , σ ) holds for every σ S n , we have
c = det ( ( m i , m j ) ) 1 i , j t # G ^ .
If f ( x ) has only a trivial linear relation among roots, then Pr ( f , σ ) is equal to 1, and by property D ( f , σ ) = D ^ n for all σ S n Conjecture 1 is obviously true with c = n n ! (cf. Proposition 2).
The second is as follows:
Conjecture 2. 
Let a set D be of the form  D = { x R n j = 1 n d i , j x j d i ( i = 1 , , l ) }  such that all  d i , j , d i  are rational and  j = 1 n d i , μ ( j ) α j Q  holds for all  1 i l  and  μ S n . Then for a permutation  σ  such that  Pr ( f , σ ) > 0  and  vol ( D ( f , σ ) ) > 0 , we have
Pr D ( f , σ ) : = lim X # { p Spl X ( f , σ ) ( r 1 / p , , r n / p ) D } # Spl X ( f , σ ) = vol ( D D ( f , σ ) ) vol ( D ( f , σ ) ) .
Next, to state the conjecture on Pr ( f , σ , { k j } , L , { R i } ) for integers L ( > 1 ) , R i ( i = 1 , , n ) as above, we introduce the following condition ( C 1 ) to L , R i , which is a necessary condition for # Spl ( f , σ , { k j } , L , { R i } ) = :
( C 1 ) : ( k j , L ) = ( i m j , i R σ ( i ) m j , L ) ( = d j , say) for j = 1 , , t and there is an integer q which satisfies (i) q is independent of j, (ii) q is relatively prime to L, (iii) i m j , i R σ ( i ) m j k j · q mod L and [ [ q ] ] = [ [ 1 ] ] on Q ( f ) Q ( ζ L / d j ) for every j = 1 , , t .
  • Here, ζ l denotes a primitive lth root of unity, and for a subfield F in Q ( ζ l ) and an integer q relatively prime to l, [ [ q ] ] denotes the automorphism of F induced by ζ l ζ l q . The condition [ [ q ] ] = [ [ 1 ] ] on Q ( f ) Q ( ζ L / d j ) is trivially satisfied if Q ( f ) Q ( ζ L / d j ) = Q . To see that condition ( C 1 ) is necessary, it is sufficient to take a prime p Spl ( f , σ , { k j } ) with p > L as q in ( C 1 ) , noting ( k j , L ) = ( k j p , L ) .
By writing
R ( f , σ , { k j } , L ) : = { { R i } [ 0 , L 1 ] n ( C 1 ) is satisfied } ,
the last conjecture is the following.
Conjecture 3. 
Under the assumption  # Spl ( f , σ , { k j } ) = ,
Pr ( f , σ , { k j } , L , { R i } ) = 1 # R ( f , σ , { k j } , L ) i f { R i } R ( f , σ , { k j } , L ) , 0 otherwise .
When f ( x ) = x + a , 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 { x n } n = 1 ( 0 x n < 1 ) on the interval [ 0 , 1 ) 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 ( r 1 / p , , r n / p ) R n accumulates a convex hull in a lower dimensional plane S R n , 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 r i / p , and in [5], we confirmed that Conjectures appear to be true for a complicated domain D = { ( x 1 , , x n ) ( 0 , 1 ) n x i Z , { N x i } < { M x i } ( i ) } by evaluating the volume, where { x } 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 { x n } , x n [ 0 , 1 ) , n = 1 , 2 , is uniformly distributed modulo 1 if and only if the following equation
lim N 1 N n = 1 N F ( x n ) = 0 1 F ( x ) d x
is satisfied for F ( x ) = exp ( 2 π i h x ) ( h Z ) . Usually, the right-hand side is replaced by “0 for h 0 ”, omitting the trivial case h = 0 . The proof proceeds as follows:
  • A sequence { x n } , x n [ 0 , 1 ) , n = 1 , 2 , is uniformly distributed modulo 1 if and only if the Equation (2) holds for the characteristic function of every interval in [ 0 , 1 ) , which is identified with the compact space R / Z .
  • Approximating a continuous function F ( x ) ( F ( 0 ) = F ( 1 ) ) on [ 0 , 1 ] 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.
  • Approximating a continuous function F ( x ) ( F ( 0 ) = F ( 1 ) ) on [ 0 , 1 ] by trigonometric functions exp ( 2 π i h x ) ( h Z ) , one shows that (2) is true for continuous functions F ( x ) if and only if Equation (2) is true for trigonometric functions exp ( 2 π i h x ) ( h Z ) .
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 C ( T ) be the algebra of all R -valued continuous functions on T. Suppose that A is a subalgebra of C ( T ) such that ( i ) A contains every constant function, ( ii ) for distinct points x , y T , there is a function g A such that g ( x ) g ( y ) . Then a continuous function f on T is approximated by functions in A by the supremum norm | | f | | : = sup x T | f ( x ) | .
The proof in [7] is simple and easy.
Our target space for Conjecture 2 is not [ 0 , 1 ) but D ( f , σ ) or its component D ( f , σ , { k j } ) .

3. Geometry of D ( f , σ , { k j } )

In this section, we suppose that the polynomial f ( x ) has no rational root and is not of the form g ( x ) g ( x c ) h ( x ) ( g ( x ) , h ( x ) Z [ x ] , c Z ) , and write simply
D : = D ( f , σ , { k j } ) = ( x 1 , , x n ) Δ i = 1 n m j , i x σ ( i ) = k j ( 1 j t ) .
First, we note that the matrix whose rows are m 1 , , m t defined in Section 1 is primitive, that is, elementary divisors of the ( t , n ) -matrix with the ith row m i are 1 only, hence we can supplement the bases m 1 , , m t of linear relations among roots by integral vectors m t + 1 , , m n such that the ( n , n ) -matrix M = ( m i , j ) with the ith row m i is in S L n ( Z ) , and put
σ ( M ) : = ( m i , σ 1 ( j ) ) ,
that is, its i-th row is σ ( m i ) . Then, writing
S : = { x R n ( x , σ ( m i ) ) = k i ( 1 i t ) } ,
we have
D = Δ S ,
and by the transformation x y : = x t ( σ ( M ) ) we see that, noting ( x , σ ( m i ) ) = ( x t ( σ ( M ) ) , σ ( m i ) σ ( M ) 1 ) = y i
S t ( σ ( M ) ) = { ( y 1 , , y n ) R n y i = k i ( 1 i t ) } .
The dimension of the set D is at most n t , which is the dimension of the supporting space S . Noting that, via
( x 1 , , x n ) = ( u 1 , , u n ) 1 1 1 0 1 1 0 0 1 ,
Δ = { x 0 x 1 x n 1 } = i = 1 n u i w i u i 0 , i = 1 n u i 1 ,
with w 1 : = ( 1 , , 1 ) , w 2 : = ( 0 , 1 , , 1 ) , , w n : = ( 0 , , 0 , 1 ) , the set Δ is the convex hull with vertices w 1 , , w n and the origin w n + 1 : = O , that is
Δ = i = 1 n + 1 u i w i u i 0 , i = 1 n + 1 u i = 1 ,
hence, we see that D ( = D ( f , σ , { k j } ) ) is also a convex hull, so a finite union of simplexes.
Denote the i-th row of the matrix t ( σ ( M ) ) 1 by m i , that is,
m 1 m n = t σ ( M ) 1 , i . e . , ( m i , σ ( m j ) ) = δ i , j ,
and put
m σ : = i = 1 t m i m i .
Lemma 1. 
Write r : = ( r 1 , , r n ) for local roots r i for p Spl ( f , σ , { k j } ) ; then we have
S t ( σ ( M ) ) = { ( k 1 , , k t , y t + 1 , , y n ) y t + 1 , , y n R } , m σ t ( σ ( M ) ) = ( m 1 , , m t , 0 , , 0 ) , ( r m σ ) / p S .
and
( r m σ ) / p Δ
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 m σ , and the third comes from ( m σ , σ ( m j ) ) = m j and ( r , σ ( m j ) ) = m j + k j p ( j = 1 , , t ) by the definition of the vector of local roots r i for p Spl ( f , σ , { k j } ) . Write m σ = ( c 1 , , c n ) . If ( r m σ ) / p Δ happens for infinitely many primes p, then one of conditions 0 r 1 < c 1 , 0 r i + 1 r i < c i + 1 c i or 0 < p r n < c n occurs for infinitely many primes, hence one of r 1 = c , r i + 1 r i = c or r n p = c for some constant c occurs for infinitely many primes. This means f ( c ) 0 mod p , f ( r i ) f ( r i + c ) 0 mod p , f ( c ) 0 mod p , respectively. The first or third condition easily implies that the polynomial f ( x ) has a rational root c. The second implies that the polynomial f is of the form g ( x ) g ( x c ) h ( x ) . Because, if the identity r i + 1 r i = c holds for infinitely many primes, then f ( r i + c ) f ( r i ) 0 mod p holds for infinitely many primes, which implies ( f ( x ) , f ( x + c ) ) 1 (resp. ( f ( x ) , f ( x ) ) 1 ) for c 0 (resp. c = 0 ), Hence, in the case of c 0 , there is a decomposition f ( x ) = g ( x ) h ( x ) , f ( x + c ) = g ( x ) k ( x ) for an irreducible polynomial g ( x ) , i.e., f ( x ) is divisible by g ( x ) g ( x c ) . If c = 0 , then f ( x ) is of the form g ( x ) 2 h ( x ) . □
Proposition 1. 
Let D be the set of the form referred to in Conjecture 2, that is,
D = x R n j = 1 n d i , j x j d i ( i = 1 , , l )
with all d i , j , d i being rational and suppose that j = 1 n d i , j α μ ( j ) Q holds for all 1 i l and all permutations μ. Write
S : = { p Spl ( f , σ , { k j } ) r / p D } , T : = { p Spl ( f , σ , { k j } ) ( r m σ ) / p D } ,
then two sets S T and T S are finite sets, in particular, there exists a constant κ D dependent on D such that
{ p Spl ( f , σ , { k j } ) r / p D , p > κ D } = { p Spl ( f , σ , { k j } ) ( r m σ ) / p D , p > κ D } ,
is true for the set D.
Proof. 
Write m σ = ( c 1 , , c n ) , and let d be a positive integer such that all d d i , j , d d i are integers. Let us show the contradiction under the supposition # ( S T ) = , that is, there are infinitely many primes p Spl ( f ) such that r / p D and ( r m σ ) / p D ; then the supposition implies j d i , j r j p d i for all i and j d k , j ( r j c j ) > p d k for some k, hence j d k , j c j < j d k , j r j p d k 0 , where j d k , j c j is a constant independent of p and d ( j d k , j r j p d k ) is an integer. Therefore, there are infinitely many primes p Spl ( f ) such that d ( j d k , j r j p d k ) = κ for some integer κ satisfying d j d k , j c j < κ 0 . Taking a prime ideal p of Q ( α 1 , , α n ) over p, we see that there are infinitely many prime ideals p and a permutation μ such that α μ ( j ) r j mod p , hence d j d k , j α μ ( j ) κ mod p , which implies d j d k , j α μ ( j ) = κ , i.e., j d k , j α μ ( j ) = κ / d Q , that is a contradiction. The case of r / p D and ( r m σ ) / p D is similarly proved. □
If a polynomial f ( x ) has no rational root, then the typical example of the set D in the proposition is
{ x R n a i x i b i for   all   i = 1 , , n }
with all a i , b i being rational, since vectors ( d i , 1 , , d i , n ) in Proposition 1 are ( 0 , , 0 , ± 1 , 0 , , 0 ) , which is in L R 0 if and only if f ( x ) has a rational root.
In case of m j 0 for some 1 j t , every vector r / p for p Spl ( f , σ , { k j } ) is not in S , but every accumulation point is in D S . 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.
# { p Spl X ( f , σ , { k j } ) r / p D } # Spl X ( f , σ , { k j } ) = # { p Spl X ( f , σ , { k j } ) ( r m σ ) / p D } # Spl X ( f , σ , { k j } ) + o ( 1 ) ,
where the error term o ( 1 ) depends on D by Proposition 1, and every vector ( r m σ ) / p and every accumulation point are in the same set S by Proposition 1.
Thus, for the set D in Proposition 1, Equation (1) in Conjecture 2 is equivalent to
lim X # { p Spl X ( f , σ , { k j } ) ( r m σ ) / p D D } # Spl X ( f , σ , { k j } ) = vol ( D D ) vol ( D ) ,
where it should be emphasized that the vector ( r m σ ) / p is on D = Δ S except for a finite number of primes in Spl ( f , σ , { k j } ) that depend not on D but only on the polynomial f ( x ) , according to Lemma 1. So, it is equivalent to
lim X 1 # Spl X ( f , σ , { k j } ) p Spl X ( f , σ , { k j } ) F ( ( r m σ ) / p ) = 1 vol ( D ) D F ( x ) d x ,
for the characteristic function F of the set D D , hence, for a continuous function F on S . The reduction step (4) seems to be unavoidable.
Applying Conjecture 2 to D i , a = { ( x 1 , , x n ) [ 0 , 1 ) n x i a } , we have the following theorem (cf. [2,4]).
Theorem 2. 
If a polynomial f ( x ) has no rational root, α i α j Q holds for any distinct i , j , and the conditions Pr ( f , σ ) > 0 and vol ( D ( f , σ ) ) > 0 are equivalent, then Conjectures 1 and 2 imply the equi-distribution of r i / p for local roots r i of the polynomial.
For a polynomial f ( x ) with no non-trivial linear relations among roots, the above can be proved by evaluating the density
lim X # { p Spl X ( f ) r i / p < a } # Spl X ( f )
explicitly, and the graph of the difference in the above density and the approximate values at X = 10 10 m ( 1 m 300 ) for f ( x ) = ( x 7 1 ) / ( x 1 ) is also provided in [2]. Some numerical data of Conjectures are also provided in [1,3].
The equi-distribution of r i / p for an irreducible polynomial f ( x ) in Theorem 2 has been proven to hold without the assumptions of Conjectures 1, 2, but only for n = 2 ([8,9]). For n 3 , 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 D in a straightforward way to see. To perform this, let us restate the definitions:
Δ = { x = ( x 1 , , x n ) R n 0 x 1 x n 1 } , S = { x R n ( x , σ ( m j ) ) = k j ( j = 1 , , t ) } , D = D ( f , σ , { k j } ) = { ( x 1 , , x n ) Δ i = 1 n m j , i x σ ( i ) = k j ( 1 j t ) } = Δ S .
Writing
S 0 : = { x R n ( x , σ ( m j ) ) = 0 ( 1 j t ) } = R [ m t + 1 , , m n ] ( by ( 3 ) ) ,
we have
S = x 0 + S 0 = x 0 + R [ m t + 1 , , m n ] for   x 0 S 0 , D = Δ { x 0 + R [ m t + 1 , , m n ] } ,
and since ( x , σ ( m j ) ) = ( x σ t ( M ) , σ ( m j ) σ ( M ) 1 ) is the j-th entry of x σ t ( M ) , we see
S 0 t σ ( M ) = { x R n x 1 = = x t = 0 } , S t σ ( M ) = { x R n x j = k j ( 1 j t ) } .
To specify the vector x 0 , we introduce the following matrix.
M ˜ : = σ ( M ) σ t ( M ) = M M t = M 1 ( t ) M 2 ( t , n t ) M 2 t M 4 = M 1 ( t ) 0 ( t , n t ) 0 M 4 M 1 1 [ M 2 ] 1 t M 1 1 M 2 0 ( n t , t ) 1 n t ,
where A [ B ] means B t A B , we have
M ˜ 1 = M 1 1 0 0 ( M 4 M 1 1 [ M 2 ] ) 1 1 t 0 ( M 1 1 M 2 ) t 1 n t = ( M 4 M 1 1 [ M 2 ] ) 1 .
Here, the matrices M 1 , M 4 M 1 1 [ M 2 ] are regular, since the matrix M M t is positive definite.
Using the above matrices, let us specify the vector x 0 as follows:
x 0 : = ( k 1 , , k t ) m 1 m t + ( k 1 , , k t ) M 1 1 M 2 m t + 1 m n = ( k 1 , , k t ) ( ( 1 t , 0 ( t , n t ) ) + ( 0 ( t , t ) , M 1 1 M 2 ) ) σ t ( M ) 1 = ( k 1 , , k t ) M 1 1 ( M 1 , M 2 ) σ t ( M ) 1 = ( k 1 , , k t ) M 1 1 ( 1 t , 0 ( t , n t ) ) M ˜ σ t ( M ) 1 = ( k 1 , , k t ) ( M 1 1 , 0 ( t , n t ) ) σ ( M ) .
Thus, we have x 0 σ t ( M ) = ( k 1 , , k t ) ( 1 t , M 1 1 M 2 ) S t σ ( M ) , which implies x 0 S . Let us see ( x 0 , S 0 ) = 0 , which is equivalent to
x 0 ( m t + 1 t , , m n t ) = 0 ( 1 , n t ) ,
which follows from
x 0 ( m t + 1 t , , m n t ) = ( k 1 , , k t ) ( M 1 1 , 0 ( t , n t ) ) σ ( M ) ( m t + 1 t , , m n t ) = ( k 1 , , k t ) ( M 1 1 , 0 ( t , n t ) ) 0 ( t , n t ) 1 n t = 0 ( 1 , n t ) .
Next, let the vectors f i R n ( i = t + 1 , , n ) be an orthonormal basis f i of S 0 , hence, there is a matrix C ( n t , n t ) such that
m t + 1 m n = C f t + 1 f n ,
therefore,
C C t = ( ( m i , m j ) ) t + 1 i , j n = ( M 4 M 1 1 [ M 2 ] ) 1 ,
since the above matrix is the submatrix of
( ( m i , m j ) ) 1 i , j n = σ t ( M ) 1 σ ( M ) 1 = M ˜ 1 .
Hence, we have
| det C | = det M 1 .
Let the vertices of D be { u i } , hence, D = { c i u i c i 0 , c i = 1 } , and in view of (6) we write
X : = { ( x t + 1 , , x n ) R n t x 0 + j = t + 1 n x j m j D }
and define the bijective mapping ψ from X to D by
ψ : x = ( x t + 1 , , x n ) X u = x 0 + j = t + 1 n x j m j D .
Then, we see that for x X
ψ ( x ) = u ( u x 0 ) σ t ( M ) = ( 0 ( 1 , t ) , x ) ,
and the vector x i X satisfying ψ ( x i ) = u i is the vertex of X, that is, X = { c i x i c i 0 , c i = 1 } .
Thus, for a function F on D = Δ S , we see
D F ( x ) d x = x 0 + j = t + 1 n y j f j D F ( x 0 + j = t + 1 n y j f j ) d y t + 1 d y n = F ( x 0 + ( y t + 1 , , y n ) C 1 m t + 1 m n ) d y t + 1 d y n = det ( M 1 ) ( x t + 1 , , x n ) X F ( x 0 + j = t + 1 n x j m j ) d x t + 1 d x n ,
hence, Equation (5) becomes
lim X 1 # Spl X ( f , σ , { k j } ) p Spl X ( f , σ , { k j } ) F ( ( r m σ ) / p ) = det ( M 1 ) vol ( D ) ( x t + 1 , , x n ) X F ( x 0 + j = t + 1 n x j m j ) d x t + 1 d x n ,
where m j is the jth row of the matrix σ t ( M ) 1 and M 1 = ( ( m i , m j ) ) 1 i , j t as before.
Writing X : = k X k for the simplexes with vertices x k , 1 , , x k , n t + 1 , we have the following:
lim X 1 # Spl X ( f , σ , { k j } ) p Spl X ( f , σ , { k j } ) F ( ( r m σ ) / p ) = det ( M 1 ) vol ( D ) k ( x t + 1 , , x n ) X k F ( x 0 + j = t + 1 n x j m j ) d x t + 1 d x n .
Here, we may suppose that the vertices x k , i of X k are those of X .
The aim is to evaluate the integral for a trigonometric function as F on simplexes X i . Let m : = n t and X R m be a simplex with vertices x 1 , , x m + 1 for which m vectors x 1 x m + 1 , , x m x m + 1 are linearly independent. Then, we have
X : = i = 1 m + 1 y i x i y i 0 , i = 1 m + 1 y i = 1 = i = 1 m x i ( x i x m + 1 ) + x m + 1 x i 0 , i = 1 m x i 1 .
Writing V : = x 1 x m + 1 x m x m + 1 GL m ( R ) , we see that, first of all,
( x t + 1 , , x n ) X 1 d x t + 1 d x n = | det ( V ) | m ! ,
because, putting ( x t + 1 , , x n ) = ( y t + 1 , , y n ) V + x m + 1 , we see that the integral is equal to
| det ( V ) | y i 0 , y i 1 d y t + 1 d y n
transforming from y i to z t + i : = y t + 1 + + y t + i ( 0 z t + 1 z n 1 )
= | det ( V ) | vol ( Δ m ) ( Δ m = { ( z t + 1 , , z n ) 0 z t + 1 z n 1 } ) = | det ( V ) | m ! σ S m vol ( σ ( Δ m ) ) = | det ( V ) | m ! .
Hereafter, we will specify the function F ( x ) using the exponential function e ( x ) : = exp ( 2 π 1 x ) as follows:
F ( x ) : = e ( ( x , c ) ) for   c R n ,
and we will evaluate the integral on the simplex in the last section. Then, the integral
( x t + 1 , , x n ) X F ( x 0 + j = t + 1 n x j m j ) d x t + 1 d x n
is
e ( ( x 0 , c ) ) ( x t + 1 , , x n ) X e ( j = t + 1 n x j ( m j , c ) ) d x t + 1 d x n
writing C : = ( ( m t + 1 , c ) , , ( m n , c ) ) , we see j = t + 1 n x j ( m j , c ) = ( x , C ) = ( y V + x m + 1 , C ) ,
= e ( ( x 0 , c ) + ( x m + 1 , C ) ) | det ( V ) | y i 0 , y i 1 e ( y V C t ) d y t + 1 d y n
Therefore, Equation (9) is, furthermore,
lim X 1 # Spl X ( f , σ , { k j } ) p Spl X ( f , σ , { k j } ) e ( ( r m σ ) / p , c ) ) = det ( M 1 ) e ( ( x 0 , c ) ) vol ( D ) k e ( ( x k , m + 1 , C ) ) | det ( V k ) | × x i 0 , x i 1 e ( ( x t + 1 , , x n ) V k C t ) ) d x t + 1 d x n ,
where the simplex X k and the vertex x k , i are those given at (9) and
V k : = x k , 1 x k , m + 1 x k , m x k , m + 1 and   C = ( ( m t + 1 , c ) , , ( m n , c ) )
for c R n .
If Equation (10) is true for every c Z n , then Equation (8) is true for every continuous function F on D by the Stone–Weierstrass theorem, and so is Conjecture 2. By Lemma 2 below, we see that the above integral vanishes if ( x k , 1 , C ) , , ( x k , m + 1 , C ) are mutually distinct and all differences ( x k , i , C ) ( x k , j , C ) are integers. Note that every vertex x k , j can be chosen in the set of vertices of X. Denote by C the set of vectors c R n such that for C = ( ( m t + 1 , c ) , , ( m n , c ) ) and the vertices x i of X, all inner products ( x i , C ) are mutually distinct and ( x i , C ) ( x j , C ) is an integer for every i , j . If the restrictions of functions e ( ( x t + 1 , , x n ) V k C t ) ) ( c C ) on X k and the constant functions approximate all continuous functions on D , 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 D ( f , σ , { k j } )

In this section, we will study D = D ( f , σ , { k j } ) explicitly in the special case. Since Δ is a convex hull, the set D = Δ S is also a convex hull, hence a finite union of simplexes.
First of all, we note that a point x = ( x 1 , , x n ) D is not a vertex if and only if there is a non-zero vector v = ( v 1 , , v n ) such that x + η v D holds for any η in a short open interval containing 0, that is, the following two hold for η :
0 x 1 + η v 1 x n + η v n 1 , i m j , σ 1 ( i ) ( x i + η v i ) = k j ( 1 j t ) .
Hence a point x D is not a vertex if and only if there is a non-zero vector v satisfying the following.
i m j , σ 1 ( i ) v i = 0 for j = 1 , , t , v i = 0 if x i = 0 , v i = v i + 1 if x i = x i + 1 , v i = 0 if x i = 1 .
Another approach is as follows: Since the set Δ is the convex hull of w 1 : = ( 1 , , 1 ) , w 2 : = ( 0 , 1 , , 1 ) , , w n : = ( 0 , , 0 , 1 ) , and w n + 1 = ( 0 , , 0 ) , the vertices of D = Δ S are the set of the intersection of the line segment w i w j ¯ connecting the points w i and w j , and the ( n t ) -dimensional plane S. Hence, for 1 i < j n + 1 , a vector v = u w i + ( 1 u ) w j ( 0 u 1 ) on w i w j ¯ is on S if and only if v σ t ( M ) = ( k 1 , , k t , , , ) . Note that
u w i + ( 1 u ) w j = ( 0 , , 0 i 1 , u , , u n i + 1 ) if j = n + 1 , ( 0 , , 0 i 1 , u , , u j i , 1 , , 1 n j + 1 ) if j n .
The shape of D is highly dependent on the polynomial f ( x ) . We will give two examples.
Example 1. 
Suppose that the polynomial f ( x ) has only a trivial linear relation among roots, i.e., t = 1 , and write
Δ k : = D ( f , σ , k ) = x Δ i = 1 n x i = k ( 0 k n ) ,
then
D ^ n = k = 0 n Δ k ( Δ 0 = { ( 0 , , 0 ) } , Δ n = { ( 1 , , 1 ) } ) .
The vertices of Δ k are the following k ( n k ) + 1 vectors:
P ( p , q , r ) : = ( 0 , , 0 p , ϵ , , ϵ q , 1 , , 1 r )
with non-negative integers p , q , r satisfying p + q + r = n and
p = n k , q = 0 i f r = k , k r + 1 q n r , ϵ = k r q i f 0 r k 1 .
Because, if x Δ k satisfies three strict inequalities x i < x i + 1 = = x i + a < x i + a + 1 = = x i + a + b < x i + a + b + 1 , then for any η sufficiently close to 0, the vector x ( η ) , replacing x i + 1 = = x i + a , x i + a + 1 = = x i + a + b by x i + a + η / a , x i + a + 1 η / b , respectively, is still in Δ k , that is, a short segment containing x is in Δ k , thus x is not a vertex. Therefore, if x = ( x 1 , , x n ) is a vertex, then we have # { x i i = 1 , , n } 3 . Suppose that a point x = ( x 1 , , x 1 p , x 2 , , x 2 q , x 3 , , x 3 r ) Δ k ( 0 x 1 < x 2 < x 3 1 and p , q , r > 0 ) is a vertex. If x 1 > 0 , then the vector v = ( 1 / p , , 1 / p , 1 / q , , 1 / q , 0 , , 0 ) satisfies condition (11), therefore, x is not a vertex. Thus, we have x 1 = 0 , and similarly x 3 = 1 , hence 0 < x 2 = ( k r ) / q < 1 . These are the ( k 1 ) ( n k 1 ) cases of 1 r k 1 , k r + 1 q < n r , p = n q r > 0 . Next, suppose x = ( x 1 , , x 1 s , x 2 , , x 2 t ) Δ k is a vertex with 0 x 1 < x 2 1 and s , t > 0 . In case of 0 < x 1 < x 2 < 1 , x is not a vertex, since the vector v = ( 1 / s , , 1 / s , 1 / t , , 1 / t ) satisfies (11). Thus, x is of the form ( 0 , , 0 , x 2 , , x 2 ) or ( x 1 , , x 1 , 1 , , 1 ) , hence x = ( 0 , , 0 , k / q , , k / q ) with 0 < k < q , p > 0 , r = 0 , ( 0 , , 0 , 1 , , 1 ) with r = k , q = 0 or ( ( k r ) / q , , ( k r ) / q , 1 , , 1 ) with 0 < ( k r ) / q < 1 , p = 0 , q , r > 0 . Lastly, in the case of x = ( x , , x ) , x = ( k / n , , k / n ) with q = n , p = r = 0 is obvious.
The convex hull Δ k is a simplex if and only if k = 1 , n 1 , and vertices of Δ 1 are
( 0 , , 0 n q , 1 q , , 1 q q ) ( 1 q n ) ,
and those of Δ n 1 are
( 1 1 q , , 1 1 q q , 1 , , 1 n q ) ( 1 q n ) .
Assume that the permutation σ is the identity and D = Δ k . We can take m 1 = ( 1 , , 1 ) , m 2 = ( 0 , 1 , 0 , , 0 ) , …, m n = ( 0 , , 0 , 1 ) , thus,
M = 1 1 1 0 1 n 1 0 , M 1 = 1 1 1 0 1 n 1 0
and
M M t = n 1 1 1 1 n 1 1 .
Then, we have
x 0 = k ( n 1 , 0 ( 1 , n 1 ) ) M = k n m 1 , X = ( x 2 , , x n ) R n 1 k n m 1 + ( j = 2 n x j , x 2 , , x n ) Δ k ,
and for x X and u D , we see
ψ ( x ) = u ( u k n m 1 ) M t = ( 0 , x ) ,
and so vol ( D ) = n · vol ( X ) by (7).
In case of k = 1 , the vertices of X are
( 0 , , 0 ) , ( 1 n , , 1 n n q 1 , 1 q 1 n , , 1 q 1 n q ) ( 1 q n 1 ) .
In case of k = n 1 , the vertices of X are
1 n , , 1 n , ( 1 n 1 q , , 1 n 1 q q 1 , 1 n , , 1 n n q ) ( 2 q n ) .
To describe the volume of Δ k , let us introduce the Eulerian numbers A ( n , k ) for 1 k n . They are defined recursively by
A ( 1 , 1 ) : = 1 , A ( n , k ) : = ( n k + 1 ) A ( n 1 , k 1 ) + k A ( n 1 , k ) ,
more explicitly
A ( n , k ) = j = 0 k ( 1 ) j n + 1 j ( k j ) n
and the volume of
{ x [ 0 , 1 ) n 1 x 1 + + x n 1 = k }
is given by E n ( k ) : = A ( n 1 , k ) / ( n 1 ) ! , where x is the integer satisfying x x < x + 1 ([10]).
Proposition 2. 
We see that
vol ( D ^ n ) = n n !
and for an integer k  ( 1 k n 1 ) ,
vol ( Δ k ) / vol ( D ^ n ) = E n ( k ) .
Proof. 
We note that vol is the ( n 1 ) -dimensional volume here. Let θ be the angle between two hyperplanes defined by x n = 0 and x i = k , respectively, that is, the angle between the vectors ( 0 , , 0 , 1 ) and ( 1 , , 1 ) , hence cos θ = 1 / n . Since a permutation acts on R n and on the set { x R n x i = k } as an orthogonal transformation and the dimension of the set defined by x i Z and x i = x i + 1 is n 2 , vol ( D ^ n ) is equal to the volume of the set
{ x 0 < x 1 < < x n < 1 , x i Z } ,
hence, we see that
vol ( D ^ n ) = 1 n ! vol ( { ( x 1 , , x n ) [ 0 , 1 ) n x i Z } )
and the projection ( x 1 , , x n ) ( x 1 , , x n 1 ) from { ( x 1 , , x n ) [ 0 , 1 ) n x i Z } to [ 0 , 1 ) n 1 is bijective by x 1 + + x n 1 + x n = x 1 + + x n 1 , we have n ! vol ( D ^ n ) cos θ = vol ( [ 0 , 1 ) n 1 ) = 1 . Now, we have
vol ( Δ k ) / vol ( D ^ n ) = n ! cos θ · vol ( { x D ^ n x i = k } ) = cos θ · vol ( { x [ 0 , 1 ) n x i = k } ) = cos θ · vol ( { x [ 0 , 1 ) n i = 1 n 1 x i = k } ) = vol ( { x [ 0 , 1 ) n 1 i = 1 n 1 x i = k } ) = E n ( k ) .
Last, letting D = { ( x 1 , , x n ) Δ | i = 1 n m j , i x σ ( i ) k j | 1 3 ( 1 j t ) } for integers k j , we see that Conjecture 2 means
lim X # { p Spl X ( f , σ ) | i = 1 n m j , i r σ ( i ) / p k j | 1 / 3 ( 1 j t ) } # Spl X ( f , σ ) = vol ( D ( f , σ , { k j } ) ) vol ( D ( f , σ ) ) .
When the polynomial f ( x ) has only a trivial linear relation among roots, Proposition 2 gives the above ratio.
Example 2. 
Suppose that an irreducible polynomial f ( x ) is of degree 4 and has a non-trivial linear relations among roots, then it is of the form g ( h ( x ) ) for quadratic polynomials g ( x ) , h ( x ) = x 2 + a x ([1]). For roots β 1 , β 2 of g ( x ) , take the complex numbers α 1 , , α 4 such that h ( α 1 ) = h ( α 4 ) = β 1 , h ( α 2 ) = h ( α 3 ) = β 2 . Then, α 1 , , α 4 are the roots of f ( x ) which satisfy relations α 1 + α 4 = α 2 + α 3 = a . They are the basis of L R 0 Z 4 , i.e., t = 2 , m 1 = ( 1 , 0 , 0 , 1 ) , m 2 = ( 0 , 1 , 1 , 0 ) . Hence, we may take m 3 : = ( 0 , 0 , 1 , 0 ) , m 4 : = ( 0 , 0 , 0 , 1 ) ; then we have
D : = D ( f , i d , k 1 , k 2 ) = { ( x 1 , , x 4 ) 0 x 1 x 4 1 , x 1 + x 4 = k 1 , x 2 + x 3 = k 2 } .
It is easy to see that dim D = 2 k 1 = k 2 = 1 , and then the vertices are v 1 = ( 0 , 0 , 1 , 1 ) , v 2 = 0 , 1 2 , 1 2 , 1 , v 3 = 1 2 , 1 2 , 1 2 , 1 2 .
Assume σ = id and k 1 = k 2 = 1 ; then we find
D = ( 1 x 4 , 1 x 3 , x 3 , x 4 ) R 4 1 2 x 3 x 4 1 ,
M = 1 2 H 0 1 2 , M 1 = 1 2 H 0 1 2   f o r   H = 0 1 1 0
and
M M t = 21 2 H H 1 2 .
Then we see that
x 0 = ( 1 , 1 ) ( 2 1 1 2 , 0 ( 2 , 2 ) ) M = 2 1 ( 1 , 1 , 1 , 1 )
and
X = { ( x 3 , x 4 ) R 2 2 1 ( 1 , 1 , 1 , 1 ) + ( x 4 , x 3 , x 3 , x 4 ) D } = ( x 3 , x 4 ) R 2 0 x 3 x 4 2 1 .
The vertices x i corresponding to v i are x 1 = 2 1 , 2 1 , x 2 = 0 , 2 1 , x 3 = ( 0 , 0 ) .
Here, let us discuss the topic mentioned at the end of the third section.
We have
m 3 = ( 0 , 1 , 1 , 0 ) , m 4 = ( 1 , 0 , 0 , 1 ) ,
and
C = ( ( m 3 , c ) , ( m 4 , c ) ) = ( c 3 c 2 , c 4 c 1 ) for   c = ( c 1 , c 2 , c 3 , c 4 ) ,
hence,
( x 1 , C ) = 2 1 ( c 3 + c 4 c 1 c 2 ) , ( x 2 , C ) = 2 1 ( c 4 c 1 ) , ( x 3 , C ) = ( 0 , 0 ) .
Thus, the condition that ( x i , C ) are mutually distinct and ( x i , C ) ( x j , C ) is an integer for every i , j is c 1 c 4 0 , c 2 c 3 0 , c 1 + c 2 ( c 3 + c 4 ) 0 , c 1 c 4 2 Z and c 2 c 3 2 Z . And we see by V = x 1 x 2
e ( ( x 3 , x 4 ) V C t ) = e ( 2 1 ( c 3 + c 4 c 1 c 2 ) x 3 + 2 1 ( c 4 c 1 ) x 4 ) = e ( ( n + m ) x 3 + n x 4 ) ,
where 2 n : = c 4 c 1 , 2 m : = c 3 c 2 with n , m Z , and n , m , n + m 0 . Do these functions under the above restrictions on c i with constant functions approximate continuous functions on X = { ( x 3 , x 4 ) 0 x 3 x 4 2 1 } ?

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 α 1 , , α m + 1 , write A i : = α i α m + 1 ( i = 1 , , m ) , we have
x i 0 , x i 1 e ( i = 1 m A i x i ) d x 1 d x m = 1 ( 2 π i ) m i = 1 m e ( A i ) A i 1 j m , j i ( A i A j ) + 1 1 j m ( A j ) , = 1 ( 2 π i ) m i = 1 m + 1 e ( α i α m + 1 ) 1 j m + 1 , j i ( α i α j ) = ( 1 ) m e ( α m + 1 ) ( 2 π i ) m e ( α 1 ) e ( α 2 ) e ( α m + 1 ) 1 1 1 α 1 α 2 α m + 1 α 1 m 1 α 2 m 1 α m + 1 m 1 1 1 1 α 1 α 2 α m + 1 α 1 m α 2 m α m + 1 m
and the integral vanishes if all A i are integers. Moreover, we have
i = 1 m 1 A i 1 j m , j i ( A i A j ) + 1 1 j m ( A j ) = 0 ,
i.e.,
i = 1 m + 1 1 1 j m + 1 , j i ( α i α j ) = 0 ,
and for a polynomial g ( x ) = c m 1 x m 1 + c m 2 x m 2 +
i = 1 m g ( A i ) 1 j m , j i ( A i A j ) = c m 1 .
Proof. 
Denote the integral by S ( A 1 , , A m ) . We use induction on m. It is easy to see that S ( A 1 ) = e ( A 1 ) 1 2 π i A 1 and S ( A 1 , , A m ) is equal to
x 1 , , x m 1 0 , i = 1 m 1 x i 1 0 x m 1 x 1 x m 1 e ( A i x i ) d x m d x 1 d x m 1 = x 1 , , x m 1 0 , i = 1 m 1 x i 1 e ( i = 1 m 1 A i x i ) 2 π i A m e ( A m ( 1 i = 1 m 1 x i ) ) 1 d x 1 d x m 1 = e ( A m ) 2 π i A m S ( A 1 A m , , A m 1 A m ) S ( A 1 , , A m 1 ) 2 π i A m .
The assumption of induction easily completes the proof of the first equality. With respect to the transform to α i , we use the Vandermonde determinant:
det 1 1 1 α 1 α 2 α m α 1 m 1 α 2 m 1 α m m 1 = ( 1 ) m ( m 1 ) / 2 i < j ( α i α j ) .
For the second identities, replace A i by ϵ A i , then we have
x i 0 , x i 1 e ( i = 1 m ϵ A i x i ) d x 1 d x m = 1 ( 2 π i ϵ ) m i = 1 m e ( ϵ A i ) A i j = 1 , j i m ( A i A j ) + 1 j = 1 m ( A j ) = 1 ( 2 π i ϵ ) m i = 1 m 1 A i j = 1 , j i m ( A i A j ) + 1 j = 1 m ( A j ) + k = 1 ( 2 π i ϵ ) k k ! i = 1 m A i k 1 j = 1 , j i m ( A i A j ) x i 0 , x i 1 1 d x 1 d x m = 1 m ! ( ϵ 0 ) .
Therefore, the coefficient of ϵ k m vanishes if k m < 0 and is 1 m ! if k m = 0 .
Theorem 3. 
Let α 1 , , α m + 1 R and let a 1 , , a u be their distinct numbers, i.e., { α i 1 i m + 1 } = { a i 1 i u } and T J : = { j α j = a J ( 1 j m + 1 ) } . Then, we have
x i 0 , x i 1 e ( i = 1 m ( α i α m + 1 ) x i ) d x 1 d x m = 1 ( 2 π i ) m J = 1 u e ( a J α m + 1 ) l T J ( a J α l ) { n 0 , n d 0 ( d T J ) , n 0 + d T J n d = # T J 1 ( 2 π i ) n 0 n 0 ! d T J ( α d a J ) n d } ,
where the indexes l , d run over { 1 , , m + 1 } T J .
Proof. 
Let δ i be mutually distinct numbers and put β i : = α i + ϵ δ i ; then we see that β i β j = α i α j + ( δ i δ j ) ϵ is not 0 for a non-zero number ϵ is sufficiently close to 0 if i j . By Lemma 2, we have
x i 0 , x i 1 e ( i = 1 m ( α i α m + 1 ) ) d x 1 d x m = lim ϵ 0 x i 0 , x i 1 e ( i = 1 m ( β i β m + 1 ) ) d x 1 d x m = ( 1 ) m ( 2 π i ) m lim ϵ 0 N ( ϵ ) D ( ϵ ) ,
where
N ( ϵ ) = e ( β 1 β m + 1 ) e ( β 2 β m + 1 ) e ( β m + 1 β m + 1 ) 1 1 1 β 1 β 2 β m + 1 β 1 m 1 β 2 m 1 β m + 1 m 1
and
D ( ϵ ) = 1 1 1 β 1 β 2 β m + 1 β 1 m β 2 m β m + 1 m .
From now on, the notations ˙ k , l and ˙ k , l will mean the sum and the product on k , l under the condition 1 k < l m + 1 . First, we see that
D ( ϵ ) = ( 1 ) ( m + 1 ) m / 2 ˙ k , l ( β k β l ) = ( 1 ) ( m + 1 ) m / 2 ˙ k , l , α k α l ( α k α l ) ( 1 + δ k δ l α k α l ϵ ) ˙ k , l , α k = α l { ( δ k δ l ) ϵ } = { ( 1 ) ( m + 1 ) m / 2 ˙ k , l , α k α l ( α k α l ) · ˙ k , l , α k = α l ( δ k δ l ) } ϵ κ + ϵ κ + 1 O ( 1 ) ,
where κ : = # { ( k , l ) 1 k < l m + 1 , α k = α l } .
Next, we see that
N ( ϵ ) = j = 1 m + 1 ( 1 ) j 1 e ( β j β m + 1 ) · ( 1 ) m ( m 1 ) / 2 ˙ k , l j ( β k β l ) = ( 1 ) m ( m 1 ) / 2 j = 1 m + 1 ( 1 ) j 1 e ( α j α m + 1 ) × ˙ k , l j , α k α l ( α k α l ) · ˙ k , l j , α k = α l ( δ k δ l ) × e ( ( δ j δ m + 1 ) ϵ ) · ˙ k , l j , α k α l ( 1 + δ k δ l α k α l ϵ ) · ϵ κ j
where κ j : = # { ( k , l ) 1 k < l m + 1 , k , l j , α k = α l } . Here, we note that κ j depends only on T J containing j by the equation κ κ j = # { ( k , l ) 1 k < l m + 1 , α k = α l , k or l = j } = # T J 1 . Moreover, by
{ ( k , l ) 1 k < l m + 1 , α k α l } = { ( k , l ) 1 k < l m + 1 , α k α l , k , l j } { ( j , l ) 1 j < l m + 1 , α l α j } { ( k , j ) 1 k < j m + 1 , α k α j } , { ( k , l ) 1 k < l m + 1 , α k = α l } = { ( k , l ) 1 k < l m + 1 , α k = α l , k , l j } { ( j , l ) 1 j < l m + 1 , α l = α j } { ( k , j ) 1 k < j m + 1 , α k = α j } ,
we see
˙ k , l , α k α l ( α k α l ) = ( 1 ) η j ˙ k , l , α k α l , k , l j ( α k α l ) 1 l m + 1 , α l α j ( α j α l ) ,
where η j = # { k 1 k < j , α k α j } , and
˙ k , l , α k = α l ( δ k δ l ) = ( 1 ) γ j ˙ k , l , α k = α l , k , l j ( δ k δ l ) 1 l m + 1 , l j , α l = α j ( δ j δ l ) ,
where γ j = # { k 1 k < j , α k = α j } , therefore, we have
( 1 ) j 1 ˙ k , l j , α k α l ( α k α l ) · ˙ k , l j , α k = α l ( δ k δ l ) = ˙ k , l , α k α l ( α k α l ) · ˙ k , l , α k = α l ( δ k δ l ) l , α l α j ( α j α l ) · l j , α l = α j ( δ j δ l ) .
Thus, we have
N ( ϵ ) = ( 1 ) m ( m 1 ) / 2 ˙ k , l , α k α l ( α k α l ) · ˙ k , l , α k = α l ( δ k δ l ) × J = 1 u e ( a J α m + 1 ) j T J 1 l , α l α j ( α j α l ) · l j , α l = α j ( δ j δ l ) × e ( ( δ j δ m + 1 ) ϵ ) ˙ k , l j , α k α l ( 1 + δ k δ l α k α l ϵ ) · ϵ κ j = ( 1 ) m ( m 1 ) / 2 ˙ k , l , α k α l ( α k α l ) · ˙ k , l , α k = α l ( δ k δ l ) × J = 1 u e ( a J α m + 1 ) { l T J ( a J α l ) } j T J e ( ( δ j δ m + 1 ) ϵ ) { l T J , l j ( δ j δ l ) } ˙ k , l j , α k α l ( 1 + δ k δ l α k α l ϵ ) ϵ κ j .
Here, by the equality
{ ( k , l ) k , l j , α k α l } = { ( k , l ) k , l T J , α k α l } { ( k , l ) k T J , l T J , l j } { ( k , l ) k T J , l T J , k j } ,
the product ˙ k , l j , α k α l ( 1 + δ k δ l α k α l ϵ ) is equal to
˙ k , l T J , α k α l ( 1 + δ k δ l α k α l ϵ ) ˙ k T J , l T J , l j ( 1 + δ k δ l α k α l ϵ ) × ˙ k T J , l T J , k j ( 1 + δ k δ l α k α l ϵ ) = ˙ k , l T J , α k α l ( 1 + δ k δ l α k α l ϵ ) 1 c , d m + 1 , c T J , c j , d T J ( 1 + δ c δ d α c α d ϵ ) = ˙ k , l T J , α k α l ( 1 + δ k δ l α k α l ϵ ) 1 c , d m + 1 , c T J , d T J ( 1 + δ c δ d α c α d ϵ ) d T J ( 1 + δ j δ d α j α d ϵ )
hence,
N ( ϵ ) = ( 1 ) m ( m 1 ) / 2 ˙ k , l , α k α l ( α k α l ) · ˙ k , l , α k = α l ( δ k δ l ) × J = 1 u e ( a J α m + 1 ) l T J ( a J α l ) ˙ k , l T J , α k α l ( 1 + δ k δ l α k α l ϵ ) 1 c , d m + 1 , c T J , d T J ( 1 + δ c δ d α c α d ϵ ) × ϵ κ # T J + 1 j T J { e ( ( δ j δ m + 1 ) ϵ ) l T J , l j ( δ j δ l ) 1 1 d m + 1 , d T J ( 1 + δ j δ d a J α d ϵ ) } .
The partial sum on j T J is
j T J e ( ( δ j δ m + 1 ) ϵ ) l T J , l j ( δ j δ l ) 1 1 d m + 1 , d T J ( 1 + δ j δ d a J α d ϵ ) = j T J e ( ( δ j δ m + 1 ) ϵ ) l T J , l j ( δ j δ l ) 1 d m + 1 , d T J q 0 ( δ j δ d a J α d ϵ ) q = n 0 , n d 0 , ( 1 d m + 1 , d T J ) j T J ( 2 π i ( δ j δ m + 1 ) ) n 0 d T J δ j δ d α d a J n d n 0 ! l T J , l j ( δ j δ l ) ϵ n 0 + d T J n d ,
applying (12) to the sum on j T J with δ j δ m + 1 for A i there, which is equal to
n 0 , n d 0 , d T J , n 0 + d T J n d = # T J 1 ( 2 π i ) n 0 n 0 ! d T J ( α d a J ) n d ϵ # T J 1 + ϵ # T J O ( 1 ) .
Thus, we have
N ( ϵ ) = ( 1 ) m ( m 1 ) / 2 ˙ k , l , α k α l ( α k α l ) · ˙ k , l , α k = α l ( δ k δ l ) × J = 1 u e ( a J α m + 1 ) l T J ( a J α l ) { n 0 , n d 0 , d T J , n 0 + d T J n d = # T J 1 ( 2 π i ) n 0 n 0 ! d T J ( α d a J ) n d } ϵ κ + ϵ κ + 1 O ( 1 ) ,
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

  1. Kitaoka, Y. Notes on the distribution of roots modulo a prime of a polynomial. Unif. Distrib. Theory 2017, 12, 91–116. [Google Scholar] [CrossRef]
  2. Kitaoka, Y. Statistical distribution of roots of a polynomial modulo primes III. Int. J. Stat. Probab. 2018, 7, 115–124. [Google Scholar] [CrossRef]
  3. 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]
  4. 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]
  5. 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]
  6. Kuipers, L.; Niederreiter, H. Uniform Distribution of Sequences; John Wiley & Sons: Hoboken, NJ, USA, 1974. [Google Scholar]
  7. Brosowski, B.; Deutsch, F. An elementary proof of Stone-Weierstrass theorem. Proc. Amer. Math. Soc. 1981, 81, 89–92. [Google Scholar] [CrossRef]
  8. 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]
  9. Tóth, Á. Roots of Quadratic congruences. Int. Math. Res. Not. 2000, 719–739. [Google Scholar] [CrossRef]
  10. 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.

Share and Cite

MDPI and ACS Style

Kitaoka, Y. Notes on the Distribution of Roots Modulo a Prime of a Polynomial V: Weyl’s Criterion. Mathematics 2025, 13, 3401. https://doi.org/10.3390/math13213401

AMA Style

Kitaoka Y. Notes on the Distribution of Roots Modulo a Prime of a Polynomial V: Weyl’s Criterion. Mathematics. 2025; 13(21):3401. https://doi.org/10.3390/math13213401

Chicago/Turabian Style

Kitaoka, Yoshiyuki. 2025. "Notes on the Distribution of Roots Modulo a Prime of a Polynomial V: Weyl’s Criterion" Mathematics 13, no. 21: 3401. https://doi.org/10.3390/math13213401

APA Style

Kitaoka, Y. (2025). Notes on the Distribution of Roots Modulo a Prime of a Polynomial V: Weyl’s Criterion. Mathematics, 13(21), 3401. https://doi.org/10.3390/math13213401

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop