ja:転置行列

See transposition for meanings of this term in telecommunication and music.

---

In mathematics, and in particular linear algebra, the transpose of a matrix is another matrix, produced by turning rows into columns and vice versa. Informally, the transpose of a square matrix is obtained by reflecting at the main diagonal (that runs from the top left to bottom right of the matrix). The transpose of the matrix A is written as A^tr, ^tA, A′, or A^T, the latter notation being preferred in Wikipedia.

Formally, the transpose of the m-by-n matrix A is the n-by-m matrix A^T defined by A^T[i, j] = A[j, i] for 1 ≤ i ≤ n and 1 ≤ j ≤ m.

For example,

<math>\begin{bmatrix}

1 & 2 \\ 3 & 4 \end{bmatrix}^T \!\! \;\! = \, \begin{bmatrix} 1 & 3 \\ 2 & 4 \end{bmatrix}\quad\quad \mbox{and}\quad\quad \begin{bmatrix} 1 & 2 \\ 3 & 4 \\ 5 & 6 \end{bmatrix}^T \!\! \;\! = \, \begin{bmatrix} 1 & 3 & 5\\ 2 & 4 & 6 \end{bmatrix} \; <math>

Properties

For any two m-by-n matrices A and B and every scalar c, we have (A + B)^T = A^T + B^T and (cA)^T = c(A^T). This shows that the transpose is a linear map from the space of all m-by-n matrices to the space of all n-by-m matrices.

The transpose operation is self-inverse, i.e taking the transpose of the transpose amounts to doing nothing: (A^T)^T = A.

If A is an m-by-n and B an n-by-k matrix, then we have (AB)^T = (B^T)(A^T). Note that the order of the factors switches. From this one can deduce that a square matrix A is invertible if and only if A^T is invertible, and in this case we have (A^-1)^T = (A^T)^-1.

The dot product of two vectors expressed as columns of their coordinates can be computed as

<math> \mathbf{a} \cdot \mathbf{b} = \mathbf{a}^T \mathbf{b} \,<math>

where the product on the right is the ordinary matrix multiplication.

If A is an arbitrary m-by-n matrix with real entries, then A^TA is a positive semidefinite matrix.

If A is an n-by-n matrix over some field, then A is similar to A^T.

Further nomenclature

A square matrix whose transpose is equal to itself is called a symmetric matrix, i.e. A is symmetric iff:

<math> A = A^T \,<math>

A square matrix whose transpose is also its inverse is called an orthogonal matrix, i.e. G is orthogonal iff:

<math>

G \; G^T = G^T G = I_n , \,<math>