Block Lanczos successive-iteration interlacing conjecture

About 1 year old · traced to

Let A∈Rn×nA\in\mathbb{R}^{n\times n} be a symmetric matrix and let v∈Rn×pv\in\mathbb{R}^{n\times p} be a block vector. Let ss be the largest index such that the block Krylov subspace Ks(A,v)\mathcal{K}_{s}(A,v) has full dimension. For 0<k<s0<k<s, let TkT_k be the symmetric block tridiagonal matrix generated at the kkth iteration of the block Lanczos algorithm applied to AA and vv, with spectral decomposition whose Ritz values are θ1(k),…,θkp(k)\theta_1^{(k)},\ldots,\theta_{kp}^{(k)}. Block Lanczos interlacing conjecture. Each open interval

(θi(k),θi+p(k)),i=1,…,(k−1)p,(\theta_i^{(k)},\theta_{i+p}^{(k)}),\qquad i=1,\ldots,(k-1)p,

contains at least one Ritz value of TjT_j for every jj satisfying k<j≤sk<j\leq s. 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

Refreshed
Claimed progress

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 kk contains a Ritz value at every later iteration.

Known results

  • Consecutive iterations satisfy θi(k)<θi+p(k+1)<θi+p(k)\theta_i^{(k)}<\theta_{i+p}^{(k+1)}<\theta_{i+p}^{(k)}.
  • 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 (a,b)(a,b), then each earlier leading block has at most pp eigenvalues in [a,b][a,b]. Its rank–nullity argument and positivity of (Tj−aI)(Tj−bI)(T_j-aI)(T_j-bI) 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

Solutions 1

ProofThis solution needs a summarySee full solutionHide 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 p≥1p\ge1, and let

Tj=(A1B2T0B2A2B3TB3A3⋱⋱⋱BjT0BjAj),(1)T_j= \begin{pmatrix} A_1&B_2^{\mathsf T}&&&0\\ B_2&A_2&B_3^{\mathsf T}&&\\ &B_3&A_3&\ddots&\\ &&\ddots&\ddots&B_j^{\mathsf T}\\ 0&&&B_j&A_j \end{pmatrix}, \tag{1}

where every Ar∈Rp×pA_r\in\mathbb R^{p\times p} is symmetric and every Br∈Rp×pB_r\in\mathbb R^{p\times p} is invertible. Write TkT_k for its leading kp×kpkp\times kp principal block submatrix, with 1≤k<j1\le k<j.

Spectral-gap theorem. If a<ba<b and

σ(Tj)∩(a,b)=∅,(2)\sigma(T_j)\cap(a,b)=\varnothing, \tag{2}

then TkT_k has at most pp eigenvalues in [a,b][a,b], counted with algebraic multiplicity.

Proof. Suppose instead that TkT_k has at least p+1p+1 eigenvalues in [a,b][a,b]. Let EE be a (p+1)(p+1)-dimensional subspace spanned by orthonormal eigenvectors corresponding to such eigenvalues. Projection onto the last pp-dimensional block defines a linear map

πk:E⟶Rp.(3)\pi_k:E\longrightarrow\mathbb R^p. \tag{3}

By rank–nullity, there exists a nonzero q∈Eq\in E with

qk=0.(4)q_k=0. \tag{4}

Extend qq by zero blocks to a vector in Rjp\mathbb R^{jp}. Block tridiagonality and (4) imply

Tjq=(Tkq0).(5)T_jq= \begin{pmatrix}T_kq\\0\end{pmatrix}. \tag{5}

Consequently, for the quadratic polynomial

f(x)=(x−a)(x−b),(6)f(x)=(x-a)(x-b), \tag{6}

we obtain

⟨q,f(Tj)q⟩=∥Tjq∥2−(a+b)⟨q,Tjq⟩+ab∥q∥2=⟨q,f(Tk)q⟩.(7)\begin{aligned} \langle q,f(T_j)q\rangle &=\|T_jq\|^2-(a+b)\langle q,T_jq\rangle +ab\|q\|^2\\ &=\langle q,f(T_k)q\rangle. \end{aligned} \tag{7}

By (2), f(λ)≥0f(\lambda)\ge0 for every λ∈σ(Tj)\lambda\in\sigma(T_j). Therefore f(Tj)f(T_j) is positive semidefinite. On the other hand, since q∈Eq\in E, the spectral expansion for TkT_k gives

⟨q,f(Tk)q⟩=∑λ∈σ(Tk)∩[a,b](λ−a)(λ−b) ∥Pλq∥2≤0,(8)\langle q,f(T_k)q\rangle =\sum_{\lambda\in\sigma(T_k)\cap[a,b]} (\lambda-a)(\lambda-b)\,\|P_\lambda q\|^2 \le0, \tag{8}

where PλP_\lambda denotes the orthogonal spectral projection. Hence both sides of (7) vanish. Positive semidefiniteness then implies

f(Tj)q=0.(9)f(T_j)q=0. \tag{9}

Let tt be the largest block index for which qt≠0q_t\ne0. By (4),

t≤k−1,t+2≤j.(10)t\le k-1, \qquad t+2\le j. \tag{10}

The (t+2)(t+2)-nd block of qq and of TjqT_jq vanishes. The corresponding block of Tj2qT_j^2q is obtained by taking the unique two-step block path from tt to t+2t+2. Thus

(f(Tj)q)t+2=(Tj2q)t+2=Bt+2Bt+1qt≠0,(11)\bigl(f(T_j)q\bigr)_{t+2} =\bigl(T_j^2q\bigr)_{t+2} =B_{t+2}B_{t+1}q_t\ne0, \tag{11}

because both off-diagonal blocks are invertible. This contradicts (9), proving the spectral-gap theorem.

The bound pp cannot be improved. Take

T2=(0IpIp0),T3=(0Ip0Ip0Ip0Ip0).(12)T_2= \begin{pmatrix}0&I_p\\I_p&0\end{pmatrix}, \qquad T_3= \begin{pmatrix} 0&I_p&0\\ I_p&0&I_p\\ 0&I_p&0 \end{pmatrix}. \tag{12}

Their respective spectra are

σ(T2)={−1,1},σ(T3)={−2,0,2},(13)\sigma(T_2)=\{-1,1\}, \qquad \sigma(T_3)=\{-\sqrt2,0,\sqrt2\}, \tag{13}

with each displayed eigenvalue having multiplicity pp. The open spectral gap (0,2)(0,\sqrt2) of T3T_3 contains exactly pp eigenvalues of T2T_2, all equal to 11.

Proof of the block-Lanczos conjecture

Write the ordered Ritz values of TkT_k as

θ1(k)≤θ2(k)≤⋯≤θkp(k).(14)\theta_1^{(k)}\le\theta_2^{(k)}\le\cdots\le\theta_{kp}^{(k)}. \tag{14}

Every eigenvalue of an irreducible symmetric block-tridiagonal matrix has multiplicity at most pp. Indeed, the eigenvector equation determines every subsequent block uniquely from the first block, since each BrB_r is invertible. The map sending an eigenvector to its first block is therefore injective into Rp\mathbb R^p. In particular,

θi(k)<θi+p(k)(1≤i≤(k−1)p).(15)\theta_i^{(k)}<\theta_{i+p}^{(k)} \qquad \bigl(1\le i\le(k-1)p\bigr). \tag{15}

Fix any later iteration jj with k<j≤sk<j\le s, and set

a=θi(k),b=θi+p(k).(16)a=\theta_i^{(k)}, \qquad b=\theta_{i+p}^{(k)}. \tag{16}

The closed interval [a,b][a,b] contains at least the p+1p+1 Ritz values

θi(k),θi+1(k),…,θi+p(k),(17)\theta_i^{(k)},\theta_{i+1}^{(k)},\ldots, \theta_{i+p}^{(k)}, \tag{17}

counted with multiplicity. The spectral-gap theorem therefore rules out σ(Tj)∩(a,b)=∅\sigma(T_j)\cap(a,b)=\varnothing. Hence

σ(Tj)∩(θi(k),θi+p(k))≠∅for every k<j≤s and 1≤i≤(k−1)p.(18)\boxed{ \sigma(T_j)\cap \bigl(\theta_i^{(k)},\theta_{i+p}^{(k)}\bigr) \ne\varnothing \quad \text{for every }k<j\le s \text{ and }1\le i\le(k-1)p. } \tag{18}

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 pp is optimal.