A matrix is skew-symmetric when .
A complex matrix can be put by unitary congruence into two-by-two skew blocks and zero blocks; the magnitudes are its singular values, each repeated twice. One proof uses the antilinear map . Because , . On a nonzero eigenspace of with eigenvalue , any unit vector has orthogonal partner , and . These orthonormal pairs give the blocks; the orthogonal complement is invariant, so the procedure repeats. Phases of the paired vectors set the block phases.
For , the map has matrix
It has trace zero and annihilates , so its determinant is zero.

Ancestors (6)

  1. Orthogonal group
  2. Linear algebra
  3. Algebra
  4. Area of mathematics
  5. Mathematics
  6. Home

Synonyms (2)

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (2)

A skew-symmetric matrix (also known as an antisymmetric matrix) is a square matrix \( A \) such that its transpose is equal to the negative of the matrix itself: \[ A^T = -A \] This means that for any elements of the matrix, the following condition holds: \[ a_{ij} = -a_{ji} \] for all \( i \) and \( j \).
Skew-symmetric matrix by Ciro Santilli 40 Updated 2025-07-16
WTF is a skew? "Antisymmetric" is just such a better name! And it also appears in other definitions such as antisymmetric multilinear map.