ArticlePDF Available

Revisiting the Bourgain-Tzafriri restricted invertibility theorem

Authors:

Abstract

Wewill give somenew techniques for working with problems surrounding the Bourgain- Tzafriri Restricted Invertibility Theorem. First we show that the parameters which work in the theorem for allT � 2 √ 2 closely approximate the parameters which work for all operators. This yields a generalization of the theorem which simultaneously does restricted invertibility on a small partition of the vectors and yields a direct proof that the Bourgain-Tzafriri Conjecture is equivalent to the Feichtinger Conjecture. We also fill in two gaps in the theory involving the relationship between paving results for norm one operators with zero diagonal and restricted invertibility results.
Operators
and
Matrices
Volume 3, Number 1 (2009), 97–110
REVISITING THE BOURGAIN–TZAFRIRI
RESTRICTED INVERTIBILITY THEOREM
PETER G. CASAZZA AND JANET C. TREMAIN
Abstract. We will give some new techniques for working with problems surrounding the Bourgain-
Tzafriri Restricted Invertibility Theorem. First we show that the parameters which work in the
theorem for all T22 closely approximate the parameters which work for all operators.
This yields a generalization of the theorem which simultaneously does restricted invertibility on
a small partition of the vectors and yields a direct proof that the Bourgain-Tzafriri Conjecture
is equivalent to the Feichtinger Conjecture. We also ll in two gaps in the theory involving the
relationship between paving results for norm one operators with zero diagonal and restricted
invertibility results.
Mathematics subject classication (2000): Primary: 46B03, 46B07, 47A05.
Keywords and phrases:Restricted invertibility theorem, Bourgain-Tzafriri conjecture, Feichtinger con-
jecture, Kadison-Singer problem.
REFERENCES
[1] J. A NDERSON,Restrictions and representations of states on C-algebras,Trans.AMS,249 (1979)
303–329.
[2] K. B ERMAN,H.HALPERN,V.KAFTAL AND G. WEISS,Matrix norm inequalities and the relative
Dixmier property, Integ. Eqns. and Operator Theory, 11 (1988), 28–48.
[3] J. B OURGAIN AND L. TZAFRI RI,Invertibility of “large” submatrices and applications to the geom-
etry of Banach spaces and Harmonic Analysis, Israel J. Math., 57 (1987), 137–224.
[4] J. B OURGAIN AND L. TZAFRI RI,On a problem of Kadison and Singer, J. Reine. Angew. Math., 420
(1991), 1–43.
[5] P.G. C ASAZZA,The art of frame theory, Taiwanese Jour. of Math., 42 (2000), 1–127.
[6] P.G. C ASAZZA,O.CHRISTENSEN,A. LINDNER AND R. VERSHYNI N,Frames and the Feichtinger
conjecture, Proceedings of AMS, 133 4 (2005), 1025–1033.
[7] P.G. C ASAZZA,M.FICKUS,J.C.TREMAIN,AND E. WEBER,The Kadison-Singer Problem in Math-
ematics and Engineering: Part II: A detailed account, Operator Theory, Operator Algebras and Ap-
plications, Proceedings of the 25th GPOTS Symposium (2005), D. Han, P.E.T. Jorgensen and D.R.
Larson Eds., Contemporary Math, 414 (2006), 299–356.
[8] P.G. C ASAZZA AND J.C. TREMAIN,The Kadison-Singer problem in Mathematics and Engineering,
PNAS, 103 7 (2006), 2032–2039.
[9] P.G. C ASAZZA AND R. VERS HYNIN,Kadison-Singer meets Bourgain-Tzafriri, unpublished.
[10] O. C HRISTENSEN,An introduction to frames and Riesz bases, Birkhauser, Boston, 2003.
[11] R. K ADISON AND I. SINGER,Extensions of pure states, American Jour. Math., 81 (1959), 383–400.
[12] R. V ERSHYNIN,John’s decompositions: selecting a large part, Israel Jour. Math., 122 (2001), 253–
277.
[13] R. V ERSHYNIN,Random sets of isomorphism of linear operators, IMS Lecture Notes – Monograph
Series, High Dimensional Probability, 51 (2006), 148–154.
[14] N. W EAVER,The Kadison-Singer Problem in discrepancy theory, Discrete Math., 278 (2004), 227–
239.
Operators and Matrices
www.ele-math.com
oam@ele-math.com
c
,Zagreb
Paper OaM-03-04
... Over the 55 year history of the Kadison-Singer Problem, a significant amount of research was generated resulting in a number of partial results as well as a large number of equivalent problems. These include the Anderson Paving Conjectures [2,3,4], the Akemann-Anderson Projection Paving Conjecture [1], the Weaver Conjectures [45], the Casazza-Tremain Conjecture [23], the Feichtinger Conjecture [14], the R ǫ -Conjecture [23], the Bourgain-Tzafriri Conjecture [23], the Sundberg Problem [20]. Many directions for approaching this problem were proposed and solutions were given for special cases: All matrices with positive coefficients are pavable [29] as are all matrices with "small" coefficients [11]. ...
... Over the 55 year history of the Kadison-Singer Problem, a significant amount of research was generated resulting in a number of partial results as well as a large number of equivalent problems. These include the Anderson Paving Conjectures [2,3,4], the Akemann-Anderson Projection Paving Conjecture [1], the Weaver Conjectures [45], the Casazza-Tremain Conjecture [23], the Feichtinger Conjecture [14], the R ǫ -Conjecture [23], the Bourgain-Tzafriri Conjecture [23], the Sundberg Problem [20]. Many directions for approaching this problem were proposed and solutions were given for special cases: All matrices with positive coefficients are pavable [29] as are all matrices with "small" coefficients [11]. ...
... Over the 55 year history of the Kadison-Singer Problem, a significant amount of research was generated resulting in a number of partial results as well as a large number of equivalent problems. These include the Anderson Paving Conjectures [2,3,4], the Akemann-Anderson Projection Paving Conjecture [1], the Weaver Conjectures [45], the Casazza-Tremain Conjecture [23], the Feichtinger Conjecture [14], the R ǫ -Conjecture [23], the Bourgain-Tzafriri Conjecture [23], the Sundberg Problem [20]. Many directions for approaching this problem were proposed and solutions were given for special cases: All matrices with positive coefficients are pavable [29] as are all matrices with "small" coefficients [11]. ...
Article
Full-text available
It is known that the famous, intractible 1959 Kadison-Singer problem in $C^{*}$-algebras is equivalent to fundamental unsolved problems in a dozen areas of research in pure mathematics, applied mathematics and Engineering. The recent surprising solution to this problem by Marcus, Spielman and Srivastava was a significant achievement and a significant advance for all these areas of research. We will look at many of the known equivalent forms of the Kadison-Singer Problem and see what are the best new theorems available in each area of research as a consequence of the work of Marcus, Spielman and Srivastave. In the cases where {\it constants} are important for the theorem, we will give the best constants available in terms of a {\it generic constant} taken from \cite{MSS}. Thus, if better constants eventually become available, it will be simple to adapt these new constants to the theorems.
... Theorem 1.1 from [4] and subsequent work of Bourgain and Tzafriri ( [5], [6]) are strongly related to the famous Kadison-Singer conjecture [9]. This was a central problem in C *algebras that was restated by Anderson in [1] as a problem about matrices and it was proved by Casazza and Tremain in [7] that a certain statement that is related to Theorem 1.1 is equivalent to this conjecture. Within this context (and others), Theorem 1.1 has been studied, reproved, and generalized many times including results by Vershynin in [19], by Spielman and Srivastava in [18] (who showed that for 0 < ε < 1 one can choose c 0 = ε 2 and d 0 = (1 − ε) 2 ), and by Naor and Youssef in [16]. ...
Preprint
Full-text available
Motivated by an influential result of Bourgain and Tzafriri, we consider continuous matrix functions $A:\mathbb{R}\to M_{n\times n}$ and lower $\ell_2$-norm bounds associated with their restriction to certain subspaces. We prove that for any such $A$ with unit-length columns, there exists a continuous choice of subspaces $t\mapsto U(t)\subset \mathbb{R}^n$ such that for $v\in U(t)$, $\|A(t)v\|\geq c\|v\|$ where $c$ is some universal constant. Furthermore, the $U(t)$ are chosen so that their dimension satisfies a lower bound with optimal asymptotic dependence on $n$ and $\sup_{t\in \mathbb{R}}\|A(t)\|.$ We provide two methods. The first relies on an orthogonality argument, while the second is probabilistic and combinatorial in nature. The latter does not yield the optimal bound for $\dim(U(t))$ but the $U(t)$ obtained in this way are guaranteed to have a canonical representation as joined-together spaces spanned by subsets of the unit vector basis.
... maximizes the right hand side of (8). Then by simple calculation, we can obtain (7). ...
Preprint
The restricted invertibility theorem was originally introduced by Bourgain and Tzafriri in $1987$ and has been considered as one of the most celebrated theorems in geometry and analysis. In this note, we present weighted versions of this theorem with slightly better estimates. Particularly, we show that for any $A\in\mathbb{R}^{n\times m}$ and $k,r\in\mathbb{N}$ with $k\leq r\leq \mbox{rank}(A)$, there exists a subset $\mathcal{S}$ of size $k$ such that $\sigma_{\min}(A_{\mathcal{S}}W_{\mathcal{S}})^2\geq \frac{(\sqrt{r}-\sqrt{k-1})^2}{\|W^{-1}\|_F^{2}}\cdot\frac{r}{\sum_{i=1}^{r}\sigma_{i}(A)^{-2}}$, where $W=\mbox{diag}(w_1,\ldots,w_m)$ with $w_i$ being the weight of the $i$-th column of $A$. Our constructions are algorithmic and employ the interlacing families of polynomials developed by Marcus, Spielman, and Srivastava.
... Then,S has the following eigenvalues listed in decreasing order [20]. This result states that Bessel sequences consisting of unit norm vectors can be partitioned into almost orthogonal sequences. ...
Article
We give self-contained presentation of results related to the Kadison-Singer problem, which was recently solved by Marcus, Spielman, and Srivastava. This problem connects with unusually large number of areas including: operator algebras (pure states), set theory (ultrafilters), operator theory (paving), random matrix theory, linear and multilinear algebra, algebraic combinatorics (real stable polynomials), algebraic curves, frame theory, harmonic analysis (Fourier frames), and functional analysis.
Article
We study the construction of exponential frames and Riesz sequences for a class of fractal measures on ℝd generated by infinite convolution of discrete measures using the idea of frame towers and Riesz-sequence towers. The exactness and overcompleteness of the constructed exponential frame or Riesz sequence is completely classified in terms of the cardinality at each level of the tower. Using a version of the solution of the Kadison-Singer problem, known as the Rϵ-conjecture, we show that all these measures contain exponential Riesz sequences of infinite cardinality. Furthermore, when the measure is the middle-third Cantor measure, or more generally for self-similar measures with no-overlap condition, there are always exponential Riesz sequences of maximal possible Beurling dimension.
Chapter
In this chapter, the traditional point of view is reversed in the sense that the measurement matrix is a fixed matrix with small coherence and that the randomness lies in the support and the sign pattern of the sparse vector to be recovered. First, the submatrix whose columns are indexed by the random support is proved to be well-conditioned. This is then used to achieve recovery of random sparse vectors via ℓ 1-minimization under a familiar condition on the number of measurements.
Article
Full-text available
In this thesis, we address three themes : columns subset selection in a matrix, the Banach-Mazur distance to the cube and the estimation of the covariance of random matrices. Although the three themes seem distant, the techniques used are similar throughout the thesis. In the first place, we generalize the restricted invertibility principle of Bougain-Tzafriri. This result allows us to extract a "large" block of linearly independent columns inside a matrix and estimate the smallest singular value of the restricted matrix. We also propose a deterministic algorithm in order to extract an almost isometric block inside a matrix i.e a submatrix whose singular values are close to 1. This result allows us to recover the best known result on the Kadison-Singer conjecture. Applications to the local theory of Banach spaces as well as to harmonic analysis are deduced. We give an estimate of the Banach-Mazur distance between a symmetric convex body in Rn and the cube of dimension n. We propose an elementary approach, based on the restricted invertibility principle, in order to improve and simplify the previous results dealing with this problem. Several studies have been devoted to approximate the covariance matrix of a random vector by its sample covariance matrix. We extend this problem to a matrix setting and we answer the question. Our result can be interpreted as a quantified law of large numbers for positive semidefinite random matrices. The estimate we obtain, applies to a large class of random matrices
Article
We now know that some of the basic open problems in frame theory are equivalent to fundamental open problems in a dozen areas of research in both pure and applied mathematics, engineering, and others. These problems include the 1959 Kadison–Singer problem in C ∗-algebras, the paving conjecture in operator theory, the Bourgain–Tzafriri conjecture in Banach space theory, the Feichtinger conjecture and the R ϵ -conjecture in frame theory, and many more. In this chapter we will show these equivalences among others. We will also consider a slight weakening of the Kadison–Singer problem called the Sundberg problem. Then we will look at the recent advances on another deep problem in frame theory called the Paulsen problem. In particular, we will see that this problem is also equivalent to a fundamental open problem in operator theory. Namely, if a projection on a finite dimensional Hilbert space has a nearly constant diagonal, how close is it to a constant diagonal projection?
Article
Full-text available
In 1959, R.V. Kadison and I.M. Singer asked whether each pure state of the algebra of bounded diagonal operators on $\ell^2$, admits a unique state extension to $B(\ell^2)$. The positive answer was given in June 2013 by A. Marcus, D. Spielman and N. Srivastava, who took advantage of a series of translations of the original question, due to C. Akemann, J. Anderson, N. Weaver,... Ultimately, the problem boils down to an estimate of the largest zero of the expected characteristic polynomial of the sum of independent random variables taking values in rank 1 positive matrices in the algebra of n-by-n matrices.
Article
Full-text available
We show that the Kadison-Singer problem is equivalent to the (strong) restricted invertibility conjecture of Bourgain-Tzafriri. We also show that these two problems are equivalent to two problems in frame the-ory holding simultaneously: (1) the Feichtinger Conjecture, and (2) the R -Conjecture. Next, we show that Bourgain-Tzafriri restricted-invertibility principle holds on random subspaces. This extends the principle in several ways and shows that slightly weaker versions of the conjectures hold.
Article
Full-text available
We show that the conjectured generalization of the Bourgain-Tzafriri restricted-invertibility theorem is equivalent to the conjecture of Feichtinger, stating that every bounded frame can be written as a finite union of Riesz basic sequences. We prove that any bounded frame can at least be written as a finite union of linear independent sequences. We further show that the two conjectures are implied by the paving conjecture. Finally, we show that Weyl-Heisenberg frames over rational lattices are finite unions of Riesz basic sequences.
Article
Full-text available
If x is a selfadjoint matrix with zero diagonal and non-negative entries, then there exists a decomposition of the identity into k diagonal orthogonal projections {pm} for which ||åpm xpm ||\leqslant (1/k)||x||\parallel \sum p_m xp_m \parallel \leqslant (1/k)\parallel x\parallel From this follows that all bounded matrices with non-negative entries satisfy the relative Dixmier property or, equivalently, the Kadison Singer extension property. This inequality fails for large Hadamard matrices. However a similar inequality holds for all matrices with respect to the Hilbert-Schmidt norm with constant k–1/2 and for Hadamard matrices with respect to the Schatten 4-norm with constant 21/4k–1/2.
Article
We give a combinatorial form of the Kadison-Singer problem, a famous problem in C*-algebra. This combinatorial problem, which has several minor variations, is a discrepancy question about vectors in C^n. Some partial results can be easily deduced from known facts in discrepancy theory.
Article
In the first three sections the question of when a pure state $g$ on a $C^\ast$-subalgebra $B$ of a $C^\ast$-algebra $A$ has a unique state extension is studied. It is shown that an extension $f$ is unique if and only if $\|\inf\|b(a - f(a)1)b\| = 0$ for each $a$ in $A$, where the $\inf$ is taken over those $b$ in $B$ such that $0 \leqslant b \leqslant 1$ and $g(b) = 1$. The special cases where $B$ is maximal abelian and/or $A = B(H)$ are treated in more detail. In the remaining sections states of the form $T \mapsto \lim_{\mathscr{u}}(Tx_\alpha, x_\alpha)$, where $\{x_\alpha\}_{\alpha \in \kappa}$ is a set of unit vectors in $H$ and $\mathscr{U}$ is an ultrafilter are studied.
Article
In a series of papers it was recently shown that the 1959 Kadison-Singer Problem in C * -Algebras is equivalent to fundamental un-solved problems in a dozen areas of research in pure mathematics, applied mathematics and engineering. Because of the length and depth of these papers, it has been difficult for people in the various impacted areas to get an overview of how their problems relate to the other areas of research. In this note we will give a short introduction to the various equivalences of the Kadison-Singer Problem for those inside and outside these fields who would like to appreciate these recent advances. We will also introduce several new equivalences of the Kadison-Singer Problem including, for the first time, connections to Algebraic Geometry.
Article
We will show that the famous, intractible 1959 Kadison-Singer problem in C * -algebras is equivalent to fundamental unsolved problems in a dozen areas of research in pure mathematics, applied mathematics and Engineering. This gives all these areas common ground on which to interact as well as explaining why each of these areas has volumes of literature on their respective problems without a satisfactory resolution. In each of these areas we will reduce the problem to the minimum which needs to be proved to solve their version of Kadison-Singer. In some areas we will prove what we believe will be the strongest results ever available in the case that Kadison-Singer fails. Finally, we will give some directions for constructing a counter-example to Kadison-Singer.