The Spectral Theorem #shorts

preview_player
Показать описание
The spectral theorem assures that a symmetric matrix has real eigenvalues. It can be diagonalized using an orthogonal matrix. The proof is most intuitive using result of von Neumann and Wigner. We look at the example of a complete network, where the eigenvalues determine the number of spanning trees in the network. This formula n^(n-2) is due to Cayley.
Рекомендации по теме
Комментарии
Автор

We really need more math shorts. Love it 😎

gymratsunited