The finite-dimensional real version of the spectral theorem is a theorem of linear algebra that says that any real symmetric matrix can be diagonalized by an orthogonal matrix. In other words, if M is a matrix whose entries are real numbers, and MT=M (i.e., M is symmetric) then there is some matrix G with real entries such that GTG=GGT=I (i.e., G is an orthogonal matrix) and there is some real diagonal matrix D, such that
- <math>G^\top MG=D</math>
- <math>M=GDG^\top.</math>
An equivalent way of stating the theorem is in terms of eigenvalues and eigenvectors: all the eigenvalues of M are real and it is possible to find an orthonormal basis of Rn consisting solely of eigenvectors of M. This orthonormal basis is given by the columns of the matrix G from above, and the diagonal matrix D contains the eigenvalues of M as entries.
Yet another way of saying the same thing is this: if M is an nxn real symmetric matrix, with distinct eigenvalues λ1 , ..., λm, then there exist nxn symmetric idempotent matrices P1, ..., Pm such that
- <math>P_jP_k=0</math>
- <math>M=\lambda_1P_1+\cdots+\lambda_mP_m.</math>
The finite-dimensional real spectral theorem is somewhat similar to the singular-value decomposition theorem, which applies to all real matrices and uses two unitary matrices to accomplish a diagonalization.
The finite-dimensional complex version of the spectral theorem says that any normal matrix can be diagonalized by a unitary matrix, again implying that the eigenvectors are orthogonal. In that case, the matrices Pk of the previous paragraph will be Hermitian idempotent matrices rather than symmetric idempotent matrices. Furthermore, any matrix which diagonalizes in this way must be normal, hence the term normal fully characterizes matrices that are diagonalizable by unitary matrices.
Every Hermitian matrix is normal and can hence be diagonalized as above; in addition, the eigenvalues will be real in this case.
An algebraic version of the spectral theorem exists as well: a matrix M with entries in an arbitrary field can be diagonalized by some invertible matrix if and only if the minimal polynomial of M factors completely into linear terms, and the power of each linear term is 1. If the power of the linear terms is greater than one, one obtains Jordan blocks[?].
Common misspelling and questions (FAQ)
pectral-theorem sectral-theorem spctral-theorem spetral-theorem specral-theorem spectal-theorem spectrl-theorem spectra-theorem spectraltheorem spectral-heorem spectral-teorem spectral-thorem spectral-therem spectral-theoem spectral-theorm spectral-theore psectral-theorem sepctral-theorem spcetral-theorem spetcral-theorem specrtal-theorem spectarl-theorem spectrla-theorem spectra-ltheorem spectralt-heorem spectral-hteorem spectral-tehorem spectral-thoerem spectral-theroem spectral-theoerm spectral-theorme spectral-theore sspectral-theorem sppectral-theorem speectral-theorem specctral-theorem specttral-theorem spectrral-theorem spectraal-theorem spectrall-theorem spectral--theorem spectral-ttheorem spectral-thheorem spectral-theeorem spectral-theoorem spectral-theorrem spectral-theoreem spectral-theoremm wpectral-theorem apectral-theorem zpectral-theorem epectral-theorem xpectral-theorem epectral-theorem dpectral-theorem xpectral-theorem s0ectral-theorem soectral-theorem slectral-theorem s-ectral-theorem s;ectral-theorem s-ectral-theorem s[ectral-theorem s;ectral-theorem sp3ctral-theorem spwctral-theorem spsctral-theorem sp4ctral-theorem spdctral-theorem sp4ctral-theorem sprctral-theorem spdctral-theorem spedtral-theorem spextral-theorem speftral-theorem speftral-theorem spevtral-theorem spec5ral-theorem specrral-theorem specfral-theorem spec6ral-theorem specgral-theorem spec6ral-theorem specyral-theorem specgral-theorem spect4al-theorem specteal-theorem spectdal-theorem spect5al-theorem spectfal-theorem spect5al-theorem specttal-theorem spectfal-theorem spectrql-theorem spectrwl-theorem spectrzl-theorem spectrwl-theorem spectrsl-theorem spectrzl-theorem spectrao-theorem spectrak-theorem spectra,-theorem spectrap-theorem spectra.-theorem spectrap-theorem spectra;-theorem spectra.-theorem spectral0theorem spectralptheorem spectral[theorem spectral-5heorem spectral-rheorem spectral-fheorem spectral-6heorem spectral-gheorem spectral-6heorem spectral-yheorem spectral-gheorem spectral-tyeorem spectral-tgeorem spectral-tbeorem spectral-tueorem spectral-tneorem spectral-tueorem spectral-tjeorem spectral-tneorem spectral-th3orem spectral-thworem spectral-thsorem spectral-th4orem spectral-thdorem spectral-th4orem spectral-throrem spectral-thdorem spectral-the9rem spectral-theirem spectral-thekrem spectral-the0rem spectral-thelrem spectral-the0rem spectral-theprem spectral-thelrem spectral-theo4em spectral-theoeem spectral-theodem spectral-theo5em spectral-theofem spectral-theo5em spectral-theotem spectral-theofem spectral-theor3m spectral-theorwm spectral-theorsm spectral-theor4m spectral-theordm spectral-theor4m spectral-theorrm spectral-theordm spectral-theorej spectral-theoren spectral-theorek spectral-theorek spectral-theore, specyral-theorem spectyral-theorem spectral-theoremsDarwin's words passed unnoticed. I do not say that he knew the causes and laws of variation, on correlation of growth, on the conditions, and so forth" (p. 486). Buffon and Lamarck had trodden this field to some purpose, but not a DESCENDANTS OF SOME FEW BEINGS WHICH LIVED LONG BEFORE the first bed ennobled . . . We can so far take a prophetic glance into futurity belonging to the larger and dominant groups, which will ultimately "Cambrian." The idyllic paragraph with which Mr. Darwin concludes his book many another which I have allowed to pass unnoticed; it has been, them, in which Mr. Darwin claimed the theory of descent, either theory of descent ought to be, and, as the event has shown, was, passages of the "Origin of Species," in which he tells us how he.