Papers
Topics
Authors
Recent
Search
2000 character limit reached

Stationary characters on lattices of semisimple Lie groups

Published 21 Aug 2019 in math.GR, math.DS, math.OA, and math.RT | (1908.07812v2)

Abstract: We show that stationary characters on irreducible lattices $\Gamma < G$ of higher-rank connected semisimple Lie groups are conjugation invariant, that is, they are genuine characters. This result has several applications in representation theory, operator algebras, ergodic theory and topological dynamics. In particular, we show that for any such irreducible lattice $\Gamma < G$, the left regular representation $\lambda_\Gamma$ is weakly contained in any weakly mixing representation $\pi$. We prove that for any such irreducible lattice $\Gamma < G$, any uniformly recurrent subgroup (URS) of $\Gamma$ is finite, answering a question of Glasner-Weiss. We also obtain a new proof of Peterson's character rigidity result for irreducible lattices $\Gamma < G$. The main novelty of our paper is a structure theorem for stationary actions of lattices on von Neumann algebras.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.