The Chebotarev density theorem for function fields -- incomplete intervals
P\"ar Kurlberg, Lior Rosenzweig

TL;DR
This paper extends the Chebotarev density theorem to incomplete intervals in function fields over finite fields, providing new density results for irreducible polynomials and their factorization types.
Contribution
It proves a Polya-Vinogradov type variation of the Chebotarev density theorem for incomplete intervals, with applications to irreducible trinomials and polynomial factorization distributions.
Findings
Density of irreducible trinomials approximates expected value under certain interval size conditions.
Distribution of polynomial factorization types matches cycle type distribution in symmetric groups.
Applicable to polynomials with degree d over finite fields, generalizing previous results.
Abstract
We prove a Polya-Vinogradov type variation of the the Chebotarev density theorem for function fields over finite fields valid for "incomplete intervals" , provided . Applications include density results for irreducible trinomials in , i.e. the number of irreducible polynomials in the set is provided , , or , , and similarly when is replaced by any monic degree polynomial in . Under the above assumptions we can also determine the distribution of factorization types, and find it to be consistent with the distribution of cycle types of permutations in the symmetric group…
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.
The Chebotarev density theorem for function fields — incomplete intervals
Pär Kurlberg, Lior Rosenzweig www.math.kth.se/~kurlberg Department of Mathematics, KTH Royal Institute of Technology, SE-100 44 Stockholm, Sweden
Unit of Mathematics, Afeka Tel Aviv College of Engineering, Mivtza Kadesh 38, Tel Aviv, Israel
(Date: July 3, 2020)
Abstract.
We prove a Pólya-Vinogradov type variation of the the Chebotarev density theorem for function fields over finite fields valid for “incomplete intervals” , provided . Applications include density results for irreducible trinomials in , i.e. the number of irreducible polynomials in the set is provided , , or , , and similarly when is replaced by any monic degree polynomial in . Under the above assumptions we can also determine the distribution of factorization types, and find it to be consistent with the distribution of cycle types of permutations in the symmetric group .
P.K. was partially supported by the Swedish Research Council (2016-03701).
1. Introduction
The distribution of primes, and more generally the distribution of factorization types, in “short intervals” in the setting of function fields over finite fields has received considerable attention [5, 6, 3, 2, 14]. For example, in [3], prime equidistribution for the family was shown for any monic degree polynomial (for large.) For “very short” intervals, i.e., one parameter families of the form , prime equidistribution does not hold for all . However, for suitably “generic”, prime equidistribution does in fact hold for very short intervals. In [14] it was shown that given a monic degree “Morse polynomial” (i.e., that ; note this holds for generic polynomials, cf. Section 5.1)
[TABLE]
More generally, the distribution of factorization types of can also be determined. Writing with all irreducible and letting we may after rearranging assume that ; the factorization type (or decomposition type) of is then given by . The distribution of factorization types of , for Morse, is consistent (up to an error of size with the distribution of cycle types of permutations in , the symmetric group on letters, with respect to the Haar measure. (E.g., for , write out all trivial cycles, i.e., ; the cycle type of is then if we order according to cycle lengths.)
The connection between factorization types and group theory proceeds via Galois theory and the function field version of the Chebotarev density theorem, made effective by Weil’s proof of the Riemann hypothesis for curves. The key point is that for Morse, and the factorization type for can be read off from the cycle type of the Frobenius class at the prime ideal . In particular, being irreducible is equivalent to the Frobenius conjugacy class at the prime being generated by a -cycle, and the proportion of -cycles in is , hence the density in (1).
The purpose of this paper is to show that equidistribution of factorization types also holds for significantly smaller subsets, namely for “incomplete intervals” , as long as is small. In fact, in spirit of the Pólya-Vinogradov inequality, we will develop a version of the Chebotarev density theorem for incomplete intervals, allowing us to determine the distribution of Artin symbols, and thus resolve finer invariants than factorization types when is not the full symmetric group. (Note that the cycle type is in general not enough to determine the conjugacy class, e.g., the three-cycles and are not conjugate in the alternating group .)
Before stating our main result we introduce some notations. Let be a (large) prime, let , let be a finite normal and separable extension with Galois group , and let denote the ring of integers in . Given a prime ideal that does not ramify in , let denote the Artin symbol, a certain conjugacy class in . (For further details and definitions, cf. [9, Ch. 6].) It will be convenient to use the convention that any prime appearing in an Artin symbol is implicitly assumed to be unramified.
By an incomplete interval in we mean a set of the form for and (in fact, our method applies to arithmetic progressions of the form where and is an incomplete interval.) Let denote the Frobenius substitution . Define such that is the field of constants in , and let ; note that in the “geometric case”, i.e., when , we have . Further, given , let denote the prime ideal generated by .
Theorem 1**.**
Let be a conjugacy class. If for all , then
[TABLE]
On the other hand, if for all , then we have
[TABLE]
The result only gives non-trivial information for slightly larger than . Using the Pólya-Vinogradov method of “completing the sum”, the result follows easily from our key technical result, Proposition 2, namely square root cancellation for certain complete sums twisted by additive characters. We remark that by using smoothing (cf. [8, Theorem 1.1]) the error in Theorem 1 is easily improved to , hence giving asymptotics as long as tends to zero. We leave the details to the interested reader.
Proposition 2**.**
Let and let be a normal and separable extension with Galois group , and let denote a conjugacy class in . If is a non-trivial additive character then
[TABLE]
with denoting the sum restricted to such that is in addition unramified in .
We remark that the sum is empty unless for all .
1.1. Applications
We now give some explicit examples of families of polynomials for which we can determine the corresponding Galois group. This together with Theorem 1 shows the existence of primes in incomplete intervals. The method proceeds by finding the distribution of Artin symbols, hence also determines the distribution of factorization types, but for simplicity we state it only for the density of irreducible polynomials.
Theorem 3**.**
Let be a (large) prime, and let be a monic polynomial of degree . There exists subsets such that for with the following properties. Given any incomplete interval , we have:
- (1)
For ,
[TABLE] 2. (2)
For ,
[TABLE] 3. (3)
For , and any integer ,
[TABLE]
An immediate application is a deterministic time algorithm for constructing irreducible degree polynomials of quite general shapes, in particular of very sparse form. (The complexity in terms of is quite bad so we will not make it explicit.) Given any (say monic) degree polynomial , consider the family . Trying at most values of , and values of yields an irreducible polynomial; each such irreducibility test can be done in arithmetic operations in (say using Rabin’s test). Hence we can produce an irreducible in -operations, or even operations using the earlier described smoothing improvement; note that for existence for irreducibles it is enough to take . This is to be compared with Shoup’s algorithm [19] which requires -operations. Ignoring polynomial factors in , and using fast (FFT-based) -arithmetic, the bit operation complexities can be obtained by multiplying the above bounds by .
Remark**.**
Given polynomials with we can under fairly weak assumptions on , namely that the ratio is Morse, show that (cf. Section 5)
[TABLE]
For a degree Morse polynomial, and distinct , the Galois group of the compositums of the fields generated, over , by the polynomials is maximal, i.e., isomorphic to (cf. [14]). Theorem 1 then gives equidistribution of cycle types of inside , provided . Thus, for Morse we immediately obtain cancellation for function field analogs of Moebius and Chowla type sums; with denoting the function field Moebius function, we have
[TABLE]
(cf. [14, 4, 12] for results valid for various longer intervals.)
Another application is asymptotics for function field anologs, for incomplete intervals “centered” at , assuming and Morse, of shifted divisors sums (e.g. where is the -th divisor function) and the Titchmarsh divisor problem (e.g. ); asymptotics for these sums over “long” intervals, while allowing for very general shifts, were determined in [1].
We next give an example where the cycle type distribution is not enough to determine the distribution of Artin symbols. Let be a (large) prime, and let be distinct. Define and let denote the splitting field of over , and let denote the compositum of the fields . Then (cf. [13, Proposition 8]) for , and . With , Theorem 1 implies that the Artin symbols equidistribute in , with relative error of size .
1.2. Discussion
For the full interval and (the geometric case) Chebotarev’s density theorem for function fields, with error term of size , easily follows from the work of Reichardt [17] together with Weil’s celebrated proof of the Riemann hypothesis for curves over finite fields [23]. (Reichardt’s error term, for primes of degree , is of size as , where is the maximum of the real parts of the roots of the zeta function of .) The case and is due to Cohen and Odoni [6] (also cf. [10]). As for incomplete intervals we are only aware of recent results by Entin [7] who determined the distribution of factorization types for various families of polynomials whose coefficients are allowed to vary over incomplete intervals (see below).
In [21] Shparlinski studied the proportion of irreducible monic polynomials in , with coeffecients in constrained to lie on points with integer coordinates inside parallelepipeds, and showed that
[TABLE]
giving non-trivial information when . (More generally, he also determined the distribution of factorization types.) Further, in [20], he considered sparser families, namely the set of irreducible trinomials in , and showed that
[TABLE]
provided and , and similarly for trinomials with any prescribed factorization type. Theorem 3 easily implies the same asymptotics, under the weaker conditions , , or , .
Entin [7] determined the distribution of factorization patterns for families of polynomials whose coefficients vary over quite general sets , with relative error of size where is related to the decay of Fourier coefficients of the characteristic function of . E.g., for , with relative error small if . His method also applies for sparser families: for trinomials the assumption needed for small relative error is ; for Morse and the family the relative error is small if , similar to the conditions in Theorem 3.
1.3. Acknowledgements
We thank A. Granville, E. Kowalski, Z. Rudnick and P. Salberger for helpful discussions. We also thank I. Shparlinski and O. Gorodetsky for valuable comments on an early version of the paper, in particular for suggesting using smoothing to improve the error term in Theorem 1. We further thank I. Shparlinski for pointing out the application of finding irreducible polynomials in sparse families, thus leading to a deterministic way to find irreducibles that is faster than Shoup’s algorithm.
2. Deducing Theorem 1 from
Proposition 2
To simplify the notation, let if , and zero otherwise. For , let denote the additive character . With denoting the characteristic function of , we “complete the sum” and write
[TABLE]
[TABLE]
where is the Fourier transform of .
Our main term will come from terms with ; by [9, Proposition 6.4.8] (note that the genus of can be bounded in terms of ) we find that
[TABLE]
As for the error terms, taking integer representatives of the elements in , such that , we find that . Now, by Proposition 2 (note that for , is non-trivial), we have
[TABLE]
As , the error term in (3) dominates the error term in (2), hence
[TABLE]
3. Additive characters and Artin-Schreier extensions
We briefly recall how a non-trivial additive character on can be realized as a character on some cyclic galois group , where , such that
[TABLE]
and denotes a degree one prime ideal. (Note that , the degree of the prime ideal is defined in terms of the cardinality of the residue field, namely . Also, since is cyclic we can regard the Artin symbol as an element in rather than a conjugacy class.)
The extension can be constructed as follows: with denoting a root of the polynomial , let . Then is an Artin-Schreier extension of degree , such that . The extension is unramified except at infinity, where it is wildly ramified.
Specializing at for , we find that splits completely, and thus is the identity element in . Similarly, specializing at for , we find that is irreducible (over ), and thus there is exactly one (unramified) prime above , and .
We next turn to identifying the Galois action of the Artin symbol. If is some fixed root of , any Galois element acts via for some . Moreover, given such a , we can recover from . Thus, if is the Artin map at , we find that
[TABLE]
In conclusion, for the Artin symbol acts as , hence there is a natural identification of with so that the image of is just . In particular, given a non-trivial additive character of we can define a character on such that
[TABLE]
4. Proof of Proposition 2
The main bulk of the argument is similar to the one used in [9, Ch 6.4]; below we briefly summarize the argument and only give details when we need to go beyond their results. For easier comparison, we follow their notation and write rather than .
Let and let be a normal extension with Galois group . Since the constant in the error term is allowed to depend on , we may assume that is sufficiently large (say so that is separable, as well as tamely ramified and thus by the Hurwitz genus formula, that the genus bound holds. Let be a conjugacy class. We may also assume that for all , otherwise the Artin symbol never meets and the sum is empty. We will need some further notations: given field extensions , let
[TABLE]
Moreover, for extensions , with unramified, and a conjugacy class , let
[TABLE]
Let denote the field of constants in , and let . Choose some and define , where denotes the order in ; note that does not depend on the choice of since all elements in have the same order. With we have ; also note that is unramified. By [9, Lemma 6.4.4] there exists such that and ; moreover .
With denoting the conjugacy class of , we have (cf. [9, Lemma 6.4.4])
[TABLE]
and thus
[TABLE]
Let denote the fixed field of . Note that does not depend on , whereas does. We will need to keep track of this dependence and will therefore deviate slightly from the notation in Fried-Jarden (in their argument it suffices to work with a fixed , consequently they denote for the fixed field of .)
From the proof of [9, Proposition 6.4.8] it follows that , and , as well as . It also follows (in particular see how their Corollary 6.4.3 was used in the proof of Proposition 6.4.8)
[TABLE]
This equality suggests the existence of some to map; we will show that this is indeed the case and then obtain a sum over certain degree one primes in .
We first show that we can “lift” to a suitably invariant character , i.e., independent of the choice of prime above any prime occuring in the sums we wish to estimate. Recall that we have realised the additive character as a character on , for an Artin-Schreier extension , with the property that
[TABLE]
As we have, for sufficiently large (which we may assume to hold since the constant in error term is allowed to depend on ), , as well as , where the latter isomorphism can be defined by restricting to act on . We can thus define a character by composition. Now, given degree one primes and , with , we will need, no matter which is chosen, that
[TABLE]
This in turn is immediate from [15, p. 198, property A3]: since and are degree one primes, we have , and thus
[TABLE]
which shows that the choice of indeed does not matter.
Now consider the tower of extensions . As for their field of constants, we have , , . Let , , and denote primes such that . Then, as (see [9, Lemma 6.4.2] and the proof of Proposition 6.4.8) we have , and thus . Further, as and , we have and hence . Thus, as , the latter implies that any is uniquely determined by , whereas the former (together with ) implies that there are exactly primes lying above .
We thus find that
[TABLE]
[TABLE]
which, from the proof of [9, Lemma 6.4.6], equals
[TABLE]
note that the inner sum amounts to summing an additive character over all points on the curve given by the field , having field of constants .
As , it suffices to show that
[TABLE]
To see this, let denote the Artin -function attached to the character ; as is abelian it is in fact an -series attached to a Hecke character.
Taking logarithmic derivatives of , we find that the sum over primes in (6) agrees, apart from ramified primes, with the sum over degree one terms in . As only ramifies (wildly) at infinity, there are ramified primes, and hence the Riemann hypothesis for curves (due to Weil) gives that the sum is , provided that we can show that the degree of the -function only depends on (here some care is needed since .) To see this, first note that
[TABLE]
Next note that any two non-trivial characters have the same conductor, thus the degrees of the -functions
[TABLE]
are the same (cf. [16, Ch. 6].) As there are non-trivial characters , it is enough to show that the degree of is . As this degree is linear in , the genus of , it is in turn enough to show that . This is immediate from Castelnuovo’s Inequality (cf. [22, Theorem 3.11.3]) since , , , and .
5. Criteria for Morse polynomials and Galois group
Given an integer , define
[TABLE]
As long as a few of the small degree coefficients of avoid sets of “bad coefficients”, the polynomial , over , will have maximal Galois group. To see this we recall a very useful criterium.
Proposition 4** (Geyer [11]).**
Assume that is a Morse function of degree . Then the Galois group of the covering of degree is the full symmetric group, i.e., .
Fixing , Geyer in fact shows that the set of polynomials for which is Morse is a Zariski open dense subset of the affine -space with coordinates . More precisely, for , fixing , write
[TABLE]
with trancendental over . Geyer then shows that is Morse provided that
[TABLE]
In particular, if the conditions in (7) are satisfied, then for all but “bad” specializations of , the specialized ratio will be Morse.
In particular, for large the second condition is automatic, and by varying the linear coefficient of (again avoiding “bad” values) we can ensure that the first condition holds, showing that very often has full Galois group. (Note that and have the same Galois group over .)
We remark that the Morse criterion is certainly not needed for the Galois group to be maximal. E.g. (cf. [18, Ch. 4.4]) we have
[TABLE]
5.1. Proof of Theorem 3
In [14] it was shown that in the family of polynomials , is Morse for all but values of (or even .) In particular, defining as the set of -values for which is not Morse, we have and the first part of Theorem 3 follows from Theorem 1 since for .
Given Geyer’s criterion, together with Theorem 1, the rest of the proof of Theorem 3 is a simple matter of checking the above conditions.
First, fix an integer and take . Then, for , we have ; as long as we have , and hence, for all but choices of (and ), is Morse and
[TABLE]
Letting be the union, over , of these sets of exceptional -values, the third part follows.
Similarly, for and we may, possibly after replacing by (changing the interval to an interval with the same cardinality, and symmetric difference of cardinality 2 with ), assume that . Hence for all but choices of , we find that , and the second part follows.
5.2. Further examples
We can also give examples of families of polynomials , with fairly large number of free parameters (about of them), such that the (geometric) Galois group of is not the full symmetric group. For instance, with and even, take ; the geometric galois group is then a subgroup of a certain wreath product (here the crucial point is that , i.e., the family is decomposable.) Similarly, for and , the family
[TABLE]
is decomposable.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. C. Andrade, L. Bary-Soroker, and Z. Rudnick. Shifted convolution and the titchmarsh divisor problem over 𝔽 q [ t ] subscript 𝔽 𝑞 delimited-[] 𝑡 \mathbb{F}_{q}[t] . Philosophical Transactions of the Royal Society of London A: Mathematical, Physical and Engineering Sciences , 373(2040), 2015.
- 2[2] E. Bank and L. Bary-Soroker. Prime polynomial values of linear functions in short intervals. Journal of Number Theory , 151(Supplement C):263 – 275, 2015.
- 3[3] E. Bank, L. Bary-Soroker, and L. Rosenzweig. Prime polynomials in short intervals and in arithmetic progressions. Duke Math. J. , 164(2):277–295, 02 2015.
- 4[4] D. Carmon and Z. Rudnick. The autocorrelation of the Möbius function and Chowla’s conjecture for the rational function field. Q. J. Math. , 65(1):53–61, 2014.
- 5[5] S. D. Cohen. Uniform distribution of polynomials over finite fields. J. London Math. Soc. (2) , 6:93–102, 1972.
- 6[6] S. D. Cohen and R. W. K. Odoni. The Farey density of norm subgroups of global fields. II. Glasgow Math. J. , 18(1):57–67, 1977.
- 7[7] A. Entin. Factorization statistics of restricted polynomial specializations over large finite fields. Preprint , 2018.
- 8[8] E. Fouvry, E. Kowalski, P. Michel, C. S. Raju, J. Rivat, and K. Soundararajan. On short sums of trace functions. Ann. Inst. Fourier (Grenoble) , 67(1):423–449, 2017.
