Commuting matrices
In linear algebra, two matrices and are said to commute if, or equivalently if their commutator is zero. Matrices that commute with matrix are called the commutant of matrix .
A set of matrices is said to commute if they commute pairwise, meaning that every pair of matrices in the set commutes.
Characterizations and properties
- Commuting matrices preserve each other's eigenspaces. As a consequence, commuting matrices over an algebraically closed field are simultaneously triangularizable; that is, there are bases over which they are both upper triangular. In other words, if commute, there exists a similarity matrix such that is upper triangular for all. The converse is not necessarily true, as the following counterexample shows:
- :
- Two diagonalizable matrices and commute if they are simultaneously diagonalizable. The converse is also true; that is, if two diagonalizable matrices commute, they are simultaneously diagonalizable. But if you take any two matrices that commute they are simultaneously diagonalizable already if one of the matrices has no multiple eigenvalues.
- If and commute, they have a common eigenvector. If has distinct eigenvalues, and and commute, then 's eigenvectors are 's eigenvectors.
- If one of the matrices has the property that its minimal polynomial coincides with its characteristic polynomial, which happens in particular whenever the characteristic polynomial has only simple roots, then the other matrix can be written as a polynomial in the first.
- As a direct consequence of simultaneous triangulizability, the eigenvalues of two commuting complex matrices A, B with their algebraic multiplicities can be matched up as in such a way that the multiset of eigenvalues of any polynomial in the two matrices is the multiset of the values. This theorem is due to Frobenius.
- Two Hermitian matrices commute if their eigenspaces coincide. In particular, two Hermitian matrices without multiple eigenvalues commute if they share the same set of eigenvectors. This follows by considering the eigenvalue decompositions of both matrices. Let and be two Hermitian matrices. and have common eigenspaces when they can be written as and. It then follows that
- :
- The property of two matrices commuting is not transitive: A matrix may commute with both and, and still and do not commute with each other. As an example, the identity matrix commutes with all matrices, which between them do not all commute. If the set of matrices considered is restricted to Hermitian matrices without multiple eigenvalues, then commutativity is transitive, as a consequence of the characterization in terms of eigenvectors.
- Lie's theorem, which shows that any representation of a solvable Lie algebra is simultaneously upper triangularizable, may be viewed as a generalization.
- An n × n matrix commutes with every other n × n matrix if and only if it is a scalar matrix, that is, a matrix of the form, where is the n × n identity matrix and is a scalar. In other words, the center of the group of invertible n × n matrices under multiplication is the subgroup of scalar matrices.
- Fix a finite field, let denote the number of ordered pairs of commuting matrices over, W. Feit and N. J. Fine showed the equation
Examples
- The identity matrix commutes with all matrices.
- Jordan blocks commute with upper triangular matrices that have the same value along bands.
- If the product of two symmetric matrices is symmetric, then they must commute. That also means that every diagonal matrix commutes with all other diagonal matrices.
- Circulant matrices commute. They form a commutative ring since the sum of two circulant matrices is circulant.