Explicit subconvexity savings for sup-norms of cusp forms on $\mathrm{PGL}_n(\mathbb R)$
Nate Gillman

TL;DR
This paper provides an explicit version of a recent subconvexity bound for sup-norms of Hecke Maass cusp forms on $ ext{PGL}_n(R)$, improving understanding of their growth in relation to Laplacian eigenvalues.
Contribution
The paper derives an explicit subconvexity bound for the sup-norms of cusp forms on $ ext{PGL}_n(R)$, building on and making concrete the previous qualitative results.
Findings
Established explicit bounds for sup-norms of cusp forms.
Quantified the dependence of bounds on Laplacian eigenvalues.
Enhanced previous subconvexity results with explicit constants.
Abstract
Blomer and Maga recently proved that, if is an -normalized Hecke Maass cusp form for , and is a compact subset of , then we have for some , where is the Laplacian eigenvalue of . In the present paper, we prove an explicit version of their result.
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.
Explicit subconvexity savings for sup-norms of cusp forms on
Nate Gillman
Department of Mathematics & Computer Science, Wesleyan University, Middletown, CT 06457, U.S.A.
(Date: June 17, 2019)
Abstract.
Blomer and Maga [2] recently proved that, if is an -normalized Hecke-Maass cusp form for , and is a compact subset of , then we have for some , where is the Laplacian eigenvalue of . In the present paper, we prove an explicit version of their result.
1. Introduction and Statement of Results
An automorphic form is defined on a quotient of a Riemannian symmetric space by a discrete subgroup of its isometries. A fundamental property of an automorphic form is its size, and in particular the distribution of its mass. One measure of equidistribution is a bound of some -norm of , an especially important case being . As an automorphic form is an eigenfunction of the Laplacian, of particular interest is bounding a given automorphic form in terms of its Laplacian eigenvalue . In 2004, Sarnak [10] proved that, if is a compact locally symmetric space and is the algebra of differential operators invariant under the Riemannian isometry group of , then an -normalized joint eigenfunction of satisfies the following bound,
[TABLE]
This result, which was proved using purely analytic arguments, is often referred to as the convexity bound, and it is known that the exponent is sharp in general.
Here we are interested in arithmetic situations. Many classical examples of Riemannian locally symmetric spaces enjoy additional symmetries given by the Hecke operators, a commutative family of “averaging” operators that play an important role in the theory of modular and automorphic forms; see for example [9]. In these situations, automorphic forms on are also joint eigenfunctions of the Hecke algebra. In light of this additional layer of symmetry, it is reasonable to expect some power saving in (1.1) when we restrict to compact subsets of . Such a restriction is necessary in order to avoid large growth at cuspidal regions, see for example [4]. This is often referred to as the subconvexity conjecture for sup-norms of cusp forms.
The first discovery of subconvexity is due to Iwaniec and Sarnak [6] in 1995. They demonstrated a saving of for automorphic forms on the hyperbolic plane . Since then, much work has been done in this area, but only recently has any power-saving been discovered for higher rank spaces: in 2014, Blomer and Pohl [3] proved subconvexity for Hecke-Maass cusp forms on the Siegel modular space of rank ; see also [5] and [1]. Additionally, a preprint of Marshall [7] demonstrates a power saving for a wide class of semi-simple groups.
In 2016, Blomer and Maga [2] proved subconvexity for Hecke-Maass cusp forms on , for all . They provided a proof of some power saving without explicating it. Until this paper, no explicit power saving has been given for the cases in this general setting, which is our main result.
Theorem 1.1**.**
Let . Let be an -normalized Hecke-Maass cusp form on , and let be a fixed compact subset of . Then,
[TABLE]
where is given explicitly by (5.2).
In Table 1 we provide numerical values for the first few . Our proof gives an exact formula for these, but does not optimize the value.
It is humorous to compare our colossally small value of against Iwaniec and Sarnak’s [6] breakthrough result of .
Using a different method, we also prove the following better bound in the case .
Theorem 1.2**.**
* is also suitable in (1.2).*
This constant is optimized within the framework of our argument. We should note that Holowinski, Ricotta, and Royer [5] proved a result analogous to Theorem 1.2, but in a more restricted setting. Specifically, they proved suffices, provided that the Hecke-Maass cusp forms have one Langlands parameter which is uniformly bounded.
Remark**.**
A slight modification of our argument gives an identical bound for in terms of spectral parameters; see the introduction to [2].
Remark**.**
Another small modification of our argument gives a nearly identical bound for Hecke-Maass cusp forms on a given congruence subgroup ; again, see [2].
Our paper is organized as follows. In Section 2, we recall a result from [2] and explain a matrix-counting problem whose solution yields the proofs of Theorems 1.1 and 1.2. In Section 3, we prove technical Lemmas 3.1, 3.2, 3.3, and 3.4, involving diophantine analysis-style bounds over algebraic number fields, as well as Lemma 3.5, which provides an estimate on the quantity of primes in relevant dyadic intervals. These results provide explicit bounds needed in Section 4, where we prove Proposition 4.1, which yields a good estimate for the matrix-counting problem. We apply this in Section 5 to prove Theorem 1.1, and in Section 6 we provide a proof of Theorem 1.2 using more elementary means.
2. The counting problem
For any , denote by the ’th determinantal divisor, i.e., the greatest common divisor of all minors. For any set of positive-definite matrices , for , any and we define the following collection of integral matrices,
[TABLE]
Here and throughout, we take estimates on matrices, such as the one above, to be entrywise. Also, we formally allow to signify zero error.
By [2, (2.8)], we have the following estimate.
Proposition 2.1**.**
Fix . Let and , and let be a set of primes in . For , define . Let be an -normalized Hecke-Maass cusp form on , and denote by the corresponding Laplacian eigenvalue. Then,
[TABLE]
The next two sections are devoted to bounding the cardinality of , which is the matrix-counting problem discussed earlier. Throughout, our argument uses that is in a fixed compact domain of , so that for instance the implied constants in (2.1) and (2.2) depend on but not on . Additionally, we take all implied constants to hold for sufficiently large ; this is acceptable because in our application of Proposition 2.2, we will take to be an increasing function of , and it is known that there are only finitely many Hecke-Maass cusp forms with bounded Laplace eigenvalue. We also allow all implied constants in the first five sections to depend on ; we will indicate this dependence explicitly when it makes the argument more clear.
3. Technical lemmas
In this section, towards estimating the cardinality of (2.1), we first prove four diophantine analysis-style lemmas. Lemma 3.1 provides a Galois-theoretic framework for keeping track of error estimates. We will repeatedly use this lemma when we prove Lemmas 3.2, 3.3 and 3.4, which are based on [2, Lemmas 5(a), 5(b), 8]. Our addition to these results is the incorporation of a scheme which makes the bounds proved in that paper’s lemmas effective.
Let be a number field and its Galois closure, and suppose . For a fixed number , we say an element of is -well-balanced, or that it has well-balanced constant , if it can be written as a fraction with and either and , or else for each , we have
[TABLE]
Lemma 3.1**.**
Fix a number field and define . If is -well-balanced and is -well-balanced, then:
- (1)
The negation has well-balanced constant . 2. (2)
If , then the reciprocal has well-balanced constant . 3. (3)
The product has well-balanced constant . 4. (4)
The sum has well-balanced constant .
Furthermore, the sum of elements of , each with well-balanced constant , has the following well-balanced constant,
[TABLE]
Proof.
The first three points are clear. If then the fourth claim is obvious, so assuming , we can estimate
[TABLE]
It is clear that , so for any , we have
[TABLE]
which proves the fourth statement. Therefore, when we sum terms, each with well-balanced constant , the well-balanced constant is given by the following linear recurrence,
[TABLE]
which has closed form given in (3.1). ∎
Lemma 3.2**.**
Let and . Let be a real number field and its Galois closure. For let and assume that all are in the ring of integers , and satisfy or
[TABLE]
for all . Let . Then for every we have
[TABLE]
where is defined in (3.5) below.
Proof.
Take a maximal independent subset (i.e., .) Then is a basis in . By the Gram-Schmidt procedure, we obtain inductively an orthogonal basis with entries in . The distance (3.3) is the following quantity,
[TABLE]
Say has well-balanced constant . By Lemma 3.1, has well-balanced constant . It follows that is a sum of terms which each have well-balanced constant , respectively. As the maximum of these terms is the last one, we can crudely estimate that
[TABLE]
This is a first-order linear recurrence , with coefficients given by
[TABLE]
The recurrence has the following bound,
[TABLE]
From the Gram-Schmidt procedure, each can be written as a linear combination of , and a suitable well-balanced constant for the scalars is . So we can write , where each is -well-balanced. By (3.4), we can estimate
[TABLE]
Since and have well-balanced constants and , respectively, the following constant,
[TABLE]
is a well-balanced constant for the double sum. ∎
Remark**.**
Fixing and , it is clear that is an increasing function of . Accordingly, when we apply Lemma 3.2, it is sufficient (and convenient) to use an upper bound on as the third argument of .
Lemma 3.3**.**
Assume the hypotheses of Lemma 3.2, and additionally suppose and . Then, there is an -basis of , with entries in , such that , where
[TABLE]
Proof.
Say with linearly independent, so . Let such that its ’th row is . Since this matrix has full rank, we can change the coordinates to some with invertible. Now, any can be decomposed as with . It is straightforward to compute that has well-balanced constant , so has well-balanced constant . It follows that has well-balanced constant . Next, letting range through the standard basis vectors of yields a basis of elements with well-balanced constant . Multiplying by the denominators of the first entries yields a basis of integral vectors with well-balanced constant . The bound now follows from . ∎
Denote by the vector space of symmetric matrices, and the subspace of positive-definite matrices. Fix non-empty open bounded sets such that , where the bar denotes topological closure. For a matrix we denote by the smallest positive integer such that , and we also define . If is symmetric and positive-definite, then we let be the diagonal entries of , and be the diagonal determinants. We say that a prime is -good if is coprime to all elements in and is a quadratic non-residue modulo for each .
The next lemma will allow us to exchange the matrix in (2.2) with one that has better diophantine properties.
Lemma 3.4**.**
Set and as in (3.11) and (3.12), respectively. Let (defined below), , and . Define and suppose . Let . Then there exists a nonzero subspace (depending on and ) defined in (3.10) below, such that for every matrix , the following inclusion holds for all ,
[TABLE]
Moreover, there exists a subset with such that, setting
[TABLE]
there exists ; and if , then we can find such a satisfying
[TABLE]
Proof.
For and , we define the following linear map,
[TABLE]
If we set
[TABLE]
then (3.7) is satisfied by construction. Now, to each we associate a matrix in which represents this map with respect to the coordinates of the standard basis of . We write this basis as , where the and entries of are , and all other entries are zero. Take a minimal set of rows , , of these matrices that generate . Let be the set of corresponding pairs from (3.10), and define as in (3.8).
The have entries that are either in , or else of the form , with and satisfying ; here, is the matrix corresponding to the vector under consideration. Since , a compact subset of , we have , where and is a diagonal matrix with eigenvalues satisfying . By the bound in (2.1), this implies . Defining , this means . Since , we have , so . We also clearly have . We can estimate , since is contained in the number field obtained by adjoining to at most prime roots, and has degree at most . So by Lemma 3.1, we have that satisfies (3.2) with . Crucially, this holds because the Galois conjugates of are also , as well as that the Galois conjugates of have absolute value .
So by Lemma 3.2 we have
[TABLE]
where is defined in (3.5); see the Remark after Lemma 3.2 regarding the third argument. We have by (2.1), so of course satisfies the same bound, hence . This implies . Then, the following choice of ,
[TABLE]
forces , which implies . (A technical note: we could have simply required , for which it would suffice to impose for some , say, rather than as is our current hypothesis. This alteration would slightly increase the numerical value of , but we opt to present the computation as above so that our presentation more closely mirrors [2, Lemma 8]). Defining , it is clear that implies intersects in some parallelepiped , where is the minimal length of any side of this polytope. Hence, we will only consider sufficiently large . By density of , we have .
Now, let us assume . The previous paragraph implies is impossible, so by Lemma 3.3 there is an -basis of , with entries in , satisfying , where is defined in (3.6). Consider the lattice , where . The projection of onto each has some positive width . Let satisfy . Such a which is minimally chosen satisfies . Then there exists some so that is in . We’ve therefore constructed a which satisfies (3.9), with
[TABLE]
This completes the argument. ∎
We will apply this next lemma to construct a suitable set of primes for use in (2.2).
Lemma 3.5**.**
For every , there exists so that for all , if , then there exists and some dyadic interval which contains primes .
Proof.
Define . By Xylouris [11, Lemma 6.2 b)], for there exists such that , where is the Euler totient function. Then by Brun-Titchmarsh [8], we have
[TABLE]
It follows that
[TABLE]
Since we have , hence the bracketed quantity is at most provided , which holds for sufficiently large . Thus,
[TABLE]
Next, we decompose into dyadic intervals, until the left endpoint arrives below . Because there are at most such intervals, it follows that for some we have
[TABLE]
since . ∎
4. A doubly recursive argument
Here we utilize a doubly recursive argument to achieve a good bound on for suitable primes in suitable intervals. This proposition concludes our diophantine investigations, and is based on [2, Proposition 1]. Our addition is the incorporation of a Linnik-type theorem from Xylouris [11] which improves the corresponding result in [2] by providing explicitly computed constants.
Proposition 4.1**.**
Let (given below) and let be fixed parameters satisfying (4.3) and (4.8). Let . Then there exists satisfying
[TABLE]
as well as a set of primes satisfying , such that
[TABLE]
for all and .
Proof.
For we define
[TABLE]
and with this choice of let be as in (3.10). Attached to these data is a field and a matrix as in Lemma 3.4. We have . Therefore we must have for some . Since , we can apply Lemma 3.4 with the parameters , and
[TABLE]
where is defined in (3.11), and conclude by (3.7) that, for all , we have . By [2, (6.2)] this implies the following bound,
[TABLE]
The remaining cases to consider are (i) , and (ii) , but . The union of these cases is equivalent to . Let , and define the interval , as well as the following set of pairs of prime powers,
[TABLE]
We then apply Lemma 3.4 with the parameters , , as in (4.3), and , which yields as in (3.10), and since in this case there exists some matrix which satisfies , where is defined in (3.12).
Next, we suppose . We will inductively construct and so that
[TABLE]
and
[TABLE]
and
[TABLE]
hold; recall that here, we allow ourselves to take sufficiently large to guarantee the relative asymptotic growth.
We first construct which satisfies (4.5) and (4.6). Towards this, associated to the rational matrix we have the sets and , which were defined immediately preceding Lemma 3.4. For a prime to be -good, we first require for all . We construct a system of congruences which suffices to imply this. We first impose , which ensures . Now, list all the possible prime factors of any of the ’s. Call such a prime , and now we run through them, imposing a few conditions on : if , then impose ; if , then impose ; and if , then impose . By multiplicativity of the Legendre symbol and quadratic reciprocity, these constraints imply that each , so . Note that by compactness, we have since by (4.7) for ; additionally, we have . Hence, in order to satisfy this system of congruences, by the Chinese remainder theorem it suffices to satisfy a single congruence for some . Now by Lemma 3.5, there exists and some dyadic interval which contains primes . Finally, we choose , so (4.5) holds.
For -goodness we also require for each . As before, by compactness we have that ; additionally, we have . Hence, the quantity of prime divisors of is . If we need to remove this many primes from , then for sufficiently large, there would still remain primes in which are -good; indeed, by (4.5) we can estimate that
[TABLE]
Thus holds as well.
To finish the induction, we now construct which satisfies (4.7). Towards this we define the intervals and , as well as the following sets of pairs of prime powers,
[TABLE]
We take as in (3.10), where is as in (4.3). We then apply Lemma 3.4 with and , which yields a matrix which satisfies (4.7). (Note that in the present case, the number field (3.8) is always .) This completes the induction.
We claim that . The inclusion is equivalent to . In order for , we must have We can estimate so if we choose
[TABLE]
then it is clear that
[TABLE]
The factor kills the implied constant for sufficiently large , so inequality holds for .
These interval inclusions imply , so we must have for some . Since , it follows from (3.7) that for all . Since this set consists of powers of -good primes, we conclude from [2, Lemma 7] the following bound,
[TABLE]
and by [2, Lemma 6],
[TABLE]
Finally, we choose and so (4.1) holds. And combining the estimates (4.4), (4.9) and (4.10) implies (4.2). ∎
5. Proof of Theorem 1.1
We apply Proposition 4.1 with the parameters
[TABLE]
where is some small constant to be specified in a moment. This yields as in (4.1) and a corresponding prime set with . Hence by (2.2),
[TABLE]
An quick computation reveals that the following constants,
[TABLE]
satisfy so (5.1) becomes
[TABLE]
where , and
[TABLE]
If we choose , then it follows that
[TABLE]
is admissible in (1.2).
We now sketch the computation of the asymptotic lower bound . Clearly we have . Elementary calculations reveal the following estimates,
[TABLE]
for some positive absolute constants . The desired bound now follows from Stirling’s approximation for .
6. Proof of Theorem 1.2
We first provide two results which bound the solution sets of relevant quadratic forms. These are Lemmas 6.1 and 6.2, which are explicit versions of [3, Lemma 3(b)] and [1, Corollary 5.3], respectively. We then apply Lemma 6.2 to bound in the case , yielding .
We denote by the height of a quadratic polynomial , which is the maximum of the absolute values of the coefficients of .
Lemma 6.1**.**
For each and each quadratic polynomial whose quadratic homogeneous part is positive definite with discriminant , the bound implies .
Proof.
We write and . Without loss of generality, we assume . Arguing as in [3, Lemma 3], we have
[TABLE]
where and . Since , the above estimate implies
[TABLE]
This is at most , which implies the desired bound for .
By [3, (7.6)], we have
[TABLE]
Our assumption and implies . Using our bound on , this implies
[TABLE]
which is again , as claimed. ∎
Lemma 6.2**.**
Let . Let be a fixed symmetric positive definite matrix and let . Let , and let be linearly independent of norm . Let be bounded by and let , where . Then,
[TABLE]
Proof.
By [1, Corollary 5.3], the result holds for , where the constant is inexplicitly provided by [3, Corollary 4]. A straightforward computation reveals that suffices, with the constant inexplicitly provided by [3, Lemma 3(b)]. We computed in Lemma 6.1 that suffices. ∎
Now, we will directly estimate using three applications of Lemma 6.2. In Proposition 2.1, we choose , where is some constant which we will specify later, and let be the set of primes in .
For any , its first column satisfies
[TABLE]
Hence, we apply Lemma 6.2 with the matrix , as well as , , , and , where . It follows that there are possible choices for . Also, the second column satisfies
[TABLE]
So if we define , then we can apply the Lemma with the matrix , as well as , , , , and again , where this time we require . Thus, there are possible choices for . Similarly, we get that there are possible choices for the third column of .
We are now in a position to apply Proposition 2.1. We argued that there are different choices for , provided in (2.2). By the prime number theorem we have , so by (2.2) we get
[TABLE]
If we choose then it follows that
[TABLE]
is admissible in (1.2).
Acknowledgements
The author would like to thank Péter Maga for his stellar mentorship and guidance, as well as useful discussions and feedback on previous versions of this paper. In addition, he would like to thank the anonymous referee for the helpful suggestions regarding the exposition. He would also like to express his gratitude towards the Budapest Semesters in Mathematics program for providing the framework under which this research was conducted.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V. Blomer and P. Maga, The sup-norm problem for PGL ( 4 ) PGL 4 \operatorname{PGL}(4) , Int. Math. Res. Notices 14 , no. 3, (2015), 5311-5332.
- 2[2] V. Blomer and P. Maga, Subconvexity for sup-norms of cusp forms on PGL n subscript PGL 𝑛 \mathrm{PGL}_{n} , Selecta Math. 22 , no. 3, (2016), 1269-1287.
- 3[3] V. Blomer and A. Pohl, The sup-norm problem on the Siegel modular space of rank 2 , Amer. J. Math. 138 , no. 4, (2016), 999-1027.
- 4[4] F. Brumley and N. Templier, Large values of cusp forms on GL n subscript GL 𝑛 \mathrm{GL}_{n} , (2014), ar Xiv:1411.4317
- 5[5] R. Holowinsky, G. Ricotta, E. Royer, On the sup-norm of SL 3 subscript SL 3 \mathrm{SL}_{3} Hecke-Maass cusp forms , ar Xiv:1404.3622.
- 6[6] H. Iwaniec and P. Sarnak, L ∞ superscript 𝐿 L^{\infty} norms of eigenfunctions of arithmetic surfaces, Ann. of Math. 141 , (1995), 301-320.
- 7[7] S. Marshall, Upper bounds for Maass forms on semisimple groups , (2014), ar Xiv:1405.7033
- 8[8] H. Montgomery and R. Vaughan, (1973), The large sieve , Mathematika 20 , no. 2, (1973), 119-134.
