Current Developments in Mathematics

Volume 2016

The solution of the Kadison-Singer Problem

Pages: 111 – 143

DOI: http://dx.doi.org/10.4310/CDM.2016.v2016.n1.a3

Authors

Adam Marcus (Princeton University, Princeton, New Jersey, U.S.A.)

Nikhil Srivastava (Department of Mathematics, University of California at Berkeley)

Abstract

These lecture notes are meant to accompany two lectures given at the CDM 2016 conference, about the Kadison–Singer Problem. They are meant to complement the survey by the same authors (along with Spielman) which appeared at the last ICM. In the first part of this survey we will introduce the Kadison–Singer problem from two perspectives ($C_{*}$ algebras and spectral graph theory) and present some examples showing where the difficulties in solving it lie. In the second part we will develop the framework of interlacing families of polynomials, and show how it is used to solve the problem. None of the results are new, but we have added annotations and examples which we hope are of pedagogical value.

Full Text (PDF format)

Supported by NSF grant DSM-1552520.

Supported by NSF grant CCF-1553751 and a Sloan research fellowship.