commuting matrices
We consider the properties of commuting matrices and linear transformations over a vector space . Two linear transformations , are said to commute if for every ,
If has finite dimension and we fix a basis of then we may represent the linear transformations as matrices and here the condition of commuting linear transformations is equivalent to testing if their corresponding matrices commute:
Simultaneous triangularisation of commuting matrices over any field can be achieved but may require an extension of the field. The reason begins to be apparent from the study of eigenvalues.
Remark 1.
Because the implication of commuting matrices is best expressed through eigenvectors, we prefer the treatment of linear transformations for the .
Proposition 2.
If are commuting linear transformations and is an eigenspace of for some , then for all , .
Proof.
Let be the eigenvalue of on . Take any and . Then
Therefore as is the eigenspace of . In particular, . ∎
We have just shown that commuting linear transformations preserve each other’s eigenspaces. This property does not depend on a finite dimension for or a finite set of commuting transformations. However, to characterize commuting linear transformations further will require that have finite dimension.
Proposition 3.
Let be a finite dimensional vector space and let be a family of commuting diagonalizable linear transformations from to . Then can be simultaneously diagonalized.
Proof.
If a finite dimensional linear transformation is diagonalizable over its field then it has all its eigenvalues in the field (under some basis the matrix is diagonal and the eigenvalues are simply those elements on the diagonal.)
If all the eigenvalues of a linear transformation are the same then the associated diagonal matrix is scalar. If all are scalar then they are simultaneously diagonalized.
Now presume that each is not a scalar transformation. Hence there are at least two distinct eigenspaces. It follows each eigenspace of has dimension less than that of .
Now we set up an induction on the dimension of . When the dimension of is 1, all linear transformations are scalar. Now suppose that for all vector spaces of dimension , any commuting diagonalizable linear transformations can be simultaneously diagonalized. Then in the case where , either all the linear transformations are scalar and so simultaneously diagonalized, or at least one is not scalar in which case its eigenspaces are proper subspaces. Since the maps commute they respect each others eigenspaces. So we restrict the maps to any eigenspace and by induction simultaneously diagonalize on this subspace. As the linear transformations are diagonalizable, the sum of the eigenspaces of any is so this process simultaneously diagonalizes each of the . ∎
Of course it is possible to have commuting matrices which are not diagonalizable. At the other extreme are unipotent matrices, that is, matrices with all eigenvalues 1. Aside from the identity matrix, unipotent matrices are never diagonal. Yet they often commute. But here the generalized eigenspaces substitute for the usual eigenspaces.
It is generally not true that two unipotent matrices commute, even if they share the same eigenspace. For example, the set of unitriangular matrices forms a nilpotent group which is abelian only for -matrices.
However, if we consider unipotent matrices of the form
we find these to correspond to matrices under addition. Thus this large family of unipotent matrices do commute.
Title | commuting matrices |
---|---|
Canonical name | CommutingMatrices |
Date of creation | 2013-03-22 15:54:12 |
Last modified on | 2013-03-22 15:54:12 |
Owner | Algeboy (12884) |
Last modified by | Algeboy (12884) |
Numerical id | 20 |
Author | Algeboy (12884) |
Entry type | Definition |
Classification | msc 15A04 |
Related topic | SimultaneousTriangularisationOfCommutingMatricesOverAnyField2 |
Related topic | CommonEigenvectorOfADiagonalElementCrossSection |