TOPICS
Search

Commuting Matrices


Commuting matrices are two matrices A and B that satisfy

 AB=BA
(1)

under matrix multiplication.

In general, matrix multiplication is not commutative. Furthermore, a nonzero square matrix need not have a matrix inverse: A^(-1) exists exactly when det(A)!=0, where det is the determinant. Finally, AB can be zero even without A=0 or B=0. Moreover, when AB=0, we may still have BA!=0, a simple example of which is provided by

A=[0 1; 0 0]
(2)
B=[1 0; 0 0]
(3)

for which

 AB=0,
(4)

but

 BA=[0 1; 0 0]=A.
(5)

(Taussky 1957).

For a noncommutative matrix ring, its commuting graph records commuting pairs outside its ring center.


See also

Commutative, Matrix Inverse, Matrix Multiplication

Portions of this entry contributed by Ronald M. Aarts

Explore with Wolfram|Alpha

References

Gantmacher, F. R. Ch. 8 in The Theory of Matrices, Vol. 1. Providence, RI: Amer. Math. Soc., 1998.Taussky, O. "Commutativity in Finite Matrices." Amer. Math. Monthly 64, 229-235, 1957.

Referenced on Wolfram|Alpha

Commuting Matrices

Cite this as:

Weisstein, Eric W., with contributions by Ronald M. Aarts. "Commuting Matrices." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CommutingMatrices.html

Subject classifications