Transpose

<h2 id="transpose-of-a-matrix">Transpose of a matrix</h2>
This article assumes that matrices are taken over a commutative ring. These results may not hold in the non-commutative case.
<h3>Definition</h3>
The transpose of a matrix A, denoted by AT,<a class="footnote-ref" id="fnref:3" href="#fn:3">3</a> ⊤A, A⊤, 
 
 
 
 
 A
 
 ⊺
 
 
 
 
 {\displaystyle A^{\intercal }}
 
,<a class="footnote-ref" id="fnref:4" href="#fn:4">4</a><a class="footnote-ref" id="fnref:5" href="#fn:5">5</a> A′,<a class="footnote-ref" id="fnref:6" href="#fn:6">6</a> Atr, tA or At, may be constructed by any one of the following methods:

<ol><li><a href="/facts/Reflection_(mathematics)/5JHWnrql">Reflect</a> A over its <a href="/facts/Main_diagonal/rkT2F08Q">main diagonal</a> (which runs from top-left to bottom-right) to obtain AT</li>
<li>Write the rows of A as the columns of AT</li>
<li>Write the columns of A as the rows of AT</li></ol>
Formally, the i-th row, j-th column element of AT is the j-th row, i-th column element of A:

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

If A is an m × n matrix, then AT is an n × m matrix. 
In the case of square matrices, AT may also denote the Tth power of the matrix A. 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)n = T(An), notation TAn is not ambiguous.
In this article, this confusion is avoided by never using the symbol T as a <a href="/facts/Variable_(mathematics)/VbQlrvKz">variable</a> name.

<h4>Matrix definitions involving transposition</h4>
A square matrix whose transpose is equal to itself is called a <a href="/facts/Symmetric_matrix/08CGwjNl">symmetric matrix</a>; that is, A is symmetric if

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

A square matrix whose transpose is equal to its negative is called a <a href="/facts/Skew-symmetric_matrix/nw5CQeLN">skew-symmetric matrix</a>; that is, A is skew-symmetric if

A
          
          
            T
          
        
        =
        −
        
          A
        
        .
      
    
    {\displaystyle \mathbf {A} ^{\operatorname {T} }=-\mathbf {A} .}

A square <a href="/facts/Complex_number/2w7mqI7e">complex</a> matrix whose transpose is equal to the matrix with every entry replaced by its <a href="/facts/Complex_conjugate/7TEaoQDe">complex conjugate</a> (denoted here with an overline) is called a <a href="/facts/Hermitian_matrix/qArPblYo">Hermitian matrix</a> (equivalent to the matrix being equal to its <a href="/facts/Conjugate_transpose/7eBWtqVG">conjugate transpose</a>); that is, A is Hermitian if

A
          
          
            T
          
        
        =
        
          
            
              A
            
            ¯
          
        
        .
      
    
    {\displaystyle \mathbf {A} ^{\operatorname {T} }={\overline {\mathbf {A} }}.}

A square <a href="/facts/Complex_number/2w7mqI7e">complex</a> matrix whose transpose is equal to the negation of its complex conjugate is called a <a href="/facts/Skew-Hermitian_matrix/wxjjnvCC">skew-Hermitian matrix</a>; that is, A is skew-Hermitian if

A
          
          
            T
          
        
        =
        −
        
          
            
              A
            
            ¯
          
        
        .
      
    
    {\displaystyle \mathbf {A} ^{\operatorname {T} }=-{\overline {\mathbf {A} }}.}

A square matrix whose transpose is equal to its <a href="/facts/Inverse_matrix/fPqXk3V8">inverse</a> is called an <a href="/facts/Orthogonal_matrix/WDXBXYB5">orthogonal matrix</a>; that is, A is orthogonal if

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

A square complex matrix whose transpose is equal to its conjugate inverse is called a <a href="/facts/Unitary_matrix/8fsxv3KD">unitary matrix</a>; that is, A is unitary if

A
          
          
            T
          
        
        =
        
          
            
              
                A
              
              
                −
                1
              
            
            ¯
          
        
        .
      
    
    {\displaystyle \mathbf {A} ^{\operatorname {T} }={\overline {\mathbf {A} ^{-1}}}.}

<h3>Examples</h3>
<ul><li>
 
 
 
 
 
 
 [
 
 
 
 1
 
 
 2
 
 
 
 ]
 
 
 
 T
 
 
 =
 
 
 
 [
 
 
 
 1
 
 
 
 
 2
 
 
 
 ]
 
 
 
 
 {\displaystyle {\begin{bmatrix}1&2\end{bmatrix}}^{\operatorname {T} }=\,{\begin{bmatrix}1\\2\end{bmatrix}}}
 
</li></ul>
<ul><li>
 
 
 
 
 
 
 [
 
 
 
 1
 
 
 2
 
 
 
 
 3
 
 
 4
 
 
 
 ]
 
 
 
 T
 
 
 =
 
 
 [
 
 
 
 1
 
 
 3
 
 
 
 
 2
 
 
 4
 
 
 
 ]
 
 
 
 
 {\displaystyle {\begin{bmatrix}1&2\\3&4\end{bmatrix}}^{\operatorname {T} }={\begin{bmatrix}1&3\\2&4\end{bmatrix}}}
 
</li></ul>
<ul><li>
 
 
 
 
 
 
 [
 
 
 
 1
 
 
 2
 
 
 
 
 3
 
 
 4
 
 
 
 
 5
 
 
 6
 
 
 
 ]
 
 
 
 T
 
 
 =
 
 
 [
 
 
 
 1
 
 
 3
 
 
 5
 
 
 
 
 2
 
 
 4
 
 
 6
 
 
 
 ]
 
 
 
 
 {\displaystyle {\begin{bmatrix}1&2\\3&4\\5&6\end{bmatrix}}^{\operatorname {T} }={\begin{bmatrix}1&3&5\\2&4&6\end{bmatrix}}}
 
</li></ul>
<h3>Properties</h3>
Let A and B be matrices and c be a <a href="/facts/Scalar_(mathematics)/MkDbA4Eo">scalar</a>. 

<ul><li>
 
 
 
 
 
 (
 
 
 A
 
 
 T
 
 
 )
 
 
 T
 
 
 =
 
 A
 
 .
 
 
 {\displaystyle \left(\mathbf {A} ^{\operatorname {T} }\right)^{\operatorname {T} }=\mathbf {A} .}

The operation of taking the transpose is an <a href="/facts/Involution_(mathematics)/kKxYrUVa">involution</a> (self-<a href="/facts/Inverse_matrix/fPqXk3V8">inverse</a>).</li>
<li>
 
 
 
 
 
 (
 
 
 A
 
 +
 
 B
 
 
 )
 
 
 T
 
 
 =
 
 
 A
 
 
 T
 
 
 +
 
 
 B
 
 
 T
 
 
 .
 
 
 {\displaystyle \left(\mathbf {A} +\mathbf {B} \right)^{\operatorname {T} }=\mathbf {A} ^{\operatorname {T} }+\mathbf {B} ^{\operatorname {T} }.}

The transpose respects <a href="/facts/Matrix_addition/6zzLWyL0">addition</a>.</li>
<li>
 
 
 
 
 
 (
 
 c
 
 A
 
 
 )
 
 
 T
 
 
 =
 c
 (
 
 
 A
 
 
 T
 
 
 )
 .
 
 
 {\displaystyle \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 a <a href="/facts/Linear_map/Q1PBKNVV">linear map</a> from the <a href="/facts/Vector_space/M1pxMLx2">space</a> of m × n matrices to the space of the n × m matrices.</li>
<li>
 
 
 
 
 
 (
 
 A
 B
 
 )
 
 
 T
 
 
 =
 
 
 B
 
 
 T
 
 
 
 
 A
 
 
 T
 
 
 .
 
 
 {\displaystyle \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
(A1A2...Ak−1Ak)T = AkTAk−1T…A2TA1T.</li>
<li>
 
 
 
 det
 
 (
 
 
 A
 
 
 T
 
 
 )
 
 =
 det
 (
 
 A
 
 )
 .
 
 
 {\displaystyle \det \left(\mathbf {A} ^{\operatorname {T} }\right)=\det(\mathbf {A} ).}

The <a href="/facts/Determinant/eGYqJ2TF">determinant</a> of a square matrix is the same as the determinant of its transpose.</li>
<li>The <a href="/facts/Dot_product/tNz8MLjT">dot product</a> of two column vectors a and b can be computed as the single entry of the matrix product
 
 
 
 
 a
 
 ⋅
 
 b
 
 =
 
 
 a
 
 
 T
 
 
 
 b
 
 .
 
 
 {\displaystyle \mathbf {a} \cdot \mathbf {b} =\mathbf {a} ^{\operatorname {T} }\mathbf {b} .}
 
</li>
<li>If A has only real entries, then ATA is a <a href="/facts/Positive-semidefinite_matrix/Hbr6AuPS">positive-semidefinite matrix</a>.</li>
<li>
 
 
 
 
 
 (
 
 
 A
 
 
 T
 
 
 )
 
 
 −
 1
 
 
 =
 
 
 (
 
 
 A
 
 
 −
 1
 
 
 )
 
 
 T
 
 
 .
 
 
 {\displaystyle \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 notation A−T is sometimes used to represent either of these equivalent expressions.</li>
<li>If A is a square matrix, then its <a href="/facts/Eigenvalue%2c_eigenvector_and_eigenspace/8TjEoT8u">eigenvalues</a> are equal to the eigenvalues of its transpose, since they share the same <a href="/facts/Characteristic_polynomial/7m8roDqo">characteristic polynomial</a>.</li>
<li>
 
 
 
 
 (
 
 
 A
 
 
 a
 
 
 )
 
 ⋅
 
 b
 
 =
 
 a
 
 ⋅
 
 
 (
 
 
 A
 
 T
 
 
 
 b
 
 
 )
 
 
 
 
 {\displaystyle \left(\mathbf {A} \mathbf {a} \right)\cdot \mathbf {b} =\mathbf {a} \cdot \mathbf {\left(A^{T}\mathbf {b} \right)} }
 
 for two column vectors 
 
 
 
 
 a
 
 ,
 
 b
 
 
 
 {\displaystyle \mathbf {a} ,\mathbf {b} }
 
 and the standard <a href="/facts/Dot_product/tNz8MLjT">dot product</a>.</li>
<li>Over any field 
 
 
 
 k
 
 
 {\displaystyle k}
 
, a square matrix 
 
 
 
 
 A
 
 
 
 {\displaystyle \mathbf {A} }
 
 is <a href="/facts/Matrix_similarity/ySevpav1">similar</a> to 
 
 
 
 
 
 A
 
 
 T
 
 
 
 
 {\displaystyle \mathbf {A} ^{\operatorname {T} }}
 
.
This implies that 
 
 
 
 
 A
 
 
 
 {\displaystyle \mathbf {A} }
 
 and 
 
 
 
 
 
 A
 
 
 T
 
 
 
 
 {\displaystyle \mathbf {A} ^{\operatorname {T} }}
 
 have the same <a href="/facts/Invariant_factors/JHMm671w">invariant factors</a>, 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.
<ul><li>Let 
 
 
 
 
 A
 
 
 
 {\displaystyle \mathbf {A} }
 
 and 
 
 
 
 
 B
 
 
 
 {\displaystyle \mathbf {B} }
 
 be 
 
 
 
 n
 ×
 n
 
 
 {\displaystyle n\times n}
 
 matrices over some base field 
 
 
 
 k
 
 
 {\displaystyle k}
 
 and let 
 
 
 
 L
 
 
 {\displaystyle L}
 
 be a <a href="/facts/Field_extension/L7yIDtyK">field extension</a> of 
 
 
 
 k
 
 
 {\displaystyle k}
 
. If 
 
 
 
 
 A
 
 
 
 {\displaystyle \mathbf {A} }
 
 and 
 
 
 
 
 B
 
 
 
 {\displaystyle \mathbf {B} }
 
 are similar as matrices over 
 
 
 
 L
 
 
 {\displaystyle L}
 
, then they are similar over 
 
 
 
 k
 
 
 {\displaystyle k}
 
. In particular this applies when 
 
 
 
 L
 
 
 {\displaystyle L}
 
 is the <a href="/facts/Algebraic_closure/yjewG1mM">algebraic closure</a> of 
 
 
 
 k
 
 
 {\displaystyle k}
 
.</li>
<li>If 
 
 
 
 
 A
 
 
 
 {\displaystyle \mathbf {A} }
 
 is a matrix over an algebraically closed field in <a href="/facts/Jordan_normal_form/M7ezYbnl">Jordan normal form</a> with respect to some basis, then 
 
 
 
 
 A
 
 
 
 {\displaystyle \mathbf {A} }
 
 is similar to 
 
 
 
 
 
 A
 
 
 T
 
 
 
 
 {\displaystyle \mathbf {A} ^{\operatorname {T} }}
 
. This further reduces to proving the same fact when 
 
 
 
 
 A
 
 
 
 {\displaystyle \mathbf {A} }
 
 is a single Jordan block, which is a straightforward exercise.</li></ul></li></ul>
<h3>Products</h3>
If A is an m × n matrix and AT is its transpose, then the result of <a href="/facts/Matrix_multiplication/lYDB6Ro2">matrix multiplication</a> with these two matrices gives two square matrices: A AT is m × m and AT A is n × n. Furthermore, these products are <a href="/facts/Symmetric_matrices/08CGwjNl">symmetric matrices</a>. Indeed, the matrix product A AT has entries that are the <a href="/facts/Inner_product/HoyjElEy">inner product</a> of a row of A with a column of AT. But the columns of AT are the rows of A, so the entry corresponds to the inner product of two rows of A. If pi j is the entry of the product, it is obtained from rows i and j in A. The entry pj i is also obtained from these rows, thus pi j = pj i, and the product matrix (pi j) is symmetric. Similarly, the product AT A is a symmetric matrix.
A quick proof of the symmetry of A AT results from the fact that it is its own transpose:

(
 
 
 A
 
 
 
 A
 
 
 T
 
 
 
 )
 
 
 T
 
 
 =
 
 
 (
 
 
 A
 
 
 T
 
 
 )
 
 
 T
 
 
 
 
 A
 
 
 T
 
 
 =
 
 A
 
 
 
 A
 
 
 T
 
 
 .
 
 
 {\displaystyle \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} }.}
 
<a class="footnote-ref" id="fnref:7" href="#fn:7">7</a>
<h3>Implementation of matrix transposition on computers</h3>
See also: <a href="/facts/In-place_matrix_transposition/suY4JyuC">In-place matrix transposition</a>

On a <a href="/facts/Computer/SQe1aK05">computer</a>, one can often avoid explicitly transposing a matrix in <a href="/facts/Random_access_memory/DuD4bxh6">memory</a> by simply accessing the same data in a different order. For example, <a href="/facts/Software_libraries/xRzL3P7q">software libraries</a> for <a href="/facts/Linear_algebra/8VaB4VWk">linear algebra</a>, such as <a href="/facts/BLAS/T8Jq1Jpq">BLAS</a>, 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 <a href="/facts/Row-_and_column-major_order/eVYvNWoE">row-major order</a>, 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 <a href="/facts/Fast_Fourier_transform/caT7UUCh">fast Fourier transform</a> algorithm, transposing the matrix in memory (to make the columns contiguous) may improve performance by increasing <a href="/facts/Memory_locality/fYFKDv5q">memory locality</a>.
Ideally, one might hope to transpose a matrix with minimal additional storage. This leads to the problem of transposing an n × m matrix <a href="/facts/In-place/Ghe2PJUF">in-place</a>, with <a href="/facts/Big_O_notation/weFFjSWg">O(1)</a> additional storage or at most storage much less than mn. For n ≠ m, this involves a complicated <a href="/facts/Permutation/JSw9ukmv">permutation</a> of the data elements that is non-trivial to implement in-place. Therefore, efficient <a href="/facts/In-place_matrix_transposition/suY4JyuC">in-place matrix transposition</a> has been the subject of numerous research publications in <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, starting in the late 1950s, and several algorithms have been developed.

<h2 id="transposes-of-linear-maps-and-bilinear-forms">Transposes of linear maps and bilinear forms</h2>
See also: <a href="/facts/Transpose_of_a_linear_map/uv0JWTHq">Transpose of a linear map</a>
As the main use of matrices is to represent linear maps between <a href="/facts/Finite-dimensional_vector_space/z8m02A3W">finite-dimensional vector spaces</a>, 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 the <a href="/facts/Basis_(linear_algebra)/89IPoN6c">basis</a> choice.

<h3>Transpose of a linear map</h3>
Main article: <a href="/facts/Transpose_of_a_linear_map/uv0JWTHq">Transpose of a linear map</a>
Let X# denote the <a href="/facts/Algebraic_dual_space/4Uw4Knz1">algebraic dual space</a> of an R-<a href="/facts/Module_(mathematics)/jP0LIhFL">module</a> X. 
Let X and Y be R-modules. 
If u : X → Y is a <a href="/facts/Linear_map/Q1PBKNVV">linear map</a>, then its algebraic adjoint or dual,<a class="footnote-ref" id="fnref:8" href="#fn:8">8</a> is the map u# : Y# → X# defined by f ↦ f ∘ u. 
The resulting functional u#(f) is called the <a href="/facts/Pullback_(differential_geometry)/EzMDBYfK">pullback</a> of f by u. 
The following <a href="/facts/Relation_(math)/HjblDaMy">relation</a> characterizes the algebraic adjoint of u<a class="footnote-ref" id="fnref:9" href="#fn:9">9</a> 

⟨u#(f), x⟩ = ⟨f, u(x)⟩ for all f ∈ Y# and x ∈ X
where ⟨•, •⟩ is the <a href="/facts/Natural_pairing/2Y8KyofV">natural pairing</a> (i.e. defined by ⟨h, z⟩ := h(z)). 
This definition also applies unchanged to left modules and to vector spaces.<a class="footnote-ref" id="fnref:10" href="#fn:10">10</a>
The definition of the transpose may be seen to be independent of any bilinear form on the modules, unlike the adjoint (below).
The <a href="/facts/Continuous_dual_space/4Uw4Knz1">continuous dual space</a> of a <a href="/facts/Topological_vector_space/XRex1ChN">topological vector space</a> (TVS) X is denoted by X'. 
If X and Y are TVSs then a linear map u : X → Y is weakly continuous if and only if u#(Y') ⊆ X', in which case we let tu : Y' → X' denote the restriction of u# to Y'. 
The map tu is called the transpose<a class="footnote-ref" id="fnref:11" href="#fn:11">11</a> of u. 
If the matrix A describes a linear map with respect to <a href="/facts/Basis_(linear_algebra)/89IPoN6c">bases</a> of V and W, then the matrix AT describes the transpose of that linear map with respect to the <a href="/facts/Dual_basis/3S14kq2A">dual bases</a>.

<h3>Transpose of a bilinear form</h3>
Main article: <a href="/facts/Bilinear_form/gyvzn9ym">Bilinear form</a>
Every linear map to the dual space u : X → X# defines a bilinear form B : X × X → F, with the relation B(x, y) = u(x)(y). 
By defining the transpose of this bilinear form as the bilinear form tB defined by the transpose tu : X## → X# i.e. tB(y, x) = tu(Ψ(y))(x), we find that B(x, y) = tB(y, x). 
Here, Ψ is the natural <a href="/facts/Homomorphism/0gyqdEse">homomorphism</a> X → X## into the <a href="/facts/Double_dual/4Uw4Knz1">double dual</a>.

<h3>Adjoint</h3>
Not to be confused with <a href="/facts/Hermitian_adjoint/gN6RHphd">Hermitian adjoint</a>.
If the vector spaces X and Y have respectively <a href="/facts/Nondegenerate_form/9TLGBvSH">nondegenerate</a> <a href="/facts/Bilinear_form/gyvzn9ym">bilinear forms</a> BX and BY, a concept known as the adjoint, which is closely related to the transpose, may be defined:
If u : X → Y is a <a href="/facts/Linear_map/Q1PBKNVV">linear map</a> between <a href="/facts/Vector_space/M1pxMLx2">vector spaces</a> X and Y, we define g as the adjoint of u if g : Y → X satisfies

B
 
 X
 
 
 
 
 (
 
 
 x
 ,
 g
 (
 y
 )
 
 
 )
 
 
 =
 
 B
 
 Y
 
 
 
 
 (
 
 
 u
 (
 x
 )
 ,
 y
 
 
 )
 
 
 
 
 {\displaystyle B_{X}{\big (}x,g(y){\big )}=B_{Y}{\big (}u(x),y{\big )}}
 
 for all x ∈ X and y ∈ Y.
These bilinear forms define an <a href="/facts/Isomorphism/pj8KgkxU">isomorphism</a> between X and X#, and between Y and Y#, resulting in an isomorphism between the transpose and adjoint of u. 
The matrix of the adjoint of a map is the transposed matrix only if the <a href="/facts/Basis_(linear_algebra)/89IPoN6c">bases</a> are <a href="/facts/Orthonormality/JfgL1nAh">orthonormal</a> 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 g : Y → X is equal to u −1 : Y → X. 
In particular, this allows the <a href="/facts/Orthogonal_group/jKWM1KDM">orthogonal group</a> over a vector space X with a quadratic form to be defined without reference to matrices (nor the components thereof) as the set of all linear maps X → X for which the adjoint equals the inverse.
Over a complex vector space, one often works with <a href="/facts/Sesquilinear_form/Kp6qUA8v">sesquilinear forms</a> (conjugate-linear in one argument) instead of bilinear forms. 
The <a href="/facts/Hermitian_adjoint/gN6RHphd">Hermitian adjoint</a> 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.

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Adjugate_matrix/jjT9v8ox">Adjugate matrix</a>, the transpose of the <a href="/facts/Cofactor_matrix/CMudF5Eh">cofactor matrix</a></li>
<li><a href="/facts/Conjugate_transpose/7eBWtqVG">Conjugate transpose</a></li>
<li><a href="/facts/Converse_relation/EVGlRSz7">Converse relation</a></li>
<li><a href="/facts/Moore%25E2%2580%2593Penrose_pseudoinverse/CU73tntq">Moore–Penrose pseudoinverse</a></li>
<li><a href="/facts/Projection_(linear_algebra)/sElXGkxD">Projection (linear algebra)</a></li></ul>

<h2 id="further-reading">Further reading</h2>
<ul><li><a href="/facts/Nicolas_Bourbaki/qRJhs9nr">Bourbaki, Nicolas</a> (1989) [1970]. <a href="http://www.cmat.edu.uy/~marclan/TM/Algebra%20i%20-%20Bourbaki.pdf">Algebra I Chapters 1-3</a> [Algèbre: Chapitres 1 à 3] (PDF). <a href="/facts/%25C3%2589l%25C3%25A9ments_de_math%25C3%25A9matique/8TQroWxE">Éléments de mathématique</a>. Berlin New York: Springer Science & Business Media. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-3-540-64243-5. <a href="/facts/OCLC_(identifier)/Yqad8waq">OCLC</a> <a href="https://search.worldcat.org/oclc/18588156">18588156</a>.</li></ul>
<ul><li><a href="/facts/Paul_Halmos/mR11lcap">Halmos, Paul</a> (1974), Finite dimensional vector spaces, Springer, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-387-90093-3.</li>
<li>Maruskin, Jared M. (2012). <a href="https://books.google.com/books?id=aOF3-hx3u1kC&pg=PA122">Essential Linear Algebra</a>. San José: Solar Crest. pp. 122–132. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-9850627-3-6.</li>
<li><a href="/facts/Helmut_H._Schaefer/xorHTDBE">Schaefer, Helmut H.</a>; Wolff, Manfred P. (1999). Topological Vector Spaces. <a href="/facts/Graduate_Texts_in_Mathematics/VTIfY29j">GTM</a>. Vol. 8 (Second ed.). New York, NY: Springer New York Imprint Springer. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1-4612-7155-0. <a href="/facts/OCLC_(identifier)/Yqad8waq">OCLC</a> <a href="https://search.worldcat.org/oclc/840278135">840278135</a>.</li>
<li><a href="/facts/Fran%25C3%25A7ois_Tr%25C3%25A8ves/cpjQbAov">Trèves, François</a> (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-486-45352-1. <a href="/facts/OCLC_(identifier)/Yqad8waq">OCLC</a> <a href="https://search.worldcat.org/oclc/853623322">853623322</a>.</li>
<li>Schwartz, Jacob T. (2001). <a href="https://books.google.com/books?id=fMG3y1z9Jw0C&pg=PA126">Introduction to Matrices and Vectors</a>. Mineola: Dover. pp. 126–132. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-486-42000-0.</li></ul>
<h2 id="external-links">External links</h2>
<ul><li>Gilbert Strang (Spring 2010) <a href="https://ocw.mit.edu/courses/mathematics/18-06-linear-algebra-spring-2010/">Linear Algebra</a> from MIT Open Courseware</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Nykamp, Duane. "The transpose of a matrix". Math Insight. Retrieved September 8, 2020. <a href="https://mathinsight.org/matrix_transpose" target="_blank">https://mathinsight.org/matrix_transpose</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Arthur Cayley (1858) "A memoir on the theory of matrices", Philosophical Transactions of the Royal Society of London, 148 : 17–37. The transpose (or "transposition") is defined on page 31. <a href="https://books.google.com/books?id=flFFAAAAcAAJ&pg=PA31" target="_blank">https://books.google.com/books?id=flFFAAAAcAAJ&pg=PA31</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">T.A. Whitelaw (1 April 1991). Introduction to Linear Algebra, 2nd edition. CRC Press. ISBN 978-0-7514-0159-2. <a href="978-0-7514-0159-2" target="_blank">978-0-7514-0159-2</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">"Transpose of a Matrix Product (ProofWiki)". ProofWiki. Retrieved 4 Feb 2021. <a href="https://proofwiki.org/wiki/Transpose_of_Matrix_Product" target="_blank">https://proofwiki.org/wiki/Transpose_of_Matrix_Product</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">"What is the best symbol for vector/matrix transpose?". Stack Exchange. Retrieved 4 Feb 2021. <a href="https://tex.stackexchange.com/questions/30619/what-is-the-best-symbol-for-vector-matrix-transpose" target="_blank">https://tex.stackexchange.com/questions/30619/what-is-the-best-symbol-for-vector-matrix-transpose</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Weisstein, Eric W. "Transpose". mathworld.wolfram.com. Retrieved 2020-09-08. <a href="https://mathworld.wolfram.com/Transpose.html" target="_blank">https://mathworld.wolfram.com/Transpose.html</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Gilbert Strang (2006) Linear Algebra and its Applications 4th edition, page 51, Thomson Brooks/Cole ISBN 0-03-010567-6 <a href="/wiki/Gilbert_Strang" target="_blank">/wiki/Gilbert_Strang</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">Schaefer & Wolff 1999, p. 128. - Schaefer, Helmut H.; Wolff, Manfred P. (1999). Topological Vector Spaces. GTM. Vol. 8 (Second ed.). New York, NY: Springer New York Imprint Springer. ISBN 978-1-4612-7155-0. OCLC 840278135. <a href="https://search.worldcat.org/oclc/840278135" target="_blank">https://search.worldcat.org/oclc/840278135</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">Halmos 1974, §44 - Halmos, Paul (1974), Finite dimensional vector spaces, Springer, ISBN 978-0-387-90093-3 <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">Bourbaki 1989, II §2.5 - 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. ISBN 978-3-540-64243-5. OCLC 18588156. <a href="http://www.cmat.edu.uy/~marclan/TM/Algebra%20i%20-%20Bourbaki.pdf" target="_blank">http://www.cmat.edu.uy/~marclan/TM/Algebra%20i%20-%20Bourbaki.pdf</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">Trèves 2006, p. 240. - Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322. <a href="https://search.worldcat.org/oclc/853623322" target="_blank">https://search.worldcat.org/oclc/853623322</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
</ol>

Transpose open-in-new

Transpose