ProbXiv
Explorersign in
Problem archiveProblem record

Statement

f Γ is an irreducible arithmetic group of rank ≥ 2, then every homomorphism Γ→ ModS has finite image. For many arithmetic groups Γ the conjecture can be proved by combining some well-known information about arithmetic groups with equally well-known properties of Mod S. But, for ex- ample, for cocompact lattices in SU (p,q ) this straightforward approach seems to fail. (I owe this specific example to G. Prasad.) In any case, by now this conjecture is completely proved. V. A. Kaimanovich and H. Masur [ KaM] proved that so-called non-elementary subgroups (subgroups containing a pair pseudo-Anosov elements with disjoint sets of fixed points in Thurston boundary) of Mod S are not isomorphic to irreducible arithmetic groups of rank ≥ 2. The proof is based on the theory of random walks on Mod S developed by Masur and Kaimanovich–Masur and on the results of H. Furstenberg about random walks on arithmetic groups (see the references in [KaM]). If combined with the Margulis finiteness theorem and the techniques of N. V. Ivanov, Subgroups of Teichm¨ uller Modular Groups, Translations of Mathematical Monographs, Vol. 115, American Math. Soc., 1992, this result can be used to prove the conjecture. A proof close in the spirit to the one alluded to in the previous paragraph is due to B. Farb and H. Masur [ FM]. In a addition, S-K. Yeung [ Y] completed the picture by proving that any homomorphism from a lattice Γ in either Sp( m, 1) or F −20 4 (the isometry group of the Cayley plane) into a mapping class group has finite image. The lattices in the remaining simple Lie groups of rank 1 often admit non-trivial homomorphisms to Z, and, therefore, homomorphisms to the mapping class groups with infinite image.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.