Abstract
A basic theorem in linear algebra says that if the eigenvalues and the diagonal entries of a Hermitian matrix A are ordered as \(\lambda _{1}\le \lambda _{2}\le ...\le \lambda _{n}\) and \(a_{1}\le a_{2}\le ...\le a_{n}\), respectively, then \(\lambda _{1}\le a_{1}\). We show that for some special classes of Hermitian matrices this can be extended to inequalities of the form \(\lambda _{k}\le a_{2k-1}\), \(k=1,2,...,\lceil \frac{n}{2}\rceil \).
Similar content being viewed by others
References
A. Berman and M. Farber, A lower bound for the second largest Laplacian eigenvalues of weighted graphs, Electron. J. Linear Algebra, 22 (2011), 1179-1184.
R. Bhatia, Matrix Analysis, Springer, New York (1997).
Z. Charles, M. Farber, C.R. Johnson, L.K. Shaffer, The relation between the diagonal entries and eigenvalues of a symmetric matrix, based upon the sign patterns of its off-diagonal entries, Linear Algebra Appl; 438 (2013), 1427-1445.
Acknowledgements
The second author thanks Ashoka University for arranging his visit during Dec 2021-Jan 2022.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by B V Rajarama Bhat.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Bhatia, R., Sharma, R. Eigenvalues and diagonal elements. Indian J Pure Appl Math 54, 757–759 (2023). https://doi.org/10.1007/s13226-022-00293-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13226-022-00293-y