The Connes Embedding Problem: A guided tour
Abstract
The Connes Embedding Problem (CEP) is a problem in the theory of tracial von Neumann algebras and asks whether or not every tracial von Neumann algebra embeds into an ultrapower of the hyperfinite II factor. The CEP has had interactions with a wide variety of areas of mathematics, including C*-algebra theory, geometric group theory, free probability, and noncommutative real algebraic geometry (to name a few). After remaining open for over 40 years, a negative solution was recently obtained as a corollary of a landmark result in quantum complexity theory known as . In these notes, we introduce all of the background material necessary to understand the proof of the negative solution of the CEP from . In fact, we outline two such proofs, one following the "traditional" route that goes via Kirchberg's QWEP problem in C*-algebra theory and Tsirelson's problem in quantum information theory and a second that uses basic ideas from logic.
Keywords
Cite
@article{arxiv.2109.12682,
title = {The Connes Embedding Problem: A guided tour},
author = {Isaac Goldbring},
journal= {arXiv preprint arXiv:2109.12682},
year = {2021}
}
Comments
74 pages. First draft. Comments very, very welcome (and very much appreciated)