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

TL;DR
This paper offers a nonstandard analysis-based proof of a theorem on ergodic optimization in noncommutative dynamical systems, extending previous results to a more direct and alternative approach.
Contribution
It introduces a nonstandard analysis method to prove a key theorem in noncommutative ergodic optimization, providing a more direct proof compared to prior approaches.
Findings
Established convergence of ergodic averages in noncommutative setting
Provided a nonstandard analysis proof technique for ergodic theorems
Extended previous results to a more accessible proof framework
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 of a countable discrete amenable group on a W*-probability space by -preserving -automorphisms of , a positive element , and a right F{\o}lner sequence for , the sequence converges to a value 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical and Theoretical Analysis · Quantum Mechanics and Applications · Advanced Operator Algebra Research
