Submitted:
06 August 2026
Posted:
06 August 2026
You are already at the latest version
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 integers r1,...,rn be the roots of f(x) mod p with 0 ≤ r1 ≤ ··· ≤ rn < p. Inthis series of papers, we have investigated the distribution of the points (r1,. . .,rn). In the present paper, we present several conjectures concerning the distribution of polynomials in the roots ri.
Keywords:
polynomial
; local root of a polynomial
; uniform distribution
1. Introduction and Conjectures
For a monic polynomial , we proposed several conjectures about the distribution of the roots of for a prime number p ([3,4,5,6,7,8]). We begin by briefly stating the relevant notation to state new observations. Let a polynomial
be of degree n with complex roots . We fix the numbering of roots once and for all and define a vector space over the rational number field by
Since the non-zero vector is in , we see clearly
We take and fix a -basis of
where
Note that vectors are also linearly independent.
We write , which is a finite Galois extension field generated by all roots of over the rational number field and write
where the letter p denotes a prime number. For a prime , we define the integers by the following two conditions:
The first condition is equivalent to . The integers are uniquely determined and we call them local roots (of at p). We define two subsets of :
where is a permutation and is a prime ideal of lying above p. Note that by setting , can be identified with under the ordering by the roots of . Up to a finite set of prime numbers, the set is a disjoint union of several ; furthermore, each is a disjoint union of several . Whether this is an infinite set or not depends on the permutation. However, the number of distinct infinite sets in is independent of the numbering of the roots of and the same holds for the number of in . It is known that is an infinite set, to be more precise, the density of the infinite set in the set of all prime numbers is equal to due to Chebotarev.
For a real number x, denotes the decimal part of x, i.e., and .
For a rational number and a prime p with , the symbol denotes an integer k such that and in , i.e., .
Last, we introduce geometric objects:
Now we can state the following conjectures.
Conjecture 1.
Let be an irreducible polynomial of degree . Then the sequence of points
is uniformly distributed in , where p runs over the set and r runs over the local roots of at p.
Next, write and let elements satisfy
as vector spaces over , and write by some polynomial in . Assume that is an infinite set. For a prime , we see , hence for an integer . Therefore, for
every accumulation points of
is on D, where p runs over the set such that p does not divide the denominator of any coefficient of for every i, and , denote the vector of local roots of at p and , respectively. The second conjecture is as follows:
Conjecture 2.
The sequence of points is uniformly distributed on D.
We note that is not on D if , hence we need to clarify the definition of “uniformly distributed". In the next section, we will do this and provide the background and data to support Conjectures.
In the third section, we will make a remark about the order of the local roots of polynomials and
2. Background and Numerical Data
With respect to the distribution of local roots of an irreducible polynomial, it appears that the sequence is uniformly distributed on as is commonly believed. However, this has only been proven for ([1,10]). Following another question in [2], we have become interested in the distribution of points
and we proposed the following conjecture in [3,5,8]:
Conjecture .
Let be a monic polynomial of degree n in . Then, the sequence of is uniformly distributed on if is an infinite set.
We expect that for contained in , the density of in is independent of a permutation if is an infinite set. Under this assumption, Conjecture 2 implies Conjecture .
We must explain the uniformity of the sequence of on , because this uniformity is different from what is usual (cf. [9]). For a prime , we have the identity
for integers . Since the integers and are fixed and the condition is supposed, the number of possible values for is finite. If is true for , then the point is on . Otherwise, it is not on , but every accumulation point of is clearly on . We define the sequence of being uniformly distributed as follows: Since we see
is contained in a finite union of -dimensional planes which are parallel to
We define the volume for a subset S of as follows: By decomposing S as for some points and subsets , we define the volume by the sum , where is the standard volume on the -dimensional Euclidian space P. Hence implies . For , write (rectangular parallelepiped). Then, the above conjecture means that, for any
This implies that the sequence of is uniformly distributed on for an irreducible polynomial ([4,6]). The condition may be weakened ([8]).
This definition of the uniformity is naturally generalized in Conjecture 2, replacing by .
Since the ratio of volumes is more important than the volumes themselves, it is often useful to compute the volume by projecting from the original plane P onto a suitably defined -dimensional plane
Before moving on to the set , we note the following facts from the theory of an algebraic number field:
- 1.
- Let K be an algebraic number field, i.e., a finite extension field of the rational number field and write by an algebraic integer and denote the ring of all algebraic integers in K by . Let be a monic minimal polynomial of . Then, for a prime p which does not divide the discriminant of the polynomial , the following conditions (i), (ii) are equivalent: (i) holds for integers , (ii) the ideal is the product of prime ideals of degree 1, in which case each prime ideal is of the form .
- 2.
- Let be algebraic number fields and K the composite field of and . For a prime p, the ideal is the product of prime ideals of degree 1 in K if and only if the same holds in (i = 1,2).
Let us come back to . Write for an algebraic integer , and denote the monic minimal polynomial of by . Using the above, we see except finitely many primes as follows: Write for monic irreducible polynomials . Then, using the above facts, we have, except finitely many primes: ⇔p decomposes into the product of prime ideals of degree 1 in ⇔p decomposes into the product of prime ideals of degree 1 in by virtue of ⇔ for all i⇔.
Write for a polynomial . Then we see that, except for finitely many primes p which divide the denominator of some coefficient of polynomials
To verify the second equality, it is enough to note and the prime ideal of is of the form . For the third equality, the following is helpful.
Proposition 1.
We keep the above notation. Let a prime be sufficiently large and R a root of . Then all the roots of are given by .
Proof.
Suppose that a prime is sufficiently large; then it does not divide the denominator of any coefficient of the polynomials and we consider . Moreover, is a prime ideal of lying over p, hence, we see that , i.e., . If holds, then we have , therefore, the prime ideal divides . The number of such prime ideals is finite. □
The inequality in (1) prompts us to investigate the density of primes satisfying
for polynomials .
In case of , by writing with , the above condition is equivalent to
Since the set is a union of intervals, Conjecture is applicable. However, in the case of or , it is helpless. As above, let the monic polynomial be the minimal polynomial of an algebraic integer satisfying and put . Write
where are the roots of as usual. Polynomials are not necessarily either monic or integral. Let us consider the density of the complement set to (2), i.e., the problem studying the density of primes which satisfy
for polynomials . By Proposition 1, the above inequality is equivalent to
for a root R of except for a finite number of primes. By defining rational numbers by
data from computer experiments suggest that under the assumption that for all , the density of primes satisfying (3) is equal to the volume of the set
This leads to Conjecture 1. For example, when is a Galois polynomial with roots , all coefficients are integral. Here is an example such that some coefficient is not integral. For , which gives the subfield of degree 3 in , the roots of are . Hence, polynomials are not necessarily integral. The density is not equal to the volume of experimentally. There is no algebraic integer such that contains all roots of .
Conjecture 1 implies, applying to the set the uniform distribution of the sequence where r runs over local roots of at p and k is a fixed integer with . We can not replace by smaller sets .
As we shall see later, the formulation in (4) may not be particularly suitable for investigating the density of prime numbers satisfying (3).
Here are data : Let be an irreducible polynomial of degree n and d a positive integer, and write
for integers whose volume is and
For example, for polynomials and , the value which is the maximum in the set of is as follows:
For and , is
For and , is
For and , is
Thus, we can expect that as X increases, the error decreases towards zero.
Next, let us consider polynomials in many variables: Write
where is a prime ideal of lying above p and is independent of i. In view of (1), we are concerned with the following density for polynomials and :
where . By
for , we see for and
where is an integer such that ; the same holds for . If we prioritize local roots over global roots, then writing
we see
for
For simplicity, assume that is the identity, since we do not deal with densities for distinct permutations at the same time in the following. If polynomials satisfy , , respectively, then we see for a prime . Suppose that are linear and let and . Then, it is clear that is equivalent to , where
Therefore, Conjecture is applicable to evaluate the density under the assumption (cf. the remark after Conjecture ).
Assume that and is a Galois extension with . Then we have and , thus is spanned by 1 and the roots of as a vector space over . Thus, for a polynomial , we see that there exists a linear polynomial such that , neglecting a constant term. Hence, we may assume that polynomials are linear to study the density .
Unless is a Galois extension and , what happens? Below are four examples : in the case of and , which are non-Galois, and , which is reducible.
Example 1. Set with roots , where linear relations among roots over rationals are spanned by . It is easy to see that is not a finite set if and only if is contained in the group which consists of such that or holds and
which is identified to
by the projection .
We remark that for a permutation , is equal to or . Because, denote by the group which consists of permutations such that there is an automorphism satisfying . Then holds.
We know by (1) the following:
Noting that with , we see that for a polynomial in , there are rational numbers so that . So, we may assume that .
The computer experiments suggest the following:
- 1.
- the densities of and in are equal to ,
- 2.
- densities are equal.
Then we see that for every permutation such that or , the density is equal to
Thus, in case that are linear, the density is evaluated by Conjecture . For example, let ; then the computer experiment suggests , which matches and .
We restrict polynomials to the following “reduced" type without constant term:
Suppose that and either or is not zero. Writing , condition is equivalent to for some i. Then the density or seems to be as follows, independently of .
- 1.
- 2.
- The case of . Then iswhich depends only on .
- 3.
- The case of and . Then iswhich depends only on .
We note that if the ordered pair of polynomials does not satisfy the third condition, then the ordered pair satisfies it.
To shed light on the background of these formulas, we will carry out the following experiment:
For real numbers with , write
From the figure, it is easy to see
and . For local roots , the inclusion is clear by and . Our observation suggests that
for independently of a permutation . This means that the sequence of the vectors is uniformly distributed in . Although this uniformity should allow us to prove that the above equation for is true, the calculation is not straightforward.
This uniformity may hold not only for but also, more generally, for ( with ), which is equivalent to that are linearly independent in the four dimensional vector space over . Here, we neglect a finite number of primes which divide a denominator of . The computational data for the case support this. This observation naturally leads to Conjecture 2.
Example 2. Let be an irreducible polynomial with roots and suppose that the extension is not a Galois extension, hence . The vector space is spanned by over . Because, the identity implies that every polynomial in is a polynomial in . By denoting the vector space spanned by by V, the identity implies Hence, follows. Finally, is easily confirmed. Thus, every polynomial in is contained in V.
We see easily for every permutation , in particular , since .
We specialize to and we suppose that polynomials are of the following “reduced” type
with rational integer coefficients without constant term. Denote its homogeneous part of degree i by . If both of are linear, i.e., , then it is sufficient for us to refer to Conjecture , and so we suppose that or is not linear. Furthermore, suppose that they satisfy , , and . Then, computer experiments suggest the following:
- 1.
- 2.
-
The case of or . Write .
- (a)
- The case of . The density is
- (b)
- In the case of ( or ) and ,
- (c)
- The case of and . The density is
- 3.
- The case of and . The density is, writingwhich depends only on .
- 4.
- The case of and , .which depends only on .
Similarly to the case of , let us consider the sequence of points
for the local roots of . This seems to be uniformly distributed on , where
Let us present data. For , write . From the figure, we can see that the volume of is:
in the case of ,
in the case of ,
in the case of ,
in the case of , , and . For a positive integer d and integers , define a box by
For a positive number X, let denote the absolute value of the difference between
and
and let be the maximum in the set of where runs over the set of with . The denominator is equal to . The data are: for , decreases as
The least value of non-zero is for .
For another polynomial such as , where , and for other polynomials, the situation is similar.
Example 3. Let with roots , and which has a root . It is easy to see that , which is a Galois extension over , and for polynomials :
We have
and we write, for a prime and local vectors of ,
where is the same as (5). For a positive integer d and integers , define a box by
By (1), we know
The sequence of points for is uniformly distributed on if and only if for every positive integer d and and every box
converges to
where the volume in the denominator is . The data are as follows: for , the maximum of the set of errors decreases as
For
instead of , we have a similar estimate:
Here we note that are not algebraic integers.
Here are supplementary data: For integers with except , the sequence of the points
seems to be uniformly distributed on . This is because for , there exists such that the absolute value of the difference between
and is less than for every and .
Example 4. Let , which is reducible. Write and . Writing and , we have and . Since , we consider the distribution of points . We write
where is the same as (5) and is defined in the same way before, and
As before, let us see the maximum value in the set of where . For , decreases as follows:
This supports that the sequence of is uniformly distributed on .
The formula for is the same as in Example 1.
These data appear to suggest that the set is more essential than .
The congruence conditions for local roots should be included in Conjectures 1, 2 (cf. Conjecture 3 in [8]).
3. Arrangement of Local Roots of Two Polynomials
What is the relation between the positions of the local roots of two polynomials and ? For example, let and . Denote the local roots of by , respectively. The density of satisfying either or appears to be in each case.
Another example: Let and and denote the local roots of by and those of by . Denoting the accumulation points of by , we have furthermore that follow from the trivial linear relation among the roots. Therefore, we have
The volume of the set of points which satisfy (6) and (7) is . We divide the cases as follows:
The density of prime numbers satisfying the ith condition appears to be as follows:
We will see that the density is times the volume of the three dimensional figure D defined by the inequalities in each case.
Let us consider the first case. The inequalities are , (6) and (7). Denote by the figure defined by (6), (7) and the inequalities in this case, i.e.,
If , then the conditions and imply the contradiction . Thus, the set is empty. The figure is defined by
The volume is calculated using the iterated integration , which is . Thus, the density . The other cases are similarly verified.
For a general reducible polynomial , there is no doubt that the density is the volume of a union of convex bodies defined by inequalities as above for any arrangement of the local roots and of and .
References
- 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]
- Hadano, T.; Kitaoka, Y.; Kubota, T.; Nozaki, M. Densities of sets of primes related to decimal expansion of rational numbers. In Number Theory, Tradition and Modernization; Zhang, W., Tanigawa, Y., Eds.; Springer Science+Business Media, Inc, 2006; Vol 15. [Google Scholar]
- Kitaoka, Y. Notes on the distribution of roots modulo a prime of a polynomial. Unif. Distrib. Theory 2017, 12(no. 2), 91–116. [Google Scholar] [CrossRef]
- Kitaoka, Y. Statistical distribution of roots of a polynomial modulo primes III. Int. J. Stat. Probab. 2018, 7, 115–124. [Google Scholar]
- Kitaoka, Y. Notes on the distribution of roots modulo a prime of a polynomial II. Unif. Distrib. Theory 2019, 14(no. 1), 87–104. [Google Scholar] [CrossRef]
- Kitaoka, Y. Notes on the distribution of roots modulo a prime of a polynomial III. Unif. Distrib. Theory 2020, 15(no. 1), 93–104. [Google Scholar] [CrossRef]
- Kitaoka, Y. Notes on the distribution of roots modulo a prime of a polynomial IV. Unif. Distrib. Theory 2023, 18(no. 1), 9–30. [Google Scholar] [CrossRef]
- Kitaoka, Y. Notes on the Distribution of Roots Modulo a Prime of a Polynomial V: Weyl’s Criterion. Mathematics 2025, 13(21), 3401. [Google Scholar] [CrossRef]
- Kuipers, L.; Niederreiter, H. Uniform Distribution of Sequences; John Wiley & Sons, 1974. [Google Scholar]
- Tóth, Á. Roots of Quadratic congruences. Internat. Math. Res. Not. 2000, 719–739. [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. |
© 2026 by the authors. 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 (http://creativecommons.org/licenses/by/4.0/).
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.