What Is... A Thin Group?
Alex Kontorovich, D. Darren Long, Alexander Lubotzky, Alan W. Reid

TL;DR
This paper provides a basic overview of what a 'Thin Group' is and discusses its applications across different fields, aiming to clarify its fundamental concepts and uses.
Contribution
It offers an introductory explanation of Thin Groups and highlights their relevance in various disciplines, filling a gap in accessible foundational knowledge.
Findings
Clarifies the definition of Thin Groups
Explores applications in multiple subjects
Provides foundational understanding
Abstract
This paper describes in basic terms what a "Thin Group" is, as well as its uses in various subjects.
Click any figure to enlarge with its caption.
Figure 1
Figure 2Peer 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.
WHAT IS … a Thin Group?
Alex Kontorovich, D. Darren Long,
Alexander Lubotzky, and Alan W. Reid111Alex Kontorovich is a professor of mathematics at Rutgers University. His email address is [email protected]. D. Darren Long is a professor of mathematics at the University of California, Santa Barbara. His email address is [email protected]. Alexander Lubotzky is the Maurice and Clara Weil professor mathematics at the Hebrew University of Jerusalem. His email address is [email protected]. Alan W. Reid is the Edgar Odell Lovett professor of mathematics at Rice University. His email address is [email protected]. The authors would like to gratefully acknowledge an NSF FRG grant which facilitated their collaboration.
The group of integer matrices with unit determinant is a quintessential arithmetic group. By this we mean that there is an algebraic group, that is, a variety defined by polynomial equations, namely,
[TABLE]
whose points over a ring happen to also form a group (under standard matrix multiplication, which is a polynomial map in the entries); then is the set of integer points in this algebraic group. More generally, an arithmetic group is a finite-index subgroup of the integer points of an algebraic group . Roughly speaking, a “thin” group is an infinite-index subgroup of an arithmetic group which “lives” in the same algebraic group, as explained below.
While the term “thin group”222Sometimes “thin matrix group,” not to be confused with other notions of thin groups in the literature. was coined in the last 10-15 years by Peter Sarnak, such groups had been studied as long as 100-150 years ago; indeed, they appear naturally in the theory of Fuchsian and Kleinian groups. For a long while, they were largely discarded as “irrelevant” to arithmetic, in part because there was not much one could do with them. More recently, thin groups have become a “hot topic” thanks to the explosion of activity in “Super Approximation” (see below). Armed with this new and massive hammer, lots of previously unrelated problems in number theory, geometry, and group theory started looking like nails. Our goal here is to describe some of these nails at a basic level; for a more advanced treatment of similar topics, the reader would do well to consult [Sar14].
Let’s get to the general definition from first seeing some (non-)examples. Take your favorite pair, , say, of matrices in and let be the group generated by them; should be called thin?
Example 1**.**
Suppose you choose A=\bigl{(}\begin{smallmatrix}1&1\\ 0&1\end{smallmatrix}\bigr{)} and B=\bigl{(}\begin{smallmatrix}0&1\\ -1&0\end{smallmatrix}\bigr{)}. Then, as is well-known, is all of . This cannot be called “thin”; it’s the whole group.
Example 2**.**
If you choose A=\bigl{(}\begin{smallmatrix}1&2\\ 0&1\end{smallmatrix}\bigr{)} and B=\bigl{(}\begin{smallmatrix}1&0\\ 2&1\end{smallmatrix}\bigr{)}, then the resulting is also well-known to be a congruence group, meaning roughly that the group is defined by congruence relations. More concretely, turns out to be the subset of of all matrices with diagonal entries congruent to and evens off the diagonal; it is a good exercise to check that these congruence restrictions do indeed form a group. It is not hard to prove that the index333If the reader was expecting this index to be 6, that would be correct in , or alternatively, if we added to . of in is 12, so just 12 cosets of will be enough to cover all of ; that also doesn’t qualify as thin.
Example 3**.**
Say you chose A=\bigl{(}\begin{smallmatrix}1&4\\ 0&1\end{smallmatrix}\bigr{)} and B=\bigl{(}\begin{smallmatrix}1&6\\ 0&1\end{smallmatrix}\bigr{)}; that will generate \Gamma=\bigl{(}\begin{smallmatrix}1&2\mathbb{Z}\\ 0&1\end{smallmatrix}\bigr{)}, the group of upper triangular matrices with an even upper-right entry. This group is certainly of infinite index in , so now is it thin? Still no. The reason is that fails to “fill out” the algebraic variety . That is, there are “extra” polynomial equations satisfied by besides ; namely, lives in the strictly smaller unipotent (all eigenvalues are 1) algebraic group*
[TABLE]
The fancy way of saying this is that is the Zariski-closure of , written
[TABLE]
*That is, is the algebraic group given by all polynomial equations satisfied by all elements of . And if we look at the integer points of , we get U(\mathbb{Z})=\bigl{(}\begin{smallmatrix}1&\mathbb{Z}\\ 0&1\end{smallmatrix}\bigr{)}, in which has finite index (namely, two). So again is not thin.
Example 4**.**
Take A=\bigl{(}\begin{smallmatrix}2&1\\ 1&1\end{smallmatrix}\bigr{)} and B=\bigl{(}\begin{smallmatrix}5&3\\ 3&2\end{smallmatrix}\bigr{)}. This example is a little more subtle. The astute observer will notice that , so , and moreover that*
[TABLE]
where is the -th Fibonacci number, determined by and initialized by . Again it is easy to see that is an infinite index subgroup of , and unlike Example 3, all the entries are changing. But it is still not thin! Let be the golden mean and ; there is a matrix which conjugates to
[TABLE]
The latter group lives inside the “diagonal” algebraic group
[TABLE]
This group is an example of what’s called an algebraic torus; the group of complex points is isomorphic to the multiplicative “torus” . When we conjugate back, the torus goes to
[TABLE]
*the variety is now defined by equations with coefficients in , not . The rational integer points of are exactly , so is not a thin group.
Example 5**.**
This time, let A=\bigl{(}\begin{smallmatrix}1&4\\ 0&1\end{smallmatrix}\bigr{)} and B=\bigl{(}\begin{smallmatrix}0&1\\ -1&0\end{smallmatrix}\bigr{)}, with . If we replace the upper-right entry in by , we’re back to Example 1. So at first glance, perhaps this has index or maybe in ? It turns out that actually has infinite index (see, e.g., [Kon13, §4] for a gentle discussion). What is its Zariski closure? Basically the only subvarieties of which are also groups look, up to conjugation, like and (and ), and it is easy to show that lives in no such group. More generally, any subgroup of infinite index in that is not virtually (that is, up to finite index) abelian is necessarily thin. Indeed, being non-virtually abelian rules out all possible proper sub-algebraic groups of , implying that .
It is now a relatively simple matter to give an almost-general definition.
Definition 6**.**
Let be a subgroup and let be its Zariski closure. We say is a thin group if the index of in the integer points is infinite. (Most people add that should be finitely generated.)
For more context, we return to the classical setting of a congruence group . Such a group acts on the upper half plane by fractional linear transformations
[TABLE]
and much 20th and 21st century mathematics has been devoted to the study of:
- •
“Automorphic forms,” meaning eigenfunctions of the hyperbolic Laplacian which are -automorphic, that is,
[TABLE]
for all and , and square-integrable (with respect to a certain invariant measure) on the quotient . These are called “Maass forms” for Hans Maass’s foundational papers in the 1940’s. Their existence and abundance in the case of congruence groups is a consequence of the celebrated Selberg trace formula, developed in the 1950’s.
- •
“-functions” attached to such . These are certain “Dirichlet series,” meaning functions of the form
[TABLE]
where is a sequence of complex numbers called the “Fourier coefficients” of . When is also an eigenfunction of so-called “Hecke operators” and normalizing , these -functions are also multiplicative, enjoying Euler products of the form
[TABLE]
where the product runs over primes. Needless to say, such -functions are essential in modern analytic number theory, with lots of fascinating applications to primes and beyond.
- •
More generally, one can define related objects (called “automorphic representations”) on other arithmetic groups , and study their -functions. The transformative insight of Langlands is the conjectured interrelation of these on different groups, seen most efficiently through the study of operations on their -functions. Consequences of these hypothesized interrelations include the Generalized Ramanujan and Sato-Tate Conjectures, among many, many others. We obviously have insufficient capacity to do more than graze the surface here.
Hecke, in studying Example 5, found that his theory of Hecke operators fails for thin groups, so such -functions would not have Euler products,444Without Euler products, -functions can have zeros in the region of absolute convergence; that is, the corresponding Riemann Hypothesis can fail dramatically! and hence no direct applications to questions about primes. Worse yet, the Selberg trace formula breaks down, and there are basically no Maass forms to speak of (nevermind the -functions!). So for a long while, it seemed like thin groups, although abundant, did not appear particularly relevant to arithmetic problems.
About 15 years ago, a series of stunning breakthroughs led to the theory of “Super Approximation,” as described below, and for the first time allowed a certain Diophantine analysis on thin groups, from which many striking applications soon followed. To discuss these, we first describe the more classical theory of Strong Approximation. In very rough terms, this theory says that from a certain algebraic perspective, “thin groups are indistinguishable from their arithmetic cousins,” by which we mean the following.
It is not hard555Though if you think it’s completely trivial, try finding a matrix whose reduction mod is, say, \bigl{(}\begin{smallmatrix}2&0\\ 1&3\end{smallmatrix}\bigr{)}. The latter is indeed an element of , since it has determinant . to show that reducing modulo a prime gives all of . What happens if we reduce the group in Example 5 mod ? Well, for , we clearly have a problem, since the generator A=\bigl{(}\begin{smallmatrix}1&4\\ 0&1\end{smallmatrix}\bigr{)} collapses to the identity. But for any other prime , the integer is a unit (that is, invertible mod ), so some power of is congruent to \bigl{(}\begin{smallmatrix}1&1\\ 0&1\end{smallmatrix}\bigr{)} mod . Hence on reduction mod (almost) any prime, we cannot distinguish Example 5 from Example 1! That is, even though in Example 5 is thin, the reduction map is onto. The Strong Approximation theorem [MVW84] says that if has, say, full Zariski closure , then is onto for all but finitely many primes . In fact, this reasoning can be reversed, giving a very easy check of Zariski density: if for a single prime , the reduction of mod is all of , then the Zariski closure of is automatically all of ; see [Lub99] for details.
One immediate caveat is that, if one is not careful, Strong Approximation can fail. For a simple example, try finding a which mod gives \bigl{(}\begin{smallmatrix}1&2\\ 3&4\end{smallmatrix}\bigr{)}. The problem is that does not map onto , since the only determinants of the former are , while the latter has determinants in all of . But such obstructions are well-understood and classical. (In fancy language, is reductive, while is semisimple.)
For Super Approximation, we study not only whether these generators and in Example 5 fill out , but the more refined question of how rapidly they do so. To quantify this question, construct for each (sufficiently large) prime the Cayley graph, , whose vertices are the elements of and two vertices (i.e., matrices) are connected if one is sent to the other under one of the four generators , . When , the graph is:666This graph is begging us to identify each node with , that is, work in .
This is a -regular graph with , that is, every vertex has four neighbors. The “graph Laplacian” of is the matrix where is the adjacency matrix of the graph. By the spectrum of , we mean the eigenvalues
[TABLE]
of . In the case of the graph above, the spectrum is:
[TABLE]
Notice that the bottom eigenvalue is [math] (corresponding to the constant function), and has multiplicity ; this is due to Strong Approximation – the graph is connected! (In general, the multiplicity of the bottom eigenvalue is the number of connected components.) Hence the first eigenvalue above the bottom, , is strictly positive, which by standard techniques implies that a random walk on the graph is “rapidly mixing” (see, e.g., [DSV03]). But we have infinitely many graphs , one for each prime, and a priori, it might be the case that the mixing rate deteriorates as increases. Indeed, goes from when down to when , for which the graph has about vertices. Super Approximation is precisely the statement that this deterioration does not continue indefinitely: there exists some so that, for all ,
[TABLE]
That is, the rate of mixing is uniform over the entire family of Cayley graphs . (This is what’s called an expander family, see [Sar04, Lub12].)
For congruence groups, Super Approximation is now a classical fact: it is a consequence of “Kazhdan’s Property T” in higher rank (e.g. for groups like ), and of non-trivial bounds towards the “Generalized Ramanujan Conjectures” in rank one (for example, isometry groups of hyperbolic spaces); see, e.g., [Lub10, Sar05] for an exposition. A version of Super Approximation for some more general (arithmetic but not necessarily congruence) lattices was established by Sarnak-Xue [SX91].
For thin subgroups , major progress was made by Bourgain-Gamburd [BG08], who established Super Approximation (as formulated above) for . This built on a sequence of striking results in Additive Combinatorics, namely the Sum-Product Theorem [BKT04] and Helfgott’s Triple Product Theorem [Hel08], and prompted a slew of activity by many people (e.g. [Var12, PS16, BGT11]), culminating in an (almost) general Super Approximation theorem of Salehi-Golsefidy and Varju [SGV12].
Simultaneously, it was realized that many natural problems in number theory, groups, and geometry require one to treat these aspects of thin (as opposed to arithmetic) groups. Two quintessential such, discussed at length in [Kon13], are the Local-Global Problem for integral Apollonian packings [BK14b], and Zaremba’s conjecture on “badly approximable” rational numbers [BK14a]. Other related problems subsequently connected to thin groups (see the exposition in [Kon16]) include McMullen’s Arithmetic Chaos Conjecture and a problem of Einsiedler-Lindenstrauss-Michel-Venkatesh on low-lying fundamental geodesics on the modular surface. The latter problem, eventually resolved in [BK17], was the catalyst for the development of the Affine Sieve [BGS10, SGS13]; see more discussion in [Kon14]. Yet a further direction was opened by the realization that the Affine Sieve can be extended to what may be called the “Group Sieve,” used to great effect on problems in Group Theory and Geometry in, e.g., [Riv08, Kow08, LLR08, LM12]. We will not rehash these topics, choosing instead to end by highlighting the difficulty of answering the slight rewording of the title:
[TABLE]
Example 7**.**
To ease us into a higher rank example, consider the group generated by*
[TABLE]
*A moment’s inspection reveals that is just a copy of (see Example 1) in the upper left block of . This has Zariski closure isomorphic to , and is hence not thin.
Example 8**.**
Here’s a much more subtle example. Set*
[TABLE]
and
[TABLE]
It is not hard to show that group has full Zariski closure, . Much more striking (see [LRT11]) is that is a faithful representation of the “ hyperbolic triangle” group
[TABLE]
into ; that is, the generators have these relations and no others. It then follows that is necessarily of infinite index in , that is, thin.
Example 9**.**
The matrices*
[TABLE]
generate a group whose Zariski closure turns out to be the symplectic group . The interest in these particular matrices is that they generate the “monodromy group” of a certain (Dwork) hypergeometric equation. It was shown in [BT14] that this group is thin. For general monodromy groups, determining who is thin or not is wide open; see related work in [Ven14] and [FMS14], as well as the discussion in [Sar14, §3.5].
Example 10**.**
The four matrices*
[TABLE]
[TABLE]
generate a group . Its Zariski closure turns out to be the “automorphism group” of a certain quadratic form of signature . By a standard process (see, e.g., [Kon13, p. 210]), such a acts on hyperbolic 3-space
[TABLE]
and in this action, each matrix represents inversion in a hemisphere. These inversions are shown in red in the figure below, as is the set of limit points of a orbit (viewed in the boundary plane ); the latter turns out to be a fractal circle packing:
Here circles are labeled with the reciprocal of their radii (notice these are all integers!). This limit set is an example of a “crystallographic packing,” introduced (and partially classified) in [KN18] as a vast generalization of integral Apollonian circle packings. It follows from the fractal nature of this limit set that is indeed a thin group.
In a sense that can be made precise (see [LM12, Aou11, Riv10, FR17]), random subgroups of arithmetic groups are thin. But lest we leave the reader with the false impression that the theory is truly well-developed and on solid ground, we demonstrate our ignorance with the following basic challenge.
Example 11**.**
The following group arises naturally through certain geometric considerations in [LRT11]: let with*
[TABLE]
*Reduced mod 7, this is all of , so its Zariski closure is . Is it thin? As of this writing, nobody knows!
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Aou 11] Richard Aoun. Random subgroups of linear groups are free. Duke Math. J. , 160(1):117–173, 2011.
- 2[BG 08] Jean Bourgain and Alex Gamburd. Uniform expansion bounds for Cayley graphs of SL 2 ( 𝔽 p ) subscript SL 2 subscript 𝔽 𝑝 {\rm SL}_{2}(\mathbb{F}_{p}) . Ann. of Math. (2) , 167(2):625–642, 2008.
- 3[BGS 10] Jean Bourgain, Alex Gamburd, and Peter Sarnak. Affine linear sieve, expanders, and sum-product. Invent. Math. , 179(3):559–644, 2010.
- 4[BGT 11] Emmanuel Breuillard, Ben Green, and Terence Tao. Approximate subgroups of linear groups. Geom. Funct. Anal. , 21(4):774–819, 2011.
- 5[BK 14a] J. Bourgain and A. Kontorovich. On Zaremba’s conjecture. Annals Math. , 180(1):137–196, 2014.
- 6[BK 14b] Jean Bourgain and Alex Kontorovich. On the local-global conjecture for integral Apollonian gaskets. Invent. Math. , 196(3):589–650, 2014.
- 7[BK 17] Jean Bourgain and Alex Kontorovich. Beyond expansion II: low-lying fundamental geodesics. J. Eur. Math. Soc. (JEMS) , 19(5):1331–1359, 2017.
- 8[BKT 04] J. Bourgain, N. Katz, and T. Tao. A sum-product estimate in finite fields, and applications. Geom. Funct. Anal. , 14(1):27–57, 2004.
