Transpose

This article is about the transpose of matrices andlinear operators.For other uses, seeTransposition (disambiguation).

The transposeA^Tof a matrixAcan be obtained by reflecting the elements along its main diagonal. Repeating the process on the transposed matrix returns the elements to their original position.

Inlinear algebra,thetransposeof amatrixis an operator which flips a matrix over its diagonal; that is, it switches the row and column indices of the matrixAby producing another matrix, often denoted byA^T(among other notations).

The transpose of a matrix was introduced in 1858 by the British mathematicianArthur Cayley.In the case of alogical matrixrepresenting abinary relationR, the transpose corresponds to theconverse relationR^T.

Transpose of a matrix

This article assumes that matrices are taken over a commutative ring. These results may not hold in the non-commutative case.

Definition

The transpose of a matrixA,denoted byA^T,^⊤A,A^⊤,$A^{\intercal }$,A′,A^tr,^tAorA^t,may be constructed by any one of the following methods:

1. ReflectAover itsmain diagonal(which runs from top-left to bottom-right) to obtainA^T
2. Write the rows ofAas the columns ofA^T
3. Write the columns ofAas the rows ofA^T

Formally, thei-th row,j-th column element ofA^Tis thej-th row,i-th column element ofA:

$\left[\mathbf {A} ^{\operatorname {T} }\right]_{ij}=\left[\mathbf {A} \right]_{ji}.$

IfAis anm×nmatrix, thenA^Tis ann×mmatrix.

In the case of square matrices,A^Tmay also denote theTth power of the matrixA.For avoiding a possible confusion, many authors use left upperscripts, that is, they denote the transpose as^TA.An advantage of this notation is that no parentheses are needed when exponents are involved: as(^TA)ⁿ=^T(Aⁿ),notation^TAⁿis not ambiguous.

In this article this confusion is avoided by never using the symbolTas avariablename.

Matrix definitions involving transposition

A square matrix whose transpose is equal to itself is called asymmetric matrix;that is,Ais symmetric if

$\mathbf {A} ^{\operatorname {T} }=\mathbf {A}.$

A square matrix whose transpose is equal to its negative is called askew-symmetric matrix;that is,Ais skew-symmetric if

$\mathbf {A} ^{\operatorname {T} }=-\mathbf {A}.$

A squarecomplexmatrix whose transpose is equal to the matrix with every entry replaced by itscomplex conjugate(denoted here with an overline) is called aHermitian matrix(equivalent to the matrix being equal to itsconjugate transpose); that is,Ais Hermitian if

$\mathbf {A} ^{\operatorname {T} }={\overline {\mathbf {A} }}.$

A squarecomplexmatrix whose transpose is equal to the negation of its complex conjugate is called askew-Hermitian matrix;that is,Ais skew-Hermitian if

$\mathbf {A} ^{\operatorname {T} }=-{\overline {\mathbf {A} }}.$

A square matrix whose transpose is equal to itsinverseis called anorthogonal matrix;that is,Ais orthogonal if

$\mathbf {A} ^{\operatorname {T} }=\mathbf {A} ^{-1}.$

A square complex matrix whose transpose is equal to its conjugate inverse is called aunitary matrix;that is,Ais unitary if

$\mathbf {A} ^{\operatorname {T} }={\overline {\mathbf {A} ^{-1}}}.$

Examples

• ${\begin{bmatrix}1&2\end{bmatrix}}^{\operatorname {T} }=\,{\begin{bmatrix}1\\2\end{bmatrix}}$

• ${\begin{bmatrix}1&2\\3&4\end{bmatrix}}^{\operatorname {T} }={\begin{bmatrix}1&3\\2&4\end{bmatrix}}$

• ${\begin{bmatrix}1&2\\3&4\\5&6\end{bmatrix}}^{\operatorname {T} }={\begin{bmatrix}1&3&5\\2&4&6\end{bmatrix}}$

Properties

LetAandBbe matrices andcbe ascalar.

• $\left(\mathbf {A} ^{\operatorname {T} }\right)^{\operatorname {T} }=\mathbf {A}.$

  The operation of taking the transpose is aninvolution(self-inverse).

• $\left(\mathbf {A} +\mathbf {B} \right)^{\operatorname {T} }=\mathbf {A} ^{\operatorname {T} }+\mathbf {B} ^{\operatorname {T} }.$

  The transpose respectsaddition.

• $\left(c\mathbf {A} \right)^{\operatorname {T} }=c\mathbf {A} ^{\operatorname {T} }.$

  The transpose of a scalar is the same scalar. Together with the preceding property, this implies that the transpose is alinear mapfrom thespaceofm×nmatrices to the space of then×mmatrices.

• $\left(\mathbf {AB} \right)^{\operatorname {T} }=\mathbf {B} ^{\operatorname {T} }\mathbf {A} ^{\operatorname {T} }.$

  The order of the factors reverses. By induction, this result extends to the general case of multiple matrices, so

  (A₁A₂...A_k−1A_k)^T=A_k^TA_k−1^T…A₂^TA₁^T.

• $\det \left(\mathbf {A} ^{\operatorname {T} }\right)=\det(\mathbf {A} ).$

  Thedeterminantof a square matrix is the same as the determinant of its transpose.

• Thedot productof two column vectorsaandbcan be computed as the single entry of the matrix product
  $$\mathbf {a} \cdot \mathbf {b} =\mathbf {a} ^{\operatorname {T} }\mathbf {b}.$$
• IfAhas only real entries, thenA^TAis apositive-semidefinite matrix.
• $\left(\mathbf {A} ^{\operatorname {T} }\right)^{-1}=\left(\mathbf {A} ^{-1}\right)^{\operatorname {T} }.$

  The transpose of an invertible matrix is also invertible, and its inverse is the transpose of the inverse of the original matrix.
  The notationA^−Tis sometimes used to represent either of these equivalent expressions.

• IfAis a square matrix, then itseigenvaluesare equal to the eigenvalues of its transpose, since they share the samecharacteristic polynomial.
• Over any field$k$,a square matrix$\mathbf {A}$issimilarto$\mathbf {A} ^{\operatorname {T} }$.

  This implies that$\mathbf {A}$and$\mathbf {A} ^{\operatorname {T} }$have the sameinvariant 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 afield extensionof$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 thealgebraic closureof$k$.
  • If$\mathbf {A}$is a matrix over an algebraically closed field inJordan normal formwith respect to some basis, then$\mathbf {A}$is similar to$\mathbf {A} ^{\operatorname {T} }$.This further reduces to proving the same fact when$\mathbf {A}$is a single Jordan block, which is a straightforward exercise.

Products

IfAis anm×nmatrix andA^Tis its transpose, then the result ofmatrix multiplicationwith these two matrices gives two square matrices:A A^Tism×mandA^TAisn×n.Furthermore, these products aresymmetric matrices.Indeed, the matrix productA A^Thas entries that are theinner productof a row ofAwith a column ofA^T.But the columns ofA^Tare the rows ofA,so the entry corresponds to the inner product of two rows ofA.Ifp_{i j}is the entry of the product, it is obtained from rowsiandjinA.The entryp_{j i}is also obtained from these rows, thusp_{i j}=p_{j i},and the product matrix (p_{i j}) is symmetric. Similarly, the productA^TAis a symmetric matrix.

A quick proof of the symmetry ofA A^Tresults from the fact that it is its own transpose:

$\left(\mathbf {A} \mathbf {A} ^{\operatorname {T} }\right)^{\operatorname {T} }=\left(\mathbf {A} ^{\operatorname {T} }\right)^{\operatorname {T} }\mathbf {A} ^{\operatorname {T} }=\mathbf {A} \mathbf {A} ^{\operatorname {T} }.$

Implementation of matrix transposition on computers

See also:In-place matrix transposition

Illustration ofrow- and column-major order

On acomputer,one can often avoid explicitly transposing a matrix inmemoryby simply accessing the same data in a different order. For example,software librariesforlinear algebra,such asBLAS,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 inrow-major 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 afast Fourier transformalgorithm, transposing the matrix in memory (to make the columns contiguous) may improve performance by increasingmemory locality.

Ideally, one might hope to transpose a matrix with minimal additional storage. This leads to the problem of transposing ann×mmatrixin-place,withO(1)additional storage or at most storage much less thanmn.Forn≠m,this involves a complicatedpermutationof the data elements that is non-trivial to implement in-place. Therefore, efficientin-place matrix transpositionhas been the subject of numerous research publications incomputer science,starting in the late 1950s, and several algorithms have been developed.

Transposes of linear maps and bilinear forms

See also:Transpose of a linear map

As the main use of matrices is to represent linear maps betweenfinite-dimensional vector spaces,the transpose is an operation on matrices that may be seen as the representation of some operation on linear maps.

This leads to a much more general definition of the transpose that works on every linear map, even when linear maps cannot be represented by matrices (such as in the case of infinite dimensional vector spaces). In the finite dimensional case, the matrix representing the transpose of a linear map is the transpose of the matrix representing the linear map, independently of thebasischoice.

Transpose of a linear map

Main article:Transpose of a linear map

LetX^#denote thealgebraic dual spaceof anR-moduleX. LetXandYbeR-modules. Ifu:X→Yis alinear map,then itsalgebraic adjointordual,is the mapu^#:Y^#→X^#defined byf↦f∘u. The resulting functionalu^#(f)is called thepullbackoffbyu. The followingrelationcharacterizes the algebraic adjoint ofu

⟨u^#(f),x⟩=⟨f,u(x)⟩for allf∈Y^#andx∈X

where⟨•, •⟩is thenatural pairing(i.e. defined by⟨h,z⟩:=h(z)). This definition also applies unchanged to left modules and to vector spaces.

The definition of the transpose may be seen to be independent of any bilinear form on the modules, unlike the adjoint (below).

Thecontinuous dual spaceof atopological vector space(TVS)Xis denoted byX'. IfXandYare TVSs then a linear mapu:X→Yisweakly continuousif and only ifu^#(Y') ⊆X',in which case we let^tu:Y'→X'denote the restriction ofu^#toY'. The map^tuis called thetransposeofu.

If the matrixAdescribes a linear map with respect tobasesofVandW,then the matrixA^Tdescribes the transpose of that linear map with respect to thedual bases.

Transpose of a bilinear form

Main article:Bilinear form

Every linear map to the dual spaceu:X→X^#defines a bilinear formB:X×X→F,with the relationB(x,y) =u(x)(y). By defining the transpose of this bilinear form as the bilinear form^tBdefined by the transpose^tu:X^##→X^#i.e.^tB(y,x) =^tu(Ψ(y))(x),we find thatB(x,y) =^tB(y,x). Here,Ψis the naturalhomomorphismX→X^##into thedouble dual.

Adjoint

Not to be confused withHermitian adjoint.

If the vector spacesXandYhave respectivelynondegeneratebilinear formsB_XandB_Y,a concept known as theadjoint,which is closely related to the transpose, may be defined:

Ifu:X→Yis alinear mapbetweenvector spacesXandY,we definegas theadjointofuifg:Y→Xsatisfies

$B_{X}{\big (}x,g(y){\big )}=B_{Y}{\big (}u(x),y{\big )}$for allx∈Xandy∈Y.

These bilinear forms define anisomorphismbetweenXandX^#,and betweenYandY^#,resulting in an isomorphism between the transpose and adjoint ofu. The matrix of the adjoint of a map is the transposed matrix only if thebasesareorthonormalwith 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 whetherg:Y→Xis equal tou⁻¹:Y→X. In particular, this allows theorthogonal groupover a vector spaceXwith a quadratic form to be defined without reference to matrices (nor the components thereof) as the set of all linear mapsX→Xfor which the adjoint equals the inverse.

Over a complex vector space, one often works withsesquilinear forms(conjugate-linear in one argument) instead of bilinear forms. TheHermitian adjointof 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.

See also

• Adjugate matrix,the transpose of thecofactor matrix
• Conjugate transpose
• Moore–Penrose pseudoinverse
• Projection (linear algebra)

Further reading

• Bourbaki, Nicolas(1989) [1970].Algebra I Chapters 1-3[Algèbre: Chapitres 1 à 3](PDF).Éléments de mathématique.Berlin New York: Springer Science & Business Media.ISBN978-3-540-64243-5.OCLC18588156.

• Halmos, Paul(1974),Finite dimensional vector spaces,Springer,ISBN978-0-387-90093-3.
• Maruskin, Jared M. (2012).Essential Linear Algebra.San José: Solar Crest. pp. 122–132.ISBN978-0-9850627-3-6.
• Schaefer, Helmut H.;Wolff, Manfred P. (1999).Topological Vector Spaces.GTM.Vol. 8 (Second ed.). New York, NY: Springer New York Imprint Springer.ISBN978-1-4612-7155-0.OCLC840278135.
• Trèves, François(2006) [1967].Topological Vector Spaces, Distributions and Kernels.Mineola, N.Y.: Dover Publications.ISBN978-0-486-45352-1.OCLC853623322.
• Schwartz, Jacob T. (2001).Introduction to Matrices and Vectors.Mineola: Dover. pp. 126–132.ISBN0-486-42000-0.

External links

• Gilbert Strang (Spring 2010)Linear Algebrafrom MIT Open Courseware