Block Lanczos successive-iteration interlacing conjecture
Let be a symmetric matrix and let be a block vector. Let be the largest index such that the block Krylov subspace has full dimension. For , let be the symmetric block tridiagonal matrix generated at the th iteration of the block Lanczos algorithm applied to and , with spectral decomposition whose Ritz values are . Block Lanczos interlacing conjecture. Each open interval
contains at least one Ritz value of for every satisfying . To the best of the authors' knowledge, no result was known that generalized the corresponding single-vector property to symmetric block tridiagonal matrices; the conjecture proposes precisely this generalization of interlacing across subsequent block Lanczos iterations.
References
Primary source
Dorota Šimonová and Petr Tichý, “On finite precision block Lanczos computations”, arXiv:2507.16484 (2025).
Progress summary
The conjecture remains open, but an unverified submission dated August 25, 2026 claims a proof through a stronger spectral-gap result.
Šimonová and Tichý formulated the conjecture in 2025 as a block analogue of known single-vector Lanczos interlacing. It asks whether every specified gap between Ritz values at iteration contains a Ritz value at every later iteration.
Known results
- Consecutive iterations satisfy .
- Numerical tests reportedly confirmed the conjecture in all tested cases, but the authors identified a complete proof as open.
Community submission (unverified), August 25, 2026
A submitted proof argues a stronger theorem: if an irreducible symmetric block-tridiagonal matrix has a spectral gap , then each earlier leading block has at most eigenvalues in . Its rank–nullity argument and positivity of are claimed to imply the conjecture, but the argument has not been independently verified.
Current status (as of August 2026): The conjecture has no verified resolution; a community-submitted proof claim is the only reported new development and remains unverified.
Sources
- arxiv.org
- arxiv.org
- scicomp.stackexchange.com
- en.wikipedia.org
- netlib.org
- bzhangcw.io
- diva-portal.org
- quantamagazine.org
- quantamagazine.org
- arxiv.org
- arxiv.org
- ar5iv.labs.arxiv.org
- ar5iv.labs.arxiv.org
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- quantamagazine.org
- openai.com
- quantamagazine.org
- quantamagazine.org
- community.openai.com
Solutions 1
ProofThis solution needs a summarySee full solution
Strict block-Lanczos interlacing at every subsequent iteration
We prove the conjecture posed in Section 2.1 of D. Šimonová and P. Tichý, On finite precision block Lanczos computations, BIT Numerical Mathematics 65 (2025), Article 47, doi:10.1007/s10543-025-01089-2, arXiv:2507.16484. In fact, a stronger sharp spectral-gap theorem holds for every irreducible symmetric block-tridiagonal matrix.
A sharp spectral-gap theorem
Fix a block size , and let
where every is symmetric and every is invertible. Write for its leading principal block submatrix, with .
Spectral-gap theorem. If and
then has at most eigenvalues in , counted with algebraic multiplicity.
Proof. Suppose instead that has at least eigenvalues in . Let be a -dimensional subspace spanned by orthonormal eigenvectors corresponding to such eigenvalues. Projection onto the last -dimensional block defines a linear map
By rank–nullity, there exists a nonzero with
Extend by zero blocks to a vector in . Block tridiagonality and (4) imply
Consequently, for the quadratic polynomial
we obtain
By (2), for every . Therefore is positive semidefinite. On the other hand, since , the spectral expansion for gives
where denotes the orthogonal spectral projection. Hence both sides of (7) vanish. Positive semidefiniteness then implies
Let be the largest block index for which . By (4),
The -nd block of and of vanishes. The corresponding block of is obtained by taking the unique two-step block path from to . Thus
because both off-diagonal blocks are invertible. This contradicts (9), proving the spectral-gap theorem.
The bound cannot be improved. Take
Their respective spectra are
with each displayed eigenvalue having multiplicity . The open spectral gap of contains exactly eigenvalues of , all equal to .
Proof of the block-Lanczos conjecture
Write the ordered Ritz values of as
Every eigenvalue of an irreducible symmetric block-tridiagonal matrix has multiplicity at most . Indeed, the eigenvector equation determines every subsequent block uniquely from the first block, since each is invertible. The map sending an eigenvector to its first block is therefore injective into . In particular,
Fix any later iteration with , and set
The closed interval contains at least the Ritz values
counted with multiplicity. The spectral-gap theorem therefore rules out . Hence
The full-dimension block-Krylov assumption in the conjecture guarantees precisely the invertibility of the off-diagonal blocks required above. Thus the conjecture holds for every block size and every subsequent Lanczos iteration, and the stronger spectral-gap count is optimal.