Non arithmetic lattices
With Martin Deraux and Julien Paupert.
1. Arithmetic lattices
We are interested in lattices in . One source of examples is the following arithmetic construction due to Borel-Harish Chandra. Let be an algebraic linear group defined over . Assume there exists a surjective homomorphism with compact kernel. Then any subgroup commensurable with is called arithmetic. It is a lattice. We are interested in other lattices.
In , there are infinitely many commensurability classes of non-arithmetic lattices (even reflection groups if ). In , , no example is known. In , there is 1 example. In , a handful of examples were obtained by Mostow in 1980 (one of which was rediscovered by Ron Livne), and these remained the only known examples until the work I will describe now.
2. Complex reflection groups
In , an isometry fixing a complex line rotates in the perpendicular direction. If the angle is , , , we speak of a complex reflection.
We investigate groups generated by three complex reflections with equal, fixed, angles. Such triples depends on 4 real parameters: one may think of them as the three angles and the Toledo invariant of a triangle.
Let , be complex reflections. Studying discreteness of the subgroup they generate leads to the braid relation: there exists an integer (called braiding length) such that
(when is odd, this means one keeps only one letter: for instance, if , ). This restricts the “angle” parameters to numbers of the form , . We also introduce the braiding length of the pair .
We expect that if the group is a lattice, then the following elements are non-loxodromic,
We are unable to prove that this is necessary (nor sufficient), but empirical experience supports it.
2.1. Arithmeticity criterion
Let be a purely imaginary quadratic extension of a totally real number field . Let be a Hermitian form defined over , of signature .
Proposition 1 (Mostow, after Takeuchi and Vinberg) Let be a lattice in . Then is arithmetic iff for all Galois automorphisms of , not inducing identity on the field of traces , is definite.
2.2. Building fundamental domains
The basic building block is a pyramid, i.e. a triangle and its images by the subgroup fixing one vertex. has a single fixed point, we want it inside our fundamental domain. maps the pyramid to another one that fits along the base.
Next we need fill in faces. Instead of using projective geometry (as Rick Schwartz did in his RHOCHI paper), we use bissectors in complex hyperbolic geometry (however, our fundamental domains are not Dirichlet). To check that this produces a polyhedron, some verifications are done by exact computations over number fields, performed by the computer.
We recover Deligne-Mostow’s examples and find a few more: the number of commensurability classes passes from 13 to 22.
The ground field has low degree (2, 3,…).
We have not tried quadrilaterals yet…