Non-tracial free graph von Neumann algebras
Abstract
Given a finite, directed, connected graph equipped with a weighting μ on its edges, we provide a construction of a von Neumann algebra equipped with a faithful, normal, positive linear functional (M(,μ),). When the weighting μ is instead on the vertices of , the first author showed the isomorphism class of (M(,μ),) depends only on the data (,μ) and is an interpolated free group factor equipped with a scaling of its unique trace (possibly direct sum copies of C). Moreover, the free dimension of the interpolated free group factor is easily computed from μ. In this paper, we show for a weighting μ on the edges of that the isomorphism class of (M(,μ),) depends only on the data (,μ), and is either as in the vertex weighting case or is a free Araki-Woods factor equipped with a scaling of its free quasi-free state (possibly direct sum copies of C). The latter occurs when the subgroup of R+ generated by μ(e1)·s μ(en) for loops e1·s en in is non-trivial, and in this case the point spectrum of the free quasi-free state will be precisely this subgroup. As an application, we give the isomorphism type of some infinite index subfactors considered previously by Jones and Penneys.
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.