Suppose we have $n \times n$ symmetric matrix $A$ with all diagonal entries zero and remaining entries are non negative. Let $B$ be the matrix obtained from $A$ by deleting its $k$th row and $k$th column and remaining entries of $B$ are less equal the corresponding entries of $A$. Then the largest eigenvalue of $B$ is less equal the largest eigenvalue of $A$ and the smallest eigenvalue of $A$ is less equal the smallest eigenvalue of $B$.
Subscribe to:
Post Comments (Atom)
analysis - Injection, making bijection
I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...
-
So if I have a matrix and I put it into RREF and keep track of the row operations, I can then write it as a product of elementary matrices. ...
-
I am asked to prove the density of irrationals in $\mathbb{R}$. I understand how to do this by proving the density of $\mathbb{Q}$ first, na...
-
Can someone just explain to me the basic process of what is going on here? I understand everything until we start adding 1's then after ...
No comments:
Post a Comment