Non-vanishing of quadratic twists of modular -functions of prime-related moduli
Abstract.
In this paper, we study central values of the family of quadratic twists of modular -functions of moduli , with ranging over odd primes. Assuming the truth of the generalized Riemann hypothesis, we establish a positive proportion non-vanishing result for the corresponding -values.
Mathematics Subject Classification (2010): 11M06, 11F67
Keywords: moments, quadratic twists, modular -functions, prime moduli
1. Introduction
The non-vanishing of the central values of -functions is very important subject in number theory, as these central values carry deep arithmetic information. S. Chowla [chow] conjectured that an -functions attached to a primitive Dirichlet character does not have a zero at . There are now two major approaches towards establishing positive proportion non-vanishing results for families of -function. One of them is the mollifier method that allows one to achieve a non-vanishing result unconditionally via evaluating mollified moments. For example, K. Soundararajan [sound1] applied this method to derive the well-known result that at least of the members of the family of quadratic Dirichlet -functions do not vanish at the central point.
The other modus operandi is provided by the density conjecture of N. Katz and P. Sarnak [KS1, K&S]. In this approach, one computes the one-level density of low-lying zeros of families of -functions to derive a corresponding non-vanishing result. In order to obtain better results, one often needs to make use of the generalized Riemann hypothesis (GRH). For example, A. E. Özluk and C. Snyder [O&S] used this process to show that at least of the members of the family of quadratic Dirichlet -functions have non-vanishing central values. Optimizing the test function as in [B&F, ILS], this percentage can be improved to , approximately 94.27%.
Both of the above two ways may fail to yield any positive proportion non-vanishing result. In the first instance, the mollifier method requires one to evaluate at least two mollified moments of the family of -functions to deduce the desired result and evaluating
higher mollified moments may be challenging. In the second approach, one needs the one-level density result to hold for test functions whose Fourier transforms have long supports in order to deduce a positive proportion non-vanishing result. The current technology often fall short of this, even under GRH.
To circumvent the above difficulties, one may apply the mollifier method with more flexibility by observing that the method works if one can bound one mollified moment from below and another from above instead of evaluating both moments asymptotically. Often, the lower bounds are relatively easier to achieve, and one may applies various tools obtain the upper bounds. For example, S. Baluyot and K. Pratt [B&P] were able to applied sieve method to bound the second mollified moment of the quadratic family of Dirichlet -functions of prime moduli from above to show that more than nine percent of the members of do not vanish at the central value. Another powerful method for establishing upper bounds was developed by K. Soundararajan in [Sound2009] with a refinement by A. J. Harper [Harper], which allows one to bound the -function by a very short Dirichlet polynomial over the primes under GRH.
One may also consider different choices of mollifiers, even though the optimal mollifiers are essentially found in many cases (see for example [sound1]). Applying these alternative mollifiers may bypass the difficulty of evaluating the mollified moments using the optimal ones. One systematic way for constructing new mollifiers originates from the study on sharp bounds for the moments of families of -functions in the work of M. Radziwiłł and K. Soundararajan [Radziwill&Sound] and the work of W. Heap and K. Soundararajan [H&Sound]. Compared to the optimal mollifiers used in the study of the non-vanishing issues, these new mollifiers can be thought of as obtained from using the Euler product to approximate the inverses of an -function, while the optimal mollifiers such as the one given in [sound1] are obtained from the consideration of employing Dirichlet series to approximate such an inverse. Thus, though suboptimal, these new mollifiers have the advantages of retaining essentially an Euler product structure, hence much easier to deploy when incorporated in the evaluations of the mollified moments.
Although the new mollifiers are primarily employed to obtain sharp bounds for the moments of families of -functions, there are emerging cases for applying them to study various subjects in number theory. For example, they have been used by S. Lester and M. Radziwiłł [LR21] to study sign changes of Fourier coefficients of half-integral weight modular
forms, by C. David, A. Florea and M. Lalin [DFL21] to establish a positive proportion non-vanishing result of cubic -functions over function field, by M. Radziwiłł and K. Soundararajan [Radziwill&Sound] as well as by H. M. Bui, N. Evans, S. Lester and K. Pratt [BELP] to establish central limit theorem for the central values of -functions, by P. Gao and L. Zhao [G&Zhao10] to establish a positive proportion non-vanishing result of cubic Dirichlet -functions. We point out here the main result of S. Lester and M. Radziwiłł [LR21] essentially relies on evaluations of the first and second mollified moments of quadratic modular -functions and in particular implies a positive proportion non-vanishing result of the corresponding -values.
In view of the above applications of the Euler product-like mollifiers, it is now clear that one may be able to apply them to obtain positive proportion of non-vanishing results on central values of -functions in general, especially when using the optimal mollifiers is beyond the reach. It is the aim of the paper to illustrate this approach by addressing the non-vanishing issue of quadratic twists of modular -functions at the central point. To state our result, we fix a holomorphic Hecke eigenform of weight for the full modular group . We write for so that the Fourier expansion of at infinity is
Here witht and , for all by Deligne’s bound [D], where is the divisor function of . Moreover, let denote the Kronecker symbol. Hence the twisted modular -function for is defined as
Define for and for . Then the function satisfies the functional equation given by
Let be a large number and we reserve the letter for primes throughout the paper. We consider the family . Note that our choice for ensures that the corresponding central -values do not automatically vanish due to the sign of the functional equation. Our main result in this paper establishes that a positive proportion of the members of the above family of -functions do not vanish at the central point.
Theorem 1.1.
Assume the truth of GRH. With the notations above, there exist infinitely many odd primes such that . More precisely, we have
(1.1) |
2. Preliminaries
2.1. Various Sums
We gather a few results concerning sums over primes.
Lemma 2.2.
Let . We have, for some constants ,
(2.1) | ||||
(2.2) |
Also, for any integer , we have
(2.3) |
Let be a primitive Dirichlet character modulo and assume that GRH holds for , we have
(2.4) |
where we define if and otherwise.
Proof.
For any positive odd integer , we write for the Dirichlet character with for . We also define if is a perfect square and otherwise. Let be a smooth, non-negative function compactly supported on satisfying for . We denote the Mellin transform of by , that is,
We note the following result concerning the smoothed quadratic character sums given in [G&Zhao11, Lemma 2.8].
Lemma 2.3.
Assume the truth of GRH. Let be a positive odd integer and be a smooth function. Then for any ,
2.4. Twisted First Moment
We recall the following approximate functional equation concerning given in [sound1, p. 451].
Lemma 2.5 (Approximate functional equation).
For any odd prime , we have
where for any real number ,
(2.5) |
In the course of proving Theorem 1.1 , we need the following result on the twisted first moment of quadratic twists of .
Proposition 2.6.
Assume the truth of GRH and use the same notations as above. Let be a large real number and a fixed positive odd integer. Further write uniquely as with square-free. We have
(2.6) |
where is an explicit constant and is a multiplicative function such that .
Proof.
The approximate functional equation in Lemma 2.5 gives
Due to the rapid decay of , we arrive at
By (2.4), the -term above is . To deal with the first term on the right-hand side above, we apply Mellin inversion to obtain that
(2.7) |
where
Now repeated integration by parts yields the bound
for any and any integer .
We evaluate the integral in (2.7) by shifting the line of integration to passing a pole at with residue only if is a perfect square. The integration on can be estimated to be , thanks to the rapid decay of on the vertical line and the estimate (see [iwakow, Theorem 5.17]) that under GRH, for ,
To treat the contribution from the poles, we deduce via the expression for in (2.5) that
Note that is a perfect square if and only if is a square multiple of . So we may replace by and the contribution from the poles to is
(2.8) |
To evaluate the last sum above, we recall that the symmetric square -function of is defined for by (see [iwakow, (25.73)])
It follows from a result of G. Shimura [Shimura] that the corresponding completed -function
is entire and satisfies the functional equation . Combining this with [iwakow, (5.8)] and apply the convexity bounds (see [iwakow, Exercise 3, p. 100]) for -functions, we deduce that
(2.9) |
We apply the above notations to write
We then evaluate the integral in (2.8) by moving the contour of integration to , crossing a simple pole at only. The integral on the new line is estimated, using (2.9), to be
The residue of the pole in the above process can be easily computed and this leads to the main term on the right-hand side of (2.6). This completes the proof of the proposition. ∎
2.7. Upper bound for
Although we are primarily interested in in this paper, we include here an upper bound result from [S&Y] on for any odd, square-free integer in terms of a short Dirichlet polynomial over the primes.
Lemma 2.8.
Assume the truth of GRH for and for for a fixed odd, square-free integer . We have for , ,
Proof.
We write where and note that by Deligne’s theorem [D]. Let be the unique positive real number satisfying . We set in [S&Y, (6.1)]. Note that for any integer . This leads to, for ,
(2.10) |
We set and note that the terms with are (see the paragraph below [S&Y, (6.1)]). Moreover,
Hence
(2.11) |
Now
(2.12) |
For the other term on the right-hand side of (2.12),
(2.14) |
Now from (2.13), the last -term above is .
Lastly, we note that
(2.16) |
3. Proof of Theorem 1.1
3.1. Setup
We shall follow the approach of A. J. Harper [Harper] and define for a large number ,
It follows from the above notations and Lemma 2.2 that we have for large enough,
(3.1) |
Also, for and large enough, we have
(3.2) |
For any real numbers with , we denote
(3.3) |
We then define for any real number and any ,
Note that each is a short Dirichlet polynomial of length at most . By taking large enough, we have that
It follows that is also a short Dirichlet polynomial of length at most .
In the sequal, we shall work exclusively with and we remark here that the expression can now be regarded as a mollifier approximating , similar to those constructed in [LR21] and [DFL21].
Now, it is easy to see that in order to prove Theorem 1.1, it suffices to show that, for the function defined in Section 2.4, we have
(3.4) | ||||
(3.5) |
In fact, (3.4) easily implies that
(3.6) |
Thus, if we write the left-hand side expression in (1.1), then (3.5) and (3.6) together with the Cauchy-Schwarz inequality imply that
The assertion of Theorem 1.1 then readily follows from the above estimate together with the observation from (2.4) that as ,
It now remains to prove (3.4) and (3.5). As the proof of (3.4) is similar to that of [G&Zhao8, Proposition 2.1] upon using Proposition 2.6, we devote the remainder of the paper to the proof of (3.5). To that end, we first note the following special case of [S&Y, Theorem 6.1].
Proposition 3.2.
Assume the truth of GRH for , as well as the symmetric square -function . For any real number and any , we have
where denotes the sum over square-free integers.
Now, let
Moreover, we define for ,
Observe that
We use Lemma 2.3 to evaluate the last expression above in a manner similar to the treatments given in the proof of [G&Zhao8, Proposition 2.2] to arrive at
(3.7) |
We then deduce via Hölder’s inequality that
(3.8) |
Similar to the proof of [G&Zhao8, Proposition 2.2], we apply Lemma 2.3 again to see that
(3.9) |
Also, setting and in Proposition 3.2 implies that
(3.10) |
Thus it remains to deal with the case in which . If , we set in (2.10) and
We then deduce from the description on that when ,
We proceed as in the proofs of [G&Zhao8, Proposition 2.2], making use of Lemma 2.3 and (3.2) to arrive at (by noting that )
As the sum of the right side expression above over converges, we see that the above estimation implies (3.5) and this completes the proof of Theorem 1.1.
Acknowledgments. P. G. is supported in part by NSFC grant 11871082 and L. Z. by the Faculty Silverstar Grant PS65447 at the University of New South Wales (UNSW).
References
School of Mathematical Sciences | School of Mathematics and Statistics |
Beihang University | University of New South Wales |
Beijing 100191 China | Sydney NSW 2052 Australia |
Email: [email protected] | Email: [email protected] |