Lesson plan

Commutation matrix

In mathematics, especially in linear algebra and matrix theory, the commutation matrix is used for transforming the vectorized form of a matrix into the vectorized form of its transpose. Specifically, the commutation matrix K (m,n) is the nm × mn permutation matrix which, for any m × n matrix A, transforms vec(A) into vec(A T ): :K (m,n) vec(A) = vec(A T ) . Here vec(A) is the mn × 1 column vector obtain by stacking the columns of A on top of one another: : \operatorname{vec}(\mathbf{A}) = [\mathbf{A}_{1,1}, \ldots, \mathbf{A}_{m,1}, \mathbf{A}_{1,2}, \ldots, \mathbf{A}_{m,2}, \ldots, \mathbf{A}_{1,n}, \ldots, \mathbf{A}_{m,n}]^{\mathrm{T}} where A = [A i,j ]. In other words, vec(A) is the vector obtained by vectorizing A in column-major order. Similarly, vec(A T ) is the vector obtaining by vectorizing A in row-major order. The cycles and other properties of this permutation have been heavily studied for in-place matrix transposition algorithms. In the context of quantum information theory, the commutation matrix is sometimes referred to as the swap matrix or swap operator

Back to article

Article summary

In mathematics, especially in linear algebra and matrix theory, the commutation matrix is used for transforming the vectorized form of a matrix into the vectorized form of its transpose. Specifically, the commutation matrix K (m,n) is the nm × mn permutation matrix which, for any m × n matrix A, transforms vec(A) into vec(A T ): :K (m,n) vec(A) = vec(A T ) . Here vec(A) is the mn × 1 column vector obtain by stacking the columns of A on top of one another: : \operatorname{vec}(\mathbf{A}) = [\mathbf{A}_{1,1}, \ldots, \mathbf{A}_{m,1}, \mathbf{A}_{1,2}, \ldots, \mathbf{A}_{m,2}, \ldots, \mathbf{A}_{1,n}, \ldots, \mathbf{A}_{m,n}]^{\mathrm{T}} where A = [A i,j ]. In other words, vec(A) is the vector obtained by vectorizing A in column-major order. Similarly, vec(A T ) is the vector obtaining by vectorizing A in row-major order. The cycles and other properties of this permutation have been heavily studied for in-place matrix transposition algorithms. In the context of quantum information theory, the commutation matrix is sometimes referred to as the swap matrix or swap operator

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.