SearcharxivSearch

arXiv · math/0604612

Bounded generation and lattices that cannot act on the line

Abstract

Let D be an irreducible lattice in a connected, semisimple Lie group G with finite center. Assume that the real rank of G is at least two, that G/D is not compact, and that G has more than one noncompact simple factor. We show that D has no orientation-preserving actions on the real line. (In algebraic terms, this means that D is not right orderable.) Under the additional assumption that no simple factor of G is isogenous to SL(2,R), applying a theorem of E.Ghys yields the conclusion that any orientation-preserving action of D on the circle must factor through a finite, abelian quotient of D. The proof relies on the fact, proved by D.Carter, G.Keller, and E.Paige, that SL(2,A) is boundedly generated by unipotents whenever A is a ring of integers with infinitely many units. The assumption that G has more than one noncompact simple factor can be eliminated if all noncocompact lattices in SL(3,R) and SL(3,C) are virtually boundedly generated by unipotents.

Explore related subjects

Keep this discovery

BibTeXRIS

Lucy Lifschitz, Dave Witte Morris. 2007-06-19. Bounded generation and lattices that cannot act on the line. https://arxiv.org/abs/math/0604612

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR