Transpose
≈ 5 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In linear algebra, transposition is an operation that flips a matrix over its diagonal; that is, transposition switches the row and column indices of the matrix to produce another matrix, called the transpose of and often denoted (among other notations). The transpose of a matrix was introduced in 1858 by the British mathematician Arthur Cayley.
In linear algebra, transposition is an operation that flips a matrix over its diagonal; that is, transposition switches the row and column indices of the matrix to produce another matrix, called the transpose of and often denoted (among other notations). The transpose of a matrix was introduced in 1858 by the British mathematician Arthur Cayley. \left[\mathbf{A}^\text{T}\right]_{ij} = \left[\mathbf{A}\right]_{ji}. If is an matrix, then is an matrix. \mathbf{A}^{\text{T}} = \mathbf{A}. A square matrix whose transpose is equal to its negative is called a skew-symmetric matrix; that is, is skew-symmetric if \mathbf{A}^{\text{T}} = -\mathbf{A}. A square complex matrix whose transpose is equal to the matrix with every entry replaced by its complex conjugate (denoted here with an overline) is called a Hermitian matrix (equivalent to the matrix being equal to its conjugate transpose); that is, is Hermitian if \mathbf{A}^{\text{T}} = \overline{\mathbf{A}}. A square complex matrix whose transpose is equal to the negation of its complex conjugate is called a skew-Hermitian matrix; that is, is skew-Hermitian if \mathbf{A}^{\text{T}} = -\overline{\mathbf{A}}. A square matrix whose transpose is equal to its inverse is called an orthogonal matrix; that is, is orthogonal if \mathbf{A}^{\text{T}} = \mathbf{A}^{-1}. A square complex matrix whose transpose is equal to its conjugate inverse is called a unitary matrix; that is, is unitary if \mathbf{A}^{\text{T}} = \overline{\mathbf{A}^{-1}}. = \begin{bmatrix} 1 & 3 & 5\\ 2 & 4 & 6 \end{bmatrix} \left(\mathbf{A}^\text{T} \right)^\text{T} = \mathbf{A}. The operation of taking the transpose is an involution (self-inverse). \left(\mathbf{A} + \mathbf{B}\right)^\text{T} = \mathbf{A}^\text{T} + \mathbf{B}^\text{T}. The transpose respects addition. \left(c \mathbf{A}\right)^\text{T} = c (\mathbf{A}^\text{T}). The transpose of a scalar is the same scalar. Together with the preceding property, this implies that the transpose is a linear map from the space of matrices to the space of the matrices. \left(\mathbf{A B}\right)^\text{T} = \mathbf{B}^\text{T} \mathbf{A}^\text{T}. The order of the factors reverses. By induction, this result extends to the general case of multiple matrices, so . \det \left(\mathbf{A}^\text{T}\right) = \det(\mathbf{A}). The determinant of a square matrix is the same as the determinant of its transpose. The dot product of two column vectors and can be computed as the single entry of the matrix product \mathbf{a} \cdot \mathbf{b} = \mathbf{a}^{\text{T}} \mathbf{b}. If has only real entries, then is a positive-semidefinite matrix. \left(\mathbf{A}^\text{T} \right)^{-1} = \left(\mathbf{A}^{-1} \right)^\text{T}. The transpose of an invertible matrix is also invertible, and its inverse is the transpose of the inverse of the original matrix. The notation is sometimes used to represent either of these equivalent expressions. If is a square matrix, then its eigenvalues are equal to the eigenvalues of its transpose, since they share the same characteristic polynomial. This can also be seen directly, see Eigenvalues of Transpose \left(\mathbf A\mathbf a\right) \cdot \mathbf b =\mathbf a \cdot \left(\mathbf A^\text{T}\mathbf b\right) for two column vectors \mathbf a, \mathbf b and the standard dot product. Over any field k , a square matrix \mathbf{A} is similar to \mathbf{A}^\text{T} . This implies that \mathbf{A} and \mathbf{A}^\text{T} have the same invariant factors, which implies they share the same minimal polynomial, characteristic polynomial, and eigenvalues, among other properties. A proof of this property uses the following two observations. Let \mathbf{A} and \mathbf{B} be n\times n matrices over some base field k and let L be a field extension of k . If \mathbf{A} and \mathbf{B} are similar as matrices over L , then they are similar over k . In particular this applies when L is the algebraic closure of k . If \mathbf{A} is a matrix over an algebraically closed field in Jordan normal form with respect to some basis, then \mathbf{A} is similar to \mathbf{A}^\text{T} . This further reduces to proving the same fact when \mathbf{A} is a single Jordan block, which is a straightforward exercise. \left(\mathbf{A} \mathbf{A}^\text{T}\right)^\text{T} = \left(\mathbf{A}^\text{T}\right)^\text{T} \mathbf{A}^\text{T}= \mathbf{A} \mathbf{A}^\text{T} . B_X\big(x, g(y)\big) = B_Y\big(u(x), y\big) for all and . These bilinear forms define an isomorphism between and , and between and , resulting in an isomorphism between the transpose and adjoint of . The matrix of the adjoint of a map is the transposed matrix only if the bases are orthonormal with respect to their bilinear forms. In this context, many authors however, use the term transpose to refer to the adjoint as defined here. The adjoint allows us to consider whether is equal to . In particular, this allows the orthogonal group over a vector space with a quadratic form to be defined without reference to matrices (nor the components thereof) as the set of all linear maps for which the adjoint equals the inverse. Over a complex vector space, one often works with sesquilinear forms (conjugate-linear in one argument) instead of bilinear forms. The Hermitian adjoint of a map between such spaces is defined similarly, and the matrix of the Hermitian adjoint is given by the conjugate transpose matrix if the bases are orthonormal.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1374772291 under CC BY-SA 4.0; modifications have been made.