Non-Random Behaviour in Sums of Modular Symbols
Alexander Cowan

TL;DR
This paper derives explicit formulas for Fourier coefficients of Eisenstein series twisted by Dirichlet characters and modular symbols, revealing unexpected non-random patterns in sums of modular symbols.
Contribution
It provides explicit spectral decompositions and evaluates sums of modular symbols, uncovering deviations from expected random cancellation phenomena.
Findings
Less cancellation than expected in certain sums
More cancellation observed in other sums
Explicit formulas for Fourier coefficients of Eisenstein series
Abstract
We give explicit expressions for the Fourier coefficients of Eisenstein series twisted by Dirichlet characters and modular symbols on in the case where is prime and equal to the conductor of the Dirichlet character. We obtain these expressions by computing the spectral decomposition of automorphic functions closely related to these Eisenstein series. As an application, we then evaluate certain sums of modular symbols in a way which parallels past work of Goldfeld, O'Sullivan, Petridis, and Risager. In one case we find less cancellation in this sum than would be predicted by the common phenomenon of ``square root cancellation'', while in another case we find more cancellation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Algebra and Geometry · Advanced Mathematical Identities
Non-Random Behaviour in Sums of Modular Symbols
Alex Cowan
Abstract
We give explicit expressions for the Fourier coefficients of Eisenstein series twisted by Dirichlet characters and modular symbols on in the case where is prime and equal to the conductor of the Dirichlet character. We obtain these expressions by computing the spectral decomposition of automorphic functions closely related to these Eisenstein series. As an application, we then evaluate certain sums of modular symbols in a way which parallels past work of Goldfeld, O’Sullivan, Petridis, and Risager. In one case we find less cancellation in this sum than would be predicted by the common phenomenon of “square root cancellation”, while in another case we find more cancellation.
1 Introduction
Let be a prime, and let be a cusp form of weight and level with Fourier coefficients . For , define the modular symbol
[TABLE]
Modular symbols have been very useful tools historically and are of significant interest in their own right. Merel in [13], for instance, used modular symbols extensively in his proof that the number of torsion points on an elliptic curve over an arbitrary number field is bounded, and that the bound depends only on the degree of the number field. Another important use of modular symbols is in Cremona’s algorithms for elliptic curves [2], which he used to generate parts of the incredibly useful LMFDB [19]. These algorithms rely on the duality between cusp forms and modular symbols and the resulting action of the Hecke operators on modular symbols, and the information about elliptic curves he derives is obtained by examining the corresponding spaces of modular symbols.
There has also been considerable interest in statistical questions regarding modular symbols because they are connected to central values of -functions. Let be a Dirichlet character of conductor , and define for via the series
[TABLE]
This function has an analytic continuation to all of . The “central value” contains a large amount of arithmetic information about . The value of can be given in terms of a finite sum of modular symbols when is primitive:
[TABLE]
where is the sign of and is the Gauss sum [18]. The matrices that appear in this formula are not necessarily in , but nevertheless they are defined via the same expression as before. Based on this formula, Mazur and Rubin [12] recently made conjectures about the distribution of modular symbols symbols, partially in an attempt to draw a connection to conjectures about ranks of twisted elliptic curves by David, Fearnley, and Kisilevsky [3]. An average version of one of their conjectures was proven by Petridis and Risager in [18], and the full conjecture was proven by Diamantis, Hoffstein, Kiral, and Lee [4].
Modular symbols are often studied for their own sake as well, especially from a statistical perspective. For , define , where and are the lower-left and lower-right entries of respectively. Goldfeld [6] conjectured that
[TABLE]
This was proved by Goldfeld and O’Sullivan in [8].
Petridis and Risager then show in [16] that modular symbols are normally distributed when ordered by for any fixed in the complex upper half-plane. To prove this result, Petridis and Risager study the properties of an Eisenstein series twisted by modular symbols, which was first defined by Goldfeld in [6]. This Eisenstein series is defined as
[TABLE]
where .
The Eisenstein series is not automorphic, but does satisfy a certain cocycle relation and can be related to automorphic functions in a simple way. This has led to several papers dedicated entirely to the study of . Particularly, O’Sullivan in [15] proves that this function has various nice properties such as an analytic continuation and a functional equation, and proves many things about the form of its Fourier expansion. Petridis in [17] studies the poles and residues of this Eisenstein series.
This paper is focused on the case where has conductor , the level of . In the literature it is usually assumed that the conductor of is coprime to . The techniques used in each case are quite different; surprisingly, the approach presented here fails completely if the conductor of is not exactly . The objects used to obtain the results in this paper can still be defined when the conductor of is different from but it seems unlikely that they will have any reasonable properties.
We prove the following theorem:
Theorem 1.1**.**
Let be a prime, let be an even character of conductor , and let be a cusp form of weight for . Let be a complex number with positive imaginary part. If is complex, then
[TABLE]
while if is real, then
[TABLE]
The error term in this theorem can be made completely explicit, and we omit it only for brevity. The secondary error term is of size .
To prove theorem 1.1, we first compute the Fourier coefficients of in very explicit terms via Selberg spectral decomposition. This is done in section 2, and yields the following two theorems, which may also be of interest in their own right:
Theorem 1.3**.**
Let be a prime, let be an even character of conductor , and let be a cusp form of weight for . Then the constant term of the Fourier expansion for is given by
[TABLE]
Theorem 1.4**.**
Let be a prime, let be an even character of conductor , and let be a cusp form of weight for . Then, for , the term of the Fourier expansion for is given by
[TABLE]
Theorem 1.3 was derived in recent work of Bruggeman and Diamantis [1]. They also give an expression for the higher Fourier coefficients of these Eisenstein series, but in terms of a shifted convolution sum involving the Fourier coefficients of and the sum of divisors function , and this leads to different applications.
Theorems 1.3 and 1.4 make calculations with straightforward. Using standard techniques we then prove theorem 1.1 in section 3.
As another application of theorems 1.3 and 1.4, we evaluate certain Kloosterman sums involving modular symbols. The Fourier coefficients of the classical Eisenstein series
[TABLE]
are often expressed in terms of the Kloosterman sums
[TABLE]
Similarly, the Fourier coefficients of the Eisenstein series twisted by modular symbols can be given in terms of Kloosterman sums twisted by modular symbols [15]:
[TABLE]
where
[TABLE]
The Kloosterman sums involved in the classical case can be evaluated, but no evaluation of the Kloosterman sums involving modular symbols above has appeared in the literature. By comparison with theorems 1.3 and 1.4, we now obtain closed form expressions for these sums:
Corollary 1.5**.**
Let be a prime, let be an even character of conductor , and let be a cusp form of weight for . Then the Kloosterman sums appearing above are given by
[TABLE]
and, for
[TABLE]
As a straightforward consequence of corollary 1.5, we can prove the following statement, which parallels theorem 1.1:
Theorem 1.6**.**
Let be a prime, let be an even character of conductor , and let be a cusp form of weight for . Then
[TABLE]
where denotes the lower left entry of .
Recent work of Nordentoft [14] gives more general results of this type using techniques similar to those used by Petridis and Risager in [18].
In the initial work of Goldfeld [6], as well as the subsequent work of O’Sullivan [15] and Petridis and Risager [16], statistics of modular symbols were considered with the ordering
[TABLE]
More recently, however, Mazur and Rubin [12] have suggested studying the statistics of modular symbols using the ordering
[TABLE]
and much of the recent work on statistics of modular symbols, such as that of Petridis and Risager [18], Diamantis, Hoffstein, Kiral, and Lee [4], and Nordentoft [14], uses this ordering instead. We will refer to these orderings as the geometric and arithmetic orderings of modular symbols respectively.
In theorem 1.1, the geometric ordering is used, and, assuming the Riemann hypothesis for Dirichlet -functions and that there is no “coordination” between the zeros of causing additional cancellation as described above, this geometric ordering leads to a twisted sum of modular symbols having size roughly . In theorem 1.6, however, the arithmetic ordering is used, and the resulting twisted sum of modular symbols has size roughly . In neither case do we observe “square root cancellation”, which would yield sums of size . It is noteworthy, however, that real characters specifically do exhibit square root cancellation under the geometric ordering of theorem 1.1.
The phenomenon of square root cancellation arises when random variables are summed in a broad (but not completely universal) sense. Sums in number theory are not over random variables, but square root cancellation is nevertheless observed frequently, because in many situations a sum is over a collection of arithmetic objects ordered in a certain way, and the quantity being summed is unrelated to that ordering. For example, letting denote the Möbius function, the Riemann hypothesis is equivalent to the statement
[TABLE]
for all . If one were to sum random variables which are half the time and half the time, then one would obtain the same result, so the statement above can be viewed as behaving randomly when its integer arguments are ordered by absolute value, or that there is no correlation between the absolute value of an integer and the parity of the number of factors it has. From this perspective, theorems 1.1 and 1.6 are statements that twisted sums of modular symbols behave non-randomly when the modular symbols are ordered using either the geometric ordering or the arithmetic ordering.
Acknowledgments
This work was done as part of my PhD thesis under the guidance of Dorian Goldfeld. Dorian was a phenomenal advisor to me, and I am extremely thankful to him for being patient, insightful, and, above all, supportive. I would also like to thank Asbjørn Nordentoft for sharing his expertise with me on numerous occasions and making many helpful comments and suggestions for this paper.
2 Spectral decomposition
Define . The approach is to introduce the function , defined as
[TABLE]
It’s easily verified that and . Moreover is for ([18] 3).
We give a Fourier expansion of for even by getting an explicit spectral decomposition for and using . The main obstacle to extending to non-prime and odd is obtaining Fourier expansions for in those cases. Recent work of Young [20] may be helpful if one wishes to do this.
Let , be an orthogonal basis of Maass forms on which transform as and normalized such that their Fourier coefficients are equal to their Hecke eigenvalues. The Selberg spectral decomposition [10] for then gives
[TABLE]
where
[TABLE]
is the Petersson inner product, and
[TABLE]
with the matrix such that is the stabilizer of the cusp , and . If is prime, there are only two cusps, and [math], and .
When dealing with Fourier expansions of Eisenstein series it is often more convenient to work with “completed” Eisenstein series, given by . Using completed Eisenstein series in place of regular Eisenstein series in the spectral decomposition formula instead gives
[TABLE]
when is prime. We for the rest of this section we will use this form of the spectral decomposition, using completed Eisenstein series.
To proceed we need:
- •
A Fourier expansion for .
- •
A Fourier expansion for .
- •
The evaluation of \big{\langle}D(*,s,\chi),M_{j}\big{\rangle}.
- •
The evaluation of \big{\langle}D(*,s,\chi),E_{\mathfrak{a}}(*,w,\chi)\big{\rangle}.
We give these in lemmas 2.1 through 2.5. From this spectral expansion for and the Fourier expansions of and we obtain the Fourier expansion of .
From there, we can obtain the full Fourier expansion of . The Fourier coefficient is
[TABLE]
which is easily evaluated using the Fourier expansions of , , and . This yields theorems 1.3 and 1.4.
Lemma 2.1**.**
The Fourier expansion of a Maass form of eigenvalue is given by
[TABLE]
where is the -Bessel function, defined as
[TABLE]
Proof.
[7], Theorem 3.5.1.∎
We normalize so that . The quantity will appear later, and from the work of Hoffstein and Lockhart [11] for all we have the bound
[TABLE]
Lemma 2.2**.**
The Fourier expansions of the completed Eisenstein series for even are given by
[TABLE]
Proof.
[5] along with the identity
[TABLE]
and the functional equation
[TABLE]
The reference gives a Fourier expansion for instead of . However, for , we have
[TABLE]
The rightmost matrix is an element of , and summing over all is the same as summing over all , so the Fourier expansion given is indeed for . ∎
Lemma 2.3**.**
The inner product of with the Maass form is given by
[TABLE]
Proof.
We can evaluate by unfolding :
[TABLE]
The integral in was evaluated with Mathematica, and relies on the fact that the Mellin transform in of is equal to , where is the variable of the Mellin transform [9]. ∎
Lemma 2.4**.**
The inner product of with the Eisenstein series is given by
[TABLE]
Proof.
We can evaluate by unfolding . We use to denote the complex conjugate of .
[TABLE]
The integral in can again be evaluated with Mathematica, which uses the Mellin transform of mentioned in the proof of 2.3. The expression then becomes
[TABLE]
[TABLE]
Substituting this into our expression from earlier yields
[TABLE]
∎
Lemma 2.5**.**
The inner product of with the Eisenstein series is given by
[TABLE]
Proof.
The computation of is very similar to that of :
[TABLE]
again using to denote the complex conjugate of . Integrating in :
[TABLE]
These integrals are identical to the ones that appear in the computation of . The expression becomes
[TABLE]
The sums are the same as the ones that appeared in the previous computation, but with replaced with and replaced with . Hence
[TABLE]
∎
We can now prove theorem 1.3.
Proof of theorem 1.3.
We compute directly:
[TABLE]
The Maass forms have no constant term, so they won’t contribute to the expression at hand. Using lemmas 2.2, 2.4, and 2.5 then gives
[TABLE]
Note that on the line . Making this substitution and cleaning up a bit yields
[TABLE]
From [15] we know that the constant term of is of the form . Therefore
[TABLE]
As goes to infinity, the contribution from , the term in the last line, vanishes, because the -Bessel functions have exponential decay in .
The contribution from on the first line can be evaluated by shifting the contour to the left. There are poles whenever for a non-negative integer. After taking the above limit, the only term that will survive is when , which has residue
[TABLE]
Similarly, the contribution from can be evaluated by shifting the integral in the second line to the right. The only residue which will contribute after the limit in is when , and is equal to
[TABLE]
From this we can conclude that for any , we have
[TABLE]
∎
We can also prove theorem 1.4 in a similar way.
Proof of theorem 1.4.
We compute directly:
[TABLE]
Again note that on the line . Making this substitution and cleaning up a bit yields
[TABLE]
Making the substitution in the third line and using the identity
[TABLE]
then gives
[TABLE]
Shifting the contour to the left allows us to write the integral as a sum of residues. The expression becomes
[TABLE]
In the proof of theorem 1.3 we used an argument to be able to discard all but one of the terms appearing, but in the current situation no argument of that sort is immediately available to us. ∎
3 Sums of modular symbols twisted by Dirichlet characters
3.1 Geometric ordering
It was conjectured in [6] and proved in [8] that
[TABLE]
where . Using the Fourier expansion of we can obtain similar results when the sum on the left is twisted by :
[TABLE]
This sum can be evaluated using theorems 1.3 and 1.4. Via inspection of these theorems, we see that the main term will be where is the rightmost zero of , and the most significant error terms will be and come from the Maass part of the spectral decomposition of . The Riemann hypothesis for Dirichlet -functions implies that the main term will be of size .
Proof of theorem 1.1.
For we evaluate in two different ways. First, using the series expansion
[TABLE]
On the other hand, we can also evaluate this integral as a sum of residues at the poles of . Because has exponential decay in , the only poles of will be the poles of its individual Fourier coefficients. Computing the residues at the most significant poles, we obtain
[TABLE]
Note that there are no poles coming from the trivial zeroes of because of the gamma factors.∎
3.2 Arithmetic ordering
The Eisenstein series admits a double coset decomposition involving the function defined in the introduction. In the classical case where the modular symbols are absent, the Kloosterman sums analogous to can expressed in a closed form, so it is natural to ask if the same can be done for . This is done in corollary 1.5, which we now prove.
Proof of corollary 1.5.
From the work of O’Sullivan [15], we have
[TABLE]
Hence, for , we have
[TABLE]
On the other hand, from theorem 1.4 we have
[TABLE]
This immediately implies the desired result for . The case where is proved similarly. ∎
We can now prove theorem 1.6.
Proof of theorem 1.6.
For we have
[TABLE]
On the other hand, using corollary 1.5, we have
[TABLE]
Shifting the contour to the left then gives the desired result. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Roelof Bruggeman and Nikolaos Diamantis. Fourier coefficients of Eisenstein series formed with modular symbols and their spectral decomposition. J. Number Theory , 167:317–335, 2016.
- 2[2] J. E. Cremona. Algorithms for modular elliptic curves . Cambridge University Press, Cambridge, second edition, 1997.
- 3[3] Chantal David, Jack Fearnley, and Hershy Kisilevsky. On the vanishing of twisted L 𝐿 L -functions of elliptic curves. Experiment. Math. , 13(2):185–198, 2004.
- 4[4] N. Diamantis, J. Hoffstein, M. Kıral, and M. Lee. Shifted convolutions and a conjecture by Mazur, Rubin and Stein. Ar Xiv e-prints , July 2018.
- 5[5] Dorian Goldfeld. On convolutions of nonholomorphic Eisenstein series. Adv. in Math. , 39(3):240–256, 1981.
- 6[6] Dorian Goldfeld. Zeta functions formed with modular symbols. In Automorphic forms, automorphic representations, and arithmetic (Fort Worth, TX, 1996) , volume 66 of Proc. Sympos. Pure Math. , pages 111–121. Amer. Math. Soc., Providence, RI, 1999.
- 7[7] Dorian Goldfeld. Automorphic forms and L 𝐿 L -functions for the group GL ( n , ℝ ) GL 𝑛 ℝ {\rm GL}(n,\mathbb{R}) , volume 99 of Cambridge Studies in Advanced Mathematics . Cambridge University Press, Cambridge, 2006. With an appendix by Kevin A. Broughan.
- 8[8] Dorian Goldfeld and Cormac O’Sullivan. Estimating additive character sums for Fuchsian groups. Ramanujan J. , 7(1-3):241–267, 2003. Rankin memorial issues.
