### Sliding over the Polya-Vinogradov gap

In my series of papers with É. Fouvry and Ph. Michel, we seem to alternate between longer papers and shorter ones. The last one, which we just put up on arXiv, is in some sense the shortest one: even if it goes up to 19 pages in length, the basic idea can be explained extremely quickly, and much of the paper is taken with variations on its basic theme and illustrations.

The context is the all-important problem of estimating short exponential sums, in the specific case of sums over intervals in a cyclic group , where (for the sake of this post) we define an *interval* in to be the injective image of a set of successive integers under reduction modulo . An interval is “short” if its length is significantly smaller than , in the sense that for some real parameter with . We are then looking for non-trivial estimates for

where

is some complex-valued function, which is supposed to oscillate in such a way that we expect that

There is a fundamental technique to attack this problem, which is of constant use in analytic number theory, and which is known as the *completion method*. Abstractly, one can see it as a case of the Plancherel formula in (discrete) Fourier analysis, namely, one writes

where

and is the same transform applied to the characteristic function of the interval . One then deduces the bound

where the implied constant is absolute, simply by estimating the -norm of — in our normalization, this is .

In many cases, the Fourier transform of can be estimated quite well, and in particular, in the context of finite fields , if is a trace function which is not proportional to an additive character , Deligne’s Riemann Hypothesis gives

where the implied constant depends only on the conductor of (the sheaf underlying) .

The resulting estimate

is known as the general *Polya-Vinogradov* bound (although the name is sometimes restricted to the case where is a Dirichlet character modulo .)

This is quite an efficient result: it gives non-trivial estimates for all intervals such that (or even , for a suitable , if one only desires *some* cancellation by a multiplicative constant, and not that the sum be of smaller order of magnitude.) With this generality, it is also *almost* best possible: if we take , then the sum over has essentially no cancellation (the phase does not have enough time to turn around sufficiently.)

It seems natural, then, to ask: is the Polya-Vinogradov range (where is a bit larger than ) best possible? Does the gap between and really represent a different behavior for such generalized exponential sums?

Our paper answers this question quite satisfactorily: there is, in fact, *no* gap, in the sense that for trace functions (not proportional to an additive character), one can get cancellation in sums over intervals of length for any function tending to infinity with (assuming we do tend to infinity while keeping the conductor bounded.)

As a direct corollary, we get for instance the equidistribution in (with respect to Lebesgue measure) of fractional parts for , for any fixed polynomial of degree , and the equidistribution with respect to the Sato-Tate measure of the angles of Kloosterman sums such that

again for , whenever . (This last result had been proved in the Polya-Vinogradov regime by Philippe a while ago, and in the full range , it is a celebrated result of Katz.)

As I mentioned, the basic method is very easy, and we call it the “sliding sum method”. It is reminiscent of the van der Corput inequality, and we wouldn’t be surprised to learn that it had already been established by other people. (The applicability to trace functions, on the other hand, requires some rather deep results, as I will discuss below.)

I will give the simplest variant. Consider an interval in . We assume that with (so we are certainly above the square-root length). We then compare upper and lower bounds for the average

For the upper-bound, we expand the square and exchange the order of summation, obtaining

where

is an additive correlation sum of (it is a special case of those correlation sums we have considered extensively in our first works.)

We *assume* that has the property that, if is not in a set containing at most values, we have

(i.e., the correlation exhibits uniform square-root cancellation, except for a few exceptional cases, among which of course we expect to have ). Then, using the trivial bound

for the exceptional values of , we get

where the implied constant depends on the parameter that we just introduced, and on the -norm of (and we use the fact that .)

As for the lower bound, we just use the fact that if we shift by a small amount, the sum over does not change too much (because the interval and its shift overlap significantly; intuitively, we *slide* the sum over a certain range, hence our name for the method):

This means that if we consider the sums shifted by of size up to (roughly) the sum

itself, these will have a contribution to of size roughly So by comparing the upper and lower bounds (using positivity), we get

or, in terms of the parameter , we get

(where the implied constant depends on and on ).

Hence, provided we work with functions with bounded -norm and with uniformly small correlations in the sense we described, then we can get cancellation as long as , but arbitrarily slowly.

This is elementary, but now the really significant part is that if is a trace function modulo , and if it is associated to an *irreducible* sheaf, and is not proportional to an additive character, then it does have the desired properties, the parameter being bounded in terms of the conductor of (which also satisfies , so that it serves as a universal complexity parameter, as it did in our previous works.)

We do not need to fight very hard to prove this in our new paper, but this is because we can quote and use various lemmas from the previous ones, and — as usual — rely on Deligne’s fundamental version of the Riemann Hypothesis over finite fields; the result itself is undoubtedly quite deep when applied to trace functions which are not of rank .

As a last remark: the method is robust, and we adapt it for instance to sums over proper generalized arithmetic progressions, which are natural generalizations of intervals. Here we get bounds of quality depending also on the dimension of the progression (the saving is replaced by for a -dimensional progression), but the result is appealing even for large because the Polya-Vinogradov gap is

for a -dimensional progression , hence its size also increases with (this follows from a recent result of X. Shao bounding the -norm of the Fourier transform of the characteristic function of .)

math stat — 24.08.2014 @ 16:38

1. Are there any Polya-Vinogradov type and Paley type results for character sum over arbitrary subset A of Fp?

For example, a Plaley type result such as

Sum_{a in A} X(a) > (#A)^{1/2}

for infinitely many primes p?

2. For random subset R of Fp?

Thank you.