On the submatrices with the best-bounded inverses
This addresses a theoretical open problem in linear algebra, but the result is incremental as it only solves a narrow case (k=2) of a broader conjecture.
The paper tackles the problem of proving the existence of a k×k submatrix with a smallest singular value at least 1/√n in an n×k real matrix with orthonormal columns, providing a proof for the specific case where k=2.
The following hypothesis was formulated by Goreinov, Tyrtyshnikov, and Zamarashkin in \cite{goreinov1997theory}. If $U$ is $n\times k$ real matrix with the orthonormal columns $(n>k)$, then there exists a submatrix $Q$ of $U$ of size $k\times k$ such that its smallest singular value is at least $\frac{1}{\sqrt{n}}.$ Although this statement is supported by numerical experiments, the problem remains open for all $1<k<n-1,$ except for the case of $n \leq 4,\ k=2.$ In this work, we provide a proof for the case $k=2.$