Transposition — Definition, Formula & Examples
Transposition is the operation of flipping a matrix over its main diagonal, so that each row becomes a column and each column becomes a row. The result is called the transpose of the original matrix.
Given an matrix , its transpose is the matrix whose entry in row , column equals the entry in row , column of . That is, for all valid .
Key Formula
Where:
- = The original m × n matrix
- = The transpose, an n × m matrix
- = Row index in the original matrix
- = Column index in the original matrix
How It Works
To transpose a matrix, take the first row and write it as the first column, then the second row becomes the second column, and so on. If the original matrix is , the transpose will be . A square matrix that equals its own transpose is called symmetric. Transposition preserves addition and scalar multiplication: and . For products, the order reverses: .
Worked Example
Problem: Find the transpose of the matrix A = [[1, 2, 3], [4, 5, 6]].
Identify dimensions: A is a 2 × 3 matrix, so its transpose will be 3 × 2.
Swap rows and columns: Write each row of A as a column. Row 1 (1, 2, 3) becomes column 1; row 2 (4, 5, 6) becomes column 2.
Answer:
Why It Matters
Transposition appears throughout linear algebra and statistics. It is essential for computing dot products as matrix products (), forming the normal equations in least-squares regression, and finding orthogonal matrices in physics and computer graphics.
Common Mistakes
Mistake: Reversing only some rows or columns instead of swapping every row-column pair.
Correction: Every entry must move: the element in row i, column j goes to row j, column i. Carefully rewrite each full row of the original as the corresponding column of the transpose.
