证明Bourgain-Tzafriri限制可逆性定理的简化Spielman和Srivastava算法
The simplified version of the Spielman and Srivastava algorithm for proving the Bourgain-Tzafriri restricted invertiblity theorem
摘要：
通过放弃最佳常数，我们将看到Spielman和Srivastava证明Bourgain-Tzafriri限制可逆性定理\cite{SS}的原始论证仍然有效--而且比最终版本简单得多。我们不打算发表这篇文章，因为这是他们的论点，只是一个微不足道的修改，但我们想让它提供给数学界，因为已经有几个人要求它了。
英文摘要：
By giving up the best constants, we will see that the original argument of Spielman and Srivastava for proving the Bourgain-Tzafriri Restricted Invertibility Theorem \cite{SS} still works - and is much simplier than the final version. We do not intend on publishing this since it is their argument with just a trivial modification, but we want to make it available to the mathematics community since several people have requested it already.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
