A diagonalizable matrix over the field admits an invertible matrix with entries in such that
Equivalently, the vector space has a basis of eigenvectors of . Indeed, says that each column of is an eigenvector with the corresponding diagonal entry as its eigenvalue. Requiring the basis and eigenvalues to lie in makes the choice of field essential.
Expansion down the last column gives the characteristic polynomial
The quadratic polynomial has roots , which are not rational numbers. For example, the rational root theorem restricts any rational root of this monic integer polynomial to or , and neither works. If had a diagonalization over , its characteristic polynomial would be a product of linear factors with rational numbers as their roots. It is not, so is not diagonalizable over .
Over the complex numbers, the eigenvalues
are distinct. Thus distinct eigenvalues imply diagonalizability, and is diagonalizable over , in fact already over .
An explicit eigenbasis is
For either quadratic root , the identity verifies . Taking these three columns as gives . Their distinct eigenvalues ensure linear independence.
In the finite field , the characteristic polynomial becomes
because modulo . Splitting into linear factors does not by itself guarantee diagonalizability: the repeated eigenvalue needs enough eigenvectors.
Solving gives
so and . Hence
has dimension one, although has algebraic multiplicity two. The geometric multiplicity is too small, and is not diagonalizable over . This illustrates diagonalizability depends on the field: characteristic zero gave three distinct eigenvalues, while reduction modulo merges two of them.

Articles by others on the same topic (0)

There are currently no matching articles.