Jump to content

Endomorphism/Diagonalizability/Introduction/Section

From Wikiversity


Let denote a field, let denote a vector space, and let

denote a linear mapping. Then is called diagonalizable, if has a basis consisting of eigenvectors

for .


Let denote a field, and let denote a finite-dimensional vector space. Let

denote a

linear mapping. Then the following statements are equivalent.
  1. is diagonalizable.
  2. There exists a basis of such that the describing matrix is a diagonal matrix.
  3. For every describing matrix with respect to a basis , there exists an invertible matrix such that

    is a diagonal matrix.

The equivalence between (1) and (2) follows from the definition, from example, and the correspondence between linear mappings and matrices. The equivalence between (2) and (3) follows from fact.

If is diagonalizable and if the eigenvalues together with their geometric multiplicities are known, then we can simply write down a corresponding diagonal matrix: just take the diagonal matrix such that, in the diagonal, the eigenvalues occur as often as the geometric multiplicities. In particular, the corresponding diagonal matrix of a diagonalizable mapping is, up to the ordering of the diagonal entries, uniquely determined.


We continue with example. There exists the two eigenvectors and for the different eigenvalues and , so that the mapping is diagonalizable, due to fact. With respect to the basis , consisting of these eigenvectors, the linear mapping is described by the diagonal matrix

The transformation matrix, from the basis to the standard basis , consisting of and , is simply

The inverse matrix is

Because of fact, we have the relation


Let denote a field, and let denote a finite-dimensional vector space. Let

denote a linear mapping. Suppose that there exists different eigenvalues. Then is

diagonalizable.

Because of fact, there exist linearly independent eigenvectors. These form, due to fact, a basis.



Let denote a field, and let denote a -vector space of finite dimension. Let

be a linear mapping. Then is diagonalizable if and only if is the direct sum of the

eigenspaces.

If is diagonalizable, then there exists a basis of consisting of eigenvectors. Hence,

Therefore,

That the sum is direct follows from fact. If, the other way round,

holds, then we can choose in every eigenspace a basis. These bases consist of eigenvectors and yield together a basis of .



We consider -shearing matrices

with . The condition for some to be an eigenvalue means

This yields the equations

For , we get and hence also , that is, only can be an eigenvalue. In this case, the second equation is fulfilled, and the first equation becomes

For , we get and thus is the eigenspace for the eigenvalue , and is an eigenvector which spans this eigenspace. For , we have the identity matrix, and the eigenspace for the eigenvalue is the total plane. For , there is a one-dimensional eigenspace, and the mapping is not diagonalizable.

The product of two diagonal matrices is again a diagonal matrix. The following example shows that the product of two diagonalizable matrices is not necessarily diagonalizable.


Let and denote two lines in through the origin, and let and denote the reflections at these axes. A reflection at an axis is always diagonalizable, the axis and the line orthogonal to the axis are eigenlines (with eigenvalues and ). The composition

of the reflections is a plane rotation, the angle of rotation being twice the angle between the two lines. However, a rotation is only diagonalizable if the angle of rotation is or degree. If the angle between the axes is different from degree, then does not have any eigenvector.