2000 character limit reached
Unitary Correlation Sets
Published 8 Dec 2016 in math.OA | (1612.02791v2)
Abstract: The unitary correlation sets defined by the first author in conjunction with tensor products of $\mathcal{U}_{nc}(n)$ are further studied. We show that Connes' embedding problem is equivalent to deciding whether or not two smaller versions of the unitary correlation sets are equal. Moreover, we obtain the result that Connes' embedding problem is equivalent to deciding whether or not two cross norms on $M_n \otimes M_n$ are equal for all $n \geq 2$.
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.