A linear endomorphism is diagonalizable over its field precisely when its minimal polynomial is a product of distinct linear polynomials over that same field. Splitting alone is insufficient: repeated factors permit nontrivial Jordan blocks.
For the displayed matrix, a determinant expansion givesThese formulas can be reduced in each requested characteristic. The four cases below distinguish failure to split from failure to have distinct factors.
Over the complex numbers, the three eigenvalues areThey are distinct. Each is a root of the minimal polynomial, so here the minimal polynomial equals the characteristic polynomial and has distinct linear polynomials. Consequently is diagonalizable over .
The quadratic polynomial has no real roots of a polynomial. Thus the characteristic polynomial does not split over the real numbers. A real diagonal matrix would have only real eigenvalues, and similar matrices have the same characteristic polynomial. Therefore is not diagonalizable over .
In the finite field , reduce the characteristic polynomial to . For , reduction of the entries givesHenceIts repeated linear polynomial prevents diagonalizability. Equivalently, a diagonalizable map with only the eigenvalue one would have to be , and this matrix is not .
In the finite field , the matrix becomesOn the first two coordinate vectors it is a nonzero nilpotent Jordan block of size two, and on the last it is the identity map. ConsequentlyThe repeated zero root prevents diagonalizability. Directly, the only possible eigenvalues are zero and one, so diagonalizability would imply , whereas the displayed off-diagonal entry disappears on squaring.
The primary decomposition theorem for linear maps states that ifwith distinct monic irreducible polynomials , thenEach summand is a -invariant subspace. More generally the same direct sum conclusion holds for any factorization of an annihilating polynomial into pairwise coprime polynomials, using the corresponding kernels. The underlying mechanism is the Bézout's identity for polynomials, which separates the mutually coprime factors.
Since is diagonalizable, its minimal polynomial is with distinct eigenvalues in the field. Apply the primary decomposition theorem for linear maps:For a scalar that is not an eigenvalue, the associated eigenspace is zero, so the sum indexed by the whole field has only finitely many nonzero summands. The eigenspaces need not be one-dimensional.
For , use commutation to obtainThus , proving that every -eigenspace is an -invariant subspace. This does not assert that an arbitrary eigenvector of is already an eigenvector of .
On each nonzero eigenspace , the restricted linear map is diagonalizable. Indeed , so the minimal polynomial of divides . A divisor of a product of distinct linear polynomials has the same property, proving the diagonalizable restriction lemma.
Choose a basis of -eigenvectors in each . Every chosen vector is simultaneously a -eigenvector, with eigenvalue . The direct sum in part (ii) shows that joining these bases gives a basis of . Therefore and have a common eigenbasis, which is exactly simultaneous diagonalization.
Suppose a single basis gives the diagonal matrices . Entrywise multiplication gives . If is the change-of-basis matrix, thenThus simultaneous diagonalization implies commutation.
Yes, provided “commute” means pairwise commute. Necessity follows because three diagonal matrices commute pairwise.
For sufficiency, first choose the common eigenbasis for the first two linear maps, say , obtained in part (b). Their joint eigenspacesgive a direct sum decomposition of . The third map preserves each , since and . By the diagonalizable restriction lemma, has a basis of eigenvectors there. Every such vector already has fixed eigenvalues for and .
Joining these bases therefore gives a common eigenbasis for all three maps. The same induction proves simultaneous diagonalization for any finite pairwise commuting family of diagonalizable linear endomorphisms.
Articles by others on the same topic
There are currently no matching articles.