Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 173 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 43 tok/s Pro
GPT-5 High 44 tok/s Pro
GPT-4o 94 tok/s Pro
Kimi K2 180 tok/s Pro
GPT OSS 120B 438 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Stationary characters on lattices of semisimple Lie groups (1908.07812v2)

Published 21 Aug 2019 in math.GR, math.DS, math.OA, and math.RT

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

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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