Lattices determined by their commensurator
Abstract
Let be a finitely generated cocompact lattice of a totally disconnected locally compact group G, and C a dense subgroup of G that contains and commensurates . We study the problem of describing all finitely generated commensurated subgroups of C. We establish general rigidity results ensuring every finitely generated commensurated subgroup of C is virtually contained in . In more concrete situations, in fact we conclude that up to commensurability, is the only infinite finitely generated commensurated subgroup of C. For instance this last conclusion holds when G is the automorphism group of a tree. This settles in particular the problem whether two non-commensurable cocompact tree lattices may have the same commensurator. Further applications include commensurators of cocompact lattices in other groups of automorphisms of trees, as well as commensurators of graph product of finite groups in automorphism groups of right-angled building.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.