1 Definition
The transpose is an operation on a matrix that interchanges its rows and columns. If a matrix is written as \(A\), its transpose is denoted \(A^T\). For an \(m \times n\) matrix, the transpose is an \(n \times m\) matrix, so the operation also changes the matrix’s shape.
1.1 Matrix transpose
If \(A\) is a matrix with entries arranged in rows and columns, then \(A^T\) is formed by turning row \(i\) into column \(i\). In effect, the first row of \(A\) becomes the first column of \(A^T\), the second row becomes the second column, and so on. This simple rearrangement is one of the most basic operations in matrix algebra.
1.2 Entrywise description
Entry by entry, the transpose is defined by \[ (A^T)_{ij} = A_{ji}. \] This means the element in row \(i\), column \(j\) of the transpose is the same as the element in row \(j\), column \(i\) of the original matrix. The diagonal entries remain unchanged, since they satisfy \(i=j\).
1.3 Transpose notation
The most common notation for the transpose is \(A^T\). In some texts, especially in more advanced settings, a superscript \(\mathsf{T}\) is used to emphasize the operation. The transpose may also be described verbally as “the transpose of \(A\).”
2 Basic properties
The transpose behaves predictably with respect to many standard matrix operations. These rules make it a useful tool for simplifying expressions and proving identities.
2.1 Double transpose
Taking the transpose twice returns the original matrix: \[ (A^T)^T = A. \] This property reflects the fact that swapping rows and columns twice restores the initial arrangement.
2.2 Linearity
The transpose is linear, meaning it respects addition and scalar multiplication. If matrices have the same dimensions, the transpose of their sum is the sum of their transposes, and the transpose of a scalar multiple is the same scalar multiplied by the transpose.
2.3 Transpose of a sum
For matrices \(A\) and \(B\) of the same size, \[ (A+B)^T = A^T + B^T. \] Each entry in the sum is transposed individually, so the operation distributes across addition.
2.4 Transpose of a scalar multiple
For any scalar \(c\), \[ (cA)^T = cA^T. \] The scalar factor is unaffected by the transpose, since only the positions of the matrix entries change.
2.5 Transpose of a product
The transpose of a product has an important reversal rule. This is one of the most frequently used identities in matrix algebra.
2.5.1 Reversal of order
If the product \(AB\) is defined, then \[ (AB)^T = B^T A^T. \] The order reverses because rows in the product correspond to columns in the transposed factors. This rule extends to longer products as well.
2.5.2 Powers and repeated products
For a square matrix \(A\) and a positive integer \(n\), \[ (A^n)^T = (A^T)^n. \] This follows from repeated use of the product rule. Thus, transposition is compatible with matrix powers, provided the matrix is square.
3 Special matrices
Certain classes of matrices are defined by how they relate to their transposes. These types occur often in theory and applications.
3.1 Symmetric matrices
A matrix \(A\) is symmetric if \[ A^T = A. \] Such a matrix is equal to its transpose, so its entries mirror across the main diagonal. Symmetric matrices play a major role in algebra, optimization, and numerical computation.
3.2 Skew-symmetric matrices
A matrix \(A\) is skew-symmetric if \[ A^T = -A. \] In this case, the transpose changes the sign of every entry. A skew-symmetric matrix has zeros on its diagonal, since each diagonal entry must equal its own negative.
3.3 Orthogonal matrices
A real square matrix \(Q\) is orthogonal if \[ Q^T Q = I. \] Here \(Q^T\) serves as the inverse of \(Q\). Orthogonal matrices preserve lengths and angles, which makes them important in geometry and numerical algorithms.
3.4 Upper and lower triangular matrices
The transpose of an upper triangular matrix is lower triangular, and vice versa. Since transposition reflects entries across the diagonal, the nonzero region above the diagonal becomes the corresponding region below it. Diagonal matrices remain unchanged under transposition.
4 Transpose in linear algebra
The transpose appears naturally in vector and transformation settings. It helps connect matrix notation with geometric and functional ideas.
4.1 Row and column vectors
The transpose converts a column vector into a row vector, and a row vector into a column vector. This is often used to write dot products and linear equations compactly. In many contexts, vectors are distinguished by orientation, and transposition switches that orientation.
4.2 Linear transformations and adjoints
For a linear transformation represented by a matrix, the transpose relates to the corresponding dual action on row vectors and linear functionals. In finite-dimensional settings with chosen bases, the matrix of the transpose transformation is the transpose of the original matrix. This relation is central in expressing how transformations interact with bilinear structure.
4.3 Bilinear forms
Transpose is closely tied to bilinear forms, which take two vectors and produce a scalar. When a matrix represents such a form, transposition exchanges the two vector slots. Symmetry of the form corresponds to symmetry of the matrix.
4.4 Inner products
The transpose also appears in formulas involving inner products, especially in real vector spaces. Many identities can be written using \(x^T y\), where a column vector \(x\) is transposed into a row vector before multiplication. This notation is common in geometry, statistics, and optimization.
5 Determinants and inverses
Transposition interacts neatly with determinant and inverse operations, which makes it useful in proofs and computations.
5.1 Determinant of a transpose
A square matrix and its transpose have the same determinant: \[ \det(A^T) = \det(A). \] This reflects the fact that the determinant depends on the matrix in a way that is unchanged by swapping rows and columns.
5.2 Inverse of a transpose
If \(A\) is invertible, then \(A^T\) is also invertible and \[ (A^T)^{-1} = (A^{-1})^T. \] This identity follows directly from the product rule for transposes and the defining property of an inverse.
5.3 Transpose and matrix rank
A matrix and its transpose have the same rank. Since rank measures the dimension of the column space, and transposition exchanges columns with rows, the equality reflects the symmetry between row rank and column rank.
6 Applications
The transpose is used throughout mathematics, science, and computation because it simplifies notation and reveals structural relationships.
6.1 Solving matrix equations
Many matrix equations become easier to manipulate after taking transposes. The operation can convert row conditions into column conditions, or produce equivalent equations with factors in reversed order. This is useful in deriving identities and checking consistency.
6.2 Computer algebra and numerical methods
In symbolic computation and numerical linear algebra, transposition is a routine step in matrix algorithms. It appears in factorization methods, least-squares procedures, iterative solvers, and code that reorganizes data for efficient access. Because it is simple to implement, it is often used to reshape expressions before more expensive operations.
6.3 Statistics and data analysis
Transpose is common in statistics, where data may be arranged with observations in rows and variables in columns, or the reverse. It also appears in covariance formulas, regression models, and matrix-based summaries of datasets. Transposition helps align data with the conventions of a particular method.
6.4 Geometry and transformations
In geometry, transpose is associated with reflections of matrix structure across the main diagonal and with transformations that preserve lengths or angles. Orthogonal matrices, in particular, use the transpose to express inverse transformations. This makes transpose relevant in rotation, reflection, and coordinate-change formulas.
7 Related concepts
Several related operations extend or generalize the transpose, especially in complex vector spaces and inner-product settings.
7.1 Conjugate transpose
For matrices with complex entries, the conjugate transpose combines transposition with complex conjugation. It is often denoted \(A^*\) or \(A^\dagger\). This operation is the appropriate analogue of transpose in complex linear algebra.
7.2 Adjoint matrix
The term adjoint matrix can refer to different ideas in different contexts. In many modern settings, it is used informally for the conjugate transpose of a matrix. In older algebra, it may also mean the classical adjugate used in inverse formulas. The meaning depends on context.
7.3 Frobenius inner product
The Frobenius inner product is a matrix inner product defined by summing products of corresponding entries. It can be written using a transpose as \[ \langle A, B \rangle = \mathrm{tr}(A^T B) \] for real matrices. This notation highlights the role of the transpose in pairing matrices entry by entry.