### Trace functions, II: Examples

Continuing after my last post, this one will be a list of examples of *trace functions* modulo some prime number . For each of the examples, I will give a bound for its *conductor*, which I recall is the main numerical invariant that allows us to measure the complexity of the trace function (formally, the conductor is attached to the object that gives rise to , but we can define the conductor of a trace function to be the minimal conductor of such a .) These objects will be called sheaves, since this is the language used in the paper(s) of Fouvry, Michel and myself, but one doesn’t need to know anything about sheaves to understand the examples.

I will start with a list of concrete functions which are trace functions, and then explain some of the basic *operations* one can perform on known trace functions to obtain new ones. All these examples will be (I hope) very natural, but it is usually a deep theorem that the functions come from sheaves.

Throughout, is a fixed prime number. Generically, denotes a non-trivial additive character modulo , for instance

(which may also be viewed casually as an -adic character), and denotes a multiplicative character modulo (non-trivial, unless specified otherwise.)

(1) **Characters and mixed characters**

Let and be non-zero rational functions in . Let

for which is not a pole of , or a zero or pole of , and in that case. Then is a trace weight. The (or an) associated sheaf is of rank , and its conductor is bounded by the sum of degrees of numerators and denominators of and . However, the size of the conductor arises for different reasons for and : for the “additive” component , singularities are poles of , and the contribution of each pole comes from the Swan conductor, which is bounded by the order of the pole at ; for the “multiplicative” component , the singularities are zeros and poles of , and each only contributes to the conductor: the Swan conductors for are all zero.

For analytic applications, the main point is that, by fixing and over , one obtains for *each* large enough (so that the reduction modulo makes sense), and each choice of characters and , a trace weight associated to and which has conductor uniformly bounded (depending on and only). Thus any estimates valid for all primes with implied constants depending only on the conductor of the trace functions involved will become an interesting estimate concerning and . This applies to the main theorem of my paper with Fouvry and Michel concerning orthogonality of Fourier coefficients of modular forms and trace functions…

These examples are the most classical, and are very useful. Even the simple case and is full of surprises.

(2) **Fiber-counting functions**

Another very useful example comes from a fixed non-constant rational function , which is viewed as defining a morphism

Consider then

This is a trace weight, associated to the direct image sheaf

which in representation theoretic terms is an induced representation from a finite-index subgroup, so that it remains relatively simple.

Here the rank of the sheaf is the degree of as a morphism (i.e., the generic number of pre-images of a point ); the singularities are the finitely many in such that the equation

has fewer than solutions (in ) and, at least if , the Swan conductors vanish everywhere, so that the conductor is bounded in terms of the degrees of the numerator and denominator of only. In particular, if is defined over , varying (large enough) will provide a family of trace functions modulo primes with uniformly bounded conductor, similar to the characters of the previous example with fixed rational functions as arguments.

The main reason this function is useful is that, for any other (arbitrary) function on , we have tautologically

(in other words, it is maybe better to interpret as the image measure of the uniform measure on the finite set under , and this formula is the classical “integration” formula for an image measure…)

One also often takes the function

where is the average of over . This is also a trace function (the sheaf corresponding to contains a trivial quotient, and this is the trace function of the kernel of the map to this trivial quotient). We now have

(3) **Number of points on families of algebraic varieties**

More generally, we can count points on one-parameter families of algebraic varieties of dimension . For instance, families of elliptic curves or of more general curves are quite common. To be concrete, one may have a polynomial , where is seen as the parameter, and consider the curves

Usually, it is not so much the number of points as the correction term that is most interesting. For instance, if the curves are generically geometrically irreducible, and have a single point at infinity, the size of is (for all but finitely many ) of the form

where satisfies the Weil bound

in terms of the genus of . In fact, once one ensures that the family of curves is such that the genus of the curves is the same (for all but finitely many ), the function

is a trace function on the corresponding dense open set of , for some sheaf which has rank . For the other values of , the trace function of the corresppnding middle-extension sheaf *might* differ from the value defined as above using the number of points, but since the number of those singularities is bounded by the conductor, one can usually (analytically at least) not worry too much about this. Similarly, in many cases the sheaf is tamely ramified everywhere (i.e., all Swan conductors vanish), and so the conductor is well-controlled.

In contrast with the first two examples, the construction of a sheaf with this trace function is not elementary: it is an example of the so-called “higher direct image sheaves” (with compact support). Since, for every “good” , the Riemann Hypothesis for curves shows that

where the are complex numbers of modulus , we can interpret the existence of this sheaf as saying that the algebraic variation of the “eigenvalues” is itself controlled by an algebraic object. This is one of the main insights that algebraic geometry (and étale cohomology in particular) brings to analytic number theory.

The family of elliptic curves

in my bijective challenge is of this type.

(4) **Families of Kloosterman sums**

One of the great examples, for analytic number theory, is given by families of Kloosterman sums: for an integer , and a non-zero , we let

The Weil bound for , and the even deeper work of Deligne for larger , prove that

for all invertible modulo . Further work, relying once more on the powerful formalism of étale sheaves and higher direct images in particular, shows that the function

is (the restriction to invertible of) a trace function for an irreducible sheaf, with conductor bounded in terms of only.

(5) **The Fourier transform**

If we have a function modulo , we define its Fourier transform by

for (the normalization here is convenient, as I will explain). It is now a very deep fact that, if $\latex K$ comes from a sheaf, then so does (the minus sign is natural, but this has to do with rather deep algebraic geometry…) More precisely, one has to be careful because of the fact that the Fourier transform of an additive character (as a function) is a multiple of a delta function. The latter does fit nicely in the framework of étale sheaves, but not as a middle-extension sheaf or Galois representation (because it is zero on a dense open set, so it would have to be zero to be a middle-extension sheaf or to come from a Galois representation). There is a geometric solution to this issue, but it involves speaking of perverse sheaves and related machinery, which we have barely started to understand: the Fourier transform works perfectly well at the level of perverse sheaves, and one can use their trace functions just as well as those of Galois representations. Since, in our current applications, we can always deal separately with additive characters (or delta functions), we have avoided having to deal with perverse sheaves (up to now…)

The existence of the -adic Fourier transform of sheaves was first proved by Deligne, but the theory of the sheaf-theoretic Fourier transform was largely built by Laumon (with further contributions, in particular, from Brylinski and Katz). To illustrate how powerful it is, consider

a relatively simple case of Example (1). We then have

so that the existence of the Fourier transform at the level of sheaves implies the existence of the Kloosterman sheaf parameterizing classical Kloosterman sums as in the previous example.

Other examples that arise from our previous examples are many families of exponential sums, for instance

(arising from Example (1); one must assume either that is not a polynomial of degree or that is non-trivial to have a well-defined sheaf), or

for with equal to the number of poles of (the sum over is over values where the rational function is defined), that arises from Example (2) (applied with the function ).

This operation of Fourier transform has one last crucial feature for applications to the analysis of trace functions: the conductor of is bounded in terms of that of only. This is something we prove in our paper using Laumon’s analysis of the singularities of the Fourier transform, and in fact we show that if the conductor of is at most , then the conductor of is at most . Hence the examples above, if the rational functions (and/or ) are fixed in and then reduced modulo various primes, always have conductor bounded uniformly for all .

(6) __Change of variable__

Given a non-constant rational function seen as a morphism

and a trace function , one can form the function

This is again, essentially, a trace function: as in Example (3), one may have to tweak the values of at some singularities (because pull-back of middle-extension sheaves do not always remain so), but this is fairly easily controlled. Moreover, one can also control the conductor of in terms of that of , taking into account the degree of latex f$. A specially simple case of great importance is when is an homography

(an automorphism of ) in which case no tweaking is necessary to defined , and the conductor is the same as that of (which certainly seems natural!)

We can now compose these various operations. One construction is the following (a finite-field Bessel transform): start with , apply the Fourier transform, change the variable to , apply again the Fourier transform. If we call the resulting function, the examples above show that if is a trace function with conductor , then will also be one, and its conductor will be bounded solely in terms of (in fact, it will be by the bound discussed in Example (5)).

**Trailer!**In the next post in this series, I will discuss the Riemann Hypothesis for trace functions and its applications. But probably before I will discuss the more recent works of Fouvry, Michel and myself, since we now have three further papers in our series — two small, and one big.