Skip to content

A proof of the interlacing conjecture for the singular values of Sylvester-Kac matrices

Fuying Tang, Shuo Shi

math.RAarXiv:2610.21702

Abstract

Boros and Rózsa (Linear Algebra Appl. 421 (2007) 407--416) reduced the singular value problem for the odd-order Sylvester--Kac matrix P∈R(2m+1)×(2m+1) to those for Q(m)∈R(m+1)× m and S(m)∈Rm×(m+1) via a permutation similarity transformation. They noted that (Q(m))TQ(m)-S(m)(S(m))T is positive definite, and also conjectured that σi(S(m))σi+1(Q(m)) for 1 i m-1 and m2. In this paper, we prove that these inequalities are strict and establish the strict interlacing relation equation* σ1(Q(m))>σ1(S(m))> ·s>σm(Q(m))> σm(S(m))>0 equation* for all m1. Here, σi(·) denotes the i-th largest singular value of a matrix.

Create a lesson