This paper derives an asymptotic formula for the average values of cubic L-functions over function fields, employing advanced techniques like metaplectic Eisenstein series and analyzing different cases based on the residue of q modulo 3.
Contribution
It provides the first asymptotic formulas for mean values of cubic L-functions over function fields in both Kummer and non-Kummer cases, using novel analytic methods.
Findings
01
Asymptotic formulas for mean values of cubic L-functions over F_q[t]
02
Explicit cancellation observed between main and dual terms in the non-Kummer case
03
Application of metaplectic Eisenstein series to analyze cubic Gauss sums
Abstract
We obtain an asymptotic formula for the mean value of L-functions associated to cubic characters over F_q[t]. We solve this problem in the non-Kummer setting when q=2 (mod 3) and in the Kummer case when q=1 (mod 3). The proofs rely on obtaining precise asymptotics for averages of cubic Gauss sums over function fields, which can be studied using the theory of metaplectic Eisenstein series. In the non-Kummer setting we display some explicit cancellation between the main term and the dual term coming from the approximate functional equation of the L-functions.
\displaystyle\mathcal{L}_{C}(u,\chi)=\begin{cases}\mathcal{L}_{q}(u,\chi)&\mbox{if $\chi$ is odd,}\\
\\
\displaystyle\frac{\mathcal{L}_{q}(u,\chi)}{1-u}&\mbox{if $\chi$ is even.}\end{cases}
\displaystyle\mathcal{L}_{C}(u,\chi)=\begin{cases}\mathcal{L}_{q}(u,\chi)&\mbox{if $\chi$ is odd,}\\
\\
\displaystyle\frac{\mathcal{L}_{q}(u,\chi)}{1-u}&\mbox{if $\chi$ is even.}\end{cases}
PC(u)=LC(u,χ)LC(u,χ).
PC(u)=LC(u,χ)LC(u,χ).
\displaystyle\deg(h)=g+2-\begin{cases}0&\mbox{if $\chi$ is even,}\\
1&\mbox{if $\chi$ is odd.}\end{cases}
\displaystyle\deg(h)=g+2-\begin{cases}0&\mbox{if $\chi$ is even,}\\
1&\mbox{if $\chi$ is odd.}\end{cases}
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.
Full text
The mean values of cubic L-functions over function fields
Chantal David
Department of Mathematics and Statistics Concordia University, 1455 de Maisonneuve West Montréal, Québec, Canada H3G 1M8
Université de Montréal, Pavillon André-Aisenstadt, Département de mathématiques et de statistique, CP 6128, succ. Centre-ville, Montréal, Québec, Canada H3C 3J7
We obtain an asymptotic formula for the mean value of L–functions associated to cubic characters over Fq[T]. We solve this problem in the non-Kummer setting when q≡2(mod3) and in the Kummer case when q≡1(mod3). The proofs rely on obtaining precise asymptotics for averages of cubic Gauss sums over function fields, which can be studied using the theory of metaplectic Eisenstein series. In the non-Kummer setting we display some explicit cancellation between the main term and the dual term coming from the approximate functional equation of the L–functions.
Key words and phrases:
Moments over function fields, cubic twists, non-vanishing.
The problem we consider in this paper is that of computing the mean value of Dirichlet L–functions Lq(s,χ) evaluated at the critical point s=1/2 as χ varies over the primitive cubic Dirichlet characters of Fq[T]. We will solve this problem in two different settings: when the base field Fq contains the cubic roots of unity (or equivalently when q≡1(mod3); we call this the Kummer setting) and when Fq does not contain the cubic roots of unity (when q≡2(mod3); we call this the non-Kummer setting.)
There are few papers in literature about moments of cubic Dirichlet twists over number fields, especially compared to the abundance of papers on quadratic twists. For the case of quadratic characters over Q,
the first moment was computed by Jutila [Jut81], and the second and third moments by Soundararajan [Sou00].
For the case of quadratic characters over Fq[T], the first 4 moments were computed by the second author of this paper [Flo17a, Flo17b, Flo17c]. In particular, the improvement of the error term for the first moment in [Flo17a] showed the existence of a secondary term (of size approximately the cube root of the main term) which was not predicted by any heuristic.
A secondary term of size X3/4 was explicitly computed by Diaconu and Whitehead in the number field setting [DW] for the cubic moment of quadratic L–functions and by Diaconu in the function field setting [Dia].
For the case of cubic characters, Baier and Young [BY10] considered the cubic Dirichlet characters over Q and obtained for the smoothed first moment that
[TABLE]
with an explicit constant c. Using an upper bound for higher moments of L–functions, Baier and Young also show that the number of primitive Dirichlet characters χ of order 3 with conductor less than or equal to Q for which L(1/2,χ)=0 is bounded below by Q76−ε.
Another result related to [BY10] is that of Cho and Park [CP], where the authors consider the 1–level density of zeros in the same family as that of Baier and Young. They compute the 1–level density when the support of the Fourier transform of the test function is in (−1,1) and show agreement with the prediction coming from the Ratios Conjecture.
The first moment of the cubic Dirichlet twists over Q(ξ3) was considered by Luo in [Luo04], and his main term has the same size as the first moment over Q, because the author considers only a thin subsets of the cubic characters, namely those given by the cubic residue symbols χc where c∈Z[ξ3] is square-free. This does not count the
conjugate characters χc2=χc2, and in particular, the first moment of [Luo04] is not real.
The problem of computing the mean value of cubic L–functions over function fields was considered by Rosen in [Ros95], where he averages over all monic polynomials of a given degree. This problem is different than the one we consider, since the counting is not done by genus and obtaining an asymptotic formula relies on using a combinatorial identity.
Before stating our results, we first introduce some notation. Let q be an odd prime power, and let Fq[T] be the set of polynomials over the finite field Fq. A Dirichlet character χ of modulus m∈Fq[T] is a multiplicative function from (Fq[T]/(m))∗ to C∗, extended to Fq[T] by periodicity if (a,m)=1, and defined by χ(a)=0 if
(a,m)=1. A cubic Dirichlet character is such that χ3 equals the principal character χ0, and it takes values in μ3, the cubic roots of 1 in C∗.
The smallest period of χ is called the conductor of the character. We say that χ is a primitive character of modulus m when m is the smallest period.
We denote by Lq(s,χ) the L–function attached to the character χ of Fq[T]. We keep the index q in the notation to avoid confusion, as we will also work over the quadratic extension Fq2 of Fq.
The set of cubic characters differs when Fq contains the third roots of unity or not.
If q≡1(mod3), Fq contains the third roots of unity,
and the number of primitive cubic Dirichlet characters with conductor of degree d is asymptotic to BK,1dqd+BK,2qd for some explicit constants BK,1,BK,2 (see Lemma
2.8). If q≡2(mod3), Fq does not contain the third roots of unity, and the number of primitive cubic Dirichlet characters with conductor of degree d
is asymptotic to BnKqd for some explicit constant BnK (see Lemma 2.10).
We will count primitive cubic characters ordering them by the degree of their conductor, or equivalently by the genus g of the cyclic cubic field extension of Fq[T] associated to such a character (see formula (8)).
We compute the first moment of cubic L–functions for the two settings. In the non-Kummer case, we have the following.
Theorem 1.1**.**
Let q be an odd prime power such that q≡2(mod3). Then
Let q be an odd prime power such that q≡1(mod3), and let χ3 be the cubic character on Fq∗ given by (3). Then,
[TABLE]
where CK,1 and CK,2 are given by equations (85) and (86) respectively.
The hypothesis that χ restricts to the character χ3 on Fq is not important, but simplifies the computations by ensuring that the L–functions have the same functional equation. It is analogous to the restriction in the case of quadratic characters to those with conductor of degree either 2g or 2g+1.
Since L-functions satisfy the Lindelöf hypothesis over function fields (see Lemma 2.6), one can easily bound the second moment, and we get the following corollary.
Corollary 1.3**.**
Let q be an odd prime power. Then,
[TABLE]
Translating from the function field to the number field setting, we associate qg with Q. Note that Theorem 1.1 is the function field analog of (1), and the proof of our Theorem 1.1 has many similarities with the work of [BY10].
The better quality of our error term can be explained in part by the fact that we can use the Riemann Hypothesis to bound the error term.
In the number field case, the same quality of error term can be obtained without the Riemann Hypothesis for some families using the appropriate version of the large sieve (for example in the case of the family of quadratic characters, with the quadratic large sieve due to Heath-Brown [HB95]). However the cubic large sieve, also due to Heath-Brown [HB00], provides a weaker upper bound. There is also an asymmetry between the sum over the cubic characters, which is naturally a sum over Q(ξ3), and the truncated Dirichlet series of the L-function, which is a sum over Z.
The asymmetry of the sums also exists in the function field setting.
Another difference from the work of Baier and Young is that we explicitly exhibit cancellation between the main term and the dual term coming from using the approximate functional equation for the L–functions. In their work Baier and Young [BY10] prove an upper bound for the dual term without obtaining an asymptotic formula for it, which is what we do in the function field case.
The first steps of our proofs are the usual ones, using the approximate functional equation to write the special value
[TABLE]
as a sum of two terms (the principal sum and the dual sum), where for a polynomial f∈Fq[T] the norm is defined by ∣f∣q=qdeg(f). Inspired by the work of Florea [Flo17c] to improve the quality of the error term, we evaluate exactly the dual sum and the secondary term of the main sum (corresponding to taking f cube in the approximate functional equation) in order to obtain cancellation of those terms. This is similar to the work of Florea for the first moment of quadratic Dirichlet characters over functions fields, replacing quadratic Gauss sums by cubic Gauss sums. Of course, this is not a trivial difference, as the behavior of quadratic Gauss sums is very regular since they are multiplicative functions. However cubic Gauss sums are different as they are no longer multiplicative. Handling the cubic Gauss sums is significantly more difficult than working with quadratic Gauss sums. This is one of the main focuses of our paper.
The distribution of Gauss sums over number fields was adressed by Heath-Brown and Patterson [HBP79], using the deep work of Kubota for automorphic forms associated to the metaplectic group. This was generalised by Hoffstein [Hof92] and Patterson [Pat07] for the function field case, and we review their work in Section 3. The main goal of Section 3 is to obtain an exact formula for the residues of the generating series
[TABLE]
where Gq(f,F) is the generalized shifted Gauss sum over Fq as defined by (21). With those residues in hand, we can evaluate precisely the main term of the dual sum, and indeed we can show that it (magically!) cancels with the secondary term of the principal sum. Unfortunately obtaining the cancellation is not enough to improve the error term, as we do not have good bounds for Ψ~q(f,u) beyond the pole at u3=1/q4.
We prove that the convexity bound in Lemma 3.11 holds, and any improvement of the convexity bound would allow an improvement of the error term of Theorem 1.1 coming from the cancellation that we exhibit.
Proving Theorem 1.2 is more difficult than obtaining the asymptotic formula in the non-Kummer case, and our error term is not as good as that in Theorem 1.1. To our knowledge, Theorem 1.2 is the first result when one considers all the primitive cubic characters (with the technical restriction that χ∣Fq∗=χ3, which does not change the size of the family). This explains the (maybe surprising) asymptotic for the first moment in Theorem 1.2, which is of the shape gqgP(1/g) where P is a polynomial of degree 1.
Because of the size of the family of cubic twists in the Kummer case, we are not able to obtain cancellation between the dual term and the error term from the main term. Certain cross-terms seem to contribute to the cancellation, but we cannot obtain an asymptotic formula for these cross terms. Instead we bound them using the convexity bound for Ψ~q(f,u), which explains the bigger error term from Theorem 1.2.
We remark that the results of Theorems 1.1 and 1.2 both correspond to a family with unitary symmetry, as expected. Note that for our results, we fix the size q of the finite field and let the genus g go to infinity. If instead one fixes the genus and lets q go to infinity, it should be possible to obtain asymptotic formulas for moments using equidistribution results as in the work of Katz and Sarnak [KS99] and then a random matrix theory computation as in the work of Keating and Snaith [KS00].
As mentioned before, a lower order term of size the cube root of the main term was computed in [Flo17c] in the case of the mean value of quadratic L–functions. We remark that in the case of the mean value of cubic L–functions, we can explicitly compute a term of size q5g/6 in the non-Kummer case and a term of size gq5g/6 in the Kummer setting
(see remarks 4.5 and 5.6 respectively). Due to the size of the error terms, these terms do not appear in the asymptotic formulas in Theorems 1.1 and 1.2. However, we suspect these terms do persist in the asymptotic formulas. Improving the convexity bound on Ψ~q(f,u) would allow us to improve the error terms, and maybe to detect the lower order terms. We remark that a similar sized term was conjectured by Heath-Brown and Patterson [HBP79] for the average of the arguments of cubic Gauss sums in the number field setting. We believe the matching size of these terms is not a coincidence, as the source of our q5g/6 comes from averaging cubic Gauss sums over function fields.
Acknowledgements. The authors would like to thank Roger Heath-Brown, Maxim Radziwill, Kannan Soundararajan, and Matthew Young for helpful discussions.
The research of the first and third authors is supported by the National Science and Engineering Research Council of Canada (NSERC) and
the Fonds de recherche du Québec – Nature et technologies (FRQNT). The second author of the paper was supported by a National Science Foundation (NSF) Postdoctoral Fellowship during part of the research which led to this paper.
2. Notation and Setting
Let q be an odd prime power such that q≡1(mod3).
We denote by Mq the set of monic polynomials of Fq[T], by Mq,d the set of monic polynomials of degree exactly d, by
Mq,≤d the set of monic polynomials of degree smaller than or equal to d,
by Hq the set of monic square-free polynomials of Fq[T] and analogously for
Hq,d and Hq,≤d. Note that ∣Mq,d∣=qd and for d≥2, we have that ∣Hq,d∣=qd(1−q1).
In general, unless stated otherwise, all polynomials are monic.
As for the L–functions in the introduction, we keep the index q in the notation to avoid confusion, as we will have to consider polynomials over the quadratic extension Fq2 of Fq when q≡2(mod3).
We define the norm of a polynomial f(T)∈Fq[T] over Fq[T] by
[TABLE]
Then, if f(T)∈Fq[T], we have ∣f∣qn=qndeg(f), for any positive integer n.
For q≡1(mod3) we fix once and for all an isomorphism Ω between μ3, the cubic roots of 1 in C∗, and the cubic roots of 1 in
Fq∗.
We also fix a cubic character χ3 on Fq∗ by
[TABLE]
For any character χ on Fq[T], we say that χ is even if it is trivial on Fq∗, and odd otherwise.
Then, when q is an odd prime power such that q≡1(mod3), any cubic character on Fq[T] falls in three natural classes depending on its restriction to Fq∗ which is either χ3, χ32 or the trivial character
(in the first 2 cases, the character is odd, and in the last case, the character is even).111
We will see in Section 2.2 that when q≡2(mod3), any cubic character on Fq[T] is even.
For any odd character χ on Fq[T], we denote by τ(χ) the Gauss sum of the restriction of χ to Fq (which is either χ3 or χ32), i.e.
[TABLE]
Then, ∣τ(χ)∣=q1/2, and we denote the sign of the Gauss sum by
[TABLE]
When χ is even, we set ϵ(χ)=1.
We will often use the fact that when q≡1(mod6), the cubic reciprocity law is very simple.
Lemma 2.1** (Cubic Reciprocity).**
Let a,b∈Fq[T] be relatively prime monic polynomials, and let χa and χb be the cubic residue symbols defined above. If q≡1(mod6), then
[TABLE]
Proof.
This is Theorem 3.5 in [Ros02] in the case where a and b are monic and q≡1(mod6). ∎
Finally, we recall Perron’s formula over Fq[T] which we will use many times throughout the paper.
Lemma 2.2** (Perron’s Formula).**
If the generating series A(u)=∑f∈Mqa(f)udeg(f)
is absolutely convergent in ∣u∣≤r<1, then
[TABLE]
and
[TABLE]
where, in the usual notation, we take ∮ to signify the integral over the circle oriented counterclockwise.
2.1. Zeta functions and the approximate functional equation
The affine zeta function over Fq[T] is defined by
[TABLE]
for ∣u∣<1/q. By grouping the polynomials according to the degree, it follows that
[TABLE]
and this provides a meromorphic continuation of Zq(u) to the entire complex plane. We remark that Zq(u) has a simple pole at u=1/q
with residue −q1. We also define
[TABLE]
Note that Zq(u) can be expressed in terms of an Euler product as follows
[TABLE]
where the product is over monic irreducible polynomials in Fq[T].
Let C be a curve over Fq(T) whose function field is a cyclic cubic extension of Fq(T).
From the Weil conjectures, the zeta function of the curve C can be written as
[TABLE]
where
[TABLE]
for some eigenangles θj, j=1,…,g.
We can write PC(u) in terms of the L-functions of the two cubic Dirichlet characters χ and χ of the function field of C. Let
h be the conductor of the non-principal character χ.
Define
[TABLE]
where the second equality follows from the orthogonality relations.
We remark that setting u=q−s, we have Lq(s,χ)=Lq(u,χ). From now on
we will mainly use the notation Lq(u,χ). The L–function has the following Euler product
[TABLE]
where the product is again over monic irreducible polynomials P in Fq[T]. From now on, the Euler products we consider are over monic, irreducible polynomials and if there is an ambiguity as to whether the polynomials belong to Fq[T] or Fq2[T] we will indicate so.
Considering the prime at infinity, we write
[TABLE]
Then we have
[TABLE]
Furthermore, using the Riemann–Hurwitz formula, we have that
[TABLE]
Lemma 2.3**.**
Let χ be a primitive cubic character to the modulus h.
If χ is odd, then
Lq(u,χ) satisfies the functional equation
[TABLE]
where the sign of the functional equation is
[TABLE]
If χ is even, then
Lq(u,χ) satisfies the functional equation
[TABLE]
where the sign of the functional equation is
[TABLE]
Proof.
From (7) and (8),
if χ is odd, then g=deg(h)−1,
Lq(u,χ)=LC(u,χ),
and the functional equation follows from the Weil conjectures, since we have
[TABLE]
Since
[TABLE]
comparing the coefficients of udeg(h)−1, it follows that
[TABLE]
which gives that
[TABLE]
From (7) and (8),
if χ is even, then g=deg(h)−2, Lq(u,χ)=(1−u)LC∗(u),
and we have
[TABLE]
Since
[TABLE]
comparing the coefficients of udeg(h)−1, it follows that
[TABLE]
which gives that
[TABLE]
∎
It is more natural to rewrite the sign of the functional equation in terms of Gauss sums over Fq[T]. In particular, it is not obvious from (10) and (11) that ∣ω(χ)∣=1.
As in [Flo17c], we will use the exponential function which was introduced by D. Hayes [Hay66]. For any a∈Fq((1/T)), we define
[TABLE]
with a1 the coefficient of 1/T in the Laurent expansion of a.
We then have that eq(a+b)=eq(a)eq(b), and eq(a)=1 for a∈Fq[T]. Also, if a,b,h∈Fq[T] are such that a≡b(modh), then
eq(a/h)=eq(b/h).
For χ a primitive character of modulus h on Fq[T], let
[TABLE]
be the Gauss sum of the primitive Dirichlet character χ over Fq[T].
The following corollary expresses the root number in terms of Gauss sums.
Corollary 2.4**.**
Let χ be a primitive character of modulus h on Fq[T]. Then
[TABLE]
Proof.
We prove the following relation
[TABLE]
which clearly implies the corollary.
Writing
[TABLE]
we have
[TABLE]
[TABLE]
When χ is even, 1 is a root of Lq(u,χ) and therefore ∑j=0deg(h)−1aj=0. The result follows.
∎
The following result allows us to replace the sum (6) by two shorter sums of lengths A and g−A−1, where A is a parameter that can be chosen later, where the relationship between g and deg(h) is given by (8).
Now using equation (16) for bn and bn+1, substracting the two equations and using the functional equation for bn, we get that
[TABLE]
and hence
[TABLE]
Now we use the equations above for n=g−1−A and n=A and after some manipulations, we get that
[TABLE]
and the result follows.
∎
The following lemmas provide upper and lower bounds for L–functions.
Lemma 2.6**.**
Let χ be a primitive cubic character of conductor h defined over Fq[T]. Then, for
Re(s)≥1/2 and for all ε>0,
[TABLE]
Proof.
This is the Lindelöf hypothesis in function fields. It is Theorem 5.1 in [BCD*+*18]. For the quadratic case see also the proof of Corollary 8.2 in
[Flo17a] and Theorem 3.3 in [AT14].
∎
Lemma 2.7**.**
Let χ be a primitive cubic character of conductor h defined over Fq[T]. Then, for Re(s)≥1 and for all ε>0,
[TABLE]
Proof.
First assume that χ is an odd character.
Recall that g=deg(h)−1. Then
[TABLE]
and
[TABLE]
From the above it follows that if Re(s)≥1 then
[TABLE]
Now for Re(s)=σ>1 we have
[TABLE]
where Λ(f) is the von Mangoldt function, equal to deg(P) when f=Pn for P prime, and zero otherwise.
Hence
[TABLE]
If σ≥1+degh1 then it follows that
[TABLE]
Now if s=1+it and s1=1+deg(h)1+it, we have that
[TABLE]
where the first inequality follows from (17). Combining the above and (18) it follows that when Re(s)=1 we have
[TABLE]
Now
[TABLE]
and then
[TABLE]
When χ is an even character, the L-function has an extra factor of 1−q−s which does not affect the bound.
∎
Note that using ideas as in the work of Carneiro and Chandee [CC11] one could prove that
[TABLE]
when Re(s)=1. For our purposes the lower bound of deg(h)−1 is enough and we do not have to follow the method in [CC11].
2.2. Primitive cubic characters over Fq[T]
Let q be an odd power of a prime. In this section we describe the cubic characters over Fq[T] when q≡1(mod3) (the Kummer case) and q≡2(mod3) (the non-Kummer case).
We first suppose that q is odd and q≡1(mod3).
We define the cubic residue symbol χP, for P an irreducible monic polynomial in Fq[T]. Let a∈Fq[T]. If P∣a, then χP(a)=0, and otherwise
χP(a)=α,
where α is the unique root of unity in C such that
[TABLE]
We extend the definition by multiplicativity to any monic polynomial F∈Fq[T] by defining for F=P1e1…Pses, with distinct primes Pi,
[TABLE]
Then, χF is a cubic character modulo P1…Ps. It is primitive if and only if all the ei are 1 or 2. Then it follows that the conductors of the primitive cubic characters are the square-free monic polynomials F∈Fq[T], and for each such conductor, there are 2ω(F) characters, where ω(F) is the number of primes dividing F. More precisely, for any conductor F=F1F2 with (F1,F2)=1 we have the primitive character of modulus F given by
[TABLE]
Lemma 2.8**.**
Suppose q≡1(mod3), and let NK(d)
be the number of primitive cubic characters with conductor of degree d. Then,
[TABLE]
where BK,1=FK(1/q), BK,2=(FK(1/q)−q1FK′(1/q)), and FK is given by (19).
Proof.
Let a(F) be the number of cubic primitive characters of conductor F. By the above discussion, the generating series for a(F) is given by
[TABLE]
which is analytic for ∣u∣<1/q with a double pole at u=1/q.
We write
[TABLE]
Then, using Perron’s formula (Lemma 2.2), and moving the integral from ∣u∣=q−2 to ∣u∣=q−(1/2+ε) while picking the residue of the (double) pole at u=q−1, we have
[TABLE]
∎
For each primitive cubic character χF1F22, we have that
for α∈Fq∗,
[TABLE]
and χF1F22 is even if and only if deg(F1)+2deg(F2)≡0(mod3). If χF1F22 is odd,
the restriction to Fq∗ is χ3 when deg(F1)+2deg(F2)≡1(mod3), and
χ32 when deg(F1)+2deg(F2)≡2(mod3), where χ3 is defined by (3).
Then, since the conductor of χF1F22 is F=F1F2, we have from (8) that
[TABLE]
For convenience, recall that we restrict to the odd cubic primitive characters such that the restriction to Fq∗ is χ3.
We have then showed the following.
Lemma 2.9**.**
Suppose q is odd and q≡1(mod3). Then,
[TABLE]
and the sign of the functional equation of Lq(s,χF1χF2) is equal to
[TABLE]
where χ3 is the cubic residue symbol on Fq∗ defined by (3) and ϵ(χ3) is defined by (5).
We now suppose that q≡2(mod3). Then there are no cubic characters modulo P for primes of odd degree since 3∤qdeg(P)−1. For each prime P of even degree and a∈Fq[T], we have the cubic residue symbol
χP(a)=α,
where α is the unique cubic root of unity in C such that
[TABLE]
where Ω takes values in the cubic roots of unity in Fq2.
We extend the definition by multiplicativity to any monic polynomial F∈Fq[T] supported on primes of even degree by defining for F=P1e1…Pses, with distinct primes Pi of even degree,
[TABLE]
Then, χF is a cubic character modulo P1…Ps, and it is primitive if and only if all the ei are 1 or 2. It follows that the conductors of the primitive cubic characters are the square-free polynomials F∈Fq[T] supported on primes of even degree, and for each such conductor, there are 2ω(F) characters, where ω(F) is the number of primes dividing F.
Lemma 2.10**.**
Suppose q≡2(mod3), and let NnK(d)
be the number of primitive cubic characters with conductor of degree d. Then,
[TABLE]
where BnK=FnK(1/q) and FnK(u) is defined by (20).
Proof.
Let a(F) be number of cubic primitive characters of conductor F. By the above discussion, the generating series for a(F) is given by
[TABLE]
which is analytic for ∣u∣<1/q with simple poles at u=1/q and u=−1/q. This follows from the fact that the primes of even degree in Fq[T] are exactly the primes splitting in the quadratic extension Fq2(T)/Fq(T).
Recall that
[TABLE]
where u=q−s and the product is over primes P of Fq[T]. The analytic properties of GnK(u) then follow from the analytic properties of Zq2(u2), which is analytic everywhere except for simple poles when u2=q−2.
We write
[TABLE]
which is analytic for ∣u∣<q−1/2.
Then, using Perron’s formula (Lemma 2.2), and moving the integral from ∣u∣=q−2 to ∣u∣=q−(1/2+ε) while picking the poles at u=±q−1 , we have
[TABLE]
Notice that FnK(1/q)=FnK(−1/q), so the main term is zero when d is odd. In this case, we already knew that there are no primitive cubic characters with conductor of odd degree as every prime which divides the conductor has even degree. For d even, this proves the result.
∎
It is more natural to describe these characters as characters over Fq2[T] restricting to characters over Fq[T] as in the work of Bary-Soroker and Meisner [BSM] (generalizing the work of Baier and Young [BY10] from number fields to function fields) by counting characters of Fq2[T] whose restrictions to Fq[T] are cubic characters over Fq[T]. In what follows, for f in the quadratic extension Fq2[T] over Fq[T], we will denote by f~ the Galois conjugate of f.
Notice that q2≡1(mod3), and we have then described the primitive cubic characters of Fq2[T] in the paragraph before Lemma 2.10.
Supose that π is a prime in Fq2[T] lying over a prime P∈Fq[T] such that P splits as ππ~. Notice that P splits in Fq2[T] if and only if the degree of P is even.
It is easy to see that the restriction of χπ to Fq[T] is the character χP, and the restriction of χπ~ to Fq[T] is the character χP (possibly exchanging π and π~). Then by running over all the characters χF where F∈Fq2[T] is square-free and not divisible by a prime P of Fq[T], we are counting exactly the characters over Fq2[T] whose restrictions are cubic characters over Fq[T], and each character over Fq[T] is counted exactly once. For more details, we refer the reader to [BSM].
We also remark that any cubic character over Fq[T] is even when q≡2(mod3). Indeed, by the classification above, such a character comes from χF with F∈Fq2[T], and for α∈Fq⊆Fq2,
we have
[TABLE]
Since q is odd and q≡2(mod3), we have that (q−1)∣(q2−1)/3.
By (8), if F∈Fq[T] is the conductor of a cubic primitive character χ over Fq[T], it follows that deg(F)=g+2. By the classification above, it follows that F=P1…Ps for distinct primes of even degree, and the character (modF) is the restriction of a character of conductor π1…πs over Fq2[T], where πi is one of the primes lying above Pi. Then the degree of the conductor of this character over Fq2[T] is equal to g/2+1.
We have then proved the following result.
Lemma 2.11**.**
Suppose q≡2(mod3). Then,
[TABLE]
2.3. Generalized cubic Gauss sums and the Poisson summation formula
Let χf be the cubic residue symbol defined before for f∈Fq[T]. This is a character of modulus f, but not necessarily primitive.
We define the generalized cubic Gauss sum by
[TABLE]
with the exponential function defined in (14).
We remark that if χf has conductor f′ with deg(f′)<deg(f), then
G(χf)=Gq(1,f).
If (a,f)=1, we have
[TABLE]
The following lemma shows that the shifted Gauss sum is almost multiplicative as a function of f, and we can determine it on powers of primes. We have the following.
Lemma 2.12**.**
Suppose that q≡1(mod6).
(i)
If (f1,f2)=1, then
[TABLE]
(ii)
If V=V1Pα where P∤V1, then
[TABLE]
where ϕ is the Euler ϕ-function for polynomials. We recall that ϵ(χ)=1 when χ is even. For the case of χPi, this happens if 3∣deg(Pi).
Proof.
The proof of (i) is the same as in [Flo17c].
We write u(modf1f2) as u=u1f1+u2f2 for u1(modf2) and u2(modf1). Then,
[TABLE]
by cubic reciprocity. The second line of (i) follows from (22).
Now we focus on the proof of (ii).
Assume that i≤α. Then
[TABLE]
The exponential above is equal to 1 since uV1Pα−i∈Fq[T], and if i≡0(mod3), then χPi(u)=1 when (u,P)=1. The conclusion easily follows in this case. If i≡0(mod3), the conclusion also follows easily from orthogonality of characters.
Now assume that i=α+1. Write u(modPi) as u=PA+C, with A(modPi−1) and C(modP). Then
[TABLE]
If i≡0(mod3), then χPi(V1−1)=1 and
[TABLE]
and the conclusion follows. So assume that i≡0(mod3).
Then
If i≥α+2, then again the proof goes through exactly as in [Flo17c].
∎
Now we state the Poisson summation formula for cubic characters.
Recall that for any non-principal character on Fq∗, τ(χ) is the standard Gauss sum defined over Fq by equation (4).
Also recall that for χ odd, ∣τ(χ)∣=q, and τ(χ)=ϵ(χ)q.
For χ even, ϵ(χ)=1.
Proposition 2.13**.**
Let f be a monic polynomial in Fq[x] with deg(f)=n, and let m be a positive integer.
If deg(f)≡0(mod3), then
Now if deg(f)≡0(mod3) then χf is an even character, and
[TABLE]
If deg(f)≡0(mod3) then χf is an odd character, and
[TABLE]
Also, if deg(f)≡0(mod3), then f is not a cube, and the character χf is non-trivial, which implies that Gq(0,f)=0 by the orthogonality relations.
∎
3. Averages of cubic Gauss sums
In this section we prove several results concerning averages of cubic Gauss sums which will be needed later. Assume throughout that q≡1(mod6).
For a,n∈Z and n positive, we denote by [a]n the residue of a modulo n such that
0≤[a]n≤n−1.
We will prove the following.
Proposition 3.1**.**
Let f=f1f22f33 with f1 and f2 square-free and coprime.
We have
[TABLE]
with 2/3<σ<4/3 and where Ψ~q(f,u) is given by (23) and ρ(1,[d+deg(f1)]3) is given by (28).
Moreover, we have
[TABLE]
To prove Proposition 3.1 we first need to understand the generating series of the Gauss sums. Let
[TABLE]
and
[TABLE]
The function Ψq(f,u) was studied by Hoffstein [Hof92], and we will cite here the relevant results that we need, following the notation of Patterson [Pat07]. We postpone the proof of Proposition 3.1 to the next sections.
3.1. The work of Hoffstein and Patterson
We first study the general Gauss sums associated to the nth residue symbols as done in [Hof92, Pat07], and we specialize to n=3 later. We always assume that q≡1(modn).
Let η∈(Fq((1/T))× and define
[TABLE]
where the equivalence relation is given by
[TABLE]
There is difference between our definition of ψ(f,η,u) above, and the definition of ψ(r,η,u) in [Pat07, p. 245]: we are summing over monic polynomials in Fq[T], and not all polynomials in Fq[T], as in
[Hof92]. This explains the extra factors of the type (q−1)/n which appear in [Pat07].
Because our polynomials are monic, it is enough to consider the equivalence classes
that separate degrees, namely η=π∞−i, where π∞ is the uniformizer of the prime at infinity, i.e. T−1 in the completion Fq((1/T)).
A little bit of basic algebra in Fq((1/T)) shows that for any i∈Z,
[TABLE]
Then ψ(f,π∞−i,u) depends only on the value of i modulo n.
We remark that since we have fixed the map between the nth roots of unity in Fq∗ and μn⊆C∗ at the beginning of this paper,
we do not make this dependence explicit in our notation, as it is done in [Pat07].
Then we can write the generating series Ψq(f,u) as
[TABLE]
The main result of Hoffstein is a functional equation for ψ(f,π∞−i,u) [Hof92, Proposition 2.1], which we write below using the notation of Patterson.
Proposition 3.2**.**
[Hof92, Proposition 2.1]**
For 0≤i<n and f∈Mq, we have
[TABLE]
*where B=[(1+deg(f)−i)/n], E=1−[(deg(f)+1−2i)/n], and Wf,i=τ(χ32i−1χf)
with χ3 given by equation (3).
*
Remark 3.3**.**
Note that we can rewrite the functional equation in the following form (for n=3)
[TABLE]
where
[TABLE]
with Wf,i as above.
By setting u=q−s and letting u→∞ in the functional equation, Hoffstein showed that
[TABLE]
where P(f,i,x) is a polynomial of degree at most [(1+deg(f)−i)/n] in x. We remark that while ψ(f,π∞−i,u) depends only on the value of i modulo n,
this is not the case for P(f,i,un).
Remark 3.4**.**
Note that, from (26), the left-hand side of equation (25) above has no pole at u3=1/q2, so neither does the right-hand side.
We let
[TABLE]
By setting x=un=q−ns, we can write for 0≤i≤n−1,
[TABLE]
If j≥[(1+deg(f)−i)/n] with 0≤i≤n−1, then we have the recurrence relation
[TABLE]
Using that, we can rewrite, for any B≥[(1+deg(f)−i)/n],
[TABLE]
Let
[TABLE]
Using the formula above for P(f,i,x), it follows that
[TABLE]
where i′≡i(modn), and i′≥deg(f).
To prove Proposition 3.1 we need to obtain an explicit formula for the residue in equation (28) which we do in the next subsection.
3.2. Explicit formula for the residue ρ(f,i)
From now on, we will specialize to n=3.
For π prime, following Patterson’s notation, let
[TABLE]
We will need the following result.
Lemma 3.5**.**
Let π be a prime such that π∤f.
We have the following relations
[TABLE]
Proof.
These equations appear in page 249 of [Pat07] as part of the “Hecke theory” equations.
For completeness we give here the details of the proof of (30). The proofs of the other two identities proceed in a similar fashion. Consider
[TABLE]
Note that in the second sum above, we need π∣∣F1, otherwise the Gauss sum will vanish by Lemma 2.12.
We write F1=πF2 with π∤F2. Part (i) of Lemma 2.12 implies that
Gq(fπ,π2F2)=Gq(fπ3,F2)Gq(fπ,π2)=Gq(f,F2)Gq(fπ,π2).
Moreover, part (ii) of Lemma 2.12 implies that Gq(fπ,π2)=∣π∣qGq(f,π), where we have used that χπ(−1)=1 since it is a cubic character.
Putting all of this together yields (30).
∎
Lemma 3.6**.**
Let π be a prime such that π∤f.
We have the following relation
[TABLE]
Proof.
We have
[TABLE]
Now when (F,π)=1, by (22),
it follows that Gq(fπk,F)=Gq(fπ[k]3,F). We also have using Lemma 2.12 and (22),
[TABLE]
Using the relations above in (33) and rearranging, we get that
[TABLE]
We now do the same with j+3 and take the difference. Then we have
[TABLE]
Dividing by (1−q3(1−s)), we obtain the result.
∎
We will also use the following periodicity result, which is stated in [Pat07] and in [KP84, p. 135].
Lemma 3.7** (The Periodicity Theorem).**
Let π be a prime such that π∤f. Then
[TABLE]
We also need the following.
Lemma 3.8**.**
Let π be a prime such that π∤f. Then
[TABLE]
Proof.
We multiply relation (32) by qis(1−q4−3s)/(1−q3(1−s)) and take the limit as s→34. This yields
Let f=f1f22f33 with f1, f2 square-free and coprime.
For n=3, we have that ρ(f,i)=0 if f2=1 and
[TABLE]
when f2=1. Here
[TABLE]
Proof.
We start by computing ρ(1,[i]3). Recall by definition that
[TABLE]
First suppose that [i]3=0, i.e., deg(F)≡0(mod3). Then, χF is even and
[TABLE]
Then we write
[TABLE]
where the term δ\leavevmodeto5.21pt\vboxto5.21pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt3.69905pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt3.69905pt\pgfsys@lineto3.69905pt3.69905pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto3.69905pt3.69905pt\pgfsys@lineto3.69905pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto3.69905pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.10959pt1.10959pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.10959pt1.10959pt\pgfsys@lineto1.10959pt4.80865pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt3.69905pt\pgfsys@lineto1.10959pt4.80865pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.10959pt4.80865pt\pgfsys@lineto4.80865pt4.80865pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto3.69905pt3.69905pt\pgfsys@lineto4.80865pt4.80865pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto3.69905pt0.0pt\pgfsys@lineto4.80865pt1.10959pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto4.80865pt1.10959pt\pgfsys@lineto4.80865pt4.80865pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.10959pt1.10959pt\pgfsys@lineto4.80865pt1.10959pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture(F)=1 is 1 if F=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture and 0 otherwise.
Since [i]3=0, τ(χF)=−1 and ∑c∈Fq∗χF(c)=q−1, and we have
[TABLE]
Notice that
[TABLE]
and this gives zero when k≡1(mod3).
This gives
[TABLE]
where we have used Proposition 2.7 in [Ros02]. Finally, we get
[TABLE]
and taking the residue,
[TABLE]
When [i]3=0, ∑c∈Fq∗χF(c)=0 and we obtain,
[TABLE]
When [i]3=2, from equation (35), we immediately get that the sum above is zero and
[TABLE]
On the other hand, if [i]3=1 we have, by cubic reciprocity,
[TABLE]
where we have used again Proposition 2.7 in [Ros02]. Taking the residue, we get
[TABLE]
To obtain equation (34), we start by multiplying equation (30) by qis(1−q4−3s) and taking the limit as
s→4/3. By Lemma 3.8 for π∤f we get that
[TABLE]
which simplifies to
[TABLE]
Multiplying equation (31) by qis(1−q4−3s), taking the limit as s→4/3, and applying Lemma 3.8 we get that
[TABLE]
which implies that
[TABLE]
Notice that by the Periodicity Theorem (Lemma 3.7),
ρ(f,i) depends on the cubic-free part of f.
From this and equation (37) we can suppose that f=f1 with f1 square-free.
Write f=π1⋯πk. By (36), we have
[TABLE]
In the equation above, note that
[TABLE]
which follows by induction on the number of prime divisors of f and part (i) of Lemma 2.12.
This finishes the proof of Lemma 3.9.
∎
3.3. Upper bounds for Ψq(f,u) and Ψ~q(f,u)
We will first prove the following result which provides an upper bound for Ψq(f,u).
Theorem 3.10**.**
For 1/2≤σ≤3/2 and ∣u3−q−4∣>δ where δ>0, we have that
[TABLE]
where u=q−s as usual, and σ=Re(s).
Proof.
The bound for Ψq(f,q−s) for 1/2<Re(s)≤3/2 and ∣u3−q−4∣>δ follows from the functional equation and the Phragmén–Lindelöf principle.
It suffices to show that the bound holds for ψ(f,π∞−i,q−s) for i=0,1,2 by (24).
First, it follows from (26) and (27) that for B=[(1+deg(f)−i)/3] we have
[TABLE]
We now bound ∣C(f,k)∣. Write F=F1F2 with (F1,f)=1 and F2∣f∞ (by this we mean that the primes of F2 divide f.) We use repeatedly that ∣Gq(f,F1F2)∣=∣Gq(f,F1)∣∣Gq(f,F2)∣. By Lemma 2.12 we have
for F2∣f∞ that ∣Gq(f,F2)∣=0 unless F2∣f2. We write
[TABLE]
Thus
[TABLE]
We get that for σ≤3/2
[TABLE]
with an absolute constant in that region.
In particular,
[TABLE]
when Re(s)=3/2.
From the functional equation of Remark 3.3, we have for 1/2≤Re(s)≤3/2 and ∣u3−q−4∣>δ that
[TABLE]
where a1(s) and a2(s) are absolutely bounded above and below in the region considered
(independently of f).
Using the bound (38) and the functional equation gives that
[TABLE]
when Re(s)=1/2.
We consider the function Φ(f,π∞−i,s)=(1−q4−3s)(1−q3s−2)ψ(f,π∞−i,q−s)ψ(f,π∞−i,qs−2).
Then Φ(f,π∞−i,s) is holomorphic in the region 1/2≤Re(s)≤3/2, and
Φ(f,π∞−i,s)≪∣f∣q1/2+ε for Re(s)=3/2 and Re(s)=1/2.
Using the Phragmén–Lindelöf principle,
it follows that for 1/2≤Re(s)≤3/2, we have that
If deg(f)+1≡2i(mod3), then the formula above implies that
[TABLE]
Now assume that deg(f)+1≡2i(mod3).
Similarly we consider the function Φ~(s)=(1−q4−3s)(1−q3s−2)ψ(f,π∞−i,q−s)ψ(f,π∞i−1−deg(f),qs−2). Then, using the same arguments as above we get that
[TABLE]
Combining the two equations (40) and (42), it would follow that
[TABLE]
Switching i with deg(f)+1−i (since deg(f)+1≡2i(mod3)), we get that there exist absolutely bounded constants b1(s) and b2(s) such that
[TABLE]
If (a1,a2) and (b2,b1) are not linearly independent, then from the equation above and (39) it follows that
[TABLE]
for some λ(s).
Combining this with equation (43), we get that
[TABLE]
and the conclusion again follows by replacing 2−s by s.
If (a1,a2) and (b2,b1) are linearly independent, then
[TABLE]
From the equation above and (43), by the linear independence condition, we get that
[TABLE]
and
[TABLE]
By summing the two equations above, we recover equation (41) without any restrictions on i,
[TABLE]
Summing over i=0,1,2 and replacing 2−s by s finishes the proof.
∎
In order to obtain an upper bound for Ψ~q(f,u) (recall its definition (23)) we first need to relate it to Ψq(f,u) which we do in the next lemma.
Lemma 3.11**.**
Let f=f1f22f33 with f1,f2 square-free and co-prime, and let f3∗ be the product of the primes dividing f3 but not dividing f1f2.
Then,
[TABLE]
If 1/2≤σ≤3/2 and ∣u3−q−4∣,∣u3−q−2∣>δ, then
[TABLE]
Proof.
We first show that the last assertion follows from the expression (44) for Ψ~q(f,u).
Suppose that 1/2≤σ≤3/2 and ∣u3−q−4∣,∣u3−q−2∣>δ. Then, for Re(s)=σ,
[TABLE]
We now prove (44). We first remark that by definition of f1,f2,f3∗, we have that (f,F)=1⟺(f1f2,F)=1\mboxand(f3∗,F)=1 with (f1f2,f3∗)=1.
If (f1f2f3,F)=1, then Gq(f1f22f33,F)=χF(f33)Gq(f1f22,F)=Gq(f1f22,F), and
[TABLE]
If (a,F)=1, then there is a prime P such that P2∣aF and P∤f1f22, and then
Gq(f1f22,aF)=0.
We can then suppose that (a,F)=1, and then by Lemma 2.12 (i), we have that
Gq(f1f22,aF)=Gq(f1f22,a)Gq(af1f22,F), and
[TABLE]
Notice that af1f2 is square-free and that a, f1 and f2 are two-by-two co-prime.
Let P be a prime dividing f2, and we write f2=Pf2′, and F=PiF′ with (F′f2′,P)=1.
Then, by Lemma 2.12,
[TABLE]
We remark that we have used that Gq(af1f2′2P5,F′)=Gq(af1f2′2P2,F′) for the second line, since (P,F′)=1.
This gives
By applying Perron’s formula (Lemma 2.2) for a small circle C around the origin and using expression (44), we have
[TABLE]
Now we write
[TABLE]
Each ψ has three poles, at q−4/3ξ3k,k=0,1,2, where ξ3=e2πi/3. We compute the residues of the poles in the integral above.
We recall that formula (26) gives
[TABLE]
where 1−q4u3ujP(f,j,u3) is a power series whose nonzero coefficients correspond to monomials with deg≡j(mod3), and then
the only ψ which gives a non-zero integral in equation (48) comes from ψ(af1f22/ℓ,π∞−j,u) with j such that j+deg(a)+2deg(ℓ)≡d(mod3).
Note that if j+deg(a)+2deg(ℓ)≥d+1, the integral in (48) is zero because the integrand has no poles inside C. Hence we assume that j+deg(a)+2deg(ℓ)≤d.
In (48) we shift the contour of integration to ∣u∣=q−σ, where 2/3<σ<4/3 and we encounter the poles when u3=q−4.
With j as before, we compute the residue of the integrand at u3=q−4 and this gives
[TABLE]
We get that
[TABLE]
Using Lemma 3.9 and since af1/ℓ is square-free and co-prime to f2 it follows that
[TABLE]
Note that j+deg(ℓaf1)≡d+deg(f1)(mod3), and
[TABLE]
where we used Lemma 2.12.
Combining the three equations above it follows that
[TABLE]
where we have used Lemma 3.11 to bound the integral.
Now using Perron’s formula (Lemma 2.2) for the sum over ℓ we have
[TABLE]
where we are integrating along a small circle around the origin. Let α(a)=0 if deg(a)≡d−j(mod2) and α(a)=1 otherwise. Introducing the sum over a and using Perron’s formula, it follows that
[TABLE]
where again we are integrating along a small circle around the origin and we did the change of variables w→−w to the second integral to reach the last line. Let R(x,w) denote the Euler product above. Using equations (50) and (51) it follows that
[TABLE]
We first shift the contour in the integral over x to ∣x∣=q1−ε and we encounter a pole at x=1. We then shift the contour over w to ∣w∣=q21−ε and encounter a pole at w=1. Then
[TABLE]
Using the formula above in (49) and the fact that ∣Gq(1,f1)∣=∣f1∣q21 finishes the proof of the first statement of Proposition 3.1.
∎
4. The non-Kummer setting
We now assume that q is odd with q≡2(mod3).
We will prove Theorem 1.1.
4.1. Setup and sieving
Using Proposition 2.5 and Lemma 2.11,
we have to compute
[TABLE]
where
[TABLE]
and
[TABLE]
We will choose A≡0(mod3). For the principal term, we will compute the contribution
from cube polynomials f and bound the contribution from non-cubes. We write
[TABLE]
where
S1,\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture corresponds to the sum with f a cube in equation (52) and S1,=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture corresponds to the sum with f not a cube, namely,
[TABLE]
and
[TABLE]
Since A≡0(mod3), note that the second term in (52) does not contribute to the expression (54)
for S1,\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture.
The main results used to prove Theorem 1.1 are summarized in the following lemmas whose proofs we postpone to the next sections.
Lemma 4.1**.**
The main term S1,\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture is given by the following asymptotic formula
[TABLE]
with AnK(x,u) given by equation (59). In particular,
[TABLE]
and
[TABLE]
In combination with the dual term S1,dual this gives the following result.
Lemma 4.2**.**
[TABLE]
We also have the following upper bound for S1,=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture.
Lemma 4.3**.**
We have that
[TABLE]
4.2. The main term
Here we will prove Lemma 4.1.
In equation (54), write f=k3. Recall that A≡0(mod3). Then S1,\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture can be rewritten as
[TABLE]
We first look at the generating series of the sum over F. We use the fact that
[TABLE]
where we have taken μ over Fq[T].
Then
[TABLE]
We evaluate the sum over F in the equation above and we have that
[TABLE]
so from equation (56) and the above it follows that
[TABLE]
Now we write down an Euler product for the sum over D and we have that
[TABLE]
where the product over R is over monic, irreducible polynomials. Let AR(x) denote the first Euler factor above and BR(x) the second. Then we rewrite the sum over D as
[TABLE]
and putting everything together, it follows that
[TABLE]
We now introduce the sum over k and we have
[TABLE]
where R denotes a monic irreducible polynomial in Fq[T]. Combining the equation above and (58) we get that the generating series for the double sum over F and k is equal to
[TABLE]
where
[TABLE]
Using Perron’s formula (Lemma 2.2) twice in (54) and the expression of the generating series above, we get that
[TABLE]
where we are integrating along circles of radii ∣u∣<q3/21 and ∣x∣<q21. First note that AnK(x,u) is analytic for ∣x∣<1/q,∣xu∣<1/q,∣xu2∣<1/q2. We initially pick ∣u∣=1/q23+ε and ∣x∣=1/q2+ε. We shift the contour over x to ∣x∣=1/q1+ε and we encounter a pole at x=1/q2. Note that the new double integral will be bounded by O(q2g+εg). Then
[TABLE]
Now we shift the contour of integration to ∣u∣=q−ε and we encounter two simple poles: one at u=1/q23 and one at u=1/q. We evaluate the residues and then
Recall that S1,=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture is the term with f not a cube in S1,principal of (52). Since A≡0(mod3), the term we want to bound is equal to
[TABLE]
Let S11 be the first term above and S12 the second. Note that it is enough to bound S11, since bounding S12 will follow in a similar way. We use equation (55) again for the sum over F and we have
[TABLE]
Note that we used the fact that χD(f)=1 since D,f∈Fq[T]. Now we look at the generating series for the sum over F. We have the following.
[TABLE]
Using Perron’s formula (Lemma 2.2) and the generating series above, we have
[TABLE]
where we are integrating along a circle of radius ∣u∣=q1 around the origin. Now we use the Lindelöf bound for the L–function in the numerator and a lower bound for the L–function in the denominator. We have, by Lemmas 2.6 and 2.7,
[TABLE]
Then
[TABLE]
Trivially bounding the sums over D and f in (60) gives a total upper bound of
[TABLE]
and similarly for S12. This finishes the proof of Lemma 4.3.
4.4. The dual term
Here we will evaluate S1,dual and prove Lemma 4.2. Recall the expression (53) for S1,dual. We further write S1,dual=S11,dual+S12,dual.
For F as in the expression (53), we have that χF is an even primitive character over Fq[T] of modulus FF~ (recall that F~ is the Galois conjugate of F).
The modulus has degree 2deg(F)=g+2 and by Corollary 2.4 the sign of the functional equation is
[TABLE]
where the Gauss sum is
[TABLE]
By the Chinese Remainder Theorem, since F and F~ are co-prime, if β runs over the classes in Fq2[T]/(F) then
βF~+β~F runs over the classes in Fq[T]/(FF~). Then
[TABLE]
where we have used that χF(F~)=1 due to cubic reciprocity.
Using the fact that
Gq2(1,F)χF(f)=Gq2(f,F) when (f,F)=1 and χF(f)=0 otherwise, we get
[TABLE]
and
[TABLE]
We first prove the following important feature of Gq2(1,f).
Lemma 4.4**.**
Let f∈Fq[T] be square-free. Then
[TABLE]
Proof.
As usual, we denote by α~ the Galois conjugate of α. We have
[TABLE]
In the first line we used the fact that eq2(−α/f)=eq2(−α~/f) which follows because tr(α)=tr(α~).
In the second line we used that χf(−1)=Ω−1((−1)3q2−1deg(f))=1.
Notice that for f,g∈Fq[T], (f,g)=1, χf(g)=1 because
[TABLE]
which implies that χf(g)∈R, hence it has to be equal to 1.
Now we go back to (61) and (62). Using the sieve (55),
we get that
[TABLE]
where we have used that Gq2(f,DF)=0 if (D,F)=1, since (f,DF)=1.
Using Proposition 3.1 (recall that we are working in Fq2[T]) we get that
[TABLE]
with δf2=1=1 if f2=1 and δf2=1=0 otherwise.
Combining equations (61), (63), (64) and Lemma 4.4, we write
[TABLE]
where M1 corresponds to the main term in (64) and E1 corresponds to the two error terms in (64).
We have
[TABLE]
We first treat the sum over D. We consider the generating series of the sum over D. We have that
[TABLE]
where we have counted the primes in Fq2[T] by counting the primes of Fq[T] lying under them.
Recall from Section 2.2 that P∈Fq[T] splits in Fq2[T] if and only if deg(P) is even.
Let Adual,R(w) denote the first factor above and Bdual,R(w) the second. Define
Now we introduce the sum over f.
Using the expression for the sum over D above, we get that
[TABLE]
Let
[TABLE]
where
[TABLE]
Then we can write down an Euler product for HnK(u,w) and we have that
[TABLE]
After simplifying, we have
[TABLE]
with BnK(u,w) analytic in a wider region (for example, BnK(u,w) is absolutely convergent for ∣u∣<q611 and ∣uw∣<q611).
We will use Perron’s formula (Lemma 2.2) for the sum over f. Note that if g/2+1+deg(f1)≡0(mod3), then deg(f1)≡g−1(mod3). In this case by Lemma 3.9, ρ(1,0)=1.
If g/2+1+deg(f1)≡1(mod3), then deg(f1)≡g(mod3), and by Lemma 3.9 again we have ρ(1,1)=τ(χ3)q2. Note that τ(χ3)=qϵ(χ3) and ϵ(χ3)=(−1)3q2−1=1. Since q is odd, we have ρ(1,1)=q3. Recall that A≡0(mod3). Using Perron’s formula (Lemma 2.2) twice depending on whether deg(f)≡g−1(mod3) or deg(f)≡g(mod3), we have
[TABLE]
where we integrate along small circles around the origin. We first shift the contour over w to ∣w∣=q1−ϵ (since JnK(w) is absolutely convergent for ∣w∣<q) and encounter the pole at w=1. Note that HnK(u,1) has a pole at u=q−1/6. Let
[TABLE]
Then
[TABLE]
Note that KnK(u) is absolutely convergent for ∣u∣<q61. We shift the contour of integration to ∣u∣=q−ε, we compute the residue at u=q−1/6 and we get that
[TABLE]
Now we consider the error term E1 from equation (65). The first term coming from the first error in equation (64) will be bounded by
[TABLE]
Then we get that
[TABLE]
where recall that 2/3<σ<4/3.
Combining the expressions for M1 and E1 it follows that
[TABLE]
We treat S12,dual similarly and since deg(f)=g−A we have [g/1+1+deg(f1)]3=1. Then as before ρ(1,1)=τ(χ3)=q3, and
we get that
and we have that KnK(q−1/6)=AnK(1/q2,1/q). Since ζq(3)=ζq2(2),
by using equation (69) and Lemma 4.1 we note that the corresponding terms of size qg−6A in the expressions for
S1,\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture and S1,dual
cancel out. Hence
[TABLE]
Now we consider the integral terms above. Note that it is enough to bound the first one. Using Lemma 3.11, the term in the second line above is bounded by
Note that the error term of size q65g can be computed explicitly from equation (68) by evaluating the residue when u3=1. The other error terms will eventually dominate the term of size q65g, so we do not carry out the computation. However, we believe this term will persist in the asymptotic formula.
where we have from Proposition 2.5 and Lemma 2.1 (cubic reciprocity)
[TABLE]
We will choose A≡0(mod3).
For the principal term, we will compute the contribution from cube polynomials f and bound the contribution from non-cubes. We write
[TABLE]
where
[TABLE]
and
[TABLE]
The main results used to prove Theorem 1.2 are summarized in the following lemmas whose proofs we postpone to the next sections.
Lemma 5.1**.**
The main term S2,\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture is given by the following asymptotic formula
[TABLE]
for some explicit constants CK,1,CK,2,DK,1,DK,2 (see formula (87)).
We also have the following upper bounds for S2,=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture and S2,dual.
Lemma 5.2**.**
We have that
[TABLE]
Lemma 5.3**.**
The dual term is bounded by
[TABLE]
for 7/6≤σ<4/3.
We finish the section by sieving out the values of F1 and F2.
Lemma 5.4**.**
For f a monic polynomial in Fq[T] the following holds.
[TABLE]
Proof.
We have that
[TABLE]
We remark that H∣(D1F1′,D2F2′) is equivalent to H1=(D1,H)H∣F1′ and H2=(D2,H)H∣F2′. This gives
For f a monic polynomial in Fq[T] the following holds.
[TABLE]
Proof.
This follows by taking Ri=(Di,H) in Lemma 5.4. ∎
5.2. The main term
Here we will obtain an asymptotic formula for the main term (74) by proving Lemma 5.1. Recall that
[TABLE]
Let 2g+1≡a(mod3) and g≡b(mod3) with a,b∈{0,1,2}. Notice that then 1+2a≡b(mod3).
Recall that A≡0(mod3). Since d1+d2=g+1 and d1+2d2≡1(mod3), it follows that d1≡a(mod3). In the equation above, write f=k3. Then the main term S2,\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture can be rewritten as
[TABLE]
We consider the generating series
[TABLE]
Note that
[TABLE]
Let CP,K(u) denote the Euler factor above. Now we introduce the sum over F2 and we have that
[TABLE]
Let BP,K(y,u) be the P-factor when P∣F1.
Finally, introducing the sum over F1 and combining equations (78) and (79), we have that
[TABLE]
Combining equations (77), (78), (79) and (80) and simplifying, we get that
[TABLE]
where
[TABLE]
Note that DK(x,y,u) has an analytic continuation when ∣x∣<1,∣y∣<1,∣x2y∣<q1,∣y2x∣<q1,∣xu∣<q3/2,∣yu∣<q3/2,∣x2u∣<q,∣y2u∣<q,∣xyu∣<q.
Using equation (81) and Perron’s formula (Lemma 2.2) three times in equation (76), we get that
[TABLE]
where we initially integrate along circles around the origin of radii ∣u∣=qε1,∣x∣=∣y∣=q1+ε1.
We first shift the contour over u to ∣u∣=q5/2, and encounter two poles: one at u=1 and another at u=q. We compute the residues of the poles and then
[TABLE]
Plugging this into the expression for S2,\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture and bounding the new triple integral by qg−65A+εg give
[TABLE]
We first focus on the first term (83). Note that DK(x,y,1) has an analytic continuation for ∣x∣<1,∣y∣<1,∣x2y∣<q1,∣y2x∣<q1.
We remark that in (83) we can shift the contours of integration to the smaller circles ∣x∣=q−3 and ∣y∣=q−2 without changing the value of the integral as we are not crossing any pole.
We write d1=3k+a and compute the sum over d1. Note that k≤[(g+1−a)/3]=[g/3]. Then
[TABLE]
We write the integral above as a difference of two integrals.
Note that the second double integral vanishes, because the integrand for the integral over x has no poles inside the circle ∣x∣=q−3.
Hence
[TABLE]
Note that for the integral over y, the only poles of the integrand inside the circle ∣y∣=q−2 are at y3=x3, so when y=xξ3i for i∈{0,1,2} and ξ3=e2πi/3.
Hence
[TABLE]
To compute the integral over x, we shift the the contour of integration to ∣x∣=q−1/3+ε, evaluating the residues at x=q−1 corresponding to each of the three functions above. Notice that the first integral has a double pole at s=1/q. This gives
[TABLE]
where
we have used the fact that 1+2a≡b(mod3).
Since DK(x,y,1)=DK(y,x,1), we further simplify (83) to
[TABLE]
where
[TABLE]
where we used the fact that 2g+1≡a(mod3).
We remark that the constants above are real, which reflects the fact that the sum is a real number.
We similarly compute the term (84) and we get that
[TABLE]
Putting everything together, we get that
[TABLE]
5.3. The contribution from non-cubes
Here we will prove Lemma 5.2. Recall the definition (75) of S2,=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture, the term coming from the contribution of non-cube polynomials.
Using the sieve of Corollary 5.5, we rewrite S2,=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture as
[TABLE]
We write S2,=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture=S2,=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture(0)+S2,=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture(1)+S2,=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture(2), according to deg(f)(mod3). When deg(f)≡1,2(mod3), note that the condition that f is not a cube is automatically satisfied. We will bound S2,=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture(1). Bounding the other two terms is similar (see the remark at the end of the proof).
We begin by using the Poisson summation formula (Proposition 2.13) for the sums over L1 and L2 above. Let deg(f)=n. Note that since ∣ϵ(χf)∣=1, we have that
[TABLE]
Write f=E3B2C, where B,C are square-free polynomials with (B,C)=1. Note that BC2=1 since f is not a cube. Then the sum over f becomes
[TABLE]
We remark that for fixed V1 and V2, Gq(V1,f)Gq(V2,f) is multiplicative as a function of f.
Indeed, for (f,h)=1, we have by Lemma 2.12 and (22)
[TABLE]
Then,
[TABLE]
We look at each of the three cases above.
(1)
If P∣E and P∤BC, from Lemma 2.12 we need P3ordP(E)−1∣V1 in order for the Gauss sum to be nonzero. In this case, we have
[TABLE]
2. (2)
If P∣B (so P∤C), again from Lemma 2.12, we need P3ordP(E)+1∣∣V1, and in this case
[TABLE]
3. (3)
If P∣C (so P∤B), we need P3ordP(E)∣∣V1. Then
[TABLE]
Combining all of the above, it follows that in order to have Gq(V1,E3B2C)=0, then we must have
[TABLE]
with (V3,BC)=1, and we can write
[TABLE]
Similarly we can suppose that
[TABLE]
where we have (V4,BC)=1.
Using equation (90) and the analogous expression for Gq(V2,E3B2C), it follows that
for i=1,2.
Now we look at the generating series for the sum over V3 and get that
[TABLE]
Using Perron’s formula (Lemma 2.2) for the sums over V3 and V4, we get that
[TABLE]
and
[TABLE]
Since B,C are square-free and coprime, and BC=1 (because f was not a cube), the L–functions in the expressions above are primitive of modulus BC, and we can use the Lindelöf bound (Lemma 2.6)
for each of them. We have
[TABLE]
for ∣u∣=q−1/2.
Then, the double sum over V3 and V4 in (91) is
[TABLE]
Now we use the fact that
[TABLE]
and trivially bound the sums over C,B,E to
get that the entire expression in (91) is bounded by
[TABLE]
Finally, trivially bounding the sums over n,D1,D2,R1,R2,H in equation (88) it follows that
[TABLE]
We remark that bounding S2,=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture(2) is identical to bounding S=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture(1). When bounding S2,=\leavevmodeto8.91pt\vboxto8.91pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\par\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto6.54453pt6.54453pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto6.54453pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto0.0pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.96312pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt6.54453pt\pgfsys@lineto1.96312pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto1.96312pt8.50768pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt6.54453pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto6.54453pt0.0pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@moveto8.50768pt1.96312pt\pgfsys@lineto8.50768pt8.50768pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setdash0.4pt,1.0pt0.0pt\pgfsys@invoke\pgfsys@moveto1.96312pt1.96312pt\pgfsys@lineto8.50768pt1.96312pt\pgfsys@stroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture(0), we apply the Poisson summation formula for the sums over L1 and L2 as before, and note that Gq(0,f)=0 since f is not a cube. The Poisson summation formula applied to each of the sums over L1 and L2 gives 2 terms in that case, and multiplying through, we will obtain four terms, each of which can be bounded using the same method as before.
In conclusion, we get
[TABLE]
5.4. The dual term
We now treat the dual term by proving Lemma 5.3. Recall from equation (73) that
[TABLE]
Since d1+2d2≡1(mod3), by Corollary 2.4 and formula (5), the sign of the functional equation is
[TABLE]
where χ3 is defined by (3).
We rewrite the dual sum as
[TABLE]
where we have used the fact that
[TABLE]
and similarly for F2.
We first notice that if F1 or F2 are not square-free, then since (F1F2,f)=1, we have by Lemma 2.12 that
Gq(f,F1)=0 or Gq(f,F2)=0. Therefore, we can write
[TABLE]
Again, if (H,F1)=1 or (H,F2)=1, then Gq(f,HF1)=0 or Gq(f,HF2)=0. If (H,F1F2)=1, we can apply Lemma 2.12 and write
[TABLE]
where we have used the fact that Gq(f,H)Gq(f,H)=∣H∣q.
Using equation (92) it follows that
and a similar formula holds for the sum over F2. Note that the second error term dominates the first error term. Then we have
[TABLE]
Then the main term of S2,dual is equal to
[TABLE]
Notice that the product of the terms involving ρ is nonzero only when d1+deg(f1)≡1(mod3) (and therefore d2+deg(f1)≡0(mod3)). By Lemma 3.9,
[TABLE]
where we have also used that τ(χ3)=ϵ(χ3)q.
We look at the generating series of the sum over H. We have
[TABLE]
Let RP(w) denote the P–factor above and let RK(w)=∏PRP(w). By Perron’s formula, we get that
[TABLE]
Recall from Section 5.2 that d1≡a(mod3),2g+1≡a(mod3),g≡b(mod3) and A≡0(mod3). Then we need deg(f)≡b(mod3).
Now we look at the sum over f. The generating series is
[TABLE]
Let
[TABLE]
Write deg(f)=3k+b. Since deg(f)≤g−A−1 and g−A−1≡b−1(mod3), we have by Perron’s formula
[TABLE]
where we are integrating along a small circle around the origin.
Introducing the sum over d1, we have
[TABLE]
Note that since d1≡a(mod3), we have that d2≡a−1(mod3). For simplicity of notation, let α=[a−1]3. We rewrite the sum over d1,d2 as
Now we compute the residue of the pole at w=ξ3−1 which is equal to
[TABLE]
The residue at w=ξ3 is equal to
[TABLE]
Putting everything together, we have
[TABLE]
Remark 5.6**.**
As in Remark 4.5, the error term of size
q65g can be computed explicitly
by evaluating the residue when u3=1 in (99). The other error terms will eventually dominate the term of size q65g, so we do not carry out the computation. However, we believe this term will persist in the asymptotic formula.
Now assume that g is even. Then
[TABLE]
Similarly as before, we get that
[TABLE]
Then the residues give
[TABLE]
and
[TABLE]
so
[TABLE]
We remark that assuming g even leads to the same asymptotic formula as before.
We now bound the mixed terms (95) and (96) in S2,dual.
For the terms of the type (95) we have
[TABLE]
Setting σ≥5/6, and bounding trivially the sum over H, it follows that these terms are bounded by
[TABLE]
We now bound the error term coming from (96). This term will be bounded by
Combining Lemmas 5.1, 5.2 and 5.3, it follows that
[TABLE]
where 7/6≤σ<4/3. Picking σ=613−27 and
A=3[6g(7−1)] (so that A≡0(mod3)) gives a total upper bound of
size qg41+7+εg and finishes the proof of Theorem 1.2.
Bibliography25
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[AT 14] Salim Ali Altuğ and Jacob Tsimerman, Metaplectic Ramanujan conjecture over function fields with applications to quadratic forms , Int. Math. Res. Not. IMRN (2014), no. 13, 3465–3558. MR 3229761
2[BCD + 18] Alina Bucur, Edgar Costa, Chantal David, João Guerreiro, and David Lowry-Duda, Traces, high powers and one level density for families of curves over finite fields , Math. Proc. Cambridge Philos. Soc. 165 (2018), no. 2, 225–248. MR 3833999
3[BSM] Lior Bary-Soroker and Patrick Meisner, On the distribution of the rational points on cyclic covers in the absence of roots of unity , Ar Xiv e-prints.
4[BY 10] Stephan Baier and Matthew P. Young, Mean values with cubic characters , J. Number Theory 130 (2010), no. 4, 879–903. MR 2600408
5[CC 11] Emanuel Carneiro and Vorrapan Chandee, Bounding ζ ( s ) 𝜁 𝑠 \zeta(s) in the critical strip , J. Number Theory 131 (2011), no. 3, 363–384. MR 2739041
6[CP] Peter Cho and Jeongho Park, Low-lying zeros of cubic Dirichlet L 𝐿 L –functions and the Ratios Conjecture , Ar Xiv e-prints.
7[Dia] Adrian Diaconu, On the third moment of L ( 1 2 , χ d ) 𝐿 1 2 subscript 𝜒 𝑑 L({1\over 2},\,\chi_{d}) I: the rational function field case , Ar Xiv e-prints.
8[DW] Adrian Diaconu and Ian Whitehead, On the third moment of L ( 1 2 , χ d ) 𝐿 1 2 subscript 𝜒 𝑑 L({1\over 2},\,\chi_{d}) II: the number field case , Ar Xiv e-prints.