I was reading an old paper by Wilf: http://www.math.upenn.edu/~wilf/website/Eigenvalues%20of%20a%20graph.pdf
In short, he has made some claim about a lower bound for the largest eigenvalue of a non-negative matrix. (Which, by the Perron–Frobenius theorem is non-negative, and it has an all positive eigenvector)
And it made great sense to me until I got to one claim in the end, where he discussed another matrix, which was identical to the old one, except he replaced some of its entries by 0s, and claimed that the new matrix' highest eigenvalue can't be higher than the original's, and after spending some time trying to prove that fact, I haven't been able to.
Am I missing something?
Is it true in general that if a non-negative matrix A dominates a second non-negative matrix B, all of B's positive eigenvalues are no greater than A's?