Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0604612

Bounded generation and lattices that cannot act on the line

Lucy Lifschitz·Dave Witte Morris
View original source ↗Read source document ↗Export metadata ↓

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

math.GRmath.GT

Keep this discovery

Explore connections, maps & timelines

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

arXiv2026

Word Measures on Wreath Products II

Every word $w$ in $F_r$, the free group of rank $r$, induces a probability measure (the $w$-measure) on every finite group $G$, by substitution of random $G$-elements in the letters. This measure is determined by its Fourier coefficients: the $w$-expectations $E_w[χ]$ of the irreducible characters of $G$. For every finite group $G$, every stable character $χ$ of $G\wr S_n$ (trace of a finitely generated $FI_G$-module), and every word $w\in F_r$, we approximate $E_w[χ]$ up to an error term of $O(n^{-π(w)})$, where $π(w)$ is the primitivity rank of $w$. This generalizes previous works by Puder, Hanany, Magee and the author. As an application we show that random Schreier graphs of representation-stable actions of $G\wr S_n$ are close-to-optimal expanders. The paper reveals a surprising relation between stable representation theory of wreath products and not-necessarily connected Stallings core graphs.

math.GR↗
arXiv2026

Robust quasi-isometric embeddings inapproximable by Anosov representations

Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$. For all but finitely many $m\in \mathbb{N}$, we exhibit the first examples of non-locally rigid, Zariski dense, robust quasi-isometric embeddings of hyperbolic groups in $\mathsf{SL}_m(\mathbb{K})$ which are not limits of Anosov representations. As a consequence, we show that higher rank analogues of Sullivan's structural stabilty theorem and of the density theorem for Kleinian groups fail for Anosov representations in $\mathsf{SL}_m(\mathbb{C}), m\geq 30$.

math.GR↗
arXiv2026

$\mathcal{C}$-Hereditarily conjugacy separable groups and wreath products

We provide a necessary and sufficient condition for the restricted wreath product $A\wr B$ to be $\mathcal{C}$-hereditarily conjugacy separable where $\mathcal{C}$ is an extension-closed pseudovariety of finite groups. Moreover, we prove that the Grigorchuk group is 2-hereditarily conjugacy separable. As an application, we demonstrate that the lamplighter groups and $\mathbb{Z} \wr \mathbb{Z}$ are hereditarily conjugacy separable (but not $p$-conjugacy separable for any prime $p$). This provides infinitely many new examples of solvable, non-polycyclic hereditarily conjugacy separable groups. Furthermore, we study wreath products of cyclic subgroup separable groups and the derived length of iterated wreath products of solvable groups with an abelian base group and, as an application, we give an explicit construction of non-polycyclic hereditarily conjugacy separable groups of arbitrary derived length as iterated wreath products of abelian groups.

math.GR↗