Skew Symmetric Matrix - Properties, Theorems, and Examples

#Algebra
TL;DR
A skew symmetric matrix is a square matrix that equals the negative of its transpose, so its diagonal entries are all zero and each entry is the negative of its mirror across the diagonal. This article covers the definition, why the diagonal must be zero, the properties, the symmetric-plus-skew decomposition theorem, the odd-order determinant rule, and six worked examples.
MV
Madhukar VLast updated on June 27, 202610 min read

What Is a Skew Symmetric Matrix?

A skew symmetric matrix (also called antisymmetric) is a square matrix AA that satisfies

AT=−AA^T = -A

where ATA^T is the transpose, the matrix formed by swapping rows and columns. Entry by entry, the condition reads aij=−ajia_{ij} = -a_{ji}: every entry is the negative of its mirror across the main diagonal.

A 3x3 example:

A=[02−5 −203 5−30]A = \begin{bmatrix} 0 & 2 & -5 \ -2 & 0 & 3 \ 5 & -3 & 0 \end{bmatrix}

Check one pair: a12=2a_{12} = 2 and a21=−2a_{21} = -2, which are negatives, as required.

Variable glossary. aija_{ij} is the entry in row ii, column jj. ATA^T is the transpose. The trace is the sum of the diagonal entries. A singular matrix has determinant zero (no inverse).

Why Are the Diagonal Entries Always Zero?

This is the first thing readers ask, and it falls straight out of the definition. For a diagonal entry, i=ji = j, so the condition aij=−ajia_{ij} = -a_{ji} becomes:

aii=−aiia_{ii} = -a_{ii}

Add aiia_{ii} to both sides:

2aii=02a_{ii} = 0

aii=0a_{ii} = 0

Every diagonal entry must equal its own negative, and the only number that does is zero. So the diagonal is forced to be all zeros, and you never get to choose those entries. An immediate consequence: the trace (sum of the diagonal) is zero for every skew symmetric matrix.

What Are the Properties of a Skew Symmetric Matrix?

The defining condition AT=−AA^T = -A propagates into a tidy set of properties.

  • Zero diagonal, zero trace. As derived above, every aii=0a_{ii} = 0, so the trace is 0.

  • Sums stay skew symmetric. If AA and BB are both skew symmetric, so is A+BA + B, and so is any scalar multiple kAkA.

  • Odd-order determinant is zero. Any skew symmetric matrix of odd order is singular, so its determinant is 0 (proof below).

  • A2A^2 is symmetric. Squaring a skew symmetric matrix produces a symmetric one.

  • Eigenvalues are zero or purely imaginary. A real skew symmetric matrix has no nonzero real eigenvalues.

The contrast with its partner, the symmetric matrix (where AT=AA^T = A), is the cleanest way to keep skew symmetric straight: symmetric mirrors equally, skew symmetric mirrors with a sign flip.

The Decomposition Theorem: Every Square Matrix as Symmetric Plus Skew

Here is the result that gives skew symmetric matrices their importance. Any square matrix can be written as the sum of a symmetric matrix and a skew symmetric matrix, in exactly one way:

$$A = \underbrace{\tfrac{1}{2}(A + A^T)}{\text{symmetric}} + \underbrace{\tfrac{1}{2}(A - A^T)}{\text{skew symmetric}}$$

The first piece, 12(A+AT)\tfrac{1}{2}(A + A^T), is always symmetric. The second piece, 12(A−AT)\tfrac{1}{2}(A - A^T), is always skew symmetric. Add them and the transposes cancel back to AA. This decomposition is why the skew symmetric part of a matrix appears throughout physics and engineering — it captures the "rotational" content of a transformation, while the symmetric part captures the "stretching" content.

Why Is the Determinant of an Odd-Order Skew Symmetric Matrix Zero?

A short, clean proof. Start from AT=−AA^T = -A and take determinants of both sides:

∣AT∣=∣−A∣|A^T| = |-A|

Use two facts: ∣AT∣=∣A∣|A^T| = |A| (transposing does not change the determinant), and ∣−A∣=(−1)n∣A∣|-A| = (-1)^n |A| for an n×nn \times n matrix (factoring −1-1 out of each of the nn rows):

∣A∣=(−1)n∣A∣|A| = (-1)^n |A|

When nn is odd, (−1)n=−1(-1)^n = -1, so:

∣A∣=−∣A∣|A| = -|A|

2∣A∣=02|A| = 0

∣A∣=0|A| = 0

So every odd-order skew symmetric matrix is singular. (For even nn, (−1)n=1(-1)^n = 1 and the equation gives ∣A∣=∣A∣|A| = |A|, no information — even-order determinants need not be zero.)

Examples of a Skew Symmetric Matrix

Example 1

Is [06 −60]\begin{bmatrix} 0 & 6 \ -6 & 0 \end{bmatrix} skew symmetric?

Check aij=−ajia_{ij} = -a_{ji}. The diagonal is all zeros. Off-diagonal: a12=6a_{12} = 6, a21=−6a_{21} = -6, which are negatives.

Final answer: Yes, it is skew symmetric.

Example 2

Is [04 40]\begin{bmatrix} 0 & 4 \ 4 & 0 \end{bmatrix} skew symmetric?

This is the wrong-path-first example.

Wrong attempt. A student sees zeros on the diagonal and declares it skew symmetric, reasoning that the zero diagonal is the defining feature.

Why it is wrong. The zero diagonal is necessary but not sufficient. The off-diagonal entries must also be negatives of each other. Here a12=4a_{12} = 4 and a21=4a_{21} = 4 — equal, not opposite.

Correct. Test a12=−a21a_{12} = -a_{21}: is 4=−44 = -4? No. The mirror entries are equal, which makes this matrix symmetric, not skew symmetric.

Final answer: No. It is symmetric, not skew symmetric — the zero diagonal alone is not enough.

Example 3

Find xx so that [0x −70]\begin{bmatrix} 0 & x \ -7 & 0 \end{bmatrix} is skew symmetric.

The condition a12=−a21a_{12} = -a_{21} requires:

x=−(−7)x = -(-7)

x=7x = 7

Final answer: x=7x = 7.

Example 4

Find the determinant of the 3×33 \times 3 skew symmetric matrix [02−5 −203 5−30]\begin{bmatrix} 0 & 2 & -5 \ -2 & 0 & 3 \ 5 & -3 & 0 \end{bmatrix}.

The matrix is skew symmetric and has odd order (3), so the theorem says the determinant is zero. Confirm by cofactor expansion along the first row:

∣A∣=0⋅M11−2∣−23 50∣+(−5)∣−20 5−3∣|A| = 0 \cdot M_{11} - 2\begin{vmatrix} -2 & 3 \ 5 & 0 \end{vmatrix} + (-5)\begin{vmatrix} -2 & 0 \ 5 & -3 \end{vmatrix}

∣A∣=0−2(0−15)−5(6−0)|A| = 0 - 2(0 - 15) - 5(6 - 0)

∣A∣=−2(−15)−5(6)|A| = -2(-15) - 5(6)

∣A∣=30−30|A| = 30 - 30

∣A∣=0|A| = 0

Final answer: ∣A∣=0|A| = 0, matching the odd-order rule.

Example 5

Decompose A=[25 14]A = \begin{bmatrix} 2 & 5 \ 1 & 4 \end{bmatrix} into symmetric and skew symmetric parts.

First find AT=[21 54]A^T = \begin{bmatrix} 2 & 1 \ 5 & 4 \end{bmatrix}.

Symmetric part 12(A+AT)\tfrac{1}{2}(A + A^T):

12[46 68]=[23 34]\tfrac{1}{2}\begin{bmatrix} 4 & 6 \ 6 & 8 \end{bmatrix} = \begin{bmatrix} 2 & 3 \ 3 & 4 \end{bmatrix}

Skew symmetric part 12(A−AT)\tfrac{1}{2}(A - A^T):

12[04 −40]=[02 −20]\tfrac{1}{2}\begin{bmatrix} 0 & 4 \ -4 & 0 \end{bmatrix} = \begin{bmatrix} 0 & 2 \ -2 & 0 \end{bmatrix}

Final answer: A=[23 34]+[02 −20]A = \begin{bmatrix} 2 & 3 \ 3 & 4 \end{bmatrix} + \begin{bmatrix} 0 & 2 \ -2 & 0 \end{bmatrix}, a symmetric matrix plus a skew symmetric one.

Example 6

Verify that A2A^2 is symmetric for A=[03 −30]A = \begin{bmatrix} 0 & 3 \ -3 & 0 \end{bmatrix}.

Compute A2A^2:

[03 −30][03 −30]=[−90 0−9]\begin{bmatrix} 0 & 3 \ -3 & 0 \end{bmatrix}\begin{bmatrix} 0 & 3 \ -3 & 0 \end{bmatrix} = \begin{bmatrix} -9 & 0 \ 0 & -9 \end{bmatrix}

The result is diagonal, hence symmetric (it equals its own transpose).

Final answer: A2=[−90 0−9]A^2 = \begin{bmatrix} -9 & 0 \ 0 & -9 \end{bmatrix}, which is symmetric, as the property predicts.

Why Skew Symmetric Matrices Matter: "The math of pure rotation"

Skew symmetric matrices exist because rotation and the cross product needed an algebraic home. When a transformation rotates without stretching, a rigid spin, its generator is skew symmetric, because rotation has no "diagonal" stretching content, only the off-diagonal mixing of axes. The forced-zero diagonal is the algebra noticing that pure rotation cannot scale.

The destination is concrete:

  • 3D rotations and robotics. The angular velocity of a spinning rigid body is encoded as a 3×33 \times 3 skew symmetric matrix; multiplying by it produces the cross product ω×v\boldsymbol{\omega} \times \mathbf{v}. Robot arms and spacecraft attitude control run on exactly this.

  • The cross product itself. Any cross product a×b\mathbf{a} \times \mathbf{b} can be written as a skew symmetric matrix built from a\mathbf{a} times the vector b\mathbf{b}, the so-called "cross-product matrix."

  • Physics field theory. The electromagnetic field tensor in special relativity is antisymmetric, packaging the electric and magnetic fields into one skew symmetric object.

Anywhere a system rotates or circulates rather than expands, a skew symmetric matrix is doing the bookkeeping.

Skew Symmetric Matrix - Where Intuition Breaks

Mistake 1: Believing the zero diagonal alone makes a matrix skew symmetric

Where it slips in: Spotting the zero diagonal and stopping the check there.

Don't do this: Call [04 40]\begin{bmatrix} 0 & 4 \ 4 & 0 \end{bmatrix} skew symmetric because the diagonal is zero.

The correct way: Test both conditions, the zero diagonal and aij=−ajia_{ij} = -a_{ji} off the diagonal. The mirror entries must be negatives, not equals. The point of confusion between symmetric and skew symmetric is the single most common source of wrong answers here: a zero diagonal is shared by some symmetric matrices too, so it can never decide the question on its own.

Mistake 2: Mixing up the sign in the decomposition theorem

Where it slips in: Splitting a matrix into symmetric and skew parts.

Don't do this: Use 12(A+AT)\tfrac{1}{2}(A + A^T) for the skew part.

The correct way: The sum 12(A+AT)\tfrac{1}{2}(A + A^T) is symmetric; the difference 12(A−AT)\tfrac{1}{2}(A - A^T) is skew symmetric. The plus sign keeps things equal (symmetric); the minus sign creates the negation (skew). The rusher who races through the formula swaps the two halves and gets parts that do not have the claimed symmetry, and a quick transpose check catches it.

Mistake 3: Assuming every skew symmetric determinant is zero

Where it slips in: Applying the odd-order rule to an even-order matrix.

Don't do this: Declare a 4×44 \times 4 skew symmetric matrix singular by reflex.

The correct way: The zero-determinant rule holds only for odd order. Even-order skew symmetric matrices can have nonzero determinants (in fact, a perfect-square value via the Pfaffian). The step where (−1)n(-1)^n decides the outcome looks skippable, but skipping it is exactly where the even case goes wrong.

The Mathematicians Behind the Skew Symmetric Matrix

Arthur Cayley (1821-1895, England) developed the algebra of matrices, including the symmetric and skew symmetric classifications, in his foundational memoir on matrices of 1858. Ferdinand Georg Frobenius (1849-1917, Germany) extended the theory of bilinear and quadratic forms that underpins the symmetric-plus-skew decomposition, work surveyed at MacTutor.

Skew Symmetric Matrix - In Five Bullets

  • A skew symmetric matrix satisfies AT=−AA^T = -A: its diagonal is all zeros and each entry is the negative of its mirror across the diagonal.

  • The zero diagonal follows from aii=−aiia_{ii} = -a_{ii}, which also forces the trace to zero.

  • Every square matrix splits uniquely into a symmetric part 12(A+AT)\tfrac{1}{2}(A + A^T) plus a skew symmetric part 12(A−AT)\tfrac{1}{2}(A - A^T).

  • The determinant of an odd-order skew symmetric matrix is always zero; even-order ones need not be.

  • Skew symmetric matrices encode rotation, the cross product, and circulating physical fields, wherever a system turns rather than stretches.

Practice Questions on Skew Symmetric Matrices

Work through these, then check the answers below.

  1. Is [0−3 30]\begin{bmatrix} 0 & -3 \ 3 & 0 \end{bmatrix} skew symmetric?

  2. Is [05 50]\begin{bmatrix} 0 & 5 \ 5 & 0 \end{bmatrix} skew symmetric?

  3. Find yy so that [0y −80]\begin{bmatrix} 0 & y \ -8 & 0 \end{bmatrix} is skew symmetric.

  4. Find the determinant of [01−4 −106 4−60]\begin{bmatrix} 0 & 1 & -4 \ -1 & 0 & 6 \ 4 & -6 & 0 \end{bmatrix}.

  5. Decompose A=[17 32]A = \begin{bmatrix} 1 & 7 \ 3 & 2 \end{bmatrix} into a symmetric and a skew symmetric part.

Answer to Question 1: Yes. The diagonal is zero and a12=−3=−a21a_{12} = -3 = -a_{21}.

Answer to Question 2: No. The mirror entries are equal (5=55 = 5), not negatives, so it is symmetric, not skew symmetric.

Answer to Question 3: The condition a12=−a21a_{12} = -a_{21} gives y=−(−8)=8y = -(-8) = 8.

Answer to Question 4: The matrix is skew symmetric and of odd order (3), so the determinant is 0.

Answer to Question 5: A=[15 52]+[02 −20]A = \begin{bmatrix} 1 & 5 \ 5 & 2 \end{bmatrix} + \begin{bmatrix} 0 & 2 \ -2 & 0 \end{bmatrix}, using 12(A+AT)\tfrac{1}{2}(A + A^T) and 12(A−AT)\tfrac{1}{2}(A - A^T).

Sharpen Your Skew Symmetric Matrix Skills - Three Practice Problems

Practice these to solidify your understanding: test three matrices for skew symmetry (include one symmetric trap with a zero diagonal), decompose a 2x2 matrix into symmetric and skew parts, and confirm the determinant of a 3x3 skew symmetric matrix is zero by direct expansion. If the symmetric-versus-skew distinction blurs, come back to the AT=−AA^T = -A versus AT=AA^T = A contrast. Next, the partner concept symmetric matrix and the broader triangular matrix deepen the picture.

Want a live Bhanzu trainer to walk through more skew symmetric matrix problems? Book a free demo class.

Was this article helpful?

Your feedback helps us write better content

Frequently Asked Questions

Are all diagonal entries of a skew symmetric matrix zero?
Yes, always. The condition aii=−aiia_{ii} = -a_{ii} forces every diagonal entry to be 0.
Is a zero matrix skew symmetric?
Yes. The zero matrix satisfies AT=−AA^T = -A trivially (since −0=0-0 = 0), so it is both symmetric and skew symmetric.
What is the difference between symmetric and skew symmetric?
A symmetric matrix satisfies AT=AA^T = A (mirror entries are equal); a skew symmetric matrix satisfies AT=−AA^T = -A (mirror entries are negatives, and the diagonal is zero).
Can a skew symmetric matrix be non-square?
No. The transpose condition AT=−AA^T = -A only makes sense when AA and ATA^T have the same order, which requires a square matrix.
Why is an odd-order skew symmetric determinant always zero?
Because ∣A∣=(−1)n∣A∣|A| = (-1)^n|A|, and for odd nn this gives ∣A∣=−∣A∣|A| = -|A|, forcing ∣A∣=0|A| = 0. The matrix is singular.
✍️ Written By
Madhukar V
Madhukar V
Math Columnist & Analyst
I see mathematics as more than just numbers and formulas—it is a way of thinking, questioning, and understanding the world around us. I work at the intersection of mathematics, EdTech, technology, and AI-powered learning, I enjoy exploring how mathematical ideas can be made simple, meaningful, and relatable. Through my articles, I aim to present mathematics with curiosity and a practical perspective, helping readers see the beauty and relevance behind every concept in a Bhanzu way.
LinkedIn
Related Articles
Book a FREE Demo ClassBook Now →