 This article is about the transpose of a matrix. For other uses, see Transposition
 Note that this article assumes that matrices are taken over a commutative ring. These results may not hold in the noncommutative case.
The transpose
A^{T} of a matrix
A can be obtained by reflecting the elements along its main diagonal. Repeating the process on the transposed matrix returns the elements to their original position.
In linear algebra, the transpose of a matrix A is another matrix A^{T} (also written A′, A^{tr}, ^{t}A or A^{t}) created by any one of the following equivalent actions:
 reflect A over its main diagonal (which runs from topleft to bottomright) to obtain A^{T}
 write the rows of A as the columns of A^{T}
 write the columns of A as the rows of A^{T}
Formally, the i th row, j th column element of A^{T} is the j th row, i th column element of A:
If A is an m × n matrix then A^{T} is an n × m matrix.
The transpose of a matrix was introduced in 1858 by the British mathematician Arthur Cayley.^{[1]}
Contents
 1 Examples
 2 Properties
 3 Special transpose matrices
 4 Transpose of a linear map
 4.1 Transpose of a bilinear form
 4.2 Adjoint
 5 Implementation of matrix transposition on computers
 6 See also
 7 References
 8 Further reading
 9 External links
Examples
Properties
For matrices A, B and scalar c we have the following properties of transpose:

 The operation of taking the transpose is an involution (selfinverse).

 The transpose respects addition.

 Note that the order of the factors reverses. 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}. By induction this result extends to the general case of multiple matrices, where we find that (A_{1}A_{2}...A_{k−1}A_{k})^{T} = A_{k}^{T}A_{k−1}^{T}...A_{2}^{T}A_{1}^{T}.

 The transpose of a scalar is the same scalar. Together with (2), this states that the transpose is a linear map from the space of m × n matrices to the space of all n × m matrices.

 The determinant of a square matrix is the same as that of its transpose.
 The dot product of two column vectors a and b can be computed as the single entry of the matrix product
which is written as a_{i} b^{i} in Einstein summation convention.
 If A has only real entries, then A^{T}A is a positivesemidefinite matrix.

 The transpose of an invertible matrix is also invertible, and its inverse is the transpose of the inverse of the original matrix. The notation A^{−T} is sometimes used to represent either of these equivalent expressions.
 If A is a square matrix, then its eigenvalues are equal to the eigenvalues of its transpose since they share the same characteristic polynomial.
 is a symmetric matrix.^{[2]}
Special transpose matrices
A square matrix whose transpose is equal to itself is called a symmetric matrix; that is, A is symmetric if
A square matrix whose transpose is equal to its negative is called a skewsymmetric matrix; that is, A is skewsymmetric if
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, A is Hermitian if
A square complex matrix whose transpose is equal to the negation of its complex conjugate is called a skewHermitian matrix; that is, A is skewHermitian if
A square matrix whose transpose is equal to its inverse is called an orthogonal matrix; that is, A is orthogonal if
Transpose of a linear map
See also: Dual space § Transpose of a linear map
The transpose may be defined in a more generally:
If f : V → W is a linear map between right Rmodules V and W with respective dual modules V^{∗} and W^{∗}, the transpose of f is the linear map
Equivalently, the transpose ^{t}f is defined by the relation
where ⟨·,·⟩ is the duality pairing. This definition also applies unchanged to left modules and to vector spaces.^{[3]}
The definition of the transpose may be seen to be independent of any bilinear form on the vector spaces, unlike the adjoint (below).
If the matrix A describes a linear map with respect to bases of V and W, then the matrix A^{T} describes the transpose of that linear map with respect to the dual bases.
Transpose of a bilinear form
Main article: Bilinear form
Every linear map to the dual space f : V → V^{∗} defines a bilinear form B : V × V → F, with the relation B(v, w) = f(v)(w). By defining the transpose of this bilinear form as the bilinear form ^{t}B defined by the transpose ^{t}f : V^{∗∗} → V^{∗} i.e. ^{t}B(w, v) = ^{t}f(w)(v), we find that B(v, w) = ^{t}B(w, v).
Adjoint
Not to be confused with Hermitian adjoint.
If the vector spaces V and W have respective nondegenerate bilinear forms B_{V} and B_{W}, a concept closely related to the transpose – the adjoint – may be defined:
If f : V → W is a linear map between vector spaces V and W, we define g as the adjoint of f if g : W → V satisfies
These bilinear forms define an isomorphism between V and V^{∗}, and between W and W^{∗}, resulting in an isomorphism between the transpose and adjoint of f. 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 use the term transpose to refer to the adjoint as defined here.
The adjoint allows us to consider whether g : W → V is equal to f^{ −1} : W → V. In particular, this allows the orthogonal group over a vector space V with a quadratic form to be defined without reference to matrices (nor the components thereof) as the set of all linear maps V → V for which the adjoint equals the inverse.
Over a complex vector space, one often works with sesquilinear forms (conjugatelinear 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.
Implementation of matrix transposition on computers
On a computer, one can often avoid explicitly transposing a matrix in memory by simply accessing the same data in a different order. For example, software libraries for linear algebra, such as BLAS, typically provide options to specify that certain matrices are to be interpreted in transposed order to avoid the necessity of data movement.
However, there remain a number of circumstances in which it is necessary or desirable to physically reorder a matrix in memory to its transposed ordering. For example, with a matrix stored in rowmajor order, the rows of the matrix are contiguous in memory and the columns are discontiguous. If repeated operations need to be performed on the columns, for example in a fast Fourier transform algorithm, transposing the matrix in memory (to make the columns contiguous) may improve performance by increasing memory locality.
Main article: Inplace matrix transposition
Ideally, one might hope to transpose a matrix with minimal additional storage. This leads to the problem of transposing an n × m matrix inplace, with O(1) additional storage or at most storage much less than mn. For n ≠ m, this involves a complicated permutation of the data elements that is nontrivial to implement inplace. Therefore efficient inplace matrix transposition has been the subject of numerous research publications in computer science, starting in the late 1950s, and several algorithms have been developed.
See also
 Invertible matrix
 Moore–Penrose pseudoinverse
 Projection (linear algebra)
References
 ^ Arthur Cayley (1858) "A memoir on the theory of matrices," Philosophical Transactions of the Royal Society of London, 148 : 1737. The transpose (or "transposition") is defined on page 31.
 ^ "Is a matrix multiplied with its transpose something special?" Proof in answer on StackExchange.com,
 ^ Bourbaki, "II §2.5", Algebra I
Further reading
 Maruskin, Jared M. (2012). Essential Linear Algebra. San José: Solar Crest. pp. 122–132. ISBN 9780985062736.
 Schwartz, Jacob T. (2001). Introduction to Matrices and Vectors. Mineola: Dover. pp. 126–132. ISBN 0486420000.
External links
 MIT Linear Algebra Lecture on Matrix Transposes
 Transpose, mathworld.wolfram.com
 Transpose, planetmath.org
 Khan Academy introduction to matrix transposes
Linear algebra


Basic concepts 
 Scalar
 Vector
 Vector space
 Vector projection
 Linear span
 Linear map
 Linear projection
 Linear independence
 Linear combination
 Basis
 Column space
 Row space
 Dual space
 Orthogonality
 Kernel
 Eigenvalues and eigenvectors
 Least squares regressions
 Outer product
 Inner product space
 Dot product
 Transpose
 Gram–Schmidt process
 Linear equations


Matrices 
 Block
 Decomposition
 Invertible
 Minor
 Multiplication
 Rank
 Transformation
 Cramer's rule
 Gaussian elimination


Numerical 
 Floating point
 Matrix Laboratory
 Numerical stability
 Basic Linear Algebra Subprograms (BLAS)
 Sparse matrix
 Comparison of linear algebra libraries
 Comparison of numerical analysis software


Tensors


Glossary of tensor theory


Scope 
Mathematics

 coordinate system
 multilinear algebra
 Euclidean geometry
 tensor algebra
 differential geometry
 exterior calculus
 tensor calculus



 continuum mechanics
 electromagnetism
 transport phenomena
 general relativity
 computer vision



Notation 
 index notation
 multiindex notation
 Einstein notation
 Ricci calculus
 Penrose graphical notation
 Voigt notation
 abstract index notation
 tetrad (index notation)
 Van der Waerden notation


Tensor definitions 
 tensor (intrinsic definition)
 tensor field
 tensor density
 tensors in curvilinear coordinates
 mixed tensor
 antisymmetric tensor
 symmetric tensor
 tensor operator
 tensor bundle


Operations 
 tensor product
 exterior product
 tensor contraction
 transpose (2ndorder tensors)
 raising and lowering indices
 Hodge dual
 covariant derivative
 exterior derivative
 exterior covariant derivative
 Lie derivative


Related abstractions 
 dimension
 basis
 vector, vector space
 multivector
 covariance and contravariance of vectors
 linear transformation
 matrix
 spinor
 Cartan formalism (physics)
 differential form
 exterior form
 connection form
 geodesic
 manifold
 fiber bundle
 LeviCivita connection
 Affine connection


Notable tensors 
Mathematics

 Kronecker delta
 LeviCivita symbol
 metric tensor
 nonmetricity tensor
 Christoffel symbols
 Ricci curvature
 Riemann curvature tensor
 Weyl tensor
 torsion tensor


Physics

 moment of inertia
 angular momentum tensor
 spin tensor
 Cauchy stress tensor
 stress–energy tensor
 EM tensor
 gluon field strength tensor
 Einstein tensor
 metric tensor (GR)



Mathematicians 
 Leonhard Euler
 Carl Friedrich Gauss
 AugustinLouis Cauchy
 Hermann Grassmann
 Gregorio RicciCurbastro
 Tullio LeviCivita
 Jan Arnoldus Schouten
 Bernhard Riemann
 Elwin Bruno Christoffel
 Woldemar Voigt
 Élie Cartan
 Hermann Weyl
 Albert Einstein

