We prove a conjecture shown by Weaver to imply a positive solution to the problem of Kadison and Singer. The proof is elementary, and should be accessible to a general mathematical audience. The most novel step a new technique for demonstrating the existence of combinatorial objects that we call the "method of interlacing polynomials."
This is joint work with Dan Spielman and Nikhil Srivastava.