Asymptotically optimal multi-paving
From MaRDI portal
Commutativity of matrices (15A27) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Hermitian, skew-Hermitian, and related matrices (15B57) Norms (inequalities, more than one norm, etc.) of linear operators (47A30) Commutation relations and statistics as related to quantum mechanics (general) (81S05)
Abstract: 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 and , one may find a paving where such that, [lambda_{max} (P_{X_i} A^{(j)} P_{X_i}) < epsilon, quad i in [r], , j in [k].] As a consequence, we get the correct asymptotic estimates for paving general zero diagonal matrices; zero diagonal contractions can be paved. As an application, we give a simplified proof wth slightly better estimates of a theorem of Johnson, Ozawa and Schechtman concerning commutator representations of zero trace matrices.
Recommendations
Cited in
(7)- Mixed determinants and the Kadison-Singer problem
- On syndetic Riesz sequences
- Some new equivalences of Anderson’s paving conjectures
- The random paving property for uniformly bounded matrices
- Correction to: ``Random reordering in SOR-type methods
- The trace and integrable commutators of the measurable operators affiliated to a semifinite von Neumann algebra
- Interlacing polynomial method for matrix approximation via generalized column and row selection
This page was built for publication: Asymptotically optimal multi-paving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021206)