Endomorphism/Trigonalizable/Introduction/Section


Let denote a field, and let denote a finite-dimensional vector space. A linear mapping is called trigonalizable, if there exists a basis such that the describing matrix of with respect to this basis is an

upper triangular matrix.

Diagonalizable linear mappings are in particular trigonalizable. The inverse statement is not true, as example shows. We will see in fact that a linear mapping is trigonalizable if and only if its characteristic polynomial factors into linear factors. A square matrix is called trigonalizable if the corresponding linear mapping is trigonalizable. This means that there exists a basis such that the mapping is described by an upper triangular matrix with respect to this basis, or, that there exists an invertible matrix (the base change matrix) such that

is an upper triangular matrix. Therefore, a matrix is trigonalizable if and only if it is similar to an upper triangular matrix. The process of finding such a basis and to perform this base change is called trigonalization.


We claim that the matrix

is trigonalizable. The matrix

is invertible with the inverse matrix

A direct computation shows

In this verification of trigonalizability, the transformation matrix arises just like that. We get a more reasonable proof with the help of the characteristic polynomial and fact. The characteristic polynomial is

and this factors into linear factors.


Let denote finite-dimensional vector spaces over the field , let

denote linear mappings, and let

denote the product mapping. Then is trigonalizable

if and only if this holds for all .

Proof


In particular, the preceding statement holds when

is a direct sum of -invariant linear subspaces.