We pursue the study of full groups of graphings and of the closures of their derived groups, which we call derived full groups. Our main result shows that aperiodic probability measure-preserving actions of finitely generated groups have finite Rokhlin entropy if and only if their derived full group has finite topological rank. We further show that a graphing is amenable if and only if its full group is, and explain why various examples of (derived) full groups fit very well into Rosendal’s geometric framework for Polish groups. As an application, we obtain that every abstract group isomorphism between $\mathrm L^1$ full groups of amenable ergodic graphings must be a quasi-isometry for their respective metrics. We finally show that full groups of rank one transformations have topological rank 2.

生成讲解博客的中文版本

生成AI智能校验的中文版本