Counting primes, groups, and manifolds

  1. Dorian Goldfeld*,
  2. Alexander Lubotzky,,
  3. Nikolay Nikolov§, and
  4. László Pyber
  1. *Department of Mathematics, Columbia University, New York, NY 10027; Einstein Institute of Mathematics, Hebrew University, Jerusalem 91904, Israel; §Tata Institute for Fundamental Research, Colaba, Mumbai 400005, India; and A. Rényi Institute of Mathematics, Reáltanoda u. 13-15, H-1053, Budapest, Hungary
  1. Communicated by Hyman Bass, University of Michigan, Ann Arbor, July 9, 2004 (received for review April 1, 2004)

Abstract

Let Formula be the modular group and let cn(Λ) be the number of congruence subgroups of Λ of index at most n. We prove that Formula. The proof is based on the Bombieri–Vinogradov “Riemann hypothesis on the average” and on the solution of a new type of extremal problem in combinatorial number theory. Similar surprisingly sharp estimates are obtained for the subgroup growth of lattices in higher rank semisimple Lie groups. If G is such a Lie group and Γ is an irreducible lattice of G it turns out that the subgroup growth of Γ is independent of the lattice and depends only on the Lie type of the direct factors of G. It can be calculated easily from the root system. The most general case of this result relies on the Generalized Riemann Hypothesis, but many special cases are unconditional. The proofs use techniques from number theory, algebraic groups, finite group theory, and combinatorics.

In this announcement we present several results about counting primes, counting groups, and counting Riemmanian manifolds, and we explore the connections between them.

Statement of Results

Arithmetic Groups. Let n be a large integer, Γ a finitely generated group, and M a Riemannian manifold. Denote by π (n) the number of primes ≤ n, sn(Γ) is the number of subgroups of Γ of index at most n and bn(M) is the number of covers of M of degree at most n. The aim of this article is to announce results that show that, in some circumstances, these three seemingly unrelated functions are very much connected. This connection emerges, for example, when Γ is an arithmetic group, in which case it is also the fundamental group of a suitable locally symmetric finite volume manifold M. The studies of sn(Γ) and bn(M) are then almost the same. Moreover, if Γ has the congruence subgroup property, then estimating sn(Γ) boils down to counting congruence subgroups of Γ. The latter is intimately related to the classical problem of counting primes. To present our results we need more notation.

Let G be an absolutely simple, connected, simply connected algebraic group defined over a number field k. For a finite subset S of valuations of k, including all the archimedean ones, let OS denote the ring of S-integers of k and set Γ= G(OS). A subgroup H ≤ Γ is called a congruence subgroup if there is some ideal IOS such that H contains the kernel of the homomorphism Γ → G(OS/I).

Let cn(Γ) denote the number of congruence subgroups of index at most n in Γ. The counting of congruence subgroups in arithmetic groups has already played a role in the proof of one of the main results of the theory of subgroup growth: A finitely generated, residually finite group Γ has polynomial subgroup growth [i.e., sn(Γ) = nO (1)] if and only if Γ is virtually solvable of finite rank (ref. 1 and references therein). That theorem required only a weak lower bound on the number congruence subgroups. In ref. 2, Lubotzky proved a more precise result: there exist numbers a, b depending on G, k, and S, such that Formula and, moreover, the sequence sn(Γ) has much faster growth (at least n log n) if the congruence subgroup property fails for G. Below we determine the precise rate of growth of cn(Γ). (All logarithms are in base e.)

Let X be the Dynkin diagram of the split form of G (e.g., X = An -1 if G = SUn). Let h be the Coxeter number of the root system Φ corresponding to X (it is the order of the Coxeter element of the Weyl group of X). Then Formula, where Formula, and for later use define R:= h/2. Let Formula

Let GRH denote the Generalized Riemann Hypothesis (GRH) for Artin–Hecke L functions of number fields as stated in ref. 4. The GRH implies, in particular: Let k be a Galois number field of degree d over the rationals and let q be a prime such that the cyclotomic field of q-th roots of unity is disjoint from k. Denote by πk(x, q) the number of primes p with px, p ≡ 1(mod q) and p splits completely at k. Then Formula for some constant C = C(k) > 0 depending only on k (a more precise bound is given in ref. 5).

The lower bound for the limit in the Theorem 1 below was proved in ref. 3 and the upper bound in ref. 6.

Theorem 1. Let G, Γ, and γ(G) be as defined above. Assuming GRH we have Formula and, moreover, this result is unconditional if G is of inner type (e.g., G splits) and k is either an abelian extension of Formula or a Galois extension of degree <42.

An interesting aspect of Theorem 1 is not only that the limit exists but that it is completely independent of k and S and depends only on G. Although the independence on S is a minor point and can be proved directly, the only way we know to prove the independence on k is by applying the whole machinery of the proof.

In ref. 3 the crucial special case of Γ = SL 2(OS) is proved in full. There, we have Formula. The lower bound follows using the Bombieri–Vinogradov Theorem (7) and the upper bound by a massive new combinatorial analysis.

Lattices. Let H be a connected characteristic 0 semisimple group. By this we mean that Formula, where for each i, Ki is a local field of characteristic 0, and Gi is a connected simple algebraic group over Ki. We assume throughout that none of the factors Gi(Ki) is compact (so that rankKi(Gi) ≥ 1). Let Γ be an irreducible lattice of H; i.e., for every infinite normal subgroup N of H the image of Γ in H/N is dense there.

Assume now that Formula By Margulis' Arithmeticity Theorem (8) every irreducible lattice Γ in H is arithmetic. Also the split forms of the factors Gi of H are necessarily of the same type and we set γ(H):= γ(Gi).

Moreover, a famous conjecture of Serre (9) asserts that such a group Γ has the (modified) congruence subgroup property. It has been proved in many cases. This enables us to prove Theorem 2.

Theorem 2. Assuming GRH and Serre's conjecture, then for every noncompact higher rank characteristic 0 semisimple group H and every irreducible lattice Γ in H the limit Formula exists and equals γ(H); i.e., it is independent of the lattice Γ.

Moreover the above result holds unconditionally if H is a simple connected Lie group not locally isomorphic to Formula and Γ is a nonuniform lattice in H (i.e., His noncompact).

Theorem 2 shows, in particular, some algebraic similarity between different lattices Γ in the same Lie group G. This outcome is an addition to other results in the theory, e.g., Furstenberg's theorem showing that the boundaries of all such lattices Γ are the same or Margulis superrigidity showing that the finite dimensional representation theory of the different lattices Γ in the same G is similar (see ref. 8 and references therein).

We point out the following geometric reformulation of the special case.

Theorem 3. Let H be a simple connected Lie group of Formula that is not locally isomorphic to Formula. Put X = H/K, where K is a maximal compact subgroup of H. Let M be a finite volume noncompact manifold covered by X and let bn(M) be the number of covers of M of degree at most n. Then Formula exists, equals γ(H), and is independent of M.

It is interesting to compare Theorems 2 and 3 with the results of Liebeck and Shalev (10) and T. W. Müller and J.-C. Puchta (unpublished data): If Formula and Γ is a lattice in H, then Formula where χ is the Euler characteristic.

We finally mention a conjecture and a question: Let X be the symmetric space associated with a simple Lie group H as in Theorem 3. Denote by mn(X) the number of manifolds covered by X of volume at most n. By a well known result of Wang (11), this number is finite unless H is locally isomorphic to Formula or Formula.

Conjecture. If Formula then Formula

Problem. Estimate mn(X) for the case of H having Formula equal to one. For H = SO(n, 1) the results of ref. 12 suggest that Formula may exist, but we do not have any clue what it could be.

Proofs

The Lower Bound. We shall illustrate the main idea of the proof with Formula and refer to ref. 3 for the full details.

Choose any ρ ε (0, ½). For x » 0 and a prime q < x, let P(x, q) be the set of primes px, such that p ≡ 1 mod q. Let L(x, q) = |P(x, q)| and M(x, q) = Σp P ( x , q) log p. Then the Bombieri–Vinogradov Theorem (7) ensures the existence of a prime q ε (xp/log x, x ρ) such that Formula Put L:= L(x, q) and M:= M(x, q).

By strong approximation (compare ref. 1, window 9), Γ maps onto Formula. Let B(p) be the subgroup of upper triangular matrices of Formula and set Formula The group BP maps onto the diagonal Formula, which in turn maps onto Formula. For fixed Formula, the latter vector space has approximately Formula subgroups of index q σ(d–1)L (see proposition 1.5.2 in ref. 1), each giving rise to a subgroup of index n = [GP: BP]q σ(d–1)L in Γ. Now, log[GP: BP] ∼ d(d–1)M/2 as x → ∞ and after some algebraic manipulations, we obtain that for this chosen value of n, Formula where in our case R = d/2. As shown in ref. 3, section 3, the maximum value of the expression above for σ, ρ ∈ (0, 1) is precisely Formula and is achieved for Formula. By taking x sufficiently large we can choose σ ∈ (0, 1) ∩ 1/[L(d – 1)] Formula to be arbitrarily close to σ0, and take ρ = ρ0. This proves the lower bound.

The reason for invoking the GRH in Theorem 1 is that, in the general case, we need an equivalent of the Bombieri–Vinogradov Theorem for k in place of Formula. The work of Murty and Murty (13) gives an analogue of it for number fields, but their result is weaker in general. It suffices for our needs when, for example, Formula is an abelian extension.

The Upper Bound. The proof of the upper bound in ref. 6 is inspired by the special case solved in ref. 3 and has two parts:

  1. A reduction to an extremal problem for abelian groups, and

  2. Solving this extremal problem (see Theorem 6 below).

Part I. The subgroup structure of the groups Formula is completely known. By using this, it is shown in ref. 3 that Theorem 1 for Formula is equivalent to the following extremal result on counting subgroups of abelian groups.

Let Cm denote the cyclic group of order m. For all pairs Formula and Formula of disjoint sets of primes, let Formula where the maximum is taken over all sets Formula, Formula and Formula, such that Formula (here Formula).

Theorem 4. We have Formula

By contrast, no such precise description of the subgroup structure exists even for Formula. Still, surprisingly, the proof of the general upper bound reduces to a similar extremal problem for abelian groups by using some ideas of refs. 3 and 14 and Theorem 5 (see below), which is the main new ingredient in ref. 6.

Let Formula be a finite quasisimple group of Lie type X over the finite field Formula of characteristic p > 3. For a subgroup H of Formula define Formula where H denotes the maximal abelian quotient of H whose order is coprime to p. Set t(H) = ∞ if |H | = 1.

Recall that R = R(X) = h/2, where h is the Coxeter number of the root system of the split Lie type corresponding to X.

Theorem 5. Given the Lie type X then Formula

The proof of this theorem does not depend on the classification of the finite simple groups; we use instead the work of Larsen and Pink (15) [which is a classification-free version of a result of Weisfeiler (16)] and Liebeck et al. (17) (the latter for groups of exceptional type).

Part II. Once Part I is proved, the argument reduces to an extremal problem on abelian groups.

Theorem 6. Let d and R be fixed positive numbers. Suppose Formula is an abelian group such that the orders x 1 , x 2 ,..., xt of its cyclic factors do not repeat more than d times each. Suppose that r |A|Rn for some positive integers r and n. Then as n and r tend to infinity we have Formula where Formula.

The starting point of the proof of this theorem in ref. 3 is a well known formula for counting subgroups of finite abelian groups (see ref. 18). We refer the reader to ref. 3 for the details that are too complicated to be given here.

Acknowledgments

We thank H. Bass for several helpful comments. This work was supported by grants from the National Science Foundation (to D.G. and A.L.), the Israel Science Foundation, and the U.S.–Israel Binational Science Foundation (to A.L.), and by Hungarian National Foundation for Scientific Research Grant T037846 (to L.P.). N.N. received a Golda Meir Postdoctoral Fellowship at the Hebrew University of Jerusalem.

Footnotes

  • To whom correspondence should be addressed. E-mail: alexlub{at}math.huji.ac.il.

  • Abbreviation: GRH, Generalized Riemann Hypothesis.

  • The lower bound depended on GRH at the time but was made unconditional in ref. 3.

References

« Previous | Next Article »Table of Contents