False. Take the diagonal matrix and its eigenvectors , . Their sum is mapped to , which is not a scalar multiple of that sum. More generally, need not have the form when .
True. Applying the matrices in order gives . The eigenvalue isThis conclusion only uses the shared eigenvector; it does not require and to commute on other vectors.
If for a nonzero eigenvector, then . Thus , soBoth values need not occur: the zero matrix has only , and the identity matrix only . More precisely, an idempotent linear map whose rank of a linear map is has copies of and copies of . Indeed, its image of a linear map and kernel of a linear map form a direct sum, giving an eigenbasis without assuming an orthogonal projection.
On an eigenvector of with eigenvalue , the linear operator has eigenvalue . ThereforeThe multiplicities are exchanged: if the matrix rank of is , then has copies of and copies of . Again, a value with zero multiplicity is absent.
Computing the characteristic polynomial with the convention givesThus the three eigenvalues areThey can also be checked directly on the respective eigenvectors , , and .
For the lowest eigenvalue, , solving gives and . A unit eigenvector is thereforeAny nonzero scalar multiple is an equally valid eigenvector.
Articles by others on the same topic
There are currently no matching articles.