Counting non-uniform lattices
Mikhail Belolipetsky, Alex Lubotzky

TL;DR
This paper investigates the asymptotic growth of non-uniform lattices in certain Lie groups, confirming a conjecture for most cases and refining understanding of lattice counting in higher rank groups.
Contribution
It proves that the conjectured growth rate holds for non-uniform lattices in most simple Lie groups of real rank at least 2.
Findings
Confirmed the conjectured asymptotic growth for non-uniform lattices in most groups.
Disproved the original conjecture for all lattices, but verified it for non-uniform cases.
Provided explicit constants related to the root systems of the groups.
Abstract
In [BGLM] and [GLNP] it was conjectured that if is a simple Lie group of real rank at least 2, then the number of conjugacy classes of (arithmetic) lattices in of covolume at most is where is an explicit constant computable from the (absolute) root system of . In [BLu] we disproved this conjecture. In this paper we prove that for most groups the conjecture is actually true if we restrict to counting only non-uniform lattices.
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.
Counting non-uniform lattices
Mikhail Belolipetsky
IMPA
Estrada Dona Castorina, 110
22460-320 Rio de Janeiro, Brazil
and
Alexander Lubotzky
Institute of Mathematics
Hebrew University
Jerusalem 91904
ISRAEL
Abstract.
In [BGLM] and [GLNP] it was conjectured that if is a simple Lie group of real rank at least , then the number of conjugacy classes of (arithmetic) lattices in of covolume at most is where is an explicit constant computable from the (absolute) root system of . In [BLu] we disproved this conjecture. In this paper we prove that for most groups the conjecture is actually true if we restrict to counting only non-uniform lattices.
2000 Mathematics Subject Classification:
22E40 (20G30, 20E07)
Belolipetsky is partially supported by CNPq and FAPERJ
Lubotzky is partially supported by ERC, NSF and ISF
1. Introduction
Let be a non-compact simple Lie group endowed with a fixed Haar measure and let be the associated symmetric space. A classical theorem of Wang [W] asserts that if is not locally isomorphic to or , then for every there exist only finitely many Riemannian orbifolds covered by with volume at most . Let (resp. ) denotes the number of conjugacy classes of lattices (resp. arithmetic lattices) in of covolume at most . By Wang’s theorem, if not locally or , then is finite for every . This is also true for even for or by a theorem of Borel [Bo2].
In recent years there has been a growing interest in the asymptotic behavior of these functions (cf. [BGLM], [G1], [G2], [GLNP], [B], [BGLS], [BLu], [BLi], and also [SG] for the positive characteristic case). Super-exponential upper bounds were given in many cases, bounds which are optimal at least for the rank one groups . But for higher rank Lie groups the growth rate of the number of lattices in much slower as it is shown in [BLu] and [SG].
Recall that if has -rank, then by Margulis’s arithmeticity theorem every lattice in is arithmetic, i.e. there exists a number field with ring of integers and the set of archimedean valuations , an absolutely simple, simply connected -group and an epimorphism , such that is compact and is commensurable with (see [M, Theorem 1, p. 2]). Thus for groups of real rank at least , we have . Moreover, Serre conjectured ([S]) that for all lattices in such , has the congruence subgroup property (CSP), i.e. is finite in the notations above. Serre’s conjecture is known by now for most arithmetic groups and, in particular, for all non-uniform lattices (see [PlR, Chapter 9]). Hence the question of counting (non-uniform) lattices in boils down to counting maximal arithmetic groups and their congruence subgroups. Maximal arithmetic subgroups were counted in [B] and very precise estimates for the number of congruence subgroups in a given lattice were obtained in [L], [GLP] and [LN], some of them are conditional on the generalized Riemann hypothesis (GRH). Even before these results, it was conjectured in [BGLM] that for groups of real rank at least the counting function grows like . In fact, a more precise conjecture was made in [GLNP], where it is suggested that
[TABLE]
[TABLE]
where is the ratio of the order of the set of positive roots of the (absolute) root system corresponding to and the rank of the root system.
In [BLu] we proved that in general the conjecture is false and the correct rate of growth is . The purpose of this paper is to show that the conjecture is still true if one restricts to non-uniform lattices. In a general setting our results depend on some widely believed number theoretic conjectures, but for “most” cases they are proved unconditionally.
For the main theorem of the paper, we assume that if is a split form of , then the center of the simply connected cover of is a -group and has no outer automorphism of order three. This is the case for most ’s. In fact, this assumption says that is not of type or , and if it is of type , then is of the form for some . We will call such simple Lie groups -generic.
Theorem 1**.**
For a -generic simple Lie group of real rank at least , we have
[TABLE]
where is as in (1.2) and is the number of conjugacy classes of non-uniform lattices in of covolume at most .
The theorem, combined with [BLu], says in particular that there are “many more” uniform lattices than non-uniform ones. This is a characteristic zero phenomenon — in positive characteristic the growth of the two types are similar (at least modulo some well established conjectures and independently in “most” cases). We refer to [SG] for more on the positive characteristic case.
The proof of Theorem 1 uses Gauss’s Theorem which gives us a bound for the -rank of the class groups of quadratic extensions of , the field of rational numbers. In order to be able to extend Theorem 1 to all simple groups we would need similar bounds for the -ranks of the class groups of number fields for the primes . In fact, we show that it is essentially equivalent to such bounds — see Section 7. Unfortunately, with the current knowledge in number theory, such bounds seem to be out of reach. It is interesting to note that if one could prove Theorem 1 (or even a weaker form of it) by geometric methods this would have deep number theoretic consequences. (See Section 3 for a further discussion.)
The proof of the theorem employs and develops the methods from [B], [GLP] and [LN] (see also [GLNP]). In particular, we need to show that the error terms in the results that we use from these papers do not depend on the choice of the base lattice. We would like to point out that unlike some of the results in [GLP] and [LN], Theorem 1 does not depend on the GRH — the Generalized Riemann Hypothesis (although the extension to some semisimple groups will still require such an assumption; see Section 7).
The lower bound of Theorem 1 is proved in Section 5 by using the methods of [GLP] and [LN]. We can avoid the assumption of the GRH imposed there by choosing suitable lattices for which Bombieri–Vinogradov “Riemann hypothesis on the average” gives results which are as good for us as the GRH (see Section 5 below). These methods provide sufficiently many congruence subgroups (with the appropriate rate of growth) in the chosen arithmetic lattices. We then use the results of [BLu, Section 5] to ensure that not too many of them are conjugate in .
In Section 6 we prove the upper bound of Theorem 1. This involves estimating the error term in the upper bound in [LN]. Besides new difficulties with the “subgroup growth” methods, here one has to overcome the subtle issue with the -rank of the class groups mentioned above. This upper bound is the main novel result of the paper.
In the final Section 7 we discuss the extension of the main results to the non-uniform lattices in semisimple Lie groups and their relation to the number theoretic conjectures which were mentioned above.
2. Notations and conventions
Let be a semisimple Lie group without compact factors. A subgroup of is called a lattice if is discrete in and its covolume (with respect to some and hence any Haar measure on ) is finite. A lattice is called irreducible if is dense in for every non-compact closed normal subgroup of . A lattice is called uniform (resp. non-uniform) if is compact (resp. non-compact).
Two subgroups and are called commensurable if is of finite index in both of them. If is a lattice in , its commensurability subgroup (or commensurator) in is defined as
[TABLE]
For a finite group (resp. profinite group) we define its rank as the supremum of the minimal number of generators over the subgroups (resp. open subgroups) of . If is a prime and is a finite group, the -rank of is defined by , where is a Sylow -subgroup of .
Along the lines we shall often come to arithmetic considerations, for which we now fix some notations. Throughout this paper will always denote a number field, is its ring of integers, is the absolute value of the discriminant and is the class number of . The set of valuations (places) of , , is the union of the set of archimedean and the set of nonarchimedean (finite) places of . The number of archimedean places of is denoted by , and , denote the number of real and complex places of , respectively (so and ). Given a nonarchimedean place , the completion of with respect to is a nonarchimedean local field , its residue field, which will be denoted by or , is a finite field of cardinality . Finally, is the ring of adèles of , where denotes a restricted product.
All logarithms in this paper will be taken in base . For a real number , denotes the largest integer . The number of elements of a finite set will be denoted by , while the order of a finite group will be denoted by .
Whenever it is not stated otherwise, the constants , , etc. depend only on the Lie group .
3. Number theoretic background
Our problem of counting arithmetic lattices turns out to be intimately connected with estimating the rank of class groups. The reader is encouraged to take a look at Proposition 7.3 to get a first hint on the connection. So let us start here with some results and conjectures on class groups.
Let be the class number of the number field , which is defined as the order of the class group . Let denote the -torsion subgroup of , which consists of the elements of the class group whose orders divide . We denote by the order of , so when is a prime.
Theorem 3.1**.**
(Gauss, see [BS, Theorem 8, p. 247])* Let be a quadratic number field with discriminant . Suppose that has distinct prime divisors. Then*
[TABLE]
In fact, we do not need the exact formulation of Gauss’s result but rather its corollary:
Corollary 3.2**.**
For running over the quadratic number fields, we have
[TABLE]
The corollary follows from the theorem by recalling the prime number theorem, which implies that the number of different prime divisors of is .
Gauss proved his celebrated theorem using the genus theory which he developed. Later on the method was applied to prove a similar result for biquadratic extensions of (see [C, Theorem 2]). We use these results in the proof of Theorem 1; the main restriction on the type of which we impose there follows from the fact that in order for the genus theory to be applicable we need to assume that the center of the simply connected cover of the split form of is a -group. In order to extend the theorem to other types we will require somewhat similar estimates for for .
Apparently, even though related questions were extensively studied, very little is known about the -ranks, for , of class groups of quadratic extensions and the ranks of class groups of extensions of higher degree. We refer to [EV] for some recent results and a review of the status of the problem. The “folk” conjecture which appeared in several sources states that for a fixed prime the -part of the class group of number fields of a fixed degree grows slower than any power of (see [EV, Section 1.2]). What we need is a stronger statement:
Conjecture 3.3.A**.**
Fix an integer and a prime . Then for number fields of degree , .
For a future reference we will also formulate a slightly weaker conjecture:
Conjecture 3.3.B**.**
In the notations of Conjecture 3.3.A, .
Let us note that a closely related statement to Conjecture 3.3.B appears as a question in [BrS, p. 96]: Brumer and Silverman asked if there exists a constant depending only on and such that .
When we will prove Theorem 1 in Section 6, we will use Corollary 3.2 of Gauss’s theorem but a slightly weaker estimate as in Conjecture 3.3.A would suffice. We will see in Section 7 that proving Conjecture 3.3.A for quadratic and biquadratic fields would imply Theorem 1 for all simple Lie groups, and proving Theorem 1 for all simple groups would imply Conjecture 3.3.B for quadratic imaginary fields and some biquadratic fields. Proving it for all semisimple groups (with non-uniform lattices) would imply Conjecture 3.3.B for all number fields and primes (see Section 7). So, these results give some support for the conjectures.
The -ranks of the class groups and, in particular, the -ranks of the class groups of quadratic number fields are subject of the work of Cohen and Lenstra [CL]. Heuristic assumptions introduced in [CL] allowed them to make striking predictions about the average values of the ranks. Let us mention that although our conjectures refer to the same object, they neither imply nor follow from the Cohen–Lenstra heuristics — the latter deal with the averages while our conjectures refer to the extreme values of the ranks of the class groups.
4. Arithmetic subgroups
Let be a semisimple connected linear Lie group without compact factors. It is known that if contains irreducible lattices then all of its simple factors are of the same type. Such groups are called isotypic or typewise homogeneous (see [M, Chapter 9.4]). So from now on we shall assume that is isotypic. Moreover, without loss of generality we can further assume that the center of is trivial. This implies that is isomorphic to , where denotes, as usual, the adjoint representation. The group is the connected component of identity of the -points of a semisimple algebraic -group. There exist, therefore, absolutely simple -groups , all of the same type, such that A classical theorem of Borel [Bo1] (see also [BH]) asserts that such does contain irreducible lattices.
A word of warning: there are cases in which contains uniform irreducible lattices but has no such a non-uniform lattice. If is simple non-compact it has both uniform and non-uniform arithmetic lattices. We refer to [Mo2, Chapter 18.7] for a discussion of this issue.
Let now be an algebraic group defined over a number field which admits an epimorphism whose kernel is compact. In this case, is an irreducible lattice in . Such lattices and the subgroups of which are commensurable with them are called arithmetic. It can be shown that to define all irreducible arithmetic lattices in it is enough to consider only simply connected, absolutely almost simple -groups which have the same (absolute) type as the almost simple factors of and are defined over the fields with at most complex and at least real places. We shall call such groups and corresponding fields admissible.
Let us recall now a fact which is crucial for this paper and explains why the results here are so different from those in [BLu]: If is a non-uniform arithmetic lattice in , then its field of definition is of bounded degree over with a bound depending only on . This follows from the well known result that the quotient space is non-compact if and only if contains non-trivial unipotent elements (see [Mo2, Chapter 5.3]) and hence non of the factors of is compact, which implies that the number of archimedean completions of is bounded by the number of simple factors of and so is bounded.
The arithmetic subgroups of the semisimple Lie group can be also described by the following construction which we are going to use throughout the paper. Let be a collection of parahoric subgroups of a simply connected -group . The family is called coherent if is an open subgroup of the adèle group . Now let
[TABLE]
where is a coherent collection. Following [P], we shall call the principal arithmetic subgroup associated to . We shall also call a principal arithmetic subgroup of .
Let now be a maximal arithmetic lattice in . It is known that can be obtained as a normalizer in of the image of some principal arithmetic subgroup of (see [BP, Proposition 1.4(iv)]). Moreover, such is a principal arithmetic subgroup of maximal type in a sense of Rohlfs (see [Ro] and also [CR] for precise definitions). In order to prove the main theorem we will need certain control over the structure of and the index in terms of the covolume of . For this purpose we recall some results from [B]. As it is explained there, the group is always abelian and the prime divisors of its order are contained in a finite set which depends only on .
Let , where , , be a maximal arithmetic lattice of covolume less than , with large enough.
Proposition 4.1**.**
[B, Corollaries 6.1, 6.3]** There exists a constant such that for we have:
- (i)
;
- (ii)
If is non-uniform and is -generic, then .
Remark 4.2**.**
The groups that we excluded in Part (ii) of the proposition are those for which the center of the simply connected form is not a -group or , the last would require considering the class groups of cubic fields. If we could prove Conjecture 3.3.A, then the argument from [B] would allow us to prove a slightly weaker form of Proposition 4.1(ii) for non-uniform lattices in an arbitrary semisimple group . More precisely, it would imply that which is sufficient for our purpose.
We will need a variant of the ”level versus index” lemma where the level is controlled by the covolume of the lattice. To put it in a perspective, recall the classical lemma asserting that in , every congruence subgroup of index contains for some , i.e. the level is at most the index . This was generalized in [L] to the congruence subgroups of an arbitrary arithmetic group by paying a price for ; i.e. it was shown that for some constant which depends on the arithmetic group . Here we want to bound in terms of the covolume of .
Let us first introduce some notations. As before, let where is a number field with the ring of integers , is a -form of and is a parahoric subgroup of , and let be an -scheme with the generic fiber isomorphic to such that . This induces a congruence subgroup structure on defined as follows:
[TABLE]
where is a uniformizer of . These congruence subgroups induce a congruence structure on , . More generally, for every ideal of look at its closure in . Then is equal to for some and . We then define the -congruence subgroup of ,
[TABLE]
In particular, for every , the -congruence subgroup is defined. Any subgroup of which contains for some non-zero ideal is called a congruence subgroup.
Let now be a principal arithmetic subgroup of a maximal type in and let be its image in . Assume also that , where . We have the following effective level versus index lemma proved in [BLu]:
Lemma 4.3**.**
[BLu, Lemma 4.3]** If is a congruence subgroup of of index , then where with and is a constant which depends only on .
Note that for a general lattice of , obtained from a principal arithmetic subgroup as before, the index of in (and hence also of in ) is not necessarily polynomial in . It is bounded by , where is the degree of the defining field of the arithmetic subgroup . As it is explained in [BLu], in general the degree is bounded by , and hence the index of in is bounded by . A better result is probably true: for some such that with a constant depending only on . This indeed follows from Lemma 4.3 if the degree of the field is bounded, which is always the case for non-uniform lattices:
Corollary 4.4**.**
In the notation above, if is a principal non-uniform arithmetic lattice in of covolume at most and is a congruence subgroup of of index , then with and , where the constants , depend only on .
5. Proof of the lower bound
The proof of the lower bound of Theorem 1 depends on the lower bound of the following result:
Theorem 5.1**.**
([GLP], [LN])* Let be a number field, an absolutely simple, connected, simply connected -group with a fixed -embedding and let , where is the ring of integers of . Denote by the number of congruence subgroups of of index at most .*
Then, assuming the Generalized Riemann Hypothesis (GRH),
[TABLE]
where with , is the set of positive roots of and is its absolute rank.
The same result holds unconditionally if the quasi-split inner form of splits over some abelian extension of .
Remark 5.2**.**
For our purposes we need also the following observation concerning the proof in [GLP, Section 4]: The proof of the lower bound provides the required number of congruence subgroups of index at most in the preimage of in , where is a carefully chosen set of rational primes which split completely in , is a maximal ideal of which lies over , and is a Borel subgroup of (see [GLP, p. 87] for details). Moreover, is bounded polynomially by and so is the order of . As all these index subgroups contain the principal congruence subgroup , we will be able to apply to them later Corollary 5.3 from [BLu], which implies that the number of such subgroups which are mutually conjugate in is bounded above by a polynomial of .
Another result which we shall use is:
Proposition 5.3**.**
([Mo1, Proposition 6.1], [PrR2, Proposition 3])* Let be an absolutely simple, simply connected algebraic -group. Then there exists a -group such that:*
- (1)
* over ;*
- (2)
* splits over ;*
- (3)
* is quasi-split over , for every odd prime ;*
- (4)
-rank = -rank.
Let be a non-compact simple Lie group, so for some simple algebraic group defined over . If is absolutely simple, we call the group real, and otherwise we call it complex. In the second case, up to isogeny, and for a complex group .
Assume first that is a real simple Lie group. Then (up to the center and connected component) is equal to for some -group as in Proposition 5.3. If splits over then, since is a simple Lie group, is absolutely simple. If does not split over , it is a restriction of scalars from to of an absolutely simple split -group . In either case we can apply Theorem 5.1 unconditionally of the GRH by taking : In the first case is absolutely simple, and in the second case , where is absolutely simple and is an abelian extension. We conclude that
[TABLE]
A crucial point for us is that depends only on the absolute type of which is completely determined by .
If is complex, then we can take to be a split -group such that . We automatically obtain -rank = -rank. As is absolutely simple, we can take , which is a lattice in , and again Theorem 5.1 applies unconditionally to .
To finish the proof of the lower bound of Theorem 1, we now treat both cases together. The subgroup is a principal arithmetic subgroup which defines a lattice in which we denote by the same letter. This lattice is non-uniform since -rank = -rank, as is non-compact (see [Mo2, Chapter 2]). Let , so every index subgroup of gives a lattice of covolume in . Remark 5.2 and [BLu, Corollary 5.3] are now combined to show that among the index subgroups of , which give the lower bound of Theorem 5.1, only polynomially many (in or, equivalently, in ) are in the same -conjugacy class, where is the adjoint form of (if needed, one can replace by a commensurable subgroup which satisfies the assumptions of Proposition 5.2 from [BLu], i.e., all the associated with it are maximal; we can then apply Corollary 5.3 of [BLu] for our case). By the discussion in [BLu, Section 5] it follows that the same lower bound applies also when we count the lattices up to -conjugacy, and the lower bound of Theorem 1 is proven. ∎
6. Proof of the upper bound
As in [BLu], the proof of the upper bound makes an essential use of two ingredients:
- (a)
Counting maximal arithmetic lattices ([B] which in turn is greatly influenced by [BP]); and
- (b)
Counting congruence subgroups of arithmetic groups ([LN] and [GLNP]).
The main challenge here is that the bound in Theorem 1 requires finer counting than in [BLu], where the upper bound grows much faster.
Let us recall the main result of [B] which we are going to use in this section (see also [BGLS, Theorem 1.6] for the semisimple groups of type ):
Theorem 6.1**.**
Let be a semisimple Lie group of real rank without compact factors. Denote by (resp. ) the number of conjugacy classes of maximal irreducible uniform (resp. non-uniform) lattices in of covolume at most . Then:
- (i)
For every , there exists such that for every .
- (ii)
There exists a constant such that for every .
We shall count the lattices of covolume at most by first counting the maximal ones (the number of which is small by Theorem 6.1), and then counting finite index subgroups within such maximal lattices. We will divide the proof into several steps:
Step 1**.**
Since the result of the main theorem does not depend on the normalization of the Haar measure on , for the sake of convenience we will fix so that for every lattice . This is possible by Wang’s theorem mentioned in the introduction (in fact, by an earlier result of Kazhdan–Margulis, giving a positive lower bound for the covolumes of lattices in — see [Ra, Chapter XI]).
The proof of the upper bound in Theorem 1 starts in a similar way to the proof of the upper bound in [BLu] and we shall use the same notations as there. There is still a crucial difference: if is a non-uniform arithmetic lattice in then, as explained in Section 4, its field of definition is of bounded degree over . This is the reason why we get a lower rate of growth. This is so for every semisimple group . If is simple as we assume here, we even have .
Step 2**.**
In analogous to the counting function considered in [BLu, Section 7], we have
[TABLE]
where now runs over the maximal non-uniform lattices in (the number of which grows polynomially by Theorem 6.1(ii)) and denotes the number of subgroups of of index at most . So our main goal in the rest of the proof is to bound the second term of the right hand side of inequality (6.1).
Step 3**.**
Let , , where and is the ring of integers in a number field (see Section 4). We endow with the congruence structure induced from . As is non-uniform, satisfies the congruence subgroup property, so we need to count only congruence subgroups. To be precise, one should say that satisfies the weak congruence subgroup property, i.e. is finite. So, if this kernel is non-trivial there are also some non-congruence subgroups. But we also know from the precise calculation of this congruence kernel in [PrR1] that if is bounded, then is bounded. This implies that every finite index subgroup is of bounded index in its congruence closure , and the map has bounded fibers. Hence for the sake of proving Theorem 1, it suffices to count only the congruence subgroups, as we will do in the remaining part of this section.
Step 4**.**
Using Corollary 4.4 (“level versus index”) we can estimate from above:
[TABLE]
Step 5**.**
Now, we recall some results on counting congruence subgroups from [GLP] and [LN]. Consider the exact sequence
[TABLE]
where , …, are the different prime divisors of .
By [GLP, Corollary 5.2],
[TABLE]
where is a constant which does not depend on but only on . We remark that in [GLP] the group was assumed to be split, but this assumption was not really needed for the proof of Corollary 5.2 which is based on Lemma 5.1 there, and the only critical issue there is that is solvable (in fact, even nilpotent) group.
Thus, the crucial factor to bound is .
Step 6**.**
From this point onward we can follow the proof of the upper bound of Theorem 2(A) in [LN] showing that , where . The proof of Theorem 2(A) there is given for a fixed and a fixed arithmetic group .
Step 7**.**
*We claim that when is a number field of bounded degree and runs over principal arithmetic lattices in a fixed group , the result is still valid with the same for all these lattices. *
The proof in [LN] is long and quite complicated, so we will not repeat it here. Let us only outline the main strategy, elaborating on one point which needs a careful discussion to ensure that the error term does not depend on .
The proof on pages 110–122 of [LN] applies the Larsen–Pink theorem and a detailed analysis of the structure of parabolic subgroups of finite simple groups to deduce that the main contribution to the subgroup counting of comes from the abelian sections , where is a Borel subgroup and is its unipotent radical. In fact, we can even concentrate on the cases where splits. In this case is of index and the abelian group is of order . (This is the reason why plays such an important role and is the basis for the computation of .)
There is however one point which requires a careful discussion when adapting the proof in [LN] to our “uniform” result: In [LN], one works with one group at a time, so it was possible to ignore finitely many “bad primes” which have no importance for the result there but we should check that they do not affect the uniform upper bound. Recall that to each nonarchimedean place we have an associated parahoric subgroup (see Section 4). Similar to [B, Section 4.4], there are three types of bad primes which correspond to the places that satisfy one of the following conditions:
- (i)
the parahoric subgroup is not hyperspecial and splits over the maximal unramified extension of ;
- (ii)
the group is not quasi-split over and splits over ;
- (iii)
the quasi-split inner form of is not split over .
By [B, Section 4.4], the total number of bad primes is bounded by but this bound is not sufficient to ensure, by a naive counting argument, that these primes are insignificant and a more careful analysis is needed.
Let us first consider an illustrative example:
Example 6.2**.**
Let be a -defined quaternion algebra and an order in . Then is an arithmetic lattice in (for a non commutative ring , we define as the set of the invertible matrices in with the reduced norm , cf. [PlR, Section 2.3.1]). If splits over , then and is, say, and we get which has no bad primes. But in the general case there is a finite set of primes for which ramifies. For these primes is a division algebra with residue degree and ramification index over , and one deduces that is also a division algebra, but as every division algebra over a finite field is a field, one sees that . It follows that the semisimple part of in this case is instead of which is the case when splits. This could cause a difficulty (note that !). But fortunately this is not the case: a careful analysis of Prasad’s volume formula shows that such bad primes increase the covolume of the given lattice, and hence decreases its contribution to the lattice growth.
Step 8**.**
We now come back to the general case. Recall the function which was defined in [LN, p. 108] by where is a subgroup of and denotes the maximal abelian quotient of whose order is coprime to . The main point of the proof of the upper bound in [LN] is that the larger is, the smaller is the contribution of to the subgroup growth, and the main technical result there is Theorem 4 (p. 109) asserting that
[TABLE]
We need to ensure that the same holds true if we allow the group to vary, when the contribution to the lattice growth should be with respect to the covolume, so let us modify the definition of to be
[TABLE]
Here the group is determined by the structure of over the corresponding place of . It is equal to for the good primes and for the bad primes is defined depending on the type (see Steps 9–11 below). The factor compensates for the covolume increase contributed by the bad primes: for almost all places the group is quasi-split over and is a hyperspecial parahoric subgroup — for all these places we have ; now for the bad primes the -factor is determined by the ratio of the volume of a hyperspecial parahoric subgroup in a quasi-spit group of the same type as over and the volume of with respect to the Haar measure from [P, Sections 1.3, 2.1]. It follows from Prasad’s formula that for the principal arithmetic lattices the factors are given by , where is a simply connected quasisimple group of the same Lie type as defined over the finite field .
We have to consider for the three types of bad primes defined above. As in [LN] we will restrict to the places of with the residue characteristic . Since the degree of is bounded this assumption will not affect the growth function.
Step 9**.**
Type (i): The group splits over the maximal unramified extension of and is not a hyperspecial parahoric subgroup. Then assuming as in Section 4 that , we have , and , and therefore
[TABLE]
Hence the problem reduces to the two other types of primes.
Step 10**.**
Type (ii): Here the group is not quasi-split over and splits over an unramified extension of . We have , where is the residue field of (in our example and ). In the notation of [P, Section 2.2] (see also [BLu, Section 4.3]) the -factor is given by
[TABLE]
The reductive group associated to the quasi-split inner form of is in fact absolutely quasi-simple (see [P, Section 2.5]), so its order over can be obtained from the table of orders of finite groups of Lie type given in [On, Table 1].
In our Example 6.2 we have and the group can be identified using the Bruhat–Tits theory; it is the product of the -dimensional norm- torus and the semisimple group whose maximal -torus has dimension over (we refer the reader to [T] for a comprehensive survey of the Bruhat–Tits theory of reductive groups over nonarchimedean local fields).
It follows that the second factor in the product for is less than and bounded below by , where is the absolute rank of (indeed, it tends to when ). Moreover, we have (see [P, Section 2.6 and Lemma 2.8]). Therefore
[TABLE]
Now, and , where is the set of positive roots of (note that the dimensions of the maximal -tori in and are equal). Hence we obtain , and
[TABLE]
As in type (i), we can choose a suitable parahoric subgroup and with a computation similar to (6.4) reduce the problem to the case . Now a small modification of the proof of Proposition 3 in [LN] implies that for large enough the function attains its minimum on the Borel subgroup of , for which we have and . It follows that
[TABLE]
It is important to note here that this bound is uniform in the lattice , i.e. the rate of convergence depends only on the Lie type of . This indeed follows from the proofs of Propositions 2 and 3 in [LN].
Step 11**.**
Type (iii): Finally consider the case when is not split over . Again as in type (i) a computation similar to (6.4) allows us to choose a suitable parahoric subgroup and assume , moreover, here because the extension over which the quasi-split inner form of splits is ramified over . Now Prasad’s formula implies that for this type of primes we have with the constant defined in [P, Section 0.4] (cf. [B, Section 4.4]). From this one deduces:
[TABLE]
where . Indeed, the second inequality follows immediately from [LN, Theorem 4] and the fact that , and as in type (ii) this bound is uniform in the lattice .
If the quasi-split inner form of does not split over an unramified extension of then is an outer form over . The types which admit outer forms together with the corresponding invariants are listed in Table 1. For the remaining types , , , , , we have , , , , , , respectively. The table values for are provided by [P, Section 0.4], the constant is easily computed from its definition, and the information about the type of follows from [T, Section 4]. We can now check that in all the cases we have .
With this modification at hand the rest of the proof in [LN] indeed gives us the desired uniform upper bound.
Step 12**.**
We now move from to of Step 3. To this end note that and, again using [GLP, Corollary 5.2], what we really need to count is where is a product of prime ideals in . So fix and let
[TABLE]
By Corollary 4.4 we can assume that with , and as the degree of the field is bounded it follows that is polynomially bounded in and hence in . By Proposition 4.1, is a finite group of order bounded by for a constant . Together with the previous remark, it implies that is polynomially bounded in . Moreover, a prime can divide the order of only if divides the order of the center of the simply connected cover of the split form of or if it divides the order of the automorphism group of the local Dynkin diagram of , where is an admissible group as in Section 4 (this can be deduced from [BP, Proposition 2.9] which is essentially due to Rohlfs [Ro]). So only finitely many primes can appear as the divisors (for a given ).
If is a subgroup of of index at most , then is of index at most in . As we already counted , we can assume that is given and estimate the number of possibilities for . For such a group , , so the prime divisors of are among . It follows that is generated by and subgroups , where each is an -Sylow subgroup of . Each subgroup is contained in some , where is an -Sylow subgroup of . So, in conclusion, such is generated by and by and we assume that is fixed. For a fixed , the number of -Sylows of is at most , which is polynomial in , so the total number of such -tuples is polynomial in (as is bounded, depending only on ). Given such a -tuple , as above is determined by . Now, each contains , i.e., the number of possibilities for is bounded by the number of subgroups of . The latter group is a subgroup of , whose order is at most . Hence the total number of subgroups of , and in particular those of the form , is bounded by (as the group of size has at most subgroups, cf. [LS, Lemma 1.2.2]). So, in summary, it follows that the total number of possible subgroups is bounded by with the constant depending only on . The second factor is asymptotically smaller than , and we conclude that
[TABLE]
This finishes the proof of Theorem 1. ∎
7. The GRH, rank of class groups and counting lattices
In this section we are going to discuss how to extend Theorem 1 to other simple and also semisimple Lie groups and its relation to some number theoretic conjectures.
We begin with the lower bound. First let us note that the lower bound in Theorem 1 is true unconditionally for every (non-compact) simple Lie group, including the non -generic ones. Let us discuss its extension to semisimple Lie groups. Given such a group , it is natural to consider only irreducible lattices in , so from now on, denotes the number of conjugacy classes of irreducible lattices in of covolume at most . The same refers to , and other notations from Section 1. We recall (see Section 4) that contains irreducible lattices only if it is isotypic, and that we can assume that for some absolutely simple -groups , . Recall also that in contrast with the case of the uniform lattices, the isotypic condition is not sufficient for having a non-uniform irreducible lattice (see [Mo2, Example 18.7.7]).
In the proof of the lower bound of Theorem 1 we showed that if is a high rank simple Lie group then
[TABLE]
We did so by presenting an arithmetic lattice in which is defined over , and appealing to [GLP] where a lower bound is given on the number of congruence subgroups of such a lattice . The results in [GLP], in the most general form, rely on the generalized Riemann hypothesis (GRH). To prove the theorem for simple Lie groups the GRH is not needed since and the Bombieri–Vinogradov Riemann hypothesis on the average suffices — see [GLP]. The same is true if
* is a number field contained in a Galois field over , such that has an abelian subgroup of index *
Unfortunately, not every semisimple group admits a non-uniform irreducible lattice defined over a field which satisfies (even if admits non-uniform irreducible lattices). As we now show, provides an example of such a group.
First note that if satisfies then is solvable. To define a non-uniform lattice in we need a number field with real and complex places, so is an odd prime. The following lemma, which is due to Peter Müller and was communicated to us by Moshe Jarden, implies that condition never holds for such fields :
Lemma 7.1**.**
If is an odd prime and , then there is no number field with
- (1)
exactly real and complex places;
- (2)
solvable , where is the Galois closure of over .
Proof.
Assume is a field of degree which satisfies conditions (1) and (2). Choose a primitive element for and let be its irreducible polynomial over (so ). Let denote the set of roots of in , so by the assumption and . As , there is at least one real root and not all roots are real. The group acts faithfully and transitively on . Since is a prime, is primitive group, and it is solvable by the assumption. Let be a minimal normal subgroup of . Then , and G is isomorphic as a permutation group to a subgroup of the affine general linear group acting on (see [FJ, Lemma 21.7.2]). Thus every element of fixes exactly one element of . In particular, if is an involution, then (since and ). So fixes exactly one element of . This applies to all real involutions in , hence and so , which is a contradiction. ∎
It follows that in order to extend our proof of the lower bound in Theorem 1 to semisimple groups we need to assume the GRH. This is the only obstacle, if we assume the GRH, we can carry on the proof of the lower bound in Section 5, without any change, for every semisimple Lie group , provided has a non-uniform irreducible lattice. In summary, we have:
Theorem 7.2**.**
Let be a semisimple Lie group of real rank at least which contains a non-uniform irreducible lattice. Then, assuming the GRH, we have
[TABLE]
where is defined by (1.2) applied to (any) of the simple factors of .
Let us move to the upper bound. Here there is an issue to discuss even for the case of general (i.e. not -generic) simple Lie group. The assumption imposed on the type of in Theorem 1 to be -generic is used only for the bound of the order of the quotient group , which is provided by Proposition 4.1(ii) whose proof in [B] uses Gauss’s Theorem 3.1. By Remark 4.2, this argument would work for every simple Lie group, and even for general semisimple groups, if we would know Conjecture 3.3.A. We will now show that a partial converse is also true, namely, we will prove that if Theorem 1 holds for semisimple Lie groups of the form , then Conjecture 3.3.B is true for all number fields with real and complex places and any odd prime .
We first establish a supplementary result:
Proposition 7.3**.**
Let be a number field, , and . If is odd then there exists an epimorphism
[TABLE]
Proof.
The proof is based on some well known results in ring theory.
Let . Recall that by a theorem of Rosenberg and Zelinsky [RZ], we have
[TABLE]
An element induces an automorphism of the matrix algebra and, moreover, if , then (this follows from the fact that is the -module spanned by ). Therefore, we have a homomorphism defined by . Combining it with the natural epimorphism , we get
[TABLE]
Hence there is a homomorphism .
We want to show that is surjective. Any automorphism of extends to an automorphism of which we denote by the same letter. By the Skolem–Noether theorem, every automorphism of is inner, so there exists an invertible element such that for every , Let . As is odd, we can choose the value of the root so that . Hence for every , . This defines an element of associated to . As is an arbitrary automorphism of , this shows that , and hence , is surjective. Note that the choice of the -th root of which is involved in the construction of the preimage of does not allow us to claim that the inverse map would be a group homomorphism.
We proved that there exists an epimorphism and it remains to apply the Rosenberg–Zelinsky theorem. ∎
Remark 7.4**.**
The kernel of consists of those elements of which come from the center of , i.e. .
We now show that if Theorem 1 holds for all of the form for all and all , then Conjecture 3.3.B is true for all number fields and any odd prime .
Let be a number field and let be a corresponding principal arithmetic subgroup of . Then is a non-uniform lattice in . The covolume of is given by Harder’s Gauss–Bonnet formula (see [H, Section 2.2]):
[TABLE]
(Here we use the normalization of from [P], the same result can be also obtained by Prasad’s volume formula given there. The function , which appears in the second product, is the Dedekind zeta function of the field .)
This implies that there exist positive constants , which depend only on , such that
[TABLE]
Indeed, we can take and then compute and from (7.1) using the basic fact that , where is the Riemann zeta function.
Now let us assume that Theorem 1 is true for but Conjecture 3.3.B is false for the fields of signature and some prime . So for any (large) number , there exists such a field with , and thus has at least subgroups (by [LS, Proposition 1.5.2]).
By Proposition 7.3, admits an epimorphism onto where , and . Let and let . We have:
[TABLE]
This gives a lower bound for the number of lattices between and . If two such lattices and are conjugate by an element , then maps to : Indeed, as is nilpotent and , is perfect (which can be checked, for example, by looking at the Steinberg relations defining it), is the unique maximal normal perfect subgroup of both and and hence takes it to itself, i.e. . Now, as both and contain and is abelian, we have . It follows that for ,
[TABLE]
Hence we obtain
[TABLE]
and using (7.2),
[TABLE]
As can be chosen arbitrary large this contradicts the assumption that Theorem 1 holds for .
In summary, we obtain:
Theorem 7.5**.**
- (i)
If Conjecture 3.3.A is true, then for any semisimple Lie group of real rank at least we have
[TABLE]
- (ii)
If the bound in (i) holds for for every and all and , then Conjecture 3.3.B is true for all number fields and all odd primes .
It is possible to elaborate further on the relation between Theorem 1 and Conjectures 3.3, in particular, Part (ii) of Theorem 7.5 can be extended to other semisimple groups and prime , at least for totally imaginary fields. We shall not do it here. The main purpose of Theorem 7.5 is to highlight the intimate connection between counting non-uniform lattices and the class groups of fields.
Acknowledgements. The authors would like to thank N. Nikolov for sharing with us his knowledge about subgroup growth of lattices and valuable comments on the preliminary version of the paper. We also thank T. Gelander, G. Prasad and A. Rapinchuk for helpful discussions. We are grateful to M. Jarden and P. Müller for providing a proof of Lemma 7.1 and we thank J. Tsimerman for the reference to the paper by Brumer and Silverman.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[B] M. Belolipetsky, Counting maximal arithmetic subgroups (with an appendix by J. Ellenberg and A. Venkatesh), Duke Math. J. 140 (2007) 1–33.
- 2[BGLS] M. Belolipetsky, T. Gelander, A. Lubotzky, A. Shalev, Counting arithmetic lattices and surfaces, Ann. of Math. (2) 172 (2010) 2197–2221.
- 3[B Li] M. Belolipetsky, B. Linowitz, Counting isospectral manifolds, Adv. Math. 321 (2017), 69–79.
- 4[B Lu] M. Belolipetsky, A. Lubotzky, Manifolds counting and class field towers, Adv. Math. 229 (2012) 3123–3146.
- 5[Bo 1] A. Borel, Compact Clifford–Klein forms of symmetric spaces, Topology 2 (1963) 111–122.
- 6[Bo 2] A. Borel, Commensurability classes and volumes of hyperbolic 3-manifolds, Ann. Scuola Norm. Sup. Pisa (4) 8 (1981) 1–33.
- 7[BH] A. Borel, G. Harder, Existence of discrete cocompact subgroups of reductive groups over local fields, J. Reine Angew. Math. 298 (1978) 53–64.
- 8[BP] A. Borel, G. Prasad, Finiteness theorems for discrete subgroups of bounded covolume in semi-simple groups, Inst. Hautes Études Sci. Publ. Math. 69 (1989) 119–171. Addendum: ibid., 71 (1990) 173–177.
