Intuition What's really happening when we transpose?
Think of a matrix as a table where each row is a data record. The transpose flips the table so that rows become columns and columns become rows. It's like rotating your spreadsheet 90° and reflecting it. Why does this matter? Many operations in linear algebra (dot products, orthogonality, symmetric matrices) rely on comparing a matrix with its transpose. It's a fundamental symmetry operation.
Definition Transpose of a Matrix
For a matrix A A A of size m × n m \times n m × n , the transpose A T A^T A T (or A ′ A' A ′ ) is an n × m n \times m n × m matrix where:
[ A T ] i j = [ A ] j i [A^T]_{ij} = [A]_{ji} [ A T ] ij = [ A ] j i
What this means: The element in row i i i , column j j j of A T A^T A T equals the element in row j j j , column i i i of A A A .
Derivation from scratch:
Start with a concrete matrix:
A = [ a 11 a 12 a 13 a 21 a 22 a 23 ] 2 × 3 A = \begin{bmatrix} a_{11} & a_{12} & a_{13} \\ a_{21} & a_{22} & a_{23} \end{bmatrix}_{2 \times 3} A = [ a 11 a 21 a 12 a 22 a 13 a 23 ] 2 × 3
We want to swap the "coordinate system": what was accessed as "row i i i , column j j j " should become "row j j j , column i i i ".
Step 1: The first row of A A A is [ a 11 , a 12 , a 13 ] [a_{11}, a_{12}, a_{13}] [ a 11 , a 12 , a 13 ] . These should become the first column of A T A^T A T .
Step 2: The second row of A A A is [ a 21 , a 22 , a 23 ] [a_{21}, a_{22}, a_{23}] [ a 21 , a 22 , a 23 ] . These should become the second column of A T A^T A T .
Result:
A T = [ a 11 a 21 a 12 a 22 a 13 a 23 ] 3 × 2 A^T = \begin{bmatrix} a_{11} & a_{21} \ a_{12} & a_{22} \\ a_{13} & a_{23} \end{bmatrix}_{3 \times 2} A T = [ a 11 a 13 a 21 a 12 a 23 a 22 ] 3 × 2
Why this step? Because "row becomes column" means the k k k -th row vector of A A A becomes the k k k -th column vector of A T A^T A T .
Worked example Basic transpose
A = [ 1 2 3 4 5 6 ] A = \begin{bmatrix} 1 & 2 & 3 \\ 4 & 5 & 6 \end{bmatrix} A = [ 1 4 2 5 3 6 ]
Find A T A^T A T :
Row 1 of A A A : [ 1 , 2 , 3 ] [1, 2, 3] [ 1 , 2 , 3 ] → Column 1 of A T A^T A T : [ 1 2 3 ] \begin{bmatrix} 1 \ 2 \\ 3 \end{bmatrix} [ 1 2 3 ]
Row 2 of A A A : [ 4 , 5 , 6 ] [4, 5, 6] [ 4 , 5 , 6 ] → Column 2 of A T A^T A T : [ 4 5 6 ] \begin{bmatrix} 4 \\ 5 \\ 6 \end{bmatrix} 4 5 6
A T = [ 1 4 2 5 3 6 ] A^T = \begin{bmatrix} 1 & 4 \\ 2 & 5 \\ 3 & 6 \end{bmatrix} A T = 1 2 3 4 5 6
Verification: [ A T ] 23 = 6 [A^T]_{23} = 6 [ A T ] 23 = 6 and [ A ] 32 = 6 [A]_{32} = 6 [ A ] 32 = 6 ✓
Worked example Transpose of sum
A = [ 1 2 3 4 ] , B = [ 5 6 7 8 ] A = \begin{bmatrix} 1 & 2 \\ 3 & 4 \end{bmatrix}, \quad B = \begin{bmatrix} 5 & 6 \\ 7 & 8 \end{bmatrix} A = [ 1 3 2 4 ] , B = [ 5 7 6 8 ]
Method 1: Add then transpose:
A + B = [ 6 8 10 12 ] ⟹ ( A + B ) T = [ 6 10 8 12 ] A + B = \begin{bmatrix} 6 & 8 \\ 10 & 12 \end{bmatrix} \implies (A+B)^T = \begin{bmatrix} 6 & 10 \\ 8 & 12 \end{bmatrix} A + B = [ 6 10 8 12 ] ⟹ ( A + B ) T = [ 6 8 10 12 ]
Method 2: Transpose then add:
A T = [ 1 3 2 4 ] , B T = [ 5 7 6 8 ] A^T = \begin{bmatrix} 1 & 3 \\ 2 & 4 \end{bmatrix}, \quad B^T = \begin{bmatrix} 5 & 7 \\ 6 & 8 \end{bmatrix} A T = [ 1 2 3 4 ] , B T = [ 5 6 7 8 ]
A T + B T = [ 6 10 8 12 ] A^T + B^T = \begin{bmatrix} 6 & 10 \\ 8 & 12 \end{bmatrix} A T + B T = [ 6 8 10 12 ]
Both match✓
Worked example Transpose of product
A = [ 1 2 3 4 ] , B = [ 5 6 7 8 ] A = \begin{bmatrix} 1 & 2 \\ 3 & 4 \end{bmatrix}, \quad B = \begin{bmatrix} 5 & 6 \\ 7 & 8 \end{bmatrix} A = [ 1 3 2 4 ] , B = [ 5 7 6 8 ]
Step 1: Compute A B AB A B :
A B = [ 1 ( 5 ) + 2 ( 7 ) 1 ( 6 ) + 2 ( 8 ) 3 ( 5 ) + 4 ( 7 ) 3 ( 6 ) + 4 ( 8 ) ] = [ 19 22 43 50 ] AB = \begin{bmatrix} 1(5)+2(7) & 1(6)+2(8) \\ 3(5)+4(7) & 3(6)+4(8) \end{bmatrix} = \begin{bmatrix} 19 & 22 \\ 43 & 50 \end{bmatrix} A B = [ 1 ( 5 ) + 2 ( 7 ) 3 ( 5 ) + 4 ( 7 ) 1 ( 6 ) + 2 ( 8 ) 3 ( 6 ) + 4 ( 8 ) ] = [ 19 43 22 50 ]
Step 2: Transpose A B AB A B :
( A B ) T = [ 19 43 22 50 ] (AB)^T = \begin{bmatrix} 19 & 43 \\ 22 & 50 \end{bmatrix} ( A B ) T = [ 19 22 43 50 ]
Step 3: Compute B T A T B^T A^T B T A T :
B T = [ 5 7 6 8 ] , A T = [ 1 3 2 4 ] B^T = \begin{bmatrix} 5 & 7 \\ 6 & 8 \end{bmatrix}, \quad A^T = \begin{bmatrix} 1 & 3 \\ 2 & 4 \end{bmatrix} B T = [ 5 6 7 8 ] , A T = [ 1 2 3 4 ]
B T A T = [ 5 ( 1 ) + 7 ( 2 ) 5 ( 3 ) + 7 ( 4 ) 6 ( 1 ) + 8 ( 2 ) 6 ( 3 ) + 8 ( 4 ) ] = [ 19 43 22 50 ] B^T A^T = \begin{bmatrix} 5(1)+7(2) & 5(3)+7(4) \\ 6(1)+8(2) & 6(3)+8(4) \end{bmatrix} = \begin{bmatrix} 19 & 43 \\ 22 & 50 \end{bmatrix} B T A T = [ 5 ( 1 ) + 7 ( 2 ) 6 ( 1 ) + 8 ( 2 ) 5 ( 3 ) + 7 ( 4 ) 6 ( 3 ) + 8 ( 4 ) ] = [ 19 22 43 50 ]
They match! Why the reversal? Because when you transpose a product, the "inside" indices that were being sumed over swap positions, forcing the matrix order to flip.
Definition Symmetric Matrix
A matrix A A A is symmetric if A T = A A^T = A A T = A .
What this means: a i j = a j i a_{ij} = a_{ji} a ij = a j i for all i , j i, j i , j . The matrix is mirror-symmetric across the main diagonal.
Example: [ 1 2 3 2 4 5 3 5 6 ] \begin{bmatrix} 1 & 2 & 3 \\ 2 & 4 & 5 \\ 3 & 5 & 6 \end{bmatrix} 1 2 3 2 4 5 3 5 6
Definition Skew-Symmetric Matrix
A matrix A A A is skew-symmetric (or antisymmetric) if A T = − A A^T = -A A T = − A .
What this means: a i j = − a j i a_{ij} = -a_{ji} a ij = − a j i for all i , j i, j i , j . Important: Diagonal elements must be zero (since a i i = − a i i a_{ii} = -a_{ii} a ii = − a ii implies a i i = 0 a_{ii} = 0 a ii = 0 ).
Example: [ 0 2 − 3 − 2 0 5 3 − 5 0 ] \begin{bmatrix} 0 & 2 & -3 \\ -2 & 0 & 5 \\ 3 & -5 & 0 \end{bmatrix} 0 − 2 3 2 0 − 5 − 3 5 0
Common mistake Common error: Confusing transpose with inverse
Wrong idea: "Transpose undoes multiplication like inverse does, so A T = A − 1 A^T = A^{-1} A T = A − 1 ."
Why it feels right: Both involve some kind of "reversal" — transpose reverses dimensions (m × n → n × m m \times n \to n \times m m × n → n × m ), inverse reverses multiplication (A A − 1 = I A A^{-1} = I A A − 1 = I ).
The fix: Transpose is a structural operation (flipping indices). Inverse is a multiplicative operation (finding what undoes A A A ). They're only equal for special matrices called orthogonal matrices where A T A = I A^T A = I A T A = I , which means A T = A − 1 A^T = A^{-1} A T = A − 1 .
Test it: For A = [ 1 2 3 4 ] A = \begin{bmatrix} 1 & 2 \ 3 & 4 \end{bmatrix} A = [ 1 2 3 4 ] :
A T = [ 1 3 2 4 ] A^T = \begin{bmatrix} 1 & 3 \ 2 & 4 \end{bmatrix} A T = [ 1 3 2 4 ]
A − 1 = 1 − 2 [ 4 − 2 − 3 1 ] = [ − 2 1 1.5 − 0.5 ] A^{-1} = \frac{1}{-2}\begin{bmatrix} 4 & -2 \\ -3 & 1 \end{bmatrix} = \begin{bmatrix} -2 & 1 \\ 1.5 & -0.5 \end{bmatrix} A − 1 = − 2 1 [ 4 − 3 − 2 1 ] = [ − 2 1.5 1 − 0.5 ]
Clearly different!
Common mistake Forgetting the reversal in
( A B ) T (AB)^T ( A B ) T
Wrong idea: ( A B ) T = A T B T (AB)^T = A^T B^T ( A B ) T = A T B T
Why it feels right: The sum rule ( A + B ) T = A T + B T (A+B)^T = A^T + B^T ( A + B ) T = A T + B T works this way, so product should too.
The fix: Matrix multiplication is not commutative . When you transpose a product, the summation indices swap, forcing the matrix order to reverse: ( A B ) T = B T A T (AB)^T = B^T A^T ( A B ) T = B T A T .
Mnemonic: "Transpose reverses the order like reading backwards: ( A B C ) T = C T B T A T (ABC)^T = C^T B^T A^T ( A B C ) T = C T B T A T ."
Mnemonic Remembering transpose properties
"SIRP" for the four core properties:
S elf-inverse: ( A T ) T = A (A^T)^T = A ( A T ) T = A
I gnores scalars: ( k A ) T = k A T (kA)^T = kA^T ( k A ) T = k A T
R everses products: ( A B ) T = B T A T (AB)^T = B^T A^T ( A B ) T = B T A T
P reserves sums: ( A + B ) T = A T + B T (A+B)^T = A^T + B^T ( A + B ) T = A T + B T
Visual: Think of transpose as a "mirror flip" along the diagonal. Sums and scalars don't care about the mirror. Products care because the matrix on the right "hits the mirror first" when you flip.
Recall Explain to a 12-year-old
Imagine you have a table of data with students in rows and test scores in columns:
Math Science English
Alice 90 85 88
Bob 75 92 80
The transpose just flips this table so that students become columns and subjects become rows:
Alice Bob
Math 90 75
Science 85 92
English 88 80
Why would you do this? Sometimes it's easier to work with data organized one way versus another. For example, if you wanted to compare all students' math scores, it's easier when math is a single row you can read across.
The cool properties are just rules about what happens when you flip tables:
If you flip twice, you get back to the original (duh!)
If you add two tables then flip, it's the same as flipping both tables first then adding
If you multiply two tables then flip, the order of the tables reverses (this one's tricky — it happens because of how the rows and columns interact when multiplying)
#flashcards/maths
What is the transpose of a matrix? :: The transpose A T A^T A T of an m × n m \times n m × n matrix A A A is the n × m n \times m n × m matrix where [ A T ] i j = [ A ] j i [A^T]_{ij} = [A]_{ji} [ A T ] ij = [ A ] j i — rows and columns are swapped.
What is ( A T ) T (A^T)^T ( A T ) T ? ( A T ) T = A (A^T)^T = A ( A T ) T = A — transposing twice returns the original matrix.
How does transpose interact with addition? ( A + B ) T = A T + B T (A + B)^T = A^T + B^T ( A + B ) T = A T + B T — you can transpose then add, or add then transpose.
How does transpose interact with scalar multiplication? ( k A ) T = k A T (kA)^T = k A^T ( k A ) T = k A T — scalars can move in or out of the transpose.
What is the transpose of a product ( A B ) T (AB)^T ( A B ) T ? ( A B ) T = B T A T (AB)^T = B^T A^T ( A B ) T = B T A T — the order reverses (most important property!).
What is the transpose of an inverse ( A − 1 ) T (A^{-1})^T ( A − 1 ) T ? ( A − 1 ) T = ( A T ) − 1 (A^{-1})^T = (A^T)^{-1} ( A − 1 ) T = ( A T ) − 1 — transpose and inverse commute.
What is a symmetric matrix? A matrix
A A A where
A T = A A^T = A A T = A — elements satisfy
a i j = a j i a_{ij} = a_{ji} a ij = a j i .
What is a skew-symmetric matrix? A matrix
A A A where
A T = − A A^T = -A A T = − A — elements satisfy
a i j = − a j i a_{ij} = -a_{ji} a ij = − a j i , and diagonal elements are zero.
Why does ( A B ) T = B T A T (AB)^T = B^T A^T ( A B ) T = B T A T instead of A T B T A^T B^T A T B T ? Because the summation index in matrix multiplication swaps position during transpose, forcing the matrix order to reverse.
If A A A is 2 × 3 2 \times 3 2 × 3 , what is the size of A T A^T A T ? A T A^T A T is
3 × 2 3 \times 2 3 × 2 — dimensions flip.
k-th row becomes k-th column
Row i col j becomes row j col i
Row vectors become columns
Symmetric matrices and orthogonality
Example check A^T 23 = A 32
Intuition Hinglish mein samjho
Transpose ka matlab hai matrix ko flip karna — rows ko columns bana do aur columns ko rows. Agar tumhare pas ek 2×3 matrix hai (2 rows, 3 columns), toh uska transpose 3×2 hoga (3 rows, 2 columns). Formula simple hai: [ A T ] i j = [ A ] j i [A^T]_{ij} = [A]_{ji} [ A T ] ij = [ A ] j i — matlab jo element original matrix mein ( j , i ) (j,i) ( j , i ) position petha, woh transpose mein ( i , j ) (i,j) ( i , j ) pe aa jayega.
Properties kafi straightforward hain. Agar tum do baar transpose karo, toh wapas original matrix mil jayegi: ( A T ) T = A (A^T)^T = A ( A T ) T = A . Addition aur scalar multiplication ke sath transpose distribute ho jata hai: ( A + B ) T = A T + B T (A+B)^T = A^T + B^T ( A + B ) T = A T + B T aur ( k A ) T = k A T (kA)^T = kA^T ( k A ) T = k A T . Lekin multiplication mein ek twist hai — agar tum do matrices multiply karo phir transpose karo, toh order reverse ho jata hai: ( A B ) T = B T A T (AB)^T = B^T A^T ( A B ) T = B T A T . Yeh isliye hota hai kyunki matrix multiplication mein jo indices sum hote hain, woh transpose karne pe swap ho jate hain.
Transpose ki understanding bahut zaroori hai kyunki yeh linear algebra mein har jagah dikhta hai — symmetric matrices (jahan A T = A A^T = A A T = A ), orthogonal matrices (jahan A T A = I A^T A = I A T A = I ), dot products (x ⋅ y = x T y \mathbf{x} \cdot \mathbf{y} = \mathbf{x}^T \mathbf{y} x ⋅ y = x T y ), aur determinants mein. Ek baar transpose ke properties clear ho gaye, toh aage ke concepts bahut asan ho jate hain.
Ek common galti yeh hai ki log transpose ko inverse samajh lete hain. Lekin transpose sirf ek structural operation hai (flipping indices), jabki inverse ek multiplicative operation hai (jo A A A ko undo kare). Woh sirf orthogonal matrices ke liye equal hote hain. Dusri galti hai ( A B ) T = A T B T (AB)^T = A^T B^T ( A B ) T = A T B T likhna — yad rakho, product ke sath order reverse hota hai!