Internal graphs of graph products of hyperfinite II$_1$-factors
Martijn Caspers, Enli Chen
TL;DR
The paper proves that for graphs Γ in the $H$-rigid class, the internal graph $Int(Γ)$ is determined by the graph product $R_Γ$ of hyperfinite II$_1$-factors, yielding rigidity results and enabling classification for specific graphs like lines and cycles. The approach relies on the Peterson–Thom conjecture (now established) and Popa’s intertwining-by-bimodule theory to transfer embeddings from vertex algebras to subgraphs, ultimately showing $Int(Γ)\cong Int(Λ)$ whenever $R_Γ\cong R_Λ$ under suitable hypotheses. This leads to concrete classifications (e.g., $R_{l_n}$, $R_{\mathbb{Z}_n}$) and strengthens radius rigidity, showing the radius difference of isomorphic graph products is at most $1$ under the $H$-rigid framework. The results advance rigidity theory for amenable vertex factors and highlight the interior graph as a robust invariant in graph product von Neumann algebras.
Abstract
In this paper, we show that for a graph $Γ$ from a class named H-rigid graphs, its subgraph ${\rm Int}(Γ)$, named the internal graph of $Γ$, is an isomorphism invariant of the graph product of hyperfinite II$_1$-factors $R_Γ$. In particular, we can classify $R_Γ$ for some typical types of graphs, such as lines and cyclic graphs. As an application, we also show that for two isomorphic graph products of hyperfinite II$_1$-factors over H-rigid graphs, the difference of the radius between the two graphs will not be larger than 1. Our proof is based on the recent resolution of the Peterson-Thom conjecture.
