Tensor product decompositions and rigidity of full factors
Abstract: We obtain several rigidity results regarding tensor product decompositions of factors. First, we show that any full factor with separable predual has at most countably many tensor product decompositions up to stable unitary conjugacy. We use this to show that the class of separable full factors with countable fundamental group is stable under tensor products. Next, we obtain new primeness and unique prime factorization results for crossed products coming from compact actions of higher rank lattices (e.g.\ $\mathrm{SL}(n,\mathbb{Z}), : n \geq 3$) and noncommutative Bernoulli shifts with arbitrary base (not necessarily amenable). Finally, we provide examples of full factors without any prime factorization.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.