1. Introduction
The authors of [
Reference He, Lee, Oliver and PozdnyakovHLOP22
] were the first to notice the oscillating pattern of the average value of the pth Dirichlet coefficients of fixed rank elliptic curves for a prime p in a fixed conductor range. This kick-started the study of what is now known as ‘murmurations’ of elliptic curves. This pattern was then detected in more general families of arithmetic L-functions, such as those associated to weight k holomorphic modular cusp forms for
$\Gamma_0(N)$
with conductor in a geometric interval range [M, cM] and a fixed root numberFootnote
1
. A. Sutherland also made a striking observation that the average of
$a_f(P)$
over this family for a single prime
$P \sim M$
converges as a continuous looking function of
$P/M$
. More recently, N. Zubrilina established a case of the correlation phenomenon between Fourier coefficients of families of modular forms and their root numbers in [
Reference ZubrilinaZub23
]. The purpose of this article is to extend the main result of Zubrilina to the case of prime power coefficients of modular forms.
The first main result proven by Zubrilina for weight 2 modular forms is the following:
Theorem. Let
$H^{\mathrm{new}}(N)$
be a Hecke basis for trivial character weight 2 cusp new forms for
$\Gamma_0(N)$
with
$f \in H^{\mathrm{new}}(N)$
normalised to have lead coefficient 1. Let
$\epsilon(f)$
be the root number of f, let
$a_f(p)$
be the p-th Fourier coefficient of f, and let
$\lambda_f(p)\;:\!=\;a_f(p)/\sqrt{p}$
. Let X,Y and P be parameters going to infinity with P prime; assume further that
$Y=(1+o(1))X^{1-\delta_2}$
and
$P\ll X^{1+\delta_1}$
for some
$\delta_1, \delta_2 \gt0$
with
$2 \delta_1 \lt \delta_2 \lt 1$
. Let
$y\;:\!=\;P/X$
. Then

where

In particular, for any
$\delta_1 \lt {2}/{9}$
, one can find
$\delta_2$
for which
$\delta' \gt 0$
.
As explained in op. cit. the formula obtained above (referred to as the murmuration density) comes from applying the Eichler–Selberg trace formula to the composition of Hecke and Atkin–Lehner operators. Using this technique allows for interpreting the sum in terms of certain class numbers, the averages of which in short intervals can then be handled via the class number formula.
The main result of this paper is Theorem 8·1 which we record below for the convenience of the reader.
Theorem. Let
$H^{\mathrm{new}}(N)$
be a Hecke basis for trivial character for weight 2 cusp forms for
$\Gamma_0(N)$
with
$f\in H^{\mathrm{new}}(N)$
normalised to have leading coefficient 1. Let
$\epsilon(f)$
be the root number of f and let
$a_f(p)$
be the p-th Fourier coefficient of f, and set
$\lambda_f(p) = {a_f(p)}/{\sqrt{p}}$
. Let P be a prime, and suppose that the parameters P, X and Y go to infinity. Set
$Y= (1+o(1))X^{1-\delta}$
and
$P^2\ll X^{1+\delta_2}$
where
$0\lt\delta_2 \lt \delta \lt {9}/{11}$
and
${\delta}/{9} + {\delta_2}/{2} \lt 1/9$
. Set
$\delta'=\delta_2 - {\delta}/{2}$
. Then for A, B, and C(r) as defined before and writing
$y={P^2}/{X}$
,

Here, the notation
$\sideset{}{'}\sum$
indicates that the sum is over square-free N.
Our key observation is that qualitatively both results are the same. Our approach in proving the result also uses the trace formula (as explained above). However, as we understand it, our result cannot be obtained as a corollary of Zubrilina’s result. While Zubrilina’s result establishes a relation between the P-th Fourier-coefficient of a family of modular forms and their root numbers, our result proves a relation between the
$P^2$
-th Fourier-coefficient of modular forms and their roots number.
1·1. Other results
Our main result mimics [ Reference ZubrilinaZub23 , theorem 1] qualitatively. It is immediate that other results proven in [ Reference ZubrilinaZub23 ] have the obvious analogue in our setting.
We prove our result for weight 2 modular forms but we remark that the result can be proven for any higher weight modular form. We expect similar shape of results if
$P^2$
is replaced by a higher power of P. We refrain from proving the result in more generality to keep the notation less cumbersome. Also, since our result proves that the shape of the average size of the
$P^2$
-coefficients is qualitatively the same shape of the average size of the P-coefficients, the general result on murmuration density can be easily read from [
Reference ZubrilinaZub23
].
It will also be straightforward to extend this idea to the case where P is replaced by products of two (or more) primes. The main difficulty will arise form the fact that the trace formula result mentioned in Theorem 2·1 will have more terms so the calculations will be more tedious.
1·2. Outlook
There are examples where one knows that the murmuration density is qualitatively different, see [ Reference Bober, Booker, Lee and Lowry-DudaBBLL23 ]. For this family, the answer is given in terms of a measure and turns out to be exactly identical (up to constants) to the case of Maass forms (we learned this from personal communication with Zubrilina).
One question of potential interest is what feature of the family determines the qualitative shape of the answer. Given the philosophical connection to one-level density, a naïve guess at an answer would be the symmetry type of the family, but this requires further investigation. At the moment no ansatz to address this question in some general framework is known but examples could provide evidence for the above guess.
It might be interesting to understand the murmurations for the family of symmetric squares of modular forms. Note that for the L-function
$L(s, \operatorname{sym}^2 f)$
, the root number is always +1 and conductor is
$N^2$
(rather than N). Since this is a symplectic family, we expect the murmuration function to reflect a different transition in the one-level density. The numerical work of Sutherland also suggests that we expect degree 3 L-functions to have a different normalization, as in they appear most regular as a function of
$({P}/{N})^{1/3}$
. Studying the case of symmetric squares will be more delicate.
1·3. Organisation
Including the introduction, this paper has seven sections. In Section 2 we describe the set-up of the main problem and state our main results. For the purpose of our calculations, we need to analyse two main terms, this is done is Sections 3 and Section 5. The calculation for the remainder term(s) is carried out in Section 4. Finally, in Section 6 we handle the terms which are outside the the range of terms addressed in earlier sections, those involving levels N when
$P\mid N$
, and those involving the P term in the trace formula. Section 7 is dedicated to recording technical lemmas involving arithmetic functions.
2. Trace formula set-up
2·1. Set-up
Fix a square-free positive integer N. Set
$H^{\mathrm{new}}(N)$
to denote a basis of the space
$S^{\mathrm{new}}(N)$
of weight 2 Hecke cusp newforms for
$\Gamma_0(N)$
, and let
$a_f(P) = \lambda_f(P)\sqrt{P}$
denote the eigenvalue under the P-th Hecke operator
$T_p$
of
$f \in H^{\mathrm{new}}(N)$
. Let
$\epsilon(f)$
denote the root number of f and recall that
$-\epsilon(f)$
is equal to the eigenvalue of f under the Atkin–Lehner involution
$W_N$
.
In contrast to previous considerations of murmuration behaviour we are interested in the Fourier-coefficient
$\lambda_f(P^2)$
. When
$P\nmid N$
, we know that

Consider the operator
$(\!-\!1)T_{P^2}\circ W_N$
on
$S^{\mathrm{new}}(N)$
; its trace is

More generally, if we consider
$P^k$
Fourier coefficients, we apply the operator
$(\!-\!1)T_{P^k} \circ W_N$
on
$S^{\mathrm{new}}(N)$
and its trace is

On the other hand, when
$P\mid N$
, we have the equality

Recall that
$a_f(P)=\pm1$
so, for
$\nu$
even we have

In particular, when
$\nu'=1$
, we have
$\lambda_f(P^2) = {1}/{P}$
.
2·2. Trace formula
We record a result of Skoruppa–Zagier [ Reference Skoruppa and ZagierSZ88 , section 2] that will be useful for us. The following result is a special case of the formula in equation (7) of op. cit. The result there is more general but since we restrict ourselves to N square-free, the expression simplifies in our setting to the following
Theorem 2·1. With notation introduced above, in the case that
$P\nmid N$
for P-power coefficients

In particular, when
$k=2$

Remark 2·2. In the notation of [
Reference Skoruppa and ZagierSZ88
], the quantity
$n_1$
takes the value N and
$n_2 =1$
. A priori, the second term should have a coefficient
$U_0(r\sqrt{N}/2P^{k/2})$
but we note that
$U_0(x)=1$
. The final term in the expression is
$\sigma_1(P^{k}) = \sum_{d\mid P^{k}} d = 1 + P + P^2 + \cdots + P^k$
.
In the above formula, the Hurwitz class number
$H_1(\!-\!d)$
is the number of equivalence classes with respect to
$\mathrm{SL}_2(\mathbb{Z})$
of positive-definite binary quadratic forms of discriminant
$-d$
weighed by the number of automorphisms (i.e., with forms corresponding to multiples of
$x^2 +y^2$
and
$x^2 +xy+y^2$
counted with multiplicities
${1}/{2}$
and
${1}/{3}$
, accordingly). In other words,
$H_1$
can be expressed in terms of the (Gauss) class number h via:

with the error term disappearing if d is not of the form 3 or 4 times a square.
Using the relationship between the Hurwitz class number
$H_1(\,\!\cdot\!\,)$
and class number
$h(\,\!\cdot\!\,)$
explained above, we see that

Throughout this paper we assume that
$P\neq 2$
. Since we assume that
$\gcd(P,N)=1$
and that N is square-free, the square factors of
$4P^{k}N$
are
$1, 4, P^2, 4P^2, \ldots, P^{\lfloor k/2 \rfloor}, 4P^{\lfloor k/2 \rfloor}$
. The above expression simplifies to the following formula when
$k=2$
(which is what is required for our main result)

If q is any prime and
$r\geq 1$
, we note that
$q^2\mid N(r^2 N -4P^{k})$
is satisfied if
$q^2\mid (r^2 N -4P^{k})$
or if
$q\mid N$
and
$q\mid 4P^{k}$
. The latter condition is satisfied precisely when
$q=2$
(i.e., N is even). Writing
$N=2N'$
(where N
′ must now be odd), if
$4d^2 \mid (r^2 N^2 -4P^{k}N)$
, we can note that

is not a square modulo 4 and the corresponding class number vanishes. Indeed, we remind the reader that Dirchlet’s class number formula
$h(\!-\!d)$
is defined for fundamental discriminants; in particular,
$h(\!-\!d)$
is defined to be 0 otherwise. It will therefore be enough to consider those square-divisors which satisfy
$d^2\mid (r^2N - 4P^{k})$
. In the general case, the trace formula becomes

When
$k=2$
the trace formula further simplifies to

3. Main term calculation via averages of class numbers I
The aim of this section is to estimate the Hurwitz class number
$H_1(\!-\!4P^2N)$
which (as we have noted above) can be written as a sum of four class numbers.
Recall that if
$-d\equiv 0 \text{ or }1\pmod{4}$
then the class number can be written in terms of a special value of an L-function. More precisely,

where
$\chi_d$
is the quadratic Dirichlet character of modulus d or 4d which can be calculated explicitly via the Kronecker symbol and
$L(1, \chi_d)$
is the value at 1 of the Dirichlet series for the Kronecker symbol
$( {d}/{\cdot})$
. The calculation in this section will be separated into two cases, first when
$-d\equiv 1\pmod{4}$
and second when
$-d\equiv 0\pmod{4}$
. The first calculation will allow us to estimate averages of
$h(\!-\!P^2N)$
and
$h(\!-\!N)$
and the second will allow us to estimate averages of
$h(\!-\!4P^2N)$
and
$h(\!-\!4N)$
.
When
$\chi$
is a non-principal Dirichlet character of modulus d, for a truncation parameter T we know

The main result we want to prove in this section is an analogue of [ Reference ZubrilinaZub23 , proposition 3·1].
Proposition 3·1. Let
$P\neq 2$
be a prime and let
$[X,X+Y]$
be an interval of length
$Y=o(X)$
. Then as
$X\rightarrow \infty$
,

Here the error term
$\rightarrow 0$
as
$P,X\rightarrow\infty$
and
$Y=o({X}/{\log(P^2 X)})$
. The notation
$\sideset{}{'}\sum$
means that we are summing over all square-free N.
Proof. We prove that for a cut-off parameter T

Choosing
$T = {(PY)^{{5}/{6} - \epsilon}}/{X^{{1}/{12}}}$
, the right-hand side of the above expression becomes

and the result follows.
3·1. When
$-d \equiv 1\pmod{4}$
Throughout this section
$P\neq 2$
and
$[X, X+Y]$
is an interval of length
$Y=o(X)$
. We provide the following estimate for the first two terms in Proposition 3·1.

Here, the main term contribution is from the estimates in Lemma 3·2. The leading term of the expression in Lemma 3·3 contributes
${1}/{\sqrt{X}}$
to the error term of this summation and subsumes the error term
${1}/{P\sqrt{X}}$
arising in Lemma 3·2.
3·1·1. Averages of
$h(\!-\!P^2N)$
Lemma 3·2. With notation as introduced above,

The first step is to obtain an expression for
$({\zeta(2)\pi}/{XY})\sum h(\!-\!P^2N)$
in terms of a cut-off parameter T where the sum runs over square-free
$N \in [X, X+Y]$
such that
$P\nmid N$
. To ensure that the error-term is smaller than the main term, we choose the cut-off parameter appropriately. The proof of the lemma occupies the remainder of this section.
Proof. We calculate the averages in intervals using the class number formula, i.e.,

where to show the second equality we use the fact that
$\chi_{-P^2N}$
is always a non-principal character when N is square-free and
$P\nmid N$
.
Next, we calculate the two (double) sums appearing in the above expression separately. Note that the first sum contains principal characters.

by Lemma 7·1 where
$A\;:\!=\; \prod_{p}(1 + {p}/{(p+1)^2 (p-1)} )$
. Here,
$\chi_1$
and
$\chi_2$
are characters modulo 4, and
$\chi_1$
is principal. The character
$({N}/{m^2})\chi_1(N)$
is principal modulo 2m whereas,
$({N}/{m^2})\chi_2(N)$
is always non-principal modulo 4m. Note that for the second last equality we use [
Reference ZubrilinaZub23
, lemma 6·7]. Next we calculate the non-square term in a manner identical to the one above.

Since N is not a square, note that
$({N}/{n})$
is non-principal. Since
$({N}/{2})$
is primitive modulo 8, the characters
$({N}/{n})\chi_1(N)$
and
$({N}/{n})\chi_2(N)$
are non-principal. For the last equality, we use [
Reference ZubrilinaZub23
, lemma 6·7].
In conclusion we obtain that for a truncation parameter T,

Choosing
$T = {(PY)^{{5}/{6}}}/{X^{{1}/{12}}}$
, completes the proof of the lemma.
3·1·2. Averages of
$h(\!-\!N)$
Lemma 3·3. With notation as before

Proof. We begin by calculating the average

where to show the second equality we use the fact that
$\chi_{-N}$
is always a non-principal character when N is square-free. We proceed as before to obtain the estimates. First we work with the square terms

Here,
$\chi_1$
and
$\chi_2$
are characters modulo 4, and
$\chi_1$
is principal. The character
$({N}/{m^2})\chi_1(N)$
is principal modulo 2m whereas,
$({N}/{m^2})\chi_2(N)$
is non-principal modulo 4m. For the third equality we use [
Reference ZubrilinaZub23
, lemma 6·7]. Next we calculate the non-square terms.

We remind the reader that since n is not a square, we have that
$({N}/{n})$
is non-principal. Also, we know that
$({N}/{2})$
is primitive modulo 8. Therefore, the characters
$({N}/{n})\chi_1(N)$
and
$({N}/{n})\chi_2(N)$
are both non-principal. We apply [
Reference ZubrilinaZub23
, lemma 6·7] to obtain the last equality.
In conclusion we obtain that for a truncation parameter T, we have

As in Section 3·1·1, we choose
$T = {(PY)^{\frac{5}{6}}}/{X^{{1}/{12}}}$
to obtain the expression in the statement of the lemma.
3·2. When
$d \equiv 0\pmod{4}$
As before, we assume that
$P\neq 2$
and that
$[X, X+Y]$
is an interval of length
$Y=o(X)$
. The calculations in Lemmas 3·4 and 3·5 will account for the last two terms in Proposition 3·1. More precisely,

3·2·1. Averages of
$h(\!-\!4P^2N)$
Lemma 3·4. With notation as above

Proof. As we have done previously, consider

As before, we estimate the two double sums separately. First we consider the square terms

The second last equality follows from [ Reference ZubrilinaZub23 , lemma 6·7]. Next we estimate the other double sum to obtain

For a truncation parameter T, we have

The lemma follows by choosing
$T={(PY)^{{5}/{6}}}/{X^{{1}/{12}}}$
.
3·2·2. Averages of
$h(\!-\!4N)$
Lemma 3·5. With notation as before,

Proof. The idea of the proof is exactly the same as before.

For the first double sum which are the ‘square terms’, we obtain the following expression where we note that the sum is over all m that is odd

The second double sum which are the ‘non-square’ terms can be estimated as before and we obtain

Therefore,

The result follows from choosing
$T = (PY)^{{5}/{6}}/{X^{{1}/{12}}}$
.
Remark 3·6. The main term contribution obtained from calculations in this section would remain unchanged if we worked with P-power coefficients rather than
$P^2$
-coefficients.
4. Remainder analysis
In this section, we work under the assumption that
$P\neq 2$
is a prime, r is a positive integer, and
$X\gt Y\gt0$
satisfies
$r^2(X+Y)\lt 4P^2$
. Given positive integers r and d, define the set

First, we calculate the size of the above set. We do so by breaking the calculation into several cases:
-
(r odd) Assume that r is odd. Then
$r^2N-4P^2$ is not divisible by 4 as N is square-free. Thus, any divisor d satisfying
$d^2\mid (r^2N-4P^2)$ has to be odd as well.
Observe that,
\[ r^2 N^2 - 4P^2 N\equiv 0 \text{ or } 1\pmod 4. \]
\[ r^2N\equiv 4P^2\pmod{d^2}. \]
$\gcd(d,r)=\gcd(d,2)=1$ and no solutions otherwise.
-
(r even) Assume that r is even.
Claim.
$\gcd(P,d)=\gcd(P,r)=1$ .
Justification. By definition
$r^2N\le 4P^2$ . As
$N\ge X\gt4$ , we deduce that
$r\lt P$ . If
$P\mid d$ , we obtain that
$P^2\mid r^2N$ . As N is square-free, this implies
$P\mid r$ which is impossible. This proves the claim.
Let us write
$r=2\ell$ . The condition
\[ \frac{r^2N^2-4P^2N}{d^2}\equiv 0\text{ or }1\pmod{4} \]
$4\ell^2 N - 4P^2=kd^2$ and
$kN\equiv 0 \text{ or } 1\pmod {4}$ . This calculation can be further divided into two cases.
-
(d odd) If d is odd, then
$4\mid k$ . Let
$k=4k'$ . Thus, we look for an N that satisfies
\[ \ell^2 N - P^2=k'd^2 \]
$\ell^2N\equiv P^2 \pmod{d^2}$ . This congruence has exactly one solution if
$\gcd(\ell,d)=1$ and zero solutions otherwise.
-
(d even) Assume that
$d=2b$ is even. As N is square-free it is either odd or congruent to 2 modulo 4.
If N is even, then
$4\ell^2N$ and
$4kb^2$ have to be divisible by 8; but
$8 \nmid 4P^2$ .
So N must be odd if d is even. As
$kN\equiv 0 \text{ or }1\pmod{4}$ we will distinguish two more cases
-
(4 | k) In this situation we try to solve
\[ \ell^2 N - P^2\equiv 0\mod {4b^2}. \]
$\ell$ is coprime to 2b and no solutions otherwise.
-
(4
k) We now consider the case that
$N\equiv k^{-1}\equiv k\pmod 4$ . Writing
$k=N+4k'$ we obtain
\[ \ell^2N-P^2=Nb^2 + 4k'b^2. \]
$N(\ell^2-b^2)\equiv P^2 \pmod{4b^2}$ . This congruence has a solution if
$\ell$ and b are coprime and exactly one of them is even. In all other cases there are no solutions.
In summary we obtain that

where

All pairs (r, d) for which
$\mathcal{R}_{r,d} \neq \emptyset$
will henceforth be called an admissible pair. The two elements in the fourth point appear as we get one solution in case (r even)–(d even)–(
$4 \mid k$
) and one solution for the case (r even)–(d even)–(
$4 \nmid k$
).
5. Main term calculation via averages of class numbers II
Throughout this section we assume that
$P^2\ll X^{1+\delta_2}$
.
For N a square-free positive integer and P a prime satisfying
$\gcd(P,N)=1$
, the goal of this section is to calculate
$\sum H_1(r^2N^2 - 4P^2N)$
with the sum of running over
$0\lt r\leq 2P/\sqrt{X+Y}$
. As observed before, the summation can be expressed as a double sum of class numbers which in turn can be written explicitly in terms of special values of L-functions. More precisely, for a divisor
$d^2\mid (r^2 N - 4P^2)$
satisfying
$({r^2 N^2 - 4P^2 N})/{d^2} \equiv 0 \text{ or }1\pmod{4}$
, the class number formula asserts that

Therefore, as r varies in the range 1 to
$ 2P/\sqrt{X+Y}$
, we have

Note that

For a non-trivial character
$\chi$
of conductor q, we know by Siegel’s bound that
$|{L(1, \chi)}| \ll \log(q)$
(see for example [
Reference Friedlander and IwaniecFI18
, p. 2]). Therefore,

We now truncate the main term and obtain

where

The last equality follows from the fact that
$\mu^2(N)=1$
. Indeed,
$N\in \mathcal{A}_{r,d}$
forces N to be always square-free. We can now state the main result of this section; its proof will occupy the remainder of this section.
Proposition 5·1. Let
$P\neq 2$
be a prime, let r be a positive integer, and let
$X\gt Y\gt0$
be such that
$4P^2 \gt r^2(X+Y)$
. Then

Proof. In Proposition 5·6 we show that

The simplified expression of (5·1) combined with the aforementioned proposition implies that

Now, by choosing
$T = (P^2XY)^{\frac25}$
gives an error term of

Corollary 5·2. Let
$P\neq 2$
be a prime, let r be a positive integer, and let
$X\gt Y\gt0$
be such that
$4P^2 \gt r^2(X+Y)$
for each
$r\lt{2P}/{\sqrt{X}}$
. Then

Proof. The claim follows easily by rearranging the terms in Proposition 5·1 and summing over r.
Comparing the conditions from each of the error terms, we see that the most restrictive one arises from the last term. It yields the relation
${\delta_2}/{2}+ {\delta}/{9} \lt {1}/9$
. So a strict condition would be to chooseFootnote
2
$\delta_2 \lt \delta \lt {2}/{11}$
. A more relaxed bound on
$\delta$
is mentioned in the statement of the main theorem.
The main task is now to estimate
$S_{n,d,r}$
.
5·1. Some preliminary calculations
Let a be an integer such that
$a\pmod{d^2}\in \mathcal{R}_{r,d}$
. The character
$({(r^2x-4P^2)/d^2})/{n}$
is a character modulo
$fnd^2$
where
$f=4$
if n is even and
$f=1$
otherwise. Thus, we have

Note that
$P^2\gt{X}/{4}$
and throughout our calculations we also have that
$P\gt({d}/{2})$
. If
$\gcd(P,fnd^2)\gt 1$
, then
$P\mid n$
and
$({N}/{n})=0$
for all N satisfying
$P\mid N$
. If
$\gcd(P,fnd^2)=1$
, then the number of elements in
$[X,X+Y]$
that are divisible by P and congruent to
$b\pmod{fnd^2}$
are
$O({X}/{fd^2nP})$
. Thus, deleting the condition
$P\nmid N$
in the inner sum gives

Now using a result of C. Hooley (see also [ Reference ZubrilinaZub23 , lemma 6·4]) the above expression can be rewritten as

Definition 5·3. Define the functions

Lemma 5·4. Let
$g=(d^\infty, n)$
and set
$n'=n/g$
. Then

Proof. Assume first that
$f\mid d^2$
(i.e either
$f=1$
or d is even). Then
$(d^\infty,fn)=fg$
and moreover,
$2\mid g$
if
$f=4$
. Here, we recall that
$f=4$
precisely when n is even.

If
$f=1$
, this is the desired result. If
$f=4$
, then g and d are even and
$\widetilde{\varphi}_{r,d}(fg)=f\widetilde{\varphi}_{r,d}(g)$
.
It remains to consider the case that n is even and d is odd.

As n
′ and f are even in this case, we obtain
$\theta_r(fn')=f\theta_r(n')$
finishing the proof.
Lemma 5·5. Let (r, d) be an admissible pair. Then

Let p be a prime coprime to P. The function
$\theta_r$
is a multiplicative function satisfying

Proof. The definition of the functions
$\theta$
and
$\varphi$
differ from the ones given in [
Reference ZubrilinaZub23
]. Nevertheless, the proofs of Lemmas 6·2 and 6·3 in loc. cit. still apply with minimal changes (substitute P by
$P^2$
).
In nutshell, the calculation we have done so far yields

This is an approximation of
$S_{n,d,r}$
in terms of multiplicative functions which are easier to manipulate. In the remainder of this section we will prove the following result.
Proposition 5·6. Let d and r be positive integers and let
$X\gt Y\gt0$
. Let P be a prime satisfying
$4P^2 \gt r^2(X+Y)$
. Then for a cut-off parameter
$T\gg Y$

5·2. Small d and small n
In this section, we estimate the sum of
${S_{n,d,r}}/{nd}$
in the range
$n\leq Y^\sigma$
and
$d\leq Y^\tau$
(where
$\sigma, \tau$
are parameters in the interval [0,1]) by explicitly examining equidistribution of square-free numbers in residue classes modulo n.
Lemma 5·7. Let
$\sigma, \tau$
be parameters with
$0\leq \sigma,\tau \leq 1$
. Let
$d,n,r\geq 1$
be integers.

Proof. The proof follows as in [ Reference ZubrilinaZub23 , lemma 6·6]. Note that we can apply the computations in loc. cit. because of Lemma 5·5.
For the ease of notation, set

Proposition 5·8. Let
$\sigma, \tau$
be parameters with
$0\leq \sigma,\tau \leq 1$
. Let
$d,n, r\geq 1$
be integers such that
$P\nmid n$
,
$4P^2 \gt r^2(X+Y)$
, and (r,d) is an admissible pair. Then

Proof. With notation introduced above, we have

Recall that
$P^2 \gt {X}/{4}$
. Equivalently, we have that
${X}/{P} \lt 2\sqrt{X}$
. The claim follows immediately.
5·3. Small d and large n
The main result of this section is the following. The proof of [ Reference ZubrilinaZub23 , proposition 3·9] goes through almost verbatim even in our setting. We give a sketch of the proof to show that the shape of the error term is the same.
Proposition 5·9. Let P be an odd prime and d,r be positive integers such that (d,r) is an admissible pair. Let
$X\gt Y\gt0$
satisfying
$(X+Y)^2 \lt 4P^2$
. For parameters
$\sigma, \tau$
between 0 and 1,

Lemma 5·10 ([
Reference ZubrilinaZub23
, lemma 3·12]). Let
$Y\leq X$
, let n,w, D be positive integers and q be any integer. Let a be an integer satisfying
$wa \equiv q\pmod{D}$
and
$\gcd(a,D)=1$
. Define the set

Then

Proof of Proposition
5·9. Choose
$w=r^2$
,
$D=d^2$
,
$q=4P^2$
in the above lemma, and choose a to be an integer such that
$a\pmod{d^2}\in \mathcal{R}_{r,d}$
. If
$Y\leq X$
, (d, r) is an admissible pair of positive integers, n is any positive integer, and P is a prime satisfying
$4P^2 \gt r^2(X+Y)$
then the set

This is precisely the set
$\mathcal{P}_n$
in [
Reference ZubrilinaZub23
, corollary 3·13]. Thus, the calculations in [
Reference ZubrilinaZub23
, proof of proposition 3·9] go through without change. We explain some of the calculations in more detail than in [
Reference ZubrilinaZub23
]

Hence,

We write
$n=x^2 y 2^\alpha P^\beta$
, where y is square-free and
$\gcd(x,2P)=\gcd(y,2P)=1$
. Therefore
$\mathcal{P} = \{ p \ : \ p\mid y\}$
. We now focus on the second term of the expression

Next, we focus on the third term.

Putting this together we get that as
$X\rightarrow \infty$
,

5·4. Large d and error terms
The first main task of this section is to estimate the sum
${S_{n,d,r}}/{nd}$
over all n when
$d \gg Y^\tau$
. We will observe that this also contributes (only) to the error term.
For
$Y^\tau \ll d \ll P$
and truncation parameter T, we have that

We obtain the second line by the trivial inequality
$\mu(N)^2({N}/{n})(({(r^2N-4P^2)/d^2})/{n})\le 1 $
. The term
$(({Y}/{d^2})+1)$
comes from the sum over N.
We now collect all the error terms. The cumulative error terms from Propositions 5·8 and 5·9, and the above calculations is

Throughout this section we are assuming that
$P^2 \ll X^{1+\delta_2}$
where
$\delta_2$
is chosen as in the statement of the main theorem. In particular, we may always choose
$\delta_2 \lt {2}/{11}$
. Therefore, we may assume that
$P^\epsilon \ll \sqrt{X}$
and choose the cut-off parameter
$T\gg Y$
, we can rewrite the cumulative error term as

Choosing
$\tau = {1}/{18}$
,
$\sigma={5}/{9}$
and assuming that
$\log( T) \ll Y$
, the above expression is bounded by

Remark 5·11. The calculations in this section rely crucially on the fact that we are working with
$P^2$
-coefficients. If we were to work with higher P-power coefficients, there would be many more terms to analyse which would make the calculations more cumbersome. However, we expect that the shape of the contribution would remain unchanged.
6. The remaining terms
To complete the proof of the main theorem, we are still left to bound the following terms:
-
(1) those in the range of r not covered in Corollary 5·2;
-
(2) those involving levels N when
$P\mid N$ ;
-
(3) those involving the P term in the trace formula.
First, we evaluate

This follows from the assumptions that
$Y=(1+o(1))X^{1-\delta}$
, that
$P^2\ll X^{1+\delta_2}$
, and that
$P^\epsilon \ll \sqrt{X}$
. Since the main term is
${P}/{\sqrt{X}}$
which is of size
$X^{\frac{\delta_2}{2}}$
, it follows that we require
$\delta_2\lt\delta$
.
When
$P\mid N$
, we have noted before that

In other words, at the ramified primes P, we notice that using the trivial bound

Finally, note that

7. Arithmetic functions
The purpose of this section is to record technical results required in the calculations performed above.
Lemma 7·1. Let P be an odd prime and K be a cut-off parameter. Define

Then:





Proof. We leave the proof as an exercise. A useful observation for these calculations is the following:

Note that (7·4) and (7·5) are already stated in [ Reference ZubrilinaZub23 , lemma 6·5].
8. Main result and proof
The main result we prove in this paper is the following
Theorem 8·1. Let
$H^{\mathrm{new}}(N)$
be a Hecke basis for trivial character for weight 2 cusp forms for
$\Gamma_0(N)$
with
$f\in H^{\mathrm{new}}(N)$
normalised to have leading coefficient 1. Let
$\epsilon(f)$
be the root number of f and let
$a_f(p)$
be the p-th Fourier coefficient of f, and set
$\lambda_f(p) = {a_f(p)}/{\sqrt{p}}$
. Let P be a prime, and suppose that the parameters P, X, and Y go to infinity. Further suppose that
$Y= (1+o(1))X^{1-\delta}$
and
$P^2\ll X^{1+\delta_2}$
where
$0\lt\delta_2 \lt \delta \lt {9}/{11}$
and
${\delta}/{9} + {\delta_2}/{2} \lt {1}/9$
. Set
$\delta'=\delta_2 - {\delta}/{2}$
. Then writing
$y={P^2}/{X}$
,

Proof. In [ Reference ZubrilinaZub23 , section 3·4], it is proven that for N square-free

Set
$y={P^2}/{X}$
. It will follow from Proposition 3·1, Corollary 5·2 and calculations in Section 6 that

The error terms in Proposition 3·1, Corollary 5·2, and the calculations in Section 6 gives that the cumulative error term is of size
$O\left(X^{\delta'+\epsilon}+{1}/{P}\right)$
where
$\delta'=\delta_2-{\delta}/{2}$
and we have used the fact that
$\delta_2\lt\delta\lt{2}/{11}$
and
$\delta_2+9\delta\lt2$
.
Acknowledgements
DK thanks Nina Zubrilina for her wonderful talk at UTRGV on this topic. We are grateful to the referee for their constructive feedback which helped improve the exposition of this paper.