We will show that the famous, intractible 1959 Kadison-Singer problem in $C^{*}$-algebras is equivalent to fundamental unsolved problems in a dozen areas of research in pure mathematics, applied mathematics and Engineering. This gives all these areas common ground on which to interact as well as explaining why each of these areas has volumes of literature on their respective problems without a satisfactory resolution. In each of these areas we will reduce the problem to the minimum which needs to be proved to solve their version of Kadison-Singer. In some areas we will prove what we believe will be the strongest results ever available in the case that Kadison-Singer fails. Finally, we will give some directions for constructing a counter-example to Kadison-Singer.
In 1959, R.V. Kadison and I.M. Singer asked whether each pure state of the algebra of bounded diagonal operators on $\ell^2$, admits a unique state extension to $B(\ell^2)$. The positive answer was given in June 2013 by A. Marcus, D. Spielman and N. Srivastava, who took advantage of a series of translations of the original question, due to C. Akemann, J. Anderson, N. Weaver,... Ultimately, the problem boils down to an estimate of the largest zero of the expected characteristic polynomial of the sum of independent random variables taking values in rank 1 positive matrices in the algebra of n-by…
In the summer of 2013 Marcus, Spielman, and Srivastava gave a surprising and beautiful solution to the Kadison--Singer problem. The current presentation is slightly more didactical than other versions that have appeared since; it hopes to contribute to a thorough understanding of this amazing proof.
We give self-contained presentation of results related to the Kadison-Singer problem, which was recently solved by Marcus, Spielman, and Srivastava. This problem connects with unusually large number of areas including: operator algebras (pure states), set theory (ultrafilters), operator theory (paving), random matrix theory, linear and multilinear algebra, algebraic combinatorics (real stable polynomials), algebraic curves, frame theory, harmonic analysis (Fourier frames), and functional analysis.
We prove some new equivalences of the paving conjecture and obtain some estimates on the paving constants. In addition we give a new family of counterexamples to one of the Akemann-Anderson conjectures.
In this paper we survey a recent progress on continuous frames inspired by the solution of the Kadison-Singer problem by Marcus, Spielman, and Srivastava. We present an extension of Lyapunov's theorem for discrete frames due to Akemann and Weaver and a similar extension for continuous frames by the author. We also outline a solution of the discretization problem, which was originally posed by Ali, Antoine, and Gazeau, and recently solved by Freeman and Speegle.
It is known that the famous, intractible 1959 Kadison-Singer problem in $C^{*}$-algebras is equivalent to fundamental unsolved problems in a dozen areas of research in pure mathematics, applied mathematics and Engineering. The recent surprising solution to this problem by Marcus, Spielman and Srivastava was a significant achievement and a significant advance for all these areas of research. We will look at many of the known equivalent forms of the Kadison-Singer Problem and see what are the best new theorems available in each area of research as a consequence of the work of Marcus, Spielman an…
We apply Srivastava's spectral sparsification technique to a vector balancing version of the Kadison-Singer problem. The result is a one-sided version of the conjectured solution.
We give a combinatorial form of the Kadison-Singer problem, a famous problem in C*-algebra. This combinatorial problem, which has several minor variations, is a discrepancy question about vectors in C^n. Some partial results can be easily deduced from known facts in discrepancy theory.
Recently Marcus, Spielman and Srivastava gave a spectacular proof of a theorem which implies a positive solution to the Kadison-Singer problem via Weaver's $KS_r$ conjecture. We extend this theorem to the realm of hyperbolic polynomials and hyperbolicity cones, as well as to arbitrary ranks. We also sharpen the theorem by providing better bounds, which imply better bounds in Weaver's $KS_r$ conjecture for each $r>2$. For $r=2$ our bound agrees with Bownik et al.
We use the method of interlacing families of polynomials introduced to prove two theorems known to imply a positive solution to the Kadison--Singer problem. The first is Weaver's conjecture $KS_{2}$ \cite{weaver}, which is known to imply Kadison--Singer via a projection paving conjecture of Akemann and Anderson. The second is a formulation due to Casazza, et al., of Anderson's original paving conjecture(s), for which we are able to compute explicit paving bounds. The proof involves an analysis of the largest roots of a family of polynomials that we call the "mixed characteristic polynomials" o…
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 2014 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 Kadison-Singer problem asks: does every pure state on the diagonal sublgebra of the C*-algebra of bounded operators on a separable infinite dimensional Hilbert space admit a unique extension? A yes answer is equivalent to several open conjectures including Feichtinger's: every bounded frame is a finite union of Riesz sequences. We consider the special case: Feichtinger's conjecture for exponentials and prove that the set of projections onto a measurable subset of the circle group of the set of exponential functions equals a union of a finite number of Reisz sequences if and only if there e…
Marcus, Spielman, and Srivastava recently solved the Kadison-Singer problem by showing that if u_1, ..., u_m are column vectors in C^d such that \sum u_iu_i^* = I, then a set of indices S \subseteq {1, ..., m} can be chosen so that \sum_{i \in S} u_iu_i^* is approximately (1/2)I, with the approximation good in operator norm to order ε^{1/2} where ε= \max \|u_i\|^2. We extend their result to show that every linear combination of the matrices u_iu_i^* with coefficients in [0,1] can be approximated in operator norm to order ε^{1/8} by a matrix of the form \sum_{i \in S} u_iu_i^*.
We adapt the arguments of Marcus, Spielman and Srivastava in their proof of the Kadison-Singer problem to prove improved paving estimates. Working with Anderson's paving formulation of Kadison-Singer instead of Weaver's vector balancing version, we show that the machinery of interlacing polyomials due to Marcus, Spielman and Srivastava works in this setting as well. The relevant expected characteristic polynomials turn out to be related to the so called "mixed determinants" that have been carefully studied by Borcea and Branden. This technique allows us to show that any projection with diagona…
We show that any $n\times m$ matrix $A$ can be approximated in operator norm by a submatrix with a number of columns of order the stable rank of $A$. This improves on existing results by removing an extra logarithmic factor in the size of the extracted matrix. Our proof uses the recent solution of the Kadison-Singer problem. We also develop a sort of tensorization technique to deal with constraint approximation problems. As an application, we provide a sparsification result with equal weights and an optimal approximate John's decomposition for non-symmetric convex bodies. This enables us to sh…
Akemann and Weaver (2014) have shown a remarkable extension of Weaver's $KS_r$ Conjecture (2004) in the form of approximate Lyapunov's theorem. This was made possible thanks to the breakthrough solution of the Kadison-Singer problem by Marcus, Spielman, and Srivastava (2015). In this paper we show a similar type of Lyapunov theorem for continuous frames on non-atomic measure spaces. In contrast with discrete frames, the proof of this result does not rely on the recent solution of the Kadison-Singer problem.
We have constructed a concrete example of a non-factorable positive operator. As a result, for the well-known problems (Ringrose, Kadison and Singer problems) we replace existence theorems by concrete examples.
Anderson's paving conjecture, now known to hold due to the resolution of the Kadison-Singer problem asserts that every zero diagonal Hermitian matrix admits non-trivial pavings with dimension independent bounds. In this paper, we develop a technique extending the arguments of Marcus, Spielman and Srivastava in their solution of the Kadison-Singer problem to show the existence of non-trivial pavings for collections of matrices. We show that given zero diagonal Hermitian contractions $A^{(1)}, \cdots, A^{(k)} \in M_n(\mathbb{C})$ and $ε> 0$, one may find a paving $X_1 \amalg \cdots \amalg X_r = …
