Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
@CarloBeenakker; even if I go one order higher and prove it, how will I show that it is true for all other dimensions? I am confused, can you please help
@CarloBeenakker; how would we get an accurate expression of $\alpha_1,\alpha_2$? I thought giving an upper bound would be easier than finding the exact eigenvalues, so I insisted on the bound
@CarloBeenakker; I had one question, how can we prove that $\alpha_1-\alpha_2<-3$ when we are in higher order. You did here the approximation for $0$ and $1$ order, isn't it? or am I missing something
If we could successfully prove it, then we won't require to use any complex calculations, so I asked you if it can be proved as is done in pure Mathematics, but I really appreciate the hard work you are putting in for me and I thank you for that.
Yes, but finding the eigenvalues requires an approximation whereas finding the bound is quite sharp, and frankly speaking I never did perturbation theory, so I am not aware of this concept
I was just wondering if this can be done with any bounds that exist on smallest and second smallest eigenvalue of a matrix, it just came to my mind so I thought of sharing with you