On June 18, Adam Marcus and Daniel A. Spielman of Yale University, along with Nikhil Srivastava of Microsoft Research India, announced a proof of the Kadison-Singer conjecture, a question about the mathematical foundations of quantum mechanics. Ten days later, they posted, on Cornell University's arXiv open-access e-prints site, a manuscript titled Interlacing Families II: Mixed Characteristic Polynomials and The Kadison-Singer Problem.

Thousands of academic papers are published every year, and this one's title wouldn't necessarily earn it much attention beyond a niche audience … except for the fact that the text divulged a proof of a mathematical conjecture more than half a century old—and the ramifications could be broad and significant.

The Kadison-Singer conjecture was first offered in 1959 by mathematicians Richard Kadison and Isadore Singer. In a summary of the achievement, the website Soul Physics says, "… this conjecture is equivalent to a remarkable number of open problems in other fields … [and] has important consequences for the foundations of physics!"

That description will get no argument from Ravi Kannan, principal researcher in the Algorithms Research Group at Microsoft Research India.

"Nikhil Srivastava and his co-authors have settled an important, 54-year-old problem in mathematics," Kannan says. "They gave an elegant proof of a conjecture that has implications for many areas of mathematics, computer science, and quantum physics."

Srivastava offers a layman's explanation of what he, Marcus, and Spielman have achieved.

"We proved a very fundamental and general statement about quadratic polynomials that was conjectured by [mathematician] Nik Weaver and that, he showed, implies Kadison-Singer. The proof is based on a new technique we developed, which we call the 'method of interlacing families of polynomials.'"

The proof—for a more technical, extended discussion, see Srivastava's post on the Windows on Theory blog—elicited the most basic of emotions from Srivastava when he got a chance to contemplate what he and his colleagues had wrought.

"My main reaction was awe at how beautiful the final proof was," he recalls. "I actually started laughing when I realized that it worked. It fit together so beautifully and sensibly you knew it was the 'right' proof and not something ad hoc. It combined bits of ideas that we had generated from all over the five years we spent working on this."

The Soul Physics site goes on to state, "Settling this conjecture shows an important way in which our experiments are enough to provide a complete description of a quantum system."

Srivastava is in complete agreement.

"It has clear implications for the foundations of quantum physics," he says. "This is something [theoretical physicist] Paul Dirac mistakenly thought was obvious, and Kadison and Singer and many other experts thought this was probably false.

"It implies that it is possible to 'approximate' a broad class of networks by networks with very few edges, which should have impact in combinatorics and algorithms. Finally, it is equivalent to several conjectures in signal processing and applied mathematics that seem to have practical use."

**Explore further:**
The maths of congestion—springs, strings and traffic jams

**More information:** arxiv.org/pdf/1306.3969v3.pdf

Please sign in to add a comment. Registration is free, and takes less than a minute. Read more

Click here to reset your password.Sign in to get notified via email when new comments are made.