Papalocal
Loading…
Papalocal · Things
Work

Kadison–Singer problem

Kadison–Singer problem is a unique extension of pure states in Hilbert spaces.

All 4 facts, and where they come from

Facts

4 facts · 0 confirmed by two sources · 0 cited · 4 from one source

What it is
mathematical problem One source
mathematical concept One source
Named after
Richard Kadison One source
Isadore Singer One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2541102771
Described as
unique extension of pure states in Hilbert spaces
What it is
mathematical problem; mathematical concept
Named after
Richard Kadison; Isadore Singer
Wikipedias with a page
4

Wikidata item Q25304456 (wikidata.org/wiki/Q25304456), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1380927375

In mathematics, the Kadison–Singer problem, posed in 1959, was a problem in functional analysis about whether certain extensions of certain linear functionals on certain C*-algebras were unique. The uniqueness was proved in 2013.
The statement arose from work on the foundations of quantum mechanics done by Paul Dirac in the 1940s and was formalized in 1959 by Richard Kadison and Isadore Singer. The problem was subsequently shown to be equivalent to numerous open problems in pure mathematics, applied mathematics, engineering and computer science. Kadison, Singer, and most later authors believed the statement to be false, but, in 2013, it was proven true by Adam Marcus, Daniel Spielman and Nikhil Srivastava, who received the 2014 Pólya Prize for the achievement.
The solution was made possible by a reformulation provided by Joel Anderson, who showed in 1979 that his "paving conjecture", which only involves operators on finite-dimensional Hilbert spaces, is equivalent to the Kadison–Singer problem. Nik Weaver provided another reformulation in a finite-dimensional setting, and this version was proved true using random polynomials.

From the Wikipedia article “Kadison–Singer problem” (en.wikipedia.org/wiki/Kadison–Singer_problem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 2

Known for it