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 79 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 99 tok/s Pro
Kimi K2 199 tok/s Pro
GPT OSS 120B 444 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Noncommutative Ergodic Theorems for Connected Amenable Groups (1605.03568v1)

Published 11 May 2016 in math.OA and math.DS

Abstract: This paper is devoted to the study of noncommutative ergodic theorems for connected amenable locally compact groups. For a dynamical system $(\mathcal{M},\tau,G,\sigma)$, where $(\mathcal{M},\tau)$ is a von Neumann algebra with a normal faithful finite trace and $(G,\sigma)$ is a connected amenable locally compact group with a well defined representation on $\mathcal{M}$, we try to find the largest noncommutative function spaces constructed from $\mathcal{M}$ on which the individual ergodic theorems hold. By using the Emerson-Greenleaf's structure theorem, we transfer the key question to proving the ergodic theorems for $\mathbb{R}d$ group actions. Splitting the $\mathbb{R}d$ actions problem in two cases according to different multi-parameter convergence types---cube convergence and unrestricted convergence, we can give maximal ergodic inequalities on $L_1(\mathcal{M})$ and on noncommutative Orlicz space $L_1\log{2(d-1)}L(\mathcal{M})$, each of which is deduced from the result already known in discrete case. Finally we give the individual ergodic theorems for $G$ acting on $L_1(\mathcal{M})$ and on $L_1\log{2(d-1)}L(\mathcal{M})$, where the ergodic averages are taken along certain sequences of measurable subsets of $G$.

Summary

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

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

Collections

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