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.
Articles by others on the same topic
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 \).
WTF is a skew? "Antisymmetric" is just such a better name! And it also appears in other definitions such as antisymmetric multilinear map.