Suppose we have a $n\times n$ symmetric positive semi-definite matrix $\mathbf{A}$. Based on Gershgorin circles theorem all the eigenvalues of the, $\mathbf{A}=[a_{ij}]$, are located in the union of $n$ circles: \begin{equation*} \bigcup_{i=1}^{p}\bigg\{r\in \mathbb{R}:|r-a_{ii}|\leq R_{i}(\mathbf{A})\bigg\} \end{equation*} where $R_{i}(\mathbf{A})=\sum_{j,j\neq i}^{n}|a_{ij}|$. Therefore, bounds of Gershgorin: \begin{equation*} [\lambda^{\geq}(\mathbf{A}) = min_{i} (a_{ii}-R_{i}(\mathbf{A})), \lambda^{\leq}(\mathbf{A}) = max_{i} (a_{ii}+R_{i}(\mathbf{A}))] \end{equation*} Now, we create a family of matrices: \begin{equation} \mathbf{A}(t) = t\mathbf{B}+\mathbf{D}, \end{equation} where $\mathbf{D}$ is the same as $\mathbf{A}$ with all the off-diagonal entries reduced to zero and $\mathbf{B}$ is the same as $\mathbf{A}$ with all the diagonal entries reduced to zero all along the interval $0<t\leq1$.
Are the following statements correct? \begin{equation} λ_1(A(t))>λ_1(A) \\ λ_n(A(t))<λ_n(A) \end{equation} where $\lambda_{1}(\mathbf{A}(t))$ and $\lambda_{n}(\mathbf{A}(t))$ are the smallest and largest eigenvalue repectively.
Thanks.