WRSWorld Research StateContribute
WORLD RESEARCH STATE

Marcus, Spielman and Srivastava: interlacing-polynomial solution of the Kadison–Singer problem

Contribution grade

Operator algebras and spectral discrepancy · Exact theorem and reusable mathematical method

Reference score350,000Provisional editorial estimate of this exact contribution; its grade is assessed separately.

What changed

Mixed characteristic polynomials and interlacing families yield a finite-dimensional random-vector norm bound. A two-part vector partition consequence establishes Weaver's KS2 conjecture and hence the Kadison–Singer problem through the previously known equivalences.

Scientific scope

Mixed characteristic polynomials and interlacing families yield a finite-dimensional random-vector norm bound. A two-part vector partition consequence establishes Weaver's KS2 conjecture and hence the Kadison–Singer problem through the previously known equivalences. The main random vectors are independent and finitely supported, with an identity covariance sum and bounded expected squared norms. The paper proves existence; its conclusion asks separately for efficient partition-finding algorithms.

Evidence

The linked original works support the scoped statement and contribution attribution. WRS has not independently replayed experiments or reconstructed a full mathematical proof. The main random vectors are independent and finitely supported, with an identity covariance sum and bounded expected squared norms. The paper proves existence; its conclusion asks separately for efficient partition-finding algorithms.

Contributors

Provisional WRS assessment, edition 2026-10-23.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction