Some new equivalences of Anderson's paving conjectures
classification
🧮 math.OA
keywords
pavingandersonconjecturesoperatorsproveequivalencespavablepaveable
read the original abstract
Anderson's paving conjectures are known to be equivalent to the Kadison-Singer problem. We prove some new equivalences of Anderson's conjectures that require the paving of smaller sets of matrices. We prove that if the strictly upper triangular operatorss are pavable, then every 0 diagonal operator is pavable. This result follows from a new paving condition for positive operators. In addition, we prove that if the upper triangular Toeplitz operators are paveable, then all Toeplitz operators are paveable.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.