A nonstandard-analytic proof of a theorem regarding noncommutative ergodic optimizations

Abstract

In a previous article, we extended the notion of ergodic optimization to the setting of C*-dynamical systems of countable discrete groups. Among the key results of that paper was that given an action G M of a countable discrete amenable group G on a W*-probability space (M, ) by -preserving *-automorphisms of M, a positive element x ∈ M, and a right Flner sequence F = (Fk)k ∈ N for G, the sequence ( \| 1|Fk| Σg ∈ Fk g x \| ) k ∈ N converges to a value (x) which can be described in the language of ergodic optimization. We provide here an alternate, more direct proof of that theorem using the tools of nonstandard analysis.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…