A new type of lower bound for the largest eigenvalue of a symmetric matrix (Q2383021)

Let \(A\) be a symmetric \(m\times m\) matrix and let \(\lambda_{\max}(A)\) denote the largest eigenvalue of \(A.\) The classical bound for \(\lambda_{\max}(A)\) says that \(\frac{1}{m}\sum_{i=1}^m\sum_{j=1}^ma_{ij}\leq \lambda_{\max}(A).\) The author uses Lagrange series to give an improvement for this bound. Theorem 1.1 is the main result.