The transpose is a simple operation with big consequences. It swaps rows and columns, but that small move lets you define several important matrix families and prove useful algebraic rules.
This note has two goals:
- understand what really does;
- learn how to recognize symmetric and skew-symmetric matrices from the diagonal outward.
Intuition first: reflect across the main diagonal
When you transpose a matrix, the entry in row i, column j moves to row j,
column i.
The easiest picture is a reflection across the main diagonal. Entries on the diagonal stay where they are. Entries off the diagonal trade places with their partners on the other side.
That is why symmetry questions are always about comparing pairs like and .
Definitions
Definition
Transpose, symmetric matrix, and skew-symmetric matrix
If is an matrix, then its transpose is the matrix defined by
A square matrix is symmetric if .
A square matrix is skew-symmetric if .
Notice the word square. If is not square, then and do not even have the same size, so the equations and cannot be true.
Embedded interactive moment
The live comparison below lets you switch among several examples. Compare with , then look at what happens to entries on opposite sides of the main diagonal.
Read and try
Compare a matrix with its transpose
The live widget compares a matrix with its transpose and shows how the symmetric and skew-symmetric parts are built.
Choose an example
Original matrix A
| 2 | -1 |
| -1 | 3 |
Transpose A^T
| 2 | -1 |
| -1 | 3 |
Classification
The off-diagonal entries match, so swapping rows and columns changes nothing.
A^T = A
Symmetric part 1/2(A + A^T)
| 2 | -1 |
| -1 | 3 |
Skew-symmetric part 1/2(A - A^T)
| 0 | 0 |
| 0 | 0 |
Worked example
Worked example
Read symmetry from matching entries
Let
Then
So is symmetric.
Now consider
Then each off-diagonal entry changes sign when reflected across the diagonal,
and every diagonal entry is 0. Therefore , so is
skew-symmetric.
Why diagonal entries matter in the skew-symmetric case
If is skew-symmetric, then .
Look at a diagonal entry . Transposing does not move it, so the rule forces
That means
so every diagonal entry must be 0.
This is one of the fastest ways to reject a candidate skew-symmetric matrix: if even one diagonal entry is nonzero, the matrix cannot be skew-symmetric.
Theorem
Transpose reverses multiplication order
Whenever the product AB is defined,
This rule is important because transpose does not merely act on each matrix separately. It also reverses the order of multiplication. Students often forget that reversal.
Common mistakes
Common mistake
Thinking every square matrix is symmetric
Being square is only the first requirement. You still need the reflected entries to agree.
Common mistake
Forgetting that skew-symmetric means a sign change
For symmetry you compare equal entries. For skew-symmetry you compare opposite entries with opposite signs.
Common mistake
Transpose reverses the multiplication order. The correct formula is .
Quick checks
Quick check
Why must a symmetric or skew-symmetric matrix be square?
Answer using the sizes of and .
Solution
Answer
Quick check
What must the diagonal entries of a skew-symmetric matrix be?
Give the exact value.
Solution
Answer
Exercises
Quick check
Explain in words why is always symmetric.
You do not need a full formal proof, but you must mention transpose.
Solution
Guided solution
Quick check
Explain in words why is always skew-symmetric.
Again, focus on what happens after taking the transpose.
Solution
Guided solution
Related notes
Read 3.2 Matrix multiplication and linear systems if the order-reversal rule for still feels too sudden.
Continue to 3.4 Special matrices to see more named matrix families built from shape and position.