Sums of squares in real quadratic fields and Hilbert modular groups
Fernando Chamizo, Roberto J. Miatello

TL;DR
This paper employs spectral theory of Hilbert-Maass forms for real quadratic fields to analyze the asymptotic behavior of sums related to representations as sums of two squares in the ring of integers.
Contribution
It introduces a novel application of spectral theory to study sums of two squares in real quadratic fields, providing new asymptotic results.
Findings
Derived asymptotic formulas for sums of representations as sums of two squares.
Connected spectral theory of Hilbert-Maass forms with classical number theory problems.
Extended understanding of sums of squares in the context of real quadratic fields.
Abstract
We use the spectral theory of Hilbert-Maass forms for real quadratic fields to obtain the asymptotics of some sums involving the number of representations as a sum of two squares in the ring of integers.
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.
Sums of squares in real quadratic fields and Hilbert modular groups
Fernando Chamizo
and
Roberto J. Miatello
Abstract.
We use the spectral theory of Hilbert-Maass forms for real quadratic fields to obtain the asymptotics of some sums involving the number of representations as a sum of two squares in the ring of integers.
2010 Mathematics Subject Classification:
11F72, 11F41, 11N45
The first named author is partially supported by the MTM2017-83496-P grant of the MICINN (Spain) and by “Severo Ochoa Programme for Centres of Excellence in R&D” (SEV-2015-0554)
1. Introduction
The asymptotic study of the average of the arithmetical function giving the number of representations of as a sum of two squares is the goal of the celebrated Gauss circle problem. It asks for the infimum of the exponents ’s satisfying
[TABLE]
The left-hand side counts the number of lattice points in a circle of radius and gives its area. Gauss used an approximation of this kind when studying the class number of quadratic forms [Gau81]. A simple geometric reasoning, already employed by Gauss, shows (1.1) for . Sierpiński [Sie74] proved the estimate for with a rather complicated argument (see [Hux96] for a short modern elementary approach). On the other hand, can be obtained in a more direct way using the Euclidean spectral expansion (i.e., classical Fourier analysis) of radial functions on [Lan93, VIII§8].
A finer asymptotic property to be studied about is its self-correlation. In [Iwa02] it is proved that
[TABLE]
and there are similar formulas replacing by (see [Cha99] for the uniformity). Although (1.1) for and (1.2) seem unrelated, from the analytic point of view one can run both proofs along similar lines changing Euclidean spectral expansions based on Fourier series by hyperbolic spectral expansions based on Maass forms and Eisenstein series. This second situation is by far more involved and one has to bypass unsettled problems like the existence of exceptional eigenvalues or the bounds of the eigenfunctions, which become trivial in the Euclidean setting. It is noteworthy to mention that the error term in (1.2) remains unimproved while van der Corput method and other finer techniques of exponential sums have proved (1.1) for some [Hux96], namely the best known result [BW17] allows to take slightly smaller than .
Several authors have considered the analogue of Gauss circle problem in totally real number fields [Sie36a], [Sch65], [Sch62], [Rau88] where is replaced by , with the ring of integers. A basic issue is to find a real number field analogue of (note that the existence of infinitely many units prevents us from using the norm). Following Siegel [Sie36a], a natural condition is to limit the size of every Galois conjugate. In the real quadratic case of discriminant , the main result in [Sch62] implies that
[TABLE]
where is the real conjugate of and is defined in the natural way:
[TABLE]
The purpose of this paper is to get an analogue of (1.2) for real quadratic fields by applying the hyperbolic circle problem for products of two upper half-planes. This latter problem was studied in general in [BGM11] for multiple products corresponding to totally real number fields of arbitrary degree. The underlying analysis involves the spectral theory of Hilbert-Maass forms.
To state our main results we use the abbreviations
[TABLE]
where is the discriminant of the quadratic real field we are considering and is the character corresponding to the Kronecker symbol \Big{(}\frac{\Delta}{\cdot}\Big{)}. See the next section for more details about the notation.
Firstly we state a result like (1.3) for the self-correlation.
Theorem 1.1**.**
For
[TABLE]
Secondly, we are interested in the global uniformity in and that is not considered in [BGM11]. Note that there are limiting arithmetical situations, for instance if is like we are essentially considering solutions of Pell’s equation which have an exponential spacing, too sparse to be captured by harmonic analysis and by an asymptotic formula.
Theorem 1.2**.**
For and , if there are no exceptional eigenvalues then
[TABLE]
and if there exist exceptional eigenvalues then we have to add O\big{(}V_{1}^{1/2+c}V_{2}^{1/4}\big{)} with .
Remark. In principle one could suspect a chaotic behavior of because of the arithmetic nature of the character sum but it is not difficult to prove that . A precise result is included in §7. It may sound surprising that the existence or not of exceptional eigenvalues plays a role in Theorem 1.2 but not in Theorem 1.1. In the terminology in [BGM11], we have a large spectral gap and the influence of the exceptional eigenvalues in Theorem 1.1 is absorbed by the error term. The fundamental result here is the bound of Kim and Shahidi [KS02] for the size of the potential exceptional eigenvalues that allows to take in Theorem 1.2.
2. Notation and basic concepts
We follow mainly the notation of [BM09] and [BGM11]. We recall it briefly reviewing at the same time the basic concepts. We use Ladau’s -notation and Vinogradov’s -notation indistinctly.
The Poincaré half-plane is the Riemannian manifold given by the upper half-plane endowed with the hyperbolic metric , which induces the invariant measure . It is possible to give an explicit formula for the corresponding hyperbolic distance , namely
[TABLE]
The group acts faithfully on in the standard way by linear fractional transformations and in fact it coincides with the group of orientation preserving isometries of . This implies in particular that is invariant, meaning u(z,w)=u\big{(}\gamma(z),\gamma(w)\big{)} for any and .
For each discrete subgroup such that has finite volume, the spectral theory of automorphic forms allows to expand any in terms of the eigenfunctions of the Laplace-Beltrami operator \Delta=-y^{2}\big{(}\partial^{2}_{x}+\partial^{2}_{y}\big{)}. In some sense, the role of the Fourier transform is played in this context by the Selberg transform
[TABLE]
As in the case of the Fourier transform, we can relax a lot the regularity still having a sound and useful Selberg transform. It is easier to introduce the conditions in terms of the transform itself, taking for granted the existence of the integral. Following Selberg [Ber54, Satz 3.4], we ask for the existence of a strip with such that
[TABLE]
This is satisfied when (see [Iwa02, §1.8]).
A novelty with respect to the Euclidean setting is that in the cases of arithmetical relevance e.g., , there is a discrete spectrum (corresponding mainly to Maass cusp forms) and a continuous spectrum (corresponding to Eisenstein series). This non-classical harmonic analysis built with nonholomorphic automorphic forms has had a profound impact on analytic number theory specially since the development of Kuznetsov’s formula [Haf85].
We focus on the case of real quadratic number fields with squarefree. The corresponding ring of integers is
[TABLE]
To parallel the previous case , the natural object to work with is the full Hilbert modular group
[TABLE]
acting on where denotes the action by the nontrivial element in the Galois group of (the real conjugation) on the entries of . It turns out that is a discrete subgroup of and has finite volume. In general the groups with these two properties are called lattices and they are said to be irreducible if the projections on each factor of are dense. This avoids artificial examples like that can be “reduced” to discrete groups acting on .
If is an irreducible lattice, spectral theory allows to analyze in terms of the simultaneous eigenfunctions of and (where the subscript indicates the variable). Imposing we have a discrete sequence of couples of eigenvalues \{\text{\lambda}_{\ell}\}_{\ell} with \text{\lambda}_{\ell}=(\lambda_{\ell_{1}},\lambda_{\ell_{2}}) and corresponding orthonormal eigenfunctions ,
[TABLE]
We reserve the label for the trivial couple \text{\lambda}_{0}=(0,0) and consequently . It is said that \text{\lambda}_{\ell} is exceptional if or , and it is said to be totally exceptional if both conditions hold simultaneously. The relevance of the exceptional \text{\lambda}_{\ell} is that the analogue of the Fourier transform has a quite different behavior at them. To emphasize this point we write
[TABLE]
(Note that we slightly divert from [BGM11]). In this way, and \text{\lambda}_{\ell} is exceptional if or belong to . Although it is conjectured that there are no exceptional \text{\lambda}_{\ell} in the cases of arithmetic interest (this is the generalization of a famous conjecture due to Selberg [Sel65]), in principle there might be infinitely many such \text{\lambda}_{\ell}. On the other hand, only finitely many can be totally exceptional (because the set \{\text{\lambda}_{\ell}\} is a discrete set) and the result of Kim and Shahidi [KS02] implies for the lattices in this paper.
As in the one-dimensional case, it turns out that does not span if is not compact and a continuous spectrum corresponding to Eisenstein series enters into the game. The corresponding spectral theorem is technical in nature and we only need a particular case, so we have limited its application to the proof of a single lemma. The reader preferring not to enter into the details of the proof can use Lemma 4.1 as a black box embodying the spectral theorem. We refer the reader to [BGM11] and [BM09, Ch.1] for more extensive comments on the spectral theorem (see also [HC68] for a more comprehensive theory).
Rather than the expansion of functions in , we need to expand a type of automorphic kernels. To introduce them it is convenient to extend the definition of in (2.1) to in the natural manner:
[TABLE]
Given an irreducible lattice and decaying rapidly enough at zero and infinity, for instance compactly supported, we can construct an automorphic kernel
[TABLE]
Using the fact that is invariant by isometries, we deduce that is actually automorphic in both variables, that is
[TABLE]
3. An arithmetic lemma
To study the sum of by analytic methods it is convenient to consider more general weighted sums
[TABLE]
A preliminary consideration is whether this sum actually makes sense when decays rapidly enough. We state a general elementary result of this kind although, for the aims of this paper, we could restrict ourselves to compactly supported functions.
Lemma 3.1**.**
If k(x,y)\ll\big{(}x+y+1)^{-\alpha} with for then is well-defined.
Proof.
Note first that if is a sum of two squares then so is and if both are positive then we can restrict the sum to .
If , expanding we see that counts the number of integral or half-integral solutions of
[TABLE]
The positivity of the first equation shows at once that is well-defined i.e., . In fact using that the number of representations of an integer as a sum of two squares in tends to zero when divided by any positive power [HW79, Th. 338], we have the trivial bound for any . Note also that, necessarily, in order to have a solution one must have .
The inequality and the equation reduce the assertion to proving that
[TABLE]
Using the trivial bound we have
[TABLE]
where we disregard the value in the last sum. It is plain that the latter series converges when , for instance by comparing with the integral , , where is the exterior of the unit ball in . ∎
The key point to apply spectral methods is to translate into an automorphic kernel (2.4). The argument is an adaptation of that in the 1-dimensional case in [Iwa02, Cor.12.2].
Lemma 3.2**.**
Consider the lattice in defined as
[TABLE]
Then for as in Lemma 3.1 we have
[TABLE]
Proof.
The map
[TABLE]
clearly establishes a bijection between and . On the other hand, if denotes the last matrix a calculation proves u\big{(}\tau(i),i\big{)}=C^{2}+D^{2}. Hence
[TABLE]
This proves the result because give rise to the same element in . Note that the sign changes do not affect the values of and . ∎
4. A rough spectral bound
Here we state the consequence of the application of the spectral theorem to automorphic kernels in the form needed for our purposes. It will be convenient to classify the labels of the exceptional \text{\lambda}_{\ell} in three sets:
[TABLE]
Lemma 4.1**.**
Let and be continuous functions with Selberg transforms satisfying (2.2). Consider the automorphic kernel (2.4) with . Define
[TABLE]
and
[TABLE]
Then we have
[TABLE]
Remark. The dependence of the constant on and could be made explicit but it is irrelevant in our application. Of course if the sum over must be omitted in and if there are no exceptional eigenvalues, the same applies to the suprema over and in the error term.
Proof.
The spectral expansion of , the analogue of the Poisson summation formula, as given in [BGM11, (39)], reads
[TABLE]
where , runs over the finitely many inequivalent cusps, are positive constants, is a lattice in and denotes the Eisenstein series. In the first sum the terms with contribute exactly as . Let , we have to prove that it is bounded by the error term in the statement. Using that we have for or
[TABLE]
Now we need a form of Bessel’s inequality that allows to bound, for a fixed and every , the expression
[TABLE]
where
[TABLE]
The instance of Bessel’s inequality we need is [BGM11, Th. 4.2]
[TABLE]
The intuitive interpretation is that and behave as constants on average.
If we divide the integral in (4.2) into the dyadic pieces indicated by and, using the positivity, we apply (4.3) to each of them, we have that the last term in (4.2) contributes at most
[TABLE]
The same argument works to get this bound for the contribution of the first term in the right-hand side of (4.2) when and are real. The remaining terms have and we can proceed in the same way keeping the supremum of if . For instance, the terms with contribute at most
[TABLE]
and the sum is by (4.3).
Therefore, we have proved that is bounded by the error term appearing in the statement. ∎
5. Volume computations
The main term (4.1) in the spectral expansion depends on the volume of the fundamental region and it becomes closely related to the constant appearing in the asymptotic formulas in Theorem 1.1 and Theorem 1.2.
Our aim in this section is to prove the following result:
Proposition 5.1**.**
Let be the subgroup of the full Hilbert modular group introduced in Lemma 3.2. The volume of a fundamental region of is given by
[TABLE]
where is the character corresponding to the Kronecker symbol \Big{(}\frac{\Delta}{\cdot}\Big{)} and is the discriminant of i.e., if and otherwise.
To prove it we are going to use an old result due to Siegel [Sie36b] and the computation of the index . We give indeed an explicit description of the representatives of the subgroups.
The elements of the full Hilbert modular group and its subgroups are pairs of matrices related by the real conjugation. This redundant presentation is important when the action on is considered but from the group theoretical point of view we get an isomorphic group dropping the second matrix in the pair. For the sake of brevity, in the next result and in the rest of the section we identify and when the action on is irrelevant.
Proposition 5.2**.**
Define
[TABLE]
and
[TABLE]
where and . Then a complete set of representatives of the cosets is given by
[TABLE]
Hence the index in these three cases is respectively, 6, 9 and 15. This can be written in an artificial but compact way with the Kronecker symbol.
Corollary 5.3**.**
We have with as in Proposition 5.1.
We divide the proof of Proposition 5.2 according whether divides or not. In this second case we benefit from a simple description of the group given in the following result which allows a substantial reduction in the computations. In its proof and in that of Proposition 5.2 we will use that for , we have and when writing each as , we have if and only if and are even.
Lemma 5.4**.**
If we have where and is the subgroup of matrices in with lower left entry in . Moreover, two matrices in belong to the same left coset of if and only if the determinant of the matrix formed by their first columns belongs to .
Proof.
Note the computations
[TABLE]
The first one shows because if then .
The second computation shows that , it reduces to check that implies . We consider two cases depending whether or not divides .
If , write and and note . Expanding we get that if and only if and or equivalently if , are both odd and , are both even. Hence .
If , write and . Expanding we see that implies and in particular and have different parity. In fact we can assume (by the symmetry , ) then and we conclude , that gives as expected.
Finally, belong to the same coset if and only if and the last part of assertion in the result reduces to write the formula for the lower left entry of this product. ∎
of Proposition 5.2 for .
We check first that different elements in represent different cosets. A calculation shows that for if and only if . Then and are in different cosets when if and when if . Clearly and belong to different cosets when , since , and the same applies to and . It only remains to check that in the case the elements and do not share coset with the other elements. As , and are in different cosets, the same holds for and with . Writing and using , after a calculation imposes , and which leads to a contradiction.
We focus firstly on the case . By Lemma 5.4 we have to prove that for each element in there is an element in belonging to the same coset of . The first column of the matrices in is given by the following vectors, except for adding to the coordinates elements of ,
[TABLE]
With the criterion given at the end of Lemma 5.4 it is enough to prove that if we add to these vectors a column with elements at least one of the corresponding determinants is in . Clearly we can assume . Note that the vectors corresponding to Id and take care of all the cases with or zero. Then there are nine cases to be considered. Three of them have and the determinant with the second vector is zero. By the same reason, we can also disregard the three cases in which and form the vectors corresponding to , and . The remaining cases are , and and we get determinants in using the vectors corresponding respectively to , and .
We deal now with the case . To prove that for each element in there exists an element in in the same coset of we proceed as before. This case is much simpler and no calculations are needed because after excluding the cases , and using as above respectively Id, and , we have only six possibilities with and they are all covered since each remaining element in treats at least the case corresponding to its own first column. ∎
If the group is not a conjugate of . In this case, and actually also when , there is a simple set of generators of . Considering some relations among them it is possible to simplify any word to one of the representatives indicated below multiplied by an element of . The drawback of this method is that it leads to distinguish a number of cases that require somewhat tedious calculations. The advantage is that it gives a unified treatment of the case (see the remarks after the proof) and it potentially works for other subgroups.
of Proposition 5.2 for .
A result due to Vaseršteĭn [Vas72] (see also [Lie81], [May07, §1.2.2] and [Eve16, §5.1]) assures that the group is generated by , and . We note that and . It is clear that, modulo we can write any element as an alternating product of factors equal to and with , that we will call generically a word. We employ the usual notation , or and equivalent modulo , to mean that belong to the same left coset i.e., . Note that and then we can always consider words with to the right.
By the multilinear properties of the multiplication of matrices, replacing in a product by with in changes the entries of the final result in elements in this ideal. Recalling the definition of , it is easy to see that two matrices in with entries differing in elements of belong to the same coset. Hence it is enough to consider products involving translations with because for any we can find such that . Note that any word of length one is equivalent to exactly a one element of .
A calculation shows
[TABLE]
For it lies in . This implies that for any ,
[TABLE]
Hence any element of the form is equivalent to or .
The set contains representatives of all the words of length 2 and they are clear nonequivalent. We have
[TABLE]
and it is easy to deduce that does not contain equivalent elements. As shown before, the words can be simplified if , hence they are all equivalent to some element in . Noticing
[TABLE]
it follows from (5.3) that does not contain equivalent elements and by (5.1) (recall ) any element in is not equivalent to an element in .
For the words of length four we could consider in principle , which makes six possibilities but some calculations show that and are respectively
[TABLE]
that belong to using (5.4). Taking conjugates we deduce
[TABLE]
Then the only possibilities for elements not equivalent to those in are the ones considered in .
Assuming that the elements in are not equivalent, we are going to prove that they form a complete set of representatives. This follows by an inductive argument if we prove that the words with length 5 are equivalent to shorter words because we have seen that the words of length at most 4 are equivalent to elements in . By (5.5) and (5.2) it is enough to consider words with or to the right. In fact, taking real conjugates if necessary, it is enough to prove that , or equivalently
[TABLE]
Using (5.4) we have that and then the trace of this matrix belongs to . In the same way, differs from in an element of . Hence the matrix is in .
It remains to prove that does not contain equivalent elements. Recall that we knew that this was the case for . Note that which is not in by (5.1). Then . By real conjugation we can restrict ourselves to check that is not equivalent to any any element in . From (5.6), and then is not equivalent to any element in . Clearly for , then also in this case and the proof is complete. ∎
As mentioned before, it is possible to extend the previous proof to cover the case . We now sketch the alternative proof following the same lines as in the case when .
The calculation (5.1) does not depend on the properties of and we can deduce as before that is equivalent to Id, or . In fact (5.1) implies
[TABLE]
The two latter establish the main difference with the case and are due to the fact that (5.4) must be replaced by and when . Multiplying to the left by one deduces (recall )
[TABLE]
Hence any word of length at most 3 is equivalent to one of the elements in C_{1}\cup C_{2}\cup\big{\{}T_{1}ST_{\omega},T_{1}ST_{\overline{\omega}}\big{\}}. These elements are inequivalent (this can be obtained essentially following the scheme of the previous proof, where a bigger set is considered).
To conclude that it is a full set of representatives we have to prove that any word of length 4 can be reduced to one of its elements. By (5.7) and (5.8) it is enough to consider and . The following calculation shows
[TABLE]
and by conjugation .
Summarizing, the relations (5.5) were not enough to exclude words of length 4 when while the two last formulas in (5.7) cause the collapse of the potential new possibilities in the case .
of Proposition 5.1.
Siegel proved a closed formula [Sie36b, (19)] for when is the ring of integers of a totally real number field. In the quadratic case, it reads
[TABLE]
where is the Dedekind zeta function of . We have with the Dirichlet -function associated to the character . By the functional equation of in its asymmetric form [MV07, Cor.10.9] (note that is primitive and even)
[TABLE]
By Proposition 5.2, the volume of the fundamental region for is times that for , hence
[TABLE]
Now we appeal to the known formula [Was97, Th.4.2] (as an aside, we note that the evaluation of plays an important role in the definition of -adic -functions)
[TABLE]
As is even,
[TABLE]
and the sum of both sides equal , hence both vanish. Then we can replace by . ∎
6. Proof of the main results
After Lemma 3.2 and Lemma 4.1, the proof of Theorem 1.1 and Theorem 1.2 boils down to approximate sharp cuts by smooth kernels and estimating Selberg transforms. Following [Cha96], with an hyperbolic version of a classical Euclidean device, it is possible to reduce the whole problem to estimate the Selberg transform of the characteristic function of an interval (which is done in [Cha96, Lemma 2.4]). With this idea in mind we write and respectively for the characteristic function of and its Selberg transform
[TABLE]
The slow decay of would cause serious convergence problems when applying the spectral theorem. The idea introduced in [Cha96] is to replace by a manageable approximation in such a way that its Selberg transform is like a product of two ’s at different scales. It doubles the decay without requiring to estimate new transforms. The key argument is a simple one and it is summarized in the following result.
Lemma 6.1**.**
For consider the function given by
[TABLE]
Then there exists such that F(z,w)=f\big{(}u(z,w)\big{)} and
[TABLE]
Moreover the Selberg transform of is .
Proof.
Note that for because is the invariant measure, then only depends on and it assures the existence of . Using geodesic polar coordinates [Iwa02, (1.17)] it is plain that \int_{\mathbb{H}}\chi_{v}\big{(}u(\zeta,w)\big{)}\;d\mu(\zeta)=4\pi v (the area of a hyperbolic circle) and hence .
Take such that and . Then by (2.1) we can write
[TABLE]
By the triangle inequality, if the integral vanishes. As , we can rewrite this as f\big{(}(\cosh x-1)/2\big{)}\leq\chi_{\widetilde{V}+\widetilde{v}}(x) for that means with and the addition formula for gives the claimed formula for . In the same way, if then implies and consequently we can omit to get f\big{(}u(z,i)\big{)}=1. This can be rephrased as f\big{(}(\cosh x-1)/2\big{)}\geq\chi_{\widetilde{V}-\widetilde{v}}(x) for and proceeding as before, .
The last part of the statement reduces to an application of Fubini’s theorem using that
[TABLE]
See [CRRC13, Lemma 2.2] for the details and a general result. ∎
Theorem 1.1 and Theorem 1.2 will be proved by an application of Lemma 4.1, for different choices of the parameters and in the following result.
Proposition 6.2**.**
Let and , where is an absolute constant. Then there exists with V_{j}^{\prime}=V_{j}+O\big{(}V_{j}v_{j}^{1/2}+(V_{j}v_{j})^{1/2}\big{)} such that
[TABLE]
where the Selberg transform of is .
Remark. The constant can be substituted by an explicit numerical value by following the steps in the proof, but this value is unimportant for our arguments, so we shall not to get into this calculation.
Proof.
Let us abbreviate ; then .
Take in Lemma 6.1 and with and . For in this interval, the hypothesis is satisfied choosing small enough because when . Let be the corresponding function in Lemma 6.1, which ensures that under
[TABLE]
We have
[TABLE]
hence the inequalities hold choosing small enough.
Consequently, defining as the automorphic kernel (2.4) that corresponds to , we have by Lemma 3.2
[TABLE]
The intermediate value theorem implies for some and the result follows with . ∎
For the sake of completeness, we include here the estimates we need for the Selberg transform. A more precise result with asymptotic formulas is given in [Cha96].
Lemma 6.3**.**
The Selberg transform of the characteristic function of satisfies for
[TABLE]
and for pure imaginary we have
[TABLE]
Proof.
This is a consequence of Lemma 2.4 in [Cha96]. ∎
The logarithm appearing in these estimates cannot be avoided when is large and close to [math]. It is reflected on some average results for the hyperbolic circle problem [PR94].
Now, we are ready to prove our main results.
of Theorem 1.1.
Take in Proposition 6.2 , hence we have V_{1}^{\prime}=V_{1}+O\big{(}V_{1}^{3/4}V_{2}^{-1/4}\big{)} and V_{2}^{\prime}=V_{2}+O\big{(}V_{2}^{3/4}V_{1}^{-1/4}\big{)}. With the notation of Lemma 4.1, for , (6.1) gives
[TABLE]
and a term must be introduced for . Then . On the other hand, the bound for from [KS02] implies by (6.2)
[TABLE]
Consequently, the sum over in Lemma 4.1 contributes O\big{(}(V_{1}V_{2})^{11/18}\big{)} and, as and , we obtain the main term (4.1) of the automorphic kernel
[TABLE]
where we have used expression (1.5) and Proposition 5.1. On the other hand, the error term in Lemma 4.1 is
[TABLE]
and clearly this is O\big{(}(V_{1}V_{2})^{3/4}\big{)}. ∎
of Theorem 1.2.
Take in Proposition 6.2 and , that implies V_{1}^{\prime}=V_{1}+O\big{(}V_{1}^{1/2}V_{2}^{-1}\big{)} and V_{2}^{\prime}=V_{2}+O\big{(}V_{1}^{-1/4}V_{2}^{1/2}\big{)}. The Selberg transforms of , and admit bounds as in the previous proof that give
[TABLE]
and .
The difference is that for we have to use the second bound in (6.1) because . Then in this case
[TABLE]
which leads to .
If there are no exceptional eigenvalues, the error term in Lemma 4.1 is simply O(H_{1}H_{2})=O\big{(}V_{1}^{3/4}V_{2}^{1/2}\big{)} and we get the first part of the result.
For the second part, note that we only need a bound for when because the second formula of (6.2) does not involve . Under our assumption
[TABLE]
Then the error term in Lemma 4.1 includes two new terms following , namely, it is
[TABLE]
Finally, note that the finite sum in contributes O\big{(}V_{1}^{1/2+c}V_{2}\big{)} that is absorbed by the error term. ∎
7. Appendix. Numerical considerations
A problem to carry out numerical calculations related to (3.1) is that is essentially a divisor function in and it seems hard to implement in an efficient way. Here we make some comments for the reader interested in doing direct computations and we display some of the data obtained in this way.
A simple calculation, already displayed in the proof of Lemma 3.1 shows that for the value of is the number of solutions of
[TABLE]
Here, . Equivalently, we consider if and we consider if .
The solutions of (7.1) enjoy some symmetries that are useful for numerical calculations.
Proposition 7.1**.**
Given , let and be the number of solutions of (7.1) satisfying the mutually exclusive conditions indicated in this list:
[TABLE]
Then .
Proof.
We have a group of transformations acting on the solutions, , generated by
[TABLE]
This action is free (fixed point free) except for the set of solutions satisfying one of the following four sets of conditions:
[TABLE]
The solutions satisfying the first or the second set of conditions amount and the rest of the conditions give solutions. In the complement of the action of gives equivalence classes with eight elements and we can always select exactly one of these eight elements satisfying the conditions indicated for , , and . This follows imposing an ordering between [math], and when possible i.e., when there are not coincidences among them. In this way counts the ordered case and , and the cases with coincidences. ∎
For the numerical calculation of note that and is equivalent to
[TABLE]
The first one readily imposes upper bounds on , , and . If we let , , and vary in these ranges and, for each combination, we add 1 to the position , of a matrix with and as in (7.1), then this matrix will store the required values of and the evaluation of in (3.1) corresponds to a sum of products of adjacent entries.
Now Proposition 7.1 allows to reduce in a factor of approximately the ranges of , , and to be considered. In the implementation the loop corresponding to takes the bulk of the calculations because the rest of the loops involve a lesser number of free variables.
The actual issue for direct computations of this kind is the limit of the fast access allocatable memory to store the matrix. The size of the stored elements can be reduced to one fourth noting that and that is always even by (7.1). With these reductions, when in the more demanding case (less sparse matrix), the memory to be allocated for the values of and is of around
[TABLE]
integers. When and are very unbalanced, meaning large and , then is determined by and one only needs room for the around integer values of . If these figures should be multiplied by .
We mention here a couple of tables for that we have obtained by implementing the previous idea in an average PC with a simple C program.
As in the case of the Gauss circle problem, the error term in the asymptotic approximation of oscillates and to get a reliable idea on the limits for a general upper bound, rather than picking large special values of , it is more informative to consider
[TABLE]
Extensive computations prove
[TABLE]
As an aside, a possibility that we have not explored is to carry out numerical calculations via Lemma 3.2 with a description of the group in terms of words and relations (cf. [PR94]). It looks promising when because has simple generators and Proposition 5.2 gives a full description of the cosets but when the natural generators are linked to the class group [Eve16, §5.2] and the calculations for large values of could be more difficult. In both cases one should have some control on in terms of the length of .
In the case of unbalanced arguments of , the numerical experiments suggest that the asymptotic formula
[TABLE]
in Theorem 1.2 could hold in some ranges beyond the condition , but even for reasonably large the values of are too small to draw trustworthy conjectures. For instance, if we define
[TABLE]
then we have
[TABLE]
It is tempting to claim that goes to when .
We finish with some considerations about the constant giving the limit of . Here it is a table of some values
[TABLE]
As we mentioned before, and the table confirms, decays as . This decay can be proved theoretically with explicit constants. Namely, we have
Proposition 7.2**.**
With the notation as in (1.5), we have
[TABLE]
This is in accordance with the previous table. In which the minimal value of is around (reached at ) and the maximal value is around (reached at ).
Proof.
The formula (5.9) due to Siegel for the volume of the fundamental region of the full Hilbert modular group and Corollary 5.3 imply
[TABLE]
Clearly
[TABLE]
Using , and comparing with Proposition 5.1,
[TABLE]
Substituting in the definition of , we complete the proof. ∎
Sharper bounds can be proved separating congruence classes modulo 8. For instance, if the previous argument leads to
[TABLE]
and in fact if we choose with to force for small primes. For example, taking we have and .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Ber 54] S. Berg. Part 1 of Selberg’s Gottingen lectures: a rough transcription. Available in the website of the Institute for Advanced Study https://publications.ias.edu/selberg , 1954.
- 2[BGM 11] R. W. Bruggeman, F. Grunewald, and R. J. Miatello. New lattice point asymptotics for products of upper half-planes. Int. Math. Res. Not. IMRN , (7):1510–1559, 2011.
- 3[BM 09] R. W. Bruggeman and R. J. Miatello. Sum formula for SL 2 subscript SL 2 \rm SL_{2} over a totally real number field. Mem. Amer. Math. Soc. , 197(919):vi+81, 2009.
- 4[BW 17] J. Bourgain and N. Watt. Mean square of zeta function, circle problem and divisor problem revisited. ar Xiv:1709.04340 [math.AP], 2017.
- 5[Cha 96] F. Chamizo. Some applications of large sieve in Riemann surfaces. Acta Arith. , 77(4):315–337, 1996.
- 6[Cha 99] F. Chamizo. Correlated sums of r ( n ) 𝑟 𝑛 r(n) . J. Math. Soc. Japan , 51(1):237–252, 1999.
- 7[CRRC 13] F. Chamizo, D. Raboso, and S. Ruiz-Cabello. Exotic approximate identities and Maass forms. Acta Arith. , 159(1):27–46, 2013.
- 8[Eve 16] L.M. Everhart. On generators of Hilbert modular groups of totally real number fields. Master’s thesis, UNC Greensboro, Greensboro, 2016. Available online https://libres.uncg.edu/ir/uncg/f/Everhart_uncg_0154 M_11992.pdf .
