Re:Mathematicians prove Pólya's conjecture for the eigenvalu...
by kmm on Saturday March 02, 2024 @01:02PM
(#39574364)
Being easy to prove doesn't make it unremarkable. Lots of theorems, including this one, have straightforward proofs once you are given the exact formulation. The tricky part is coming up with the idea for the theorem itself. I remember being (mildly) shocked when I was taught this in undergrad, it just seemed too good to be true.
Re:Mathematicians prove Pólya's conjecture for the eigenvalu...
by stabbles on Saturday March 02, 2024 @01:41PM
(#39574748)
I think that's just how textbooks present it. A fact is stated but you're lacking intuition.
If you had played around a bit with Laplacian matrices, like tri-diagonal matrices with stencil [-1, 2, -1], and found that its eigenvalues are within 2 ± 2, and if you also realized that A + τI has the same eigenvalues shifted by τ, then it's a small step to consider that the magnitude of the off-diagonal may have something to do with the spread of eigenvalues.
It's likely that Gerschgorin stumbled upon it like this.
Re:Mathematicians prove Pólya's conjecture for the eigenvalu...
by xelxebar on Sunday March 03, 2024 @08:05AM
(#39580570)
> tri-diagonal matrices with stencil [-1, 2, -1],
Just trying to understand these terms. So is a 5x5 tridiagonal matrix with your stencil look like this?
2 -1 0 0 0
-1 2 -1 0 0
0 -1 2 -1 0
0 0 -1 2 -1
0 0 0 -1 2
Re:Mathematicians prove Pólya's conjecture for the eigenvalu...
by stabbles on Sunday March 03, 2024 @09:26AM
(#39581000)
Yeah, exactly. Your matrix shows up when you do a 3-point discretization of -u''(x) = λu(x) with u(0) = u(1) = 0, at 5 equidistant (interior) grid points. That's the discrete, 1D version of the problem they're looking at in the paper.
See https://en.wikipedia.org/wiki/Compact_stencil#Three_Point_St...
Re:Mathematicians prove Pólya's conjecture for the eigenvalu...
by llmzero on Saturday March 02, 2024 @02:36PM
(#39575156)
Just thinking about some intuition for the result of the theorem: If the off diagonal elements are zero then the diagonal element is an eigenvalue, by continuity of the determinant, if the off diagonal element are small then $det(A-a_{ii}\lambda)$ is almost zero, that is the new eigenvalue is near aii. So it suggests that the off diagonal elements measure how far is aii from being an eigenvalue.
Re:Mathematicians prove Pólya's conjecture for the eigenvalu...
by nine_k on Saturday March 02, 2024 @01:02PM
(#39574367)
The Euler's identity is also trivial to deduce, but this doesn't diminish its beauty.
Re:Mathematicians prove Pólya's conjecture for the eigenvalu...
by xanderlewis on Saturday March 02, 2024 @01:25PM
(#39574576)
The Yoneda lemma is another great example of (once you've got the right setup) trivial but beautiful
Re:Mathematicians prove Pólya's conjecture for the eigenvalu...
by moralestapia on Saturday March 02, 2024 @02:34PM
(#39575144)
Huh?
Math 101, simple is better.
Re:Mathematicians prove Pólya's conjecture for the eigenvalu...
by jonahx on Saturday March 02, 2024 @03:09PM
(#39575375)
removed
Re:Mathematicians prove Pólya's conjecture for the eigenvalu...
by tsimionescu on Saturday March 02, 2024 @04:29PM
(#39575944)
They are saying that the Greshgorin theorem that the OP is talking about is simple to prove, not the Polya conjecture that took 70 years from the article.
Given Ax=λx, take i for which |xᵢ| is largest. Look at the i'th equation: sum aᵢⱼxⱼ = λxᵢ, move the aᵢᵢxᵢ term to the rhs, take absolute values, divide by |xᵢ|, apply triangle inequality, and you have |aᵢᵢ - λ| ≤ sum |aᵢⱼ| over j≠i. So for every eigenvalue you can find such a disc.
That's by column, for row use Aᵀ.