A square matrix is a diagonalizable matrix over the chosen field when there are an invertible matrix and a diagonal matrix such that . If is column of and , the identity gives . Invertibility makes these columns linearly independent eigenvectors.
Conversely, put linearly independent eigenvectors in the columns of and their eigenvalues in . Then is invertible and , givingRepeated eigenvalues are allowed; the requirement is a complete eigenbasis, not distinctness of the eigenvalues.
A single eigenbasis works for every choice of the parameters. The columns , , satisfyThey are linearly independent because their column matrix has determinant one. Thus the diagonalization isThis formula includes all coincidences among , so no special repeated-eigenvalue cases need separate bases.
The diagonalization in part (b) gives . HenceSufficiency follows from the scalar powers tending to zero; necessity also follows immediately from the diagonal entries of . Under these conditions the matrix geometric series converges, and its sum isWriting , and , all entries are explicitlyFor example, and . These expressions remain valid when parameter values coincide.
Expand the quadratic form of this Gram matrix:For , linear independence of the real vectors implies , so its squared Euclidean norm is strictly positive. Thusproving the positive definiteness of a Gram matrix in the independent-vector case.
Articles by others on the same topic
There are currently no matching articles.