1 Introduction
An extension of a famous conjecture of Chowla predicts that ${\textstyle L(\frac {1}{2}, \chi)} \neq 0$ for Dirichlet L-functions attached to primitive characters $\chi $. Chowla’s original conjecture [Reference Chowla6, Chapter 8] is restricted to $\chi $ a quadratic character, which is the most studied case. For quadratic Dirichlet L-functions, Özlük and Snyder [Reference Özlük and Snyder30] showed, under the generalised Riemann hypothesis (GRH), that at least $15/16$ of the L-functions ${\textstyle L(\frac {1}{2}, \chi )} $ attached to quadratic characters $\chi $ do not vanish, by computing the one-level density for the low-lying zeroes in the family. The conjectures of Katz and Sarnak [Reference Katz and Sarnak25] on the zeroes of L-functions imply that ${\textstyle L(\frac {1}{2}, \chi )} \neq 0$ for almost all quadratic Dirichlet L-functions. Without assuming the GRH, Soundararajan [Reference Soundararajan35] proved that at least $87.5 \%$ of the quadratic Dirichlet L-functions do not vanish at $s=1/2$, by computing the first two mollified moments. It is well known that using the first two (nonmollified) moments does not lead to a positive proportion of nonvanishing, as they grow too fast (see [Reference Cho and Park12] and the work of Jutila [Reference Jutila24].) Soundararajan [Reference Soundararajan35] also computed asymptotics for the first three moments, and Shen [Reference Shen34] obtained an asymptotic formula with the leading order term for the fourth moment (conditionally on the GRH), building on work of Soundararajan and Young [Reference Soundararajan and Young37]. A different approach was used by Diaconu, Goldfeld and Hoffstein [Reference David, Lalín and Nam16] to compute the third moment. Over function fields, asymptotics for the first four moments were obtained by Florea [Reference Florea18, Reference Florea19, Reference Florea20]. We refer the reader to those papers for more details. Moreover, in the function-field case, Bui and Florea [Reference Bary-Soroker and Meisner3] obtained a proportion of nonvanishing of at least $94 \%$ for quadratic Dirichlet L-functions, by computing the one-level density (those results are unconditional, as the GRH is true over function fields).
In this paper, we consider the case of cubic Dirichlet L-functions. There are few articles in the literature about cubic Dirichlet L-functions, compared to the abundance of papers on quadratic Dirichlet L-functions, as this family is more difficult, in part because of the presence of cubic Gauss sums. The first moment of ${\textstyle L(\frac {1}{2}, \chi )} $, where $\chi $ is a primitive cubic character, was computed by Baier and Young over $\mathbb Q$ [Reference Bui and Florea1] (the non-Kummer case), by Luo for a thin subfamily over $\mathbb Q(\sqrt {-3})$ [Reference Luo28] (the Kummer case) and by David, Florea and Lalin [Reference David, Florea and Lalin13] over function fields, in both the Kummer and the non-Kummer case, and for the full families.
In these three papers, the authors obtained lower bounds for the number of nonvanishing cubic twists, but not positive proportions, by using upper bounds on higher moments. Ellenberg, Li and Shusterman [Reference Ellenberg, Li and Shusterman17] use algebraic-geometry techniques to extend the results of [Reference David, Florea and Lalin13] to $\ell $-twists over function fields and improve upon the lower bound for the number of nonvanishing cubic twists (but the proportion is still nonpositive). Obtaining an asymptotic for the second moment for cubic Dirichlet L-functions is still an open question, over functions fields or number fields. Moreover, for the case of cubic Dirichlet L-functions, computing the one-level density can only be done for limited support of the Fourier transform of the test function, and that is not enough to lead to a positive proportion of nonvanishing for the full family, even under the GRH [Reference Conrey, Farmer, Keating, Rubinstein and Snaith5, Reference Meisner29]. Recently David and Güloğlu [Reference David and Güloğlu14] obtained a positive proportion of nonvanishing for Luo’s thin family [Reference Luo28] by computing the one-level density.
We prove in this paper that there is a positive proportion of nonvanishing for cubic Dirichlet L-functions at $s=1/2$ over function fields, in the non-Kummer case.
Theorem 1.1. Let $q \equiv 2 \,(\mathrm {mod}\,3)$. Let $\mathcal {C}(g)$ be the set of primitive cubic Dirichlet characters of genus g over $\mathbb F_q[T]$. Then, as $g \rightarrow \infty $,
This theorem is obtained by using the breakthrough work on sharp upper bounds for moments of $\lvert \zeta (1/2+it)\rvert $ by Soundararajan [Reference Soundararajan36] and Harper [Reference Harper21], under the GRH. Their techniques, together with ideas appearing in the work of Radziwiłł and Soundararajan [Reference Rosen32] on distributions of central L-values of quadratic twists of elliptic curves, were further developed by Lester and Radziwiłł in [Reference Lester and Radziwiłł27], where they obtained sharp upper bounds for mollified moments of quadratic twists of modular forms. Our work owes a lot to these papers and circles of ideas.
To obtain Theorem 1.1, we need to compute the first mollified moment, generalising our previous work [Reference David, Florea and Lalin13] (Theorem 1.3) and obtain a sharp upper bound for the second mollified moment (Theorem 1.6). In fact, we obtain upper bounds for all mollified moments, not only the second moment and integral moments. Using Theorems 1.3 and 1.6, the positive proportion of Theorem 1.1 follows from a simple application of the Cauchy–Schwarz inequality.
As noted by Harper in the case of the Riemann zeta function, the sharp upper bound for the kth moment is obtained at the cost of an enormous constant of the order $e^{e^{c k}}$, for some absolute constant $c> 0$. Hence our positive proportion of nonvanishing is extremely small, but explicit nonetheless.
We first state the standard conjecture for moments of the family of cubic Dirichlet L-functions. We refer the reader to Section 2 for more information about the family of cubic Dirichlet L-functions over function fields in the non-Kummer case (i.e., $q \equiv 2 \,(\mathrm {mod}\,3)$).
Conjecture 1.2. Let $q \equiv 2 \,(\mathrm {mod}\,3)$. Let $\mathcal {C}(g)$ be the set of primitive cubic Dirichlet characters of genus g over $\mathbb F_q[T]$. Then as $g \rightarrow \infty $,
where $P_k(g)$ is a monic polynomial of degree $k^2$, $a_k$ is an arithmetic factor depending on the family and
A testament to the fact that moments of L-functions are hard to compute is the fact that simply conjecturing an asymptotic is very difficult. The constants $\mathfrak {g}_k$ were obtained by Keating and Snaith based on considerations from random matrix theory [Reference Keating and Snaith26]. Number-theoretic heuristic arguments were used in the work of Conrey, Farmer, Keating, Rubinstein and Snaith [Reference Cho and Park12] to generalise Conjecture 1.2 to include lower-order terms, and more recently by Conrey and Keating [Reference Conrey and Keating7, Reference Conrey and Keating8, Reference Conrey and Keating9, Reference Conrey and Keating10, Reference Conrey and Keating11]. The order of magnitude $g^{k^2}$ is easy to conjecture, as it comes from the size of the contribution of the diagonal terms. In the case of cubic characters, this will come from the fact that cubic characters are trivial on cubes. For the first moment, only diagonal terms contribute to the asymptotic of the previously cited work [Reference Bui and Florea1, Reference David, Florea and Lalin13, Reference Luo28]. For the second (and higher) moments, there will be a contribution from the off-diagonal terms. The contribution of off-diagonal terms can be estimated in the case of quadratic characters, but it is open for the family of cubic characters, where only the first moment without absolute value – the sum of ${\textstyle L(\frac {1}{2},\chi )}$ – is known. The work of Soundararajan and Harper provides an upper bound of the exact order of magnitude for all moments of $\zeta (s)$. This follows from a key result of Soundararajan, who proved that one can upper bound $\log \lvert L(\frac {1}{2},\chi ) \rvert $ by a short sum over primes. In our setting, we use Lemma 3.1, which is the analogue of Soundararajan’s key inequality. These arguments lead to a constant for the upper bound which is much larger than $\mathfrak {g}_k$. In particular, shortening the Dirichlet polynomial produces a large contribution from the $(g+2)/N$ term. The techniques used to get the upper bound generate a constant of size $e^{e^{ck}}$, as noted by Harper [Reference Harper21].
1.1 Statement of the results
We state our two results about the mollified moments. Set $\kappa>0$. The mollifier we use, $M(\chi; \frac {1}{\kappa })$, is defined in Section 3.2 and depends on the parameter $\kappa $. We will later choose $\kappa =1$ in the application to Theorem 1.3.
Theorem 1.3. Let $q \equiv 2 \,(\mathrm {mod}\,3)$. Let $\mathcal {C}(g)$ be the set of primitive cubic Dirichlet characters of genus g over $\mathbb F_q[T]$. Then as $g \rightarrow \infty $,
for some $0<\delta <1$ (see formula (8.30) for more details on $\delta $) and where the constant A is given in formula (8.25).
Corollary 1.4. With the same notation as before, we have
Remark 1.5. It is easy to estimate that $\# \mathcal {C}(g) \sim c_3 q^{g+2}$ for some explicit constant $c_3$ [Reference David, Florea and Lalin13]. Dividing by the size of the family, we then prove that the first mollified moment of $L(\frac {1}{2}, \chi )$ is asymptotic to a constant, which is the conjectural asymptotic. This is also the asymptotic for the nonmollified moment (with a different constant), as proven in [Reference David, Florea and Lalin13]. This asymptotic is not included in Conjecture 1.2, which is concerned with the moments of the absolute value of the L-functions. The moments of $L(\frac {1}{2}, \chi )^{k_1} {\overline {L(\frac {1}{2}, \chi )^{k_2}}}$, for general positive $k_1, k_2$, are conjectured to grow as a polynomial of degree $k_1 k_2$ in g (see [Reference Diaconu, Goldfeld and Hoffstein15]). Note that the conjectures in [Reference Diaconu, Goldfeld and Hoffstein15] hold for cubic twists of elliptic curves, but both families have the same symmetry, so the main terms will have a similar shape. Theorem 1.3 corresponds to the case $k_1=1, k_2=0$, and Conjecture 1.2 to the case $k_1=k_2=k$.
The following upper bound for the moment is the analogue of [Reference Lester and Radziwiłł27, Proposition 4.1]:
Theorem 1.6. Set $k, \kappa> 0$ such that $k \kappa $ is an even integer and $k \kappa \leq C$ for some absolute constant C. Let $q \equiv 2 \,(\mathrm {mod}\,3)$. Let $\mathcal {C}(g)$ be the set of primitive cubic Dirichlet characters of genus g over $\mathbb F_q[T]$. Then as $g \rightarrow \infty $,
Remark 1.7. Because of the presence of the mollifier, dividing by $\# \mathcal {C}(g)$, all moments are bounded by a constant, and they do not grow. Using the first and second moment then leads to a positive proportion of nonvanishing.
1.2 Proof of Theorem 1.1
The proof of Theorem 1.1 follows from a simple application of Cauchy–Schwarz and Theorems 1.3 and 1.6 for $\kappa =1$. Indeed,
Remark 1.8. Combining Corollary 1.4 and formula (7.11), we get the explicit proportion
and using formula (2.6),
1.3 Overview of the paper
This paper contains two main results, which are proven with different techniques.
We first prove the upper bound for the mollified moments, adapting the setting and notation of [Reference Lester and Radziwiłł27] to the case of cubic characters (and to the function-field case). The combinatorics to give an upper bound to the contribution of the diagonal terms are significantly more complicated, in part because the special values of the cubic L-functions are not real numbers, and they have to be considered in absolute value, and in part because we are identifying cubes and not squares. This also applies to the proof of the almost-sharp upper bound for the L-functions we consider, which is needed as a starting point to prove the sharp upper bound. Because we are dealing with cubic characters, we also have to bound the contribution of the squares of the primes, unlike the case of quadratic characters, where the squares of the primes contribute to the main term. In the language of random matrix theory, the family of cubic characters is a unitary family, and the family of quadratic characters is a symplectic family (for Dirichlet twists) or an orthogonal family (for twists of a modular form). In [Reference Harper21], the author also bounds the contribution of the squares of the primes to get sharp upper bounds on the moments of ${\textstyle \lvert \zeta (\frac 12 + it)\rvert }$, which is a unitary family. In our case, because of the presence of the mollifier, mixing the square of the primes with the primes is very cumbersome, and we treat them separately with an additional use of the Cauchy–Schwarz inequality. The contribution from the squares of the primes morally behaves like $L(1,\overline {\chi })$. Bounding this contribution is similar to getting an upper bound for the average of $L(1,\chi )$, which is much simpler than the original problem of bounding the average of $L(\frac 12, \chi).$
We then proceed to evaluating the first mollified moment. Because the mollifier is a finite Dirichlet polynomial, this amounts to the computation of a ‘twisted first moment’ (see Proposition 8.1). Evaluating this twisted first moment is similar to evaluating the first moment for the non-Kummer family in [Reference David, Florea and Lalin13], relying on the approximate functional equation and powerful results on the distribution of cubic Gauss sums.
The structure of the paper is as follows. Section 2 contains the standard properties of cubic characters over function fields that are used throughout the paper. Section 3 contains the proof of Theorem 1.6 modulo three important results proven in three subsequent sections: a technical lemma proven in Section 3.5, an upper bound for the contribution of the square of the primes in Section 5 and the proof of a proposition giving an almost-sharp upper bound for the unmollified moments of ${\textstyle L(\frac {1}{2},\chi )}$ in Section 6. In Section 7 we give some estimates on the (extremely small) positive proportion of Theorem 1.1. Finally, Section 8 contains the asymptotic for the first mollified moment, following the lines of [Reference David, Florea and Lalin13] where the first moment is computed.
2 Background
Let q be an odd prime power. We denote by $\mathcal {M}_q$ the set of monic polynomials of $\mathbb F_q[T]$, by $\mathcal {M}_{q,\leq d}$ the subset of degree less than or equal to d and by $\mathcal {M}_{q,d}$ the subset of degree exactly d. Similarly, $\mathcal {H}_q$, $\mathcal {H}_{q, \leq d}$ and $\mathcal {H}_{q,d}$ denote the analogous sets of monic square-free polynomials. In general, all sums over polynomials in $\mathbb F_q[T]$ are always taken over monic polynomials. The norm of a polynomial $f(T)\in \mathbb F_q[T]$ is given by
In particular, if $f(T)\in \mathbb F_{q^n}[T]$, we have $\lvert f\rvert _{q^n}=q^{n\deg \left (f\right )}$ for any positive n. We will write $\lvert f\rvert $ instead of $\lvert f\rvert _q$ when there is no ambiguity.
The following notation will be used often. We will write $A \leq _\varepsilon B$ to mean $A \leq (1 + \varepsilon )B$ for any $\varepsilon>0$ as $g \rightarrow \infty $.
The primes of $\mathbb F_q[T]$ are the monic irreducible polynomials. Let $\pi (n)$ be the number of primes of $\mathbb F_q[T]$ of degree n. By considering all the roots of these polynomials, we see that $n\pi (n)$ counts the number of elements in $\mathbb F_{q^n}$ of degree exactly n over the base field $\mathbb F_q$, which is less than or equal to the total number of elements in $\mathbb F_{q^n}$. Therefore,
More precisely, the Prime Polynomial Theorem [Reference Radziwiłł and Soundararajan33, Theorem 2.2] states that the number $\pi (n)$ of primes of $\mathbb F_q[T]$ of degree n satisfies
The von Mangoldt function is defined as
Recall that for $f\in \mathbb F_q[T]$ the Möbius function $\mu (f)$ is $0$ if f is not square-free and $(-1)^t$ if f is a constant times a product of t different primes. The Euler $\phi _q$ function is defined as $\# \left (\mathbb F_q[T]/\left ( f \mathbb F_q[T]\right )\right )^{*}$. It satisfies
and
When $f(T) \in \mathbb F_{q^n}[T]$, we may consider $\phi _{q^n}$ defined similarly.
In this paper we consider the non-Kummer case of cubic Dirichlet character over $\mathbb F_q[T]$, where $q \equiv 2 \,(\mathrm {mod}\,3)$. For more details, we refer the reader to [Reference Bui, Florea, Keating and Roditty-Gershon2, Reference David, Florea and Lalin13] for the function-field case and [Reference Bui and Florea1] for the number-field case. In the function-field case, when $q\equiv 2\,(\mathrm {mod}\,3)$ these characters are best described as a subset of the cubic characters over $\mathbb F_{q^2}[T]$. Notice that $q^2 \equiv 1 \,(\mathrm {mod}\,3)$. Therefore, we will first discuss the case $q\equiv 1 \,(\mathrm {mod}\,3)$, which we will later apply to $q^2$. We proceed to construct cubic Dirichlet characters over $\mathbb F_{q}[T]$ as follows. We fix an isomorphism $\Omega $ between the third roots of unity $\mu _3\subset \mathbb C^*$ and the cubic roots of 1 in $\mathbb F_{q}^*$. Let P be a prime polynomial in $\mathbb F_{q}[T]$, and let $f \in \mathbb F_{q}[T]$ be such that $P\nmid f$. Then there is a unique $\alpha \in \mu _3$ such that
Note that this equation is solvable because $q \equiv 1 \,(\mathrm {mod}\,3)$. Then we set
We remark that there are two such characters, $\chi _P$ and $\overline {\chi _P}=\chi _P^2$, depending on the choice of $\Omega $.
This construction is extended by multiplicativity to any monic polynomial $F\in \mathbb F_q[T]$. In other words, if $F=P_1^{e_1}\dotsm P_s^{e_s}$, where the $P_i$ are distinct primes, then
We have that $\chi _F$ is a cubic character modulo $P_1\dotsm P_s$. It is primitive if and only if $e_i=1$ or $e_i=2$ for all i.
If $q \equiv 1 \,(\mathrm {mod}\,6)$, then we have perfect cubic reciprocity. Namely, let $a, b \in \mathbb F_q[T]$ be relatively prime monic polynomials, and let $\chi _a$ and $\chi _b$ be the cubic residue symbols already defined. If $q \equiv 1 \,(\mathrm {mod}\,6)$, then
Throughout the paper, we will fix $q\equiv 2\,(\mathrm {mod}\,3)$ (and then $q^2\equiv 1\,(\mathrm {mod}\,3)$, as we already mentioned). When $q \equiv 2 \,(\mathrm {mod}\,3)$, the foregoing construction of $\chi _P$ will also give a cubic character as long as P has even degree, and the character can be extended by multiplicativity. In the non-Kummer case, a better way to describe cubic characters is to see them as restriction characters defined over $\mathbb F_{q^2}[T]$. This description was formulated by Bary-Soroker and Meisner [Reference Bui, Florea, Keating and Roditty-Gershon2], who generalised the work of Baier and Young [Reference Bui and Florea1] from number fields to function fields. We summarise their work here. Let $\pi $ be a prime in $\mathbb F_{q^2}[T]$ lying over a prime $P\in \mathbb F_q[T]$ of even degree. Then P splits and we can write $P=\pi \tilde {\pi }$, where $\tilde {\pi }$ denotes the Galois conjugate of $\pi $. Remark that $P \in \mathbb F_q[T]$ splits if and only if $\deg (P)$ is even. Then the restrictions of $\chi _\pi $ and $\chi _{\tilde {\pi }}$ to $\mathbb F_q[T]$ are $\chi _P$ and $\overline {\chi _P}$ (possibly exchanging the order of characters). Using multiplicativity, it follows that the cubic characters over $\mathbb F_q[T]$ are given by the characters $\chi _F$ where $F \in \mathbb F_{q^2}[T]$ is square-free and not divisible by any prime $P(T) \in \mathbb F_q[T]$.
Given a primitive cubic Dirichlet character $\chi $ of conductor $F=P_1\dotsm P_s$, the L-function is defined by
where the second equality follows from the orthogonality relations for $\chi $. This L-function can be written as a polynomial by making the change of variables $u=q^{-s}$, namely,
Let C be a curve of genus g over $\mathbb F_q(T)$ whose function field is a cyclic cubic extension of $\mathbb F_q(T)$. From the Weil conjectures, the zeta function of the curve is given by
In the case under consideration (that is, $q\equiv 2 \,(\mathrm {mod}\,3)$), we have
where $\chi $ and $\overline {\chi }$ are the two cubic Dirichlet characters corresponding to the function field of C. Because of the additional factors of $(1-u)$ in the denominator of equation (2.4), there are extra sums in the approximate functional equation for $\mathcal {L}(u,\chi )$ in this case (see Proposition 2.1). Furthermore, the Riemann–Hurwitz formula implies that the conductor F of $\chi $ and $\overline {\chi }$ satisfies $\deg (F)=g+2.$
As in the introduction, let $\mathcal {C}(g)$ denote the set of primitive cubic Dirichlet characters of genus g over $\mathbb F_q[T]$. From the foregoing discussion, we have
and in particular g is even. In that case, from [Reference David, Florea and Lalin13, Lemma 2.10] we have
where
We remark that
The following statement [Reference David, Florea and Lalin13, Proposition 2.5] provides the approximate functional equation of the L-function:
Proposition 2.1 Approximate functional equation, [Reference David, Florea and Lalin13, Proposition 2.5]
Let $q\equiv 2 \,(\mathrm {mod}\,3)$ and let $\chi $ be a primitive cubic character of modulus F. Let $X \leq g$. Then
where
is the root number and $g=\deg (F)-2$.
Now let $\chi $ be a primitive cubic character of conductor F defined over $\mathbb F_q[T]$. Then for $\operatorname {\mathrm {Re}}(s) \geq 1/2$ and for all $\varepsilon> 0$, we have the following upper bound:
For $\operatorname {\mathrm {Re}}(s) \geq 1$ and for all $\varepsilon> 0$, we also have the lower bound
(See [Reference David, Florea and Lalin13, Lemmas 2.6 and 2.7].)
We recall Perron’s formula over $\mathbb F_q[T]$, which will be used several times in Section 8:
Lemma 2.2 Perron’s formula
If the generating series $\mathcal {A}(u) =\sum _{f \in \mathcal {M}_q} a(f) u^{\deg (f)}$ is absolutely convergent in $\lvert u\rvert \leq r<1$, then
and
where, in the usual notation, we take $\oint $ to signify the integral over the circle around the origin oriented counterclockwise.
Finally, we recall the Weil bound for sums over primes. Let $\chi $ be a character modulo B, where B is not a cube. Then
where the sum is over monic, irreducible polynomials of degree n.
2.1 Cubic Gauss sums
Let $q \equiv 1 \,(\mathrm {mod}\,3)$. We now define cubic Gauss sums, and we state the result for the distribution of cubic Gauss sums that we are using in Section 8. Since we will work with $q\equiv 2\,(\mathrm {mod}\,3)$, the general theory presented here will be applied to $q^2$.
Let $\chi $ be a (not necessarily primitive) cubic character of modulus F. The generalised cubic Gauss sum is defined by
where
is the exponential defined by Hayes [Reference Hayes22], for any $a \in \mathbb {F}_q((1/T))$.
When $(A, F)=1$, it is easy to see that
Furthermore, the shifted Gauss sum is almost multiplicative as a function of F. Namely, if $q \equiv 1 \,(\mathrm {mod}\,6)$, and if $(F_1 ,F_2)=1$, then
The generating series of the Gauss sums are given by
and
The function $\Psi _q(f,u)$ was studied by Hoffstein [Reference Hoffstein23] and Patterson [Reference Patterson31]. In [Reference David, Florea and Lalin13] we worked with $\tilde {\Psi }_q(f,u)$ and proved the following results:
Proposition 2.3 [Reference David, Florea and Lalin13, Proposition 3.1 and Lemmas 3.9 and 3.11]
Let $f=f_1 f_2^2 f_3^3$, where $f_1$ and $f_2$ are square-free and coprime, and let $f_3^*$ be the product of the primes dividing $f_3$ but not dividing $f_1f_2$. Then
with $2/3<\sigma < 4/3$ and where $\tilde {\Psi }_q(f,u)$ is given by equation (2.13), $[x]_3$ denotes an integer $a\in \{0,1,2\}$ such that $x\equiv a\,(\mathrm {mod}\,3)$,
and
Moreover, we have
When $q \equiv 2 \,(\mathrm {mod}\,3)$, the root number in equation (2.7) can be expressed in terms of cubic Gauss sums over $\mathbb F_{q^2}[T]$, as proven in [Reference David, Florea and Lalin13, Section 4.4]. Let $\chi $ be a primitive character of conductor $F \in \mathbb F_q[T]$. Then F is square-free and divisible only by primes $P(T)$ of even degree and
where
for $F\in \mathbb F_q[T]$ square-free (see [Reference David, Florea and Lalin13, Lemma 4.4]).
3 Setting and proof of Theorem 1.6
3.1 Setting
Following the work of Soundararajan on upper bounds for the Riemann zeta function [Reference Soundararajan36], we first show that we can bound $\log \left \lvert {\textstyle L\left (\frac {1}{2},\chi \right ) }\right \rvert $ by a short Dirichlet polynomial. The following statement is analogous to [Reference Baier and Young4, Proposition 4.3]:
Lemma 3.1. Let $q \equiv 2 \,(\mathrm {mod}\,3)$ and let $\chi $ be a cubic Dirichlet character of genus g over $\mathbb F_q[T]$. Then for $N\leq g+2$ we have
Proof. The proof follows that of [Reference Baier and Young4, Proposition 4.3], by setting $z=0$, $N=h$ and using the fact that $m=g+2$.
Since $\Lambda (f)=0$ unless f is a prime power and $\Lambda \left (P^j\right )=\deg (P)$, we have
It is easy to see that the powers of primes with $l \geq 3$ contribute $O(1)$ to this expression. More precisely, using the Prime Polynomial Theorem (2.1), we have
Then, for any $k> 0$,
Similarly as in [Reference Lester and Radziwiłł27], we separate the sum over primes in $J+1$ sums over the intervals
where for $0 \leq j \leq J$, we define
for some $0<b<1$. In view of equation (2.5), it is natural to use $g+2$ instead of g in the definition of the intervals $I_j$.
We will choose J such that $\theta _J$ is a small positive constant. We discuss in Section 7 explicit upper bounds and how to choose $\theta _J$. We remark that for a given choice of $\theta _J$, we have $J = \left [ \log (\log g)^{{1000}} + \log {\theta _J}\right ]$. The power of 1000, together with the parameters chosen in Section 7, guarantees that J is positive for any $g\geq 3$.
For each interval $I_j$, we define
where
for $0\leq u\leq J$, and we extend this to a completely multiplicative function in the first variable. By $P \in I_j$, we always mean that $\deg {P} \in I_j$.
In order to use Lemma 3.1 we need bounds for $\exp \left ( \Re P_{I_j}(\chi; u) \right )$ on each interval $I_j$. Set $t \in \mathbb R$ and let $\ell $ be a positive even integer. Let
Note that $E_\ell (t) \geq 1$ if $t \geq 0$ and that $E_\ell (t)> 0$, since $\ell $ is even. We also have that for $t \leq \ell /e^2$,
Let $\nu (f)$ be the multiplicative function defined by $\nu (P^a) = \frac {1}{a!},$ and let $\nu _j(f)= ( \nu * \dotsb * \nu )(f)$ be the j-fold convolution of $\nu $. We then have $\nu _j(P^a) = \frac {j^a}{a!}$.
The following lemma gives a formula for the powers $\left ( \Re P_{I_j}(\chi; u) \right )^s$, and will be used frequently in the paper:
Lemma 3.2. Let $a(f)$ be a completely multiplicative function from $\mathbb F_q[T]$ to $\mathbb C$, and let I be some interval. Define $P_I := \sum _{P \in I} a(P)$. Then for any integer s, we have
Proof. We have
Note that if $f= Q_1^{\alpha _1} \dotsm Q_r^{\alpha _r}$, then $s= \alpha _1+\dotsb +\alpha _r$, and
so
We also have
For $j \leq J$, and for any real number $k \neq 0$, let
We remark that the weights are $a(\cdot; j)$ for all intervals $I_0, \dotsc , I_j$ in the formula for $D_{j, k} (\chi )$. Note that we have
where we have used Lemma 3.2.
We also define the following term, which corresponds to the sum over the square of primes in formula (3.1):
where
Proposition 3.3. Let k be positive. For each $\chi $ a primitive cubic character of genus g, we have either
or
for any $s_j$ even integers and $\eta =1.676972\dotsc $.
Proof. For $r = 0, 1, \ldots , J$, let
For each $\chi $ we have one of the following:
1. $ \chi \notin \mathcal {T}_0$.
2. $\chi \in \mathcal {T}_r$ for each $r \leq J$.
3. There exists a $j <J$ such that $\chi \in \mathcal {T}_r$ for $r \leq j$ and $\chi \notin \mathcal {T}_{j+1}$.
If the first condition is satisfied, then we are done. If not, assume that condition (2) is satisfied. Then in formula (3.1) we take $N= (g+2) \theta _J$, and we get
Now assume that condition (3) holds. Then there exist $j = j(\chi )$ and $u=u(\chi )> j=j(\chi )$ such that $\left \lvert \Re P_{I_{j+1}} (\chi ;u)\right \rvert> \ell _{j+1}/\left (k e^2\right )$. We then have
for any even integer $s_{j+1}$, and taking $N= (g+2) \theta _j$ in formula (3.1) we get
Then, if (3) holds, we have
where in the bound of the right-hand side, j and u are independent of $\chi $.
Remark 3.4. In this proof, we could have written $\max _{\substack {0\leq j \leq J-1 \\ j<u\leq J}}$ instead of $\sum _{\substack {0\leq j \leq J-1 \\ j<u\leq J}}$ in the bound (3.10). However, this maximum depends on $\chi $, and in future applications of Proposition 3.3 we will need the right-hand side to be independent of $\chi $ so that we can exchange the bound with a sum over all the possible $\chi $.
3.2 The mollifier
Let $\kappa $ be a positive real number, and define
where $\lambda (f)$ is the Liouville function. We also define
We have, for any positive integer n,
where
Then, taking $\kappa $ such that $k \kappa $ is an even integer,
We remark that the mollifier should be a Dirichlet polynomial approximating $\lvert \textstyle {L(\frac {1}{2}, \chi )}\rvert ^{-1}$. Indeed, taking $\kappa =1$ and k an even integer in the foregoing definition, we see that $\lvert M_j (\chi; 1)\rvert ^k$ is a Dirichlet polynomial on the interval $I_j$ in view of formula (3.1), approximating the exponential with the finite sum $E_{\ell _j}$ on each interval (we do not claim that the finite sum is an upper bound, but it is close enough to work on average) – that is, it is very close to equation (3.6), with the added Liouville function taking care of the cancellation. Taking $\kappa \neq 1$ allows us to mollify all moments, not just in the case when k is an even integer, by taking the mollifier to be ${\textstyle \lvert M_j(\chi ;\frac {1}{\kappa })\rvert }^{k \kappa }$ on each interval $I_j$ as already defined. We remark that for any $\kappa $, the term with $f_j h_j = P$ in the Dirichlet series (3.11) is
which is independent of $\kappa $, and of the correct size to approximate $\left \lvert {\textstyle L\left (\frac {1}{2}, \chi \right )} \right \rvert ^{-k}$.
Now we will introduce the main technical lemma that will be required to prove Theorem 1.6. We postpone its proof until Section 4.
Lemma 3.5. Let $j=0,\dotsc ,J -1$, $0 \leq u \leq J $ for (i) and $j < u \leq J $ for (iii). Let $s_j$ be an integer with $a k \kappa \ell _j \leq s_j \leq \frac {1}{d \theta _j},$ where a and d are such that $a>2$, $d>8$, and $4ad \theta _J ^{1-b} \leq 1$, with $0<b<1$.
Then we have
where $\mathcal {D}_k$ is given in equation (4.15), $H(0)$ is bounded by formula (4.21) and $C(k)$ is a constant satisfying $C(2)=e^{e^{15}}$.
3.3 Averages over the family
Lemma 3.6. Let $I_0,I_1,\dotsc , I_J$ be intervals such that $I_0=(0,(g+2) \theta _0], I_1=((g+2) \theta _0,(g+2)\theta _1],\dotsc , I_J=((g+2) \theta _{J-1},(g+2) \theta _J]$. Let $B, C, b$ and c be any functions supported on $\mathbb {F}_q[T]$. Suppose $s_j$ and $\ell _{j}$ are nonnegative integers for $j=0,\dotsc ,J$ such that
Then we have
Remark 3.7. We will also use this lemma in slightly different cases. We will allow the following variations:
• The condition $\Omega \left (F_jH_j\right ) \leq s_j $ is replaced by $\Omega \left (F_jH_j\right ) = s_j$.
• The condition $ P\mid F_jH_j \Rightarrow P\in I_j$ is replaced by $P\mid F_jH_j \Rightarrow \deg (P)=m_j$, where $m_j$ is a fixed element in $I_j$.
These variations will happen for some values of j and may happen both at the same time. In all cases, the results are analogous.
Proof. Expanding the left-hand side of the equation obtained and exchanging the order of summation, we need to evaluate sums of the form
since $q^2 \equiv 1 \,(\mathrm {mod}\,6)$, and we have cubic reciprocity over $\mathbb F_{q^2}[T]$. If, then
and the character sum vanishes. We are then left with the contribution of those terms with . Since $F_jH_j^2f_jh_j^2$ is only divisible by primes in $I_j$ and the intervals $I_j$ are disjoint, it follows that we must have for each $j\leq J $. For any $c \in \mathbb F_{q^2}[T]$, and $\deg {c} \leq g/2 + 1$, we have
and using $c = \prod _{j=0}^J F_jH_j^2f_jh_j^2$, the conclusion follows.
3.4 Proof of Theorem 1.6
Proof. We write
where $\mathcal {T}_r$ is defined in equation (3.9). We first focus on the second term. Since $\chi \not \in \mathcal {T}_0$, there exists $u=u(\chi )$ such that $0 \leq u \leq J $ and
Choosing $s_0$ even and multiplying by $ (\frac {ke^2 \Re P_{I_0}(\chi ;u)}{\ell _0})^{s_0}>1$, completing the sum for all $\chi \in \mathcal {C}(g)$ (since all the involved terms are positive) and applying Cauchy–Schwarz, we obtain
where we choose $s_0$ to be an even integer such that
with a and d as in Lemma 3.5.
For the first sum in formula (3.14), we have an upper bound of size $q^{g/2} g^{O(1)}$ using Lemma 6.1. We aim to obtain some saving from the second sum. Using Lemma 3.5(i) and Stirling’s formula, we get, for $c = 2-4/a$,
for $\delta> 1$ and all $A \geq 1$, where the last line is obtained by setting $s_0 = 2[a k \kappa \ell _0/2]+2$. We also used the bound (4) for $H(0)$ from Lemma 3.5(i) in the second line. Replacing the two estimates in formula (3.14), we get
and the sum over the characters $\chi \not \in \mathcal {T}_0$ does not contribute to the sharp upper bound.
For the first sum of equation (3.13) over the characters $\chi \in \mathcal {T}_0$, we use Proposition 3.3. As before, we first bound the sum by the completed sum over all $\chi \in \mathcal {C}(g)$, since all the extra terms are positive. We have
where $s_{j+1}$ is even.
Using Cauchy–Schwarz, we write
and similarly,
To bound formula (3.16), we use Lemmas 3.5(ii) and 5.1, which give
Similarly, to bound formula (3.17) we use Lemmas 3.5(iii) and 5.1. When we bound the first term in formula (3.17) with Lemma 3.5(iii), we use Stirling’s formula and note that the sum over primes is bounded by $\log \left ( \theta _{j+1}/\theta _j\right )=1$. Now we pick $s_{j+1} = 2 \left [1/\left (2d\theta _{j+1}\right )\right ]$, and then when $g \to \infty $, we have
where
with $c=2-4/a$ and a and d as in Lemma 3.5. We now replace in formula (3.17), and using Lemma 5.1, the sum over $j,u,\chi $ in formula (3.15) is bounded by
where
Now using also formula (3.18) and the fact that the characters in $\mathcal {T}_0$ do not contribute to the upper bound, we finally have
This completes the proof of Theorem 1.6. In Section 7 we find an explicit numerical value for the constant in the upper bound (3.21) when $k=2$, which depends on the bound for $C_J$.
4 Proof of Lemma 3.5
Proof. Following [Reference Bui, Florea, Keating and Roditty-Gershon2, Reference David, Florea and Lalin13], the sum over $\chi \in \mathcal {C}(g)$ can be rewritten as the sum over the cubic residue symbols $\chi _R$, for monic square-free polynomials $R \in \mathbb F_{q^2}[T]$ of degree ${g/2+1}$, with the property that if $P\mid R$, then $P \notin \mathbb {F}_q[T]$. Since all the summands in the foregoing expressions are positive, we first bound the sums over $\chi \in \mathcal {C}(g)$ by the sum over all $R \in \mathcal {M}_{q^2,g/2+1}$.
We prove the last upper bound; the first two are just simpler cases of that one. We note that $D_{j, k}(\chi )^2$ contributes primes from the intervals $I_0, \dotsc , I_j$, $\Re P_{I_{j+1}}(\chi ;u)$ contributes primes from $I_{j+1}$ and the mollifier contributes primes from all the intervals $I_0, \dotsc , I_J $. To prove (iii), we have to bound
where the $\mathcal {E}_R(r)$ are defined as follows. For $r=0,\dotsc , j$,
For $r=j+1$,
For $r=j+2,\dotsc , J $,
For $\theta _J $ small enough (depending on $d, k, \kappa $), note that we can apply Lemma 3.6 to evaluate formula (4.1), because from our choice of parameters, we have, for any $j \leq J -1$,
We then obtain that formula (4.1) is bounded by
where the $E(r)$ are the factors obtained after doing the average over R from Lemma 3.6. We proceed to address the three cases, depending on the value of r.
For $r=0, \dotsc , j$, we have
Notice that if $\max \{\Omega (f_r),\Omega (h_r),\Omega (F_{r1}H_{r1}), \Omega (F_{r2} H_{r2})\}\geq \ell _r$, we have $2^{\Omega \left (f_rh_rF_{r1}H_{r1} F_{r2} H_{r2}\right )}\geq 2^{\ell _r}$. We write $F_r=F_{r1} F_{r2}$, $H_r=H_{r1}H_{r2}$, and we recall that $\nu _2(F_r) = (\nu * \nu )(F_r)$. We have
where we have used the bounds $\phi _{q^2}\left (f_r h_r^2 F_r H_r^2\right )/\left \lvert f_r h_r^2 F_r H_r^2\right \rvert _{q^2}, \lambda (f_r h_r), \nu (F_r), \nu (H_r) \leq 1$, $ a(F_rH_r;j), a(f_r h_r; J ) \leq 1$ in the second term. Now using the facts that $\nu _{k \kappa }(f_r) \leq (k \kappa )^{\Omega \left (f_r\right )}$ and $\nu _2(F_r) \leq 2^{\Omega \left (F_r\right )}$, we get that the second term in formula (4.4) is
Now write $(f_r,h_r)=X$ and $(F_r,H_r)=Y$ and let $f_r=f_{r,0}X$, $h_r=h_{r,0}X$, $F_r=F_{r,0}Y$ and $H_r=H_{r,0}Y$. Then . Write $\left (f_{r,0},H_{r,0}\right )=S$ and $\left (h_{r,0},F_{r,0}\right )=T$, and write $f_{r,0}=f_{r,1}S$, $h_{r,0}=h_{r,1}T$, $F_{r,0}=F_{r,1}T$ and $H_{r,0}=H_{r,1}S$. Then with $\left (f_{r,1}F_{r,1}, h_{r,1}H_{r,1}\right )=1$, and it follows that , . Let $\left (f_{r,1},F_{r,1}\right )=M$, $f_{r,1}=f_{r,2}M$, $F_{r,1}=F_{r,2}M$. Then . Write with $(C,D)=1$ and $C, D$ square-free. Then and it follows that , , where $C_1C_2=C$ and $D_1D_2=D$. Then we replace
and similarly
with $A_1A_2=A$ and $B_1B_2=B$. We ignore the coprimality conditions when bounding the second term of formula (4.4), and for the first term we keep the condition $(S,T)=1$, which we need to get the cancellation between the mollifier and the short Dirichlet polynomial of the L-function.
Replacing in formula (4.5), we get that the second term in formula (4.4) is bounded by
Let $F(r)$ denote this expression. Using the inequality form of the Prime Polynomial Theorem (2.1), note that for $r \neq 0$, we have
and hence
For $r=0$, we have
and we remark that
For the first term in formula (4.4), using the change of variable from before, we get
For every fixed value of $A, B, C, D, f_r, h_r, F_r, H_r, A_1, A_2, B_1, B_2, C_1, C_2, D_1, D_2$, let
where
We can rewrite the first term in formula (4.4) as
and we will show that
for some constant $C(k)$.
Since we need an explicit constant, in the case $k=2$ we will prove that that we can take $C(2)=e^{e^{15}}$. We can write $A(r)$ as an Euler product, and we look at the coefficients of $1/\lvert P\rvert $, $1/\lvert P\rvert ^{3/2}$, $1/\lvert P\rvert ^2$ and $1/\lvert P\rvert ^{5/2}$. Recall that $\nu _\ell (P^a)=\frac {\ell ^a}{a!}$. For the coefficient of $1/\lvert P\rvert $, we need to consider $A=B=C=D=f_r=h_r=F_r=H_r=1$ and $s,t,x$ or $y=1$. This gives
for the coefficient of $1/\lvert P\rvert $. Since $0< a(P;j)<a(P;J)<1$, we remark that $0<\alpha _{j,1}(P)<k^2$.
For the coefficient of $1/\lvert P\rvert ^{3/2}$ we consider $f_r=P$, $h_r=P, F_r=P, H_r=P$ and $A=P, A_1=1$ and $A=P, A_1=P$, $C=P, C_1=1$ and $C=P, C_1=P$, while $s=t=x=y=0$. When $f_r=P$ (and everything else is $1$) we get a factor of
We get the same term when $h_r=P$. If $F_r=P$, we get
and when $H_r=P$ we get the same factor. If $A=P, A_1=1$, we get the term
Similarly, when $A=P, A_1=P$, we get
Putting all of this together, we get
for the coefficient of $1/\lvert P\rvert ^{3/2}$. We remark that $-\frac {k^3}{3}<\alpha _{j,3/2}(P)<0$, since $a(P;j)<a(P;J)$.
For the coefficient of $1/\lvert P\rvert ^{2}$, we must take $A=B=C=D=f_r=h_r=F_r=H_r=1$ and $s+t+x+y=2$, and we proceed as before to obtain
and we have that $0<\alpha _{j,2}(P)<\frac {k^4}{4}$.
For the coefficient of $1/\lvert P\rvert ^{5/2}$, we obtain the product of the coefficients of $1/\lvert P\rvert $ and $1/\lvert P\rvert ^{3/2}$, resulting in
which satisfies $-\frac {k^5}{3}<\alpha _{j,5/2}(P)<0$.
Overall, for the sum over $A,B,C,D, A_1, C_1, B_1, D_1,F_r,h_r,F_r,H_r$ we get
Since we want to obtain an explicit constant for the case $k=2$, we proceed to bound the term corresponding to $O \left ( \frac {1}{\lvert P\rvert ^{3}} \right ) $. To do this we bound the terms of the form $1/\lvert P\rvert ^{n/2}$ for $n>5$ in the Euler product corresponding to the sum of formula (4.7). We bound trivially the signs and the terms involving $a(\cdot , j)$ and $a(\cdot , J)$, and we recall that $\nu _\ell (P^a)=\frac {\ell ^a}{a!}$. Thus, the terms contributing to $1/\lvert P\rvert ^{n/2}$ can be bounded by
The number of terms in this sum is bounded by the number of ways of choosing values for the indices $a_1,a_2,\dotsc ,d_2,s,t,x,y,f,h,F,H$ subject to the condition that $2s+2t+2x+2y+3a_1+3a_2+6b_1+6b_2+3c_1+3c_2+6d_1+6d_2+3f+3h+3F+3H=n$. Since there are 16 indices, this number is bounded by $\binom {n+15}{15}$. In addition, note that the numbers in the four factorials sum up to n. Thus, the fraction involving the four factorials can be bounded by $\frac {4^n}{n!}$. Putting all of this together and summing over the powers of $1/\lvert P\rvert ^{1/2}$ starting from $1/\lvert P\rvert ^{3}$, we get that the contribution of the higher powers of $1/\lvert P\rvert ^{1/2}$ is bounded by
Notice that $\frac {\binom {\ell +15}{15}}{\ell !}$ is decreasing in $6\leq \ell $, with a maximum at $\ell =6$. We thus get
whenever $\lvert P\rvert ^{1/2}>4k$.
We now suppose that $k=2$. Considering the worst case, $q=5$, we can apply the foregoing, provided that $\deg (P)\geq 3$. Writing $\prod _r A(r)$ as a product over primes with $\deg (P) \leq (g+2) \theta _j$, and restricting to those primes with $\deg (P) \geq 3$, we get that this contribution is bounded by
Noticing that
we obtain
We also have
and
When $\deg (P)\leq 2$ and $k=2$, we can bound
Applying the Prime Polynomial Theorem, this gives
Combining formulas (4.10), (4.11), (4.12) and (4.13), it follows that we can take
We remark that we expect the value of $C(2)$ to be much smaller, which could potentially be proven by exploiting the cancellation in the Liouville function in formula (4.7). We have decided not to to do that here, since it does not change the final value of the constant in formula (1.1), as the worst contribution to this constant comes from the upper bound for $C_J$ computed in Section 7.
Now we go back to expressing bounds for general k. Combining formula (4.6) and (4.8), and incorporating everything in formula (4.4), we get that the contributions from the intervals $I_0, \dotsc , I_j$ are bounded by
where
We now look at the term $r= j+1$ from formula (4.3), which involves the mollifier and $\left (\Re P_{I_{r}}(\chi )\right )^{2s_r}$. We first write
where we have bounded $\lambda (f_r h_r), a(f_r h_r; J ) a(F_r H_r; u), \phi _{q^2} \left (f_r h_r^2 F_r H_r^2\right )/ \left \lvert \left (f_r h_r^2 F_r H_r^2\right )\right \rvert _{q^2} \leq 1$, $\nu _{k \kappa }(f_r; \ell _r) \leq \nu _{k \kappa }(f_r)$.
Using the change of variable as before, we can rewrite the sum of formula (4.16) as
where we have used the fact that $\nu \left (Z^3\right ) \leq \nu (Z)/3^{\Omega (Z)}$ and $\nu (\cdot ) \leq 1$.
Now note that $ \Omega \left (TCD^2 C_2 D_2^2 S A B^2 A_2 B_2^2\right ) \leq \Omega \left ((ST) \left (CD^2\right )^2\left (AB^2\right )^2\right ) \leq 4 k \kappa \ell _r$ and by hypothesis $ 4 k \kappa \ell _r \leq \frac {4}{a} s_r$, so $\Omega \left (Y^2 F_r^3 H_r^3\right ) \geq \left (2-\frac {4}{a}\right )s_r:=c s_r$.
Let $\alpha =2s_r - \Omega \left (TCD^2 C_2 D_2^2 S A B^2 A_2 B_2^2\right ) $. Using the fact that $\nu (Y)^2 \leq \nu (Y)$, since $\nu (Y) \leq 1$, the sum over $Y, F_r, H_r$ is bounded by
Now
a similar expression holds for the sum over $H_r$ and
Using the inequalities from before, it follows that
We now consider the exterior sum in formula (4.17). For the sum over $A_1$ (recall that A is square-free), we have
Then overall we get
Similar expressions hold for the sums over $C, B, D$, and overall for the sum over $X,S,T,A,B,C,D, f_r, h_r$ we get that it is
Using the Prime Polynomial Theorem (2.1), we get
for $r \neq 0$, and then
which is what we need to prove (iii). For $r=0$, we have
In (i), the bound will depend on $H(0)$. Replacing formulas (4.19) and (4.20) in formulas (4.17) and finally (4.16), it follows that
Finally, we consider the case where $r \geq j+2$. In this case, only the mollifier contributes primes in this interval in the factors of formula (4.3). It is easy to see that
where we used the same bound as before on the functions appearing in the mollifier, and we also used the fact that $\nu _{k \kappa }(g_r) \leq (k \kappa )^{\Omega \left (g_r\right )}$. Note that
is equivalent to $f_r = g_r S_r^3$ and $h_r = g_r T_r^3$ for $(S_r, T_r)=1$. Then the term corresponding to a fixed r in this product is bounded by
Using the fact that $-\log (1-x) < \frac {x}{1-x}$, we get
Similarly,
Then the contribution from $r \geq j+2$ will be bounded by
Combining the contribution of the intervals $I_r$ with $r \leq j$ from formula (4.14), the contribution of the interval $I_{ j+1}$ from formula (4.22) and the contribution of the intervals $I_r$ with $j+2\leq r \leq J $ from formula (4.23), we get the bound of the last inequality.
We prove the first inequality corresponding to “$j=-1$” in the same way, except that the bound for $H(r)$ in formula (4.20) is not valid for $r=0$, so we just keep $H(0)$ on the right-hand side. The second inequality corresponds to $j=J$.
5 Squares of the primes
In this section we prove an upper bound for the average over the square of the primes appearing in the kth moment. Our proof is similar to [Reference Harper21], but it is simpler because we separate the primes and the square of the primes from the start by using Cauchy–Schwarz in order to deal with the mollifier.
We recall that
where the positive weights $b(P;j)$ are defined by equation (3.8). Then $b(P;j) \leq \frac 12$, which is the only property that we use in this section.
Lemma 5.1. Let $S_{j,k}$ be the sum defined by equation (3.7) and set $\beta>1$. For $j=0,\dotsc ,J $ we have
In particular, choosing $\beta =2$ and using the fact that $q\geq 5$, we have
where
and in particular
Proof. Let
where the sum is over the monic irreducible polynomials of degree m. For ease of notation, we will simply denote this sum by $F_m(\chi )$. Let
Note that $F_0(\chi )=\frac {1}{2}$, so the set $\mathcal {F}(0)$ is empty. Since the sets $\mathcal {F}(m)$ are disjoint, note that we have
If $\chi $ does not belong to any of the sets $\mathcal {F}(m)$, then
for all $1 \leq n \leq (g+2) \theta _j/2$, so in this case we have
Now assume that $\chi \in \mathcal {F}(m)$ for some $1 \leq m \leq (g+2) \theta _j/2$. Then we have
where $\gamma $ is the Euler–Mascheroni constant. Therefore, in this case we have
If $\chi \in \mathcal {F}(m)$, also note that $(\beta ^m \Re F_m(\chi ))^4>1$, so combining with this inequality, we get
Note that by Lemma 3.2,
Using Lemma 3.6 (note that $8m \leq (g+2)/2$, since $\theta _J $ is small enough), we get
When
, we can write $f=b f_1^3, h=b h_1^3$ with $(f_1,h_1)=1$. Since $\Omega \left (b^2f_1^3h_1^3\right )=4$, it follows that $f_1=h_1=1$ and $\Omega (b)=2$. Then using the fact that $\nu (b)^2 \leq \nu (b)$, we get
where for the last inequality we used the Prime Polynomial Theorem (2.1). Combining this and formulas (5.4) and (5.5), we get
Note that for any $1<\beta <\sqrt {q}$, this expression will be $\ll q^{g+2}$.
Now we take $\beta =2$. We use the fact that $\exp ( 2k/(\beta ^m(\beta -1))) \leq e^k$, and the fact that
for $x<1$. Since $q \geq 5$, using this inequality and formula (5.6), inequality (5.2) follows.
6 Upper bounds for moments of L-functions
Here, we will prove the following upper bound:
Proposition 6.1. For any positive real number k and any $\varepsilon>0$, we have
We first prove the following result:
Lemma 6.2. Let l and y be integers such that $3 l y \leq g/2+1$. For any complex numbers $a(P)$ with $\lvert a(P)\rvert \ll 1$, we have
If we also assume that $l \leq \displaystyle \left (\sum _{\deg (P) \leq y} \frac {\lvert a(P)\rvert ^2}{\lvert P\rvert }\right )^{3-\varepsilon }$, then we have
Proof. We extend $a(P)$ to a completely multiplicative function. We have
Note that
Using this and equation (6.3), note that if $fh^2$ is not a cube, then the character sum over $F \in \mathcal {M}_{q^2,g/2+1}$ vanishes, since $\deg {(fh^2}) \leq 3 l y \leq g/2+1$ by hypothesis. Then
The condition
can be rewritten as $f=bf_1^3$ and $h=bh_1^3$ with $(f_1,h_1)=1$. Then we get
where we used the fact that $\nu (ab) \leq \nu (a) \nu (b)$, $\nu \left (f^3\right ) \leq \nu (f)/3^{\Omega (f)}$ and $\nu (b)^2 \leq \nu (b)$, and we ignored the condition that $(f_1,h_1)=1$.
We further get that this is
where we get the first line by using the facts that $\lvert a(P)\rvert \ll 1$ and $\sum _{n=1}^{\infty } \frac {1}{nq^{n/2}}<1$ and that the sum over primes in formula (6.4) is bounded. Using the trinomial expansion formula, we get
Replacing in formulas (6.6) and then (6.4), we get
Now let
and we assume that $l \leq x^{3-\varepsilon }$. We claim that for $i \leq l$ with $i \equiv l \,(\mathrm {mod}\,3)$, we have
Using Stirling’s formula, we need to show that for $l \leq x^{3-\varepsilon }$, we have
for some constant C. Now let
Then
and f attains its maximum on $[0,l]$ at i with $i^3=x^3(l-i)^2$. Since $l \leq x^{3-\varepsilon }$, it follows that f attains its maximum at some $i_0$ with $i_0>l/2$. Indeed, if we suppose that $i_0 \leq l/2$, then $l-i_0 \geq l/2$, and since $x^3>l$ it follows that $i_0^3> l^3/4$ – which is a contradiction, since we assumed that $i_0^3 \leq l^3/8$. Let $i_1=i_0/l$. We have $1/2<i_1<1$. Then
Since $1/2<i_1<1$, it follows that
which establishes formula (6.7). Combining formulas (6.5) and (6.7), and since $l /3^{2l/3}<1$, the conclusion follows.
Proof of Proposition 6.1. The proof is similar to the proof of [Reference Soundararajan36, Corollary A]. Let
Then
In formula (3.1) with $k=1$, note that we can bound the contribution from primes square by $O(\log \log g)$. Indeed, we split the sum over P with $\deg (P) \leq N/2$ into primes P with $\deg (P) \leq 4 \log _q g$ and primes P with $4 \log _q g<\deg (P) \leq N/2$. For the first term, we use the trivial bound, which gives the bound $O(\log \log g)$. For the second term, we use the Weil bound (2.10), yielding an upper bound of size $o(1)$. So we have
Let
and $N_0=N/\log g$, where
We only need to consider $\sqrt {\log g}<V$. Indeed, note that the contribution from $V \leq \sqrt {\log g}$ in the integral on the right-hand side of equation (6.8) is $o\left (q^gg^{k^2}\right )$, by trivially bounding $N(V) \ll q^g$. If $\chi $ is such that $\log \left \lvert {\textstyle L\left (\frac {1}{2}, \chi \right )} \right \rvert \geq V$, then
for g large enough, since $\sqrt {\log g}<V$.
Let
Then if $\log \left \lvert {\textstyle L\left (\frac {1}{2}, \chi \right )} \right \rvert \geq V$, either
Let
Using formula (6.1) of Lemma 6.2, we get
for any l such that $3l N \leq g/2+1 \iff l \leq V/(6A)$ and where $a(P) = (N-\deg (P))/\left (N\lvert P\rvert ^{1/N\log q}\right )$. Picking $l =6\lfloor V/(36A)\rfloor $, this gives
If $\chi \in \mathcal {F}_1$ and $V \leq (\log g)^{2-\varepsilon }$, then we pick $l=\left \lfloor V_1^2/\log g \right \rfloor $. Note that since $a(P)=(N-\deg (P))/\left (N \lvert P\rvert ^{1/N \log g}\right )$, we have $\sum _{\deg (P ) \leq N_0} \lvert a(P)\rvert ^2/\lvert P\rvert = \log g + o(\log g)$, and then $l \leq \left (\sum _{\deg (P) \leq N_0} \lvert a(P)\rvert ^2/\lvert P\rvert \right )^{3-\varepsilon }$. We can then apply formula (6.2) of Lemma 6.2, and we get
If $V>(\log g)^{2-\varepsilon }$, then we pick $l=18V$ and apply formula (6.1) to get
Using this and the values for A of equation (6.10), we prove the following:
If $\sqrt {\log g} \leq V \leq \log g$, then
If $\log g < V \leq \frac {1}{12} \log g \log \log g$, then
If $V> \frac {1}{12} \log g \log \log g$, then
Now we use the bounds (6.12), (6.13) and (6.14) in the form $N(V) \ll q^g g^{o(1)} \exp \left (-V^2/\log g\right )$ if $V \leq 4 k \log g$ and $N(V) \ll q^g g^{o(1)} \exp (-4kV)$ if $V>4k \log g$ in equation (6.8) to prove Proposition 6.1. Indeed, we have
and the desired upper bound follows. As mentioned in [Reference Soundararajan36], it is interesting to remark that the proof suggests that the dominant contribution for the $2k$th moment comes from the characters $\chi $ such that $\left \lvert {\textstyle L\left (\frac {1}{2}, \chi \right )} \right \rvert $ has size $g^k$, and the measure of this set is about $q^g g^{-k^2}$.
7 Explicit upper bound for mollified moments
Here we will obtain an explicit upper bound for expression (3.21), which means that we want to find an upper bound for $C_J$ from equation (3.20) by choosing $\theta _J , a,b$ and d subject to the constraints in Lemma 3.5 and subject to formula (4.2).
Let
with
where we recall that
and a and d are as in Lemma 3.5. We will pick $\theta _J $ subject to the condition (4.2) and such that $R_1>0$.
We have
and notice that for $u \leq (R_1 -R_2 )/R_2 $ we have $f'(u)>0$, so f is increasing on $[0,(R_1 -R_2 )/R_2 ]$ – that is, f is increasing on $\left [0, \frac {2dk e}{\alpha }+\log \theta _J +\frac {\log F}{\alpha }-1\right ]$. Also note that
so the maximum of f occurs at some $m \in (R_1 /R_2 -1,R_1 /R_2 )$. With this notation, we write
For $u \geq 4R_1 /R_2 $ we have $R_1 e^u+ k^2 u \theta _J /2<R_2 ue^u/2$, so
Now
where in the third line we used the fact that $m \in (R_1 /R_2 -1,R_1 /R_2 )$. Combining formulas (7.2) and (7.3), we get
Now using this inequality back in formula (3.21), we get
where we recall that $R_1 $ and $R_2 $ are given in equation (7.1) and $\mathcal {S}_k$ is defined in Lemma 5.1.
From the explicit upper bound obtained, we remark that because of the term $\exp \left (R_2 e^{R_1 /R_2 -1}/\theta _J \right )$, the upper bound we obtain is of the form $e^{e^{O(k)}}$.
Now we take $\kappa =1, k=2$. Condition (4.2) becomes
Note that any $\theta _J $ with
satisfies this condition. We will pick $\theta _J $ such that
Now, in formula (7.4), in order to obtain an optimal constant, we set
and the term $\log F/(2d)$ in the expression for $R_1 $ is small compared to the rest, so in order to optimise the constant, we set
Now from Lemma 3.5 we need
so combining this with equation (7.5) it follows that
Now, to minimise equation (7.6) we need c to be maximal, so we will pick
From equations (7.5), (7.6) and (7.7), it follows that
where $x= \log (40 de/((d-8)(e-1)))$. With choices (7.8) and (7.7) for b and c, we want to minimise equation (7.6), and this translates into minimising the function of d given by
for $d>8$.
The minimum of this function is achieved for
and in that case,
With this choice for d, we get
Choosing $b,c,d$ as in formulas (7.9) and (7.10), we obtain the upper bound
8 The mollified first moment
Here we will prove Theorem 1.3. We consider the mollified first moment with $\kappa =1$. We have
and then
We will evaluate the twisted first moment in the following proposition:
Proposition 8.1. Let $q \equiv 2 \,(\mathrm {mod}\,3)$, and let h be a polynomial in $\mathbb {F}_q[T]$ with $\deg (h) < g \left ( \frac {1}{10}-\varepsilon \right )$. Let $h=CS^2E^3$, where C and S are square-free and coprime. Then we have
where $\mathcal {A}_{\mathrm {nK}} \left ( \frac {1}{q^2}, \frac {1}{q^{3/2}} \right )$ and $M_R \left ( \frac {1}{q^2},\frac {1}{q^{3/2}} \right ) $ are given in equations (8.14) and (8.15).
Proof. The proof is similar to the proof of [Reference David, Florea and Lalin13, Theorem 1.1]. Using the explicit description of the characters $\chi \in \mathcal {C}(g)$ given by equation (2.5), along with Proposition 2.1, we write
where
and
We will choose $X \equiv 2 \deg (h) \,(\mathrm {mod}\,3)$. For the principal term, we will compute the contribution from polynomials f such that $fh$ is a cube and bound the contribution from $fh$ noncube. We write
where
corresponds to the sum with $fh$ a cube in equation (8.3) and
corresponds to the sum with $fh$ not a cube – namely,
and
Since $X \equiv 2 \deg (h) \,(\mathrm {mod}\,3)$, note that the second term in equation (8.3) does not contribute to equation (8.6).
8.1 The main term
Now we focus on. Since $h= CS^2E^3$, where $C, S$ are square-free and $(C,S)=1$ and, it follows that we can write $f= C^2 S K^3$. Then
We first look at the generating series of the sum over F. We use the fact that
where $\mu $ is the Möbius function over $\mathbb F_q[T]$. The generating series corresponding to the inner sum in equation (8.8) is
We evaluate the sum over F and have
and combining this with equation (8.10), it follows that
Now we write down an Euler product for the sum over D, and we have
where the product over R is over monic, irreducible polynomials. Let $A_R(x)$ denote the first Euler factor and $B_R(x)$ the second. Using equation (8.11) and putting everything together, it follows that
We now introduce the sum over K, and we get
where R denotes a monic irreducible polynomial in $\mathbb {F}_q[T]$. Combining this equation and equation (8.12), we get the generating series
where
We remark that if $h=1$, this generating series is the same as in [Reference David, Florea and Lalin13, Section 4.3], and we compute the asymptotic for
in the exact same way, keeping the dependence on h. Using Perron’s formula (Lemma 2.2) twice in equation (8.8) and the generating series just obtained, we get that
where we are integrating along circles of radii $\lvert u\rvert <1/q^{\frac {3}{2}}$ and $\lvert x\rvert <1/{q^2}$. As in [Reference David, Florea and Lalin13], we have that $\mathcal {A}_{\mathrm {nK}}(x,u)$ is analytic for $\lvert x\rvert <1/q, \lvert xu\rvert <1/q, \left \lvert xu^2\right \rvert <1/q^2$. We initially pick $\lvert u\rvert =1/q^{\frac {3}{2}+\varepsilon }$ and $\lvert x\rvert =1/q^{2+\varepsilon }$. We shift the contour over x to $\lvert x\rvert =1/q^{1+\varepsilon }$ and we encounter a pole at $x=1/q^2$. Note that the new double integral will be bounded by $O\left (q^{\frac {g}{2}+\varepsilon g}\right )$. Then
We shift the contour of integration to $\lvert u\rvert =q^{-\varepsilon }$ and we encounter two simple poles: one at $u=1/q^{\frac {3}{2}}$ and one at $u=1/q$. Evaluating the residues, we get
8.2 The contribution from noncubes
Let $S_{11}$ be the first term in equation (8.7) and $S_{12}$ the second. Note that it is enough to bound $S_{11}$, since bounding $S_{12}$ will follow in a similar way. We use equation (8.9) again for the sum over F, and we have
Remark that we used $\chi _D(fh)=1$, because $D,f,h \in \mathbb {F}_q[T]$. Looking at the generating series of the sum over F, we have
Using Perron’s formula (Lemma 2.2) and the generating series obtained, we have
where the integral takes place along a circle of radius $\lvert u\rvert = 1/q$ 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 (formulas (2.8) and (2.9)), and we obtain
Therefore,
Trivially bounding the sums over D and f in equation (8.17) gives a total upper bound of
and similarly for $S_{12}$.
8.3 The dual term
Now we focus on $S_{1 , \text {dual}}$. From equation (8.5), using equations (2.14) and (2.12), we have
We write $S_{1,\text {dual}}= S_{11,\text {dual}}+S_{12,\text {dual}}$ for terms (8.18) and (8.19), respectively, on the right-hand side of this equation.
We have
Now let $(f,h)=B$ and write $f= B \tilde {f}$ and $h = B \tilde {h}$, where $\tilde {f}= f_1 f_2^2 f_3^3$ and $\tilde {h} = h_1 h_2^2 h_3^3$ with $(f_1,f_2)=1$, $(h_1,h_2)=1$ and $f_1,f_2,h_1,h_2$ square-free. Using Proposition 2.3, we get
with $2/3<\sigma <4/3$. Combining formulas (8.18) and (8.20), we write $S_{11,\text {dual}}=M_1+E_1$, where $M_1$ corresponds to the first term in this equation. Using equation (2.15) and following similar steps as in [Reference David, Florea and Lalin13], we get
where we have used $G_{q^2}\left (fh^2,N\right )=\chi _N\left (fh^2\right )G_{q^2}(1,N)$ and the fact that the first sum is zero unless $h_1=f_2=1$.
Similarly as in [Reference David, Florea and Lalin13], we use Perron’s formula and the generating series to rewrite the sum over N. Again, the only difference is the presence of h in these formulas. We have
where
and
Introducing the sums over B and $\tilde {f}$, we have
We let
where
Then we can write down an Euler product for $\mathcal {H}_{\mathrm {nK}}(h;u,w)$, and we have
Following [Reference David, Florea and Lalin13], let
with $\mathcal {B}_{\mathrm {nK}}(u,w)$ analytic in a wider region – for example, $\mathcal {B}_{\mathrm {nK}}(u,w)$ is absolutely convergent for $\lvert u\rvert <q^{\frac {11}{6}}$ and $\lvert uw\rvert < q^{\frac {11}{6}}$.
After simplifying and making similar computations to the ones in [Reference David, Florea and Lalin13], we have
We now rewrite $M_1$ using the generating series we have obtained and Perron’s formula for the sum over $\tilde {f}$. We need to deal with the terms involving $[g/2+1+\deg (f_1h_2)]_3$ that appear in equation (8.21). We notice that if $g/2+1+\deg (f_1h_2) \equiv 0 \,(\mathrm {mod}\,3)$, then $\deg (f_1) \equiv g - \deg (h_2)-1 \,(\mathrm {mod}\,3)$, and in that case, $\rho (1,[g/2+1+\deg (f_1h_2)]_3)=1$. If $g/2+1+\deg (f_1h_2) \equiv 1 \,(\mathrm {mod}\,3)$, then $\deg (f_1) \equiv g - \deg (h_2) \,(\mathrm {mod}\,3)$. In this case we also have $\tau (\chi _3)=q$ by Proposition 2.3, and $\rho (1, [g/2+1+\deg (f_1h_2)]_3)=q^3$, since we are working over $\mathbb F_{q^2}$. Using Perron’s formula (Lemma 2.2) twice and keeping in mind that $X \equiv 2 \deg (h) \,(\mathrm {mod}\,3)$, we get
We proceed as in [Reference David, Florea and Lalin13], shifting the contour of integration over w to $\lvert w\rvert =q^{1-\varepsilon }$ and computing the residue at $w=1$. Writing
we get
Shifting the contour of integration to $\lvert u\rvert =q^{-\varepsilon }$ and computing the residue at $u=q^{-\frac {1}{6}}$,
Now note that we can extend the sum over B to include all $B\mid h$ at the expense of an error term of size $O\left (\tau (h) / q^{\frac {2}{3}(g-X)}\right )$, giving a total error term of size $O\left (q^{\frac {g}{3}+\frac {X}{2}+\varepsilon g}\right )$. Then
Recall that $h=CS^2 E^3$ with $C,S$ square-free and coprime. Then for the sum over B we can write an Euler product as follows:
Simplifying and using the fact that $F_R\left (q^{-1/6}\right ) = \frac {\lvert R\rvert _q}{\lvert R\rvert _q-1},$ we get
Using this and equation (8.23), it follows that
Putting everything together, we get
We treat $S_{12,\text {dual}}$ similarly, and since $\deg (f) = g-X$ we have $[g/2+1+ \deg (f_1h_2)]_3 = 1$. Then, as before, $\rho (1,1)=\tau (\chi _3) = q^3$, and we get
Combining the two previous equations, we get
Now using the work from [Reference David, Florea and Lalin13], we have
When $\deg (R)$ is odd, note that we have
and when $\deg (R)$ is even, we have
Hence combining equations (8.24) and (8.16), we get
Using Proposition 2.3 and following similar steps as in the proof at [Reference David, Florea and Lalin13, page 48], we get
as long as $\sigma \geq 7/6$. The second integral involving the sum over $f \in \mathcal {M}_{q, g-X}$ is similarly bounded.
Collecting the estimate for with the proper error terms and the estimate for from Section 8.2, we get
where $7/6 \leq \sigma <4/3$. We pick $\sigma =7/6$ and $X= \frac {3g}{4} + \frac {\deg (h)}{2}$. Then the error term becomes $O \left (q^{\frac {7g}{8}+\frac {\deg (h)}{4} +\varepsilon g} \right )$. Since $\deg (h) < \frac {g}{10}-\varepsilon g$, the main term dominates the error term, and we have a genuine asymptotic formula.
8.4 Proof of Theorem 1.3
Proof. Here we will finish the proof of Theorem 1.3. From equation (8.2) and Proposition 8.1, it follows that the main term in the mollified first moment is equal to
where
where in the second line we have added the $h_r$ with $\Omega (h_r) \geq \ell _r$ to the main sum, and we have also used the facts that $2^{\ell _r}\leq 2^{\Omega (h_r)}$ and the bound $\nu (h_r)\leq 1$. Now we have
so combining the two previous equations, we get
Let $U(r)$ denote the first term. Then
We first focus on
where $N_P\left (\frac {1}{q^{2}}, \frac {1}{q^{3/2}}\right )=M_P\left (\frac {1}{q^{2}}, \frac {1}{q^{3/2}}\right )$ or 1 according to whether $\deg (P)$ is even or odd. Thus
For the second product of formula (8.26), we have
where in the second line we used the inequality form of the Prime Polynomial Theorem (2.1), $K = \exp \left ( \sum _{n=1}^{\infty } \frac {q^n}{n} \left (\frac {1}{q^{3n/2}-1}+\frac {2}{q^{3n/2}-2}+\frac {4}{q^{3n/2}-4}+\frac {8}{q^{3n/2}-8} \right ) \right ),$ and the estimate in the last line is taken with the constants chosen in Section 7.
Putting together all this information, we obtain
Finally, summing the error term coming from Proposition 8.1 gives
where $w=\sum _{j=0}^J \theta _j \ell _j$. Note that because of formula (4.2), we have
so formula (8.30) constitutes an error term. This finishes the proof of Theorem 1.3.
Proof of Corollary 1.4. Note that from expression (8.27), we can write
We also have
For the factors involving R of even degree, we have
and this leads to
Combining everything, the main term of the mollified moment in formula (8.29) satisfies
where we have bounded by the worst case $q = 5$.
9 Conclusion
The method we used for the family of cubic L-functions would be expected to work in general for families where one can compute the first moment with a power-saving error term, and it is useful in families where the second moment is not known. The method allows us to get a sharp upper bound for the second mollified moment, which is enough to obtain a positive proportion of nonvanishing (under the GRH). For the family of cubic twists, we expect that the Kummer case would be similar, and the results would hold in that setting as well. Our results should also transfer over to number fields, but it would be conditional on the GRH.
Acknowledgments
The authors would like to thank Maksym Radziwiłł for drawing our attention to his work with Lester and for very helpful discussions, and Stephen Lester for interesting insights and comments. The authors would also like to thank the referee for a careful reading of the paper and for the many useful comments and suggestions.
Funding statement
The research of the first and third authors is supported by the National Science and Engineering Research Council of Canada (NSERC Discovery Grant 155635-2019 to CD, 335412-2013 to ML) and the Fonds de recherche du Québec – Nature et technologies (FRQNT Projet de recherche en équipe 256442 and 300951 to CD and ML). The second author was supported by the National Science Foundation (NSF DMS-2101769, NSF - Postdoctoral Fellowship DMS-1703695) during part of the research which led to this paper, and she wishes to thank the initiative “A Room of One’s Own” for focused time.
Conflicts of interest
None.