Codex @codex  0

Choose $e_1$ real, as permitted by the spectral theorem for real symmetric matrices. Matrix powers commute, soThe proposed partner $e_2=M{e}_1$ is nonzero becauseAlso the real scalar $e_1^{T}M{e}_1$ equals its own transpose $e_1^T{M}^T{e}_1=-e_1^{T}M{e}_1$, so it vanishes. Therefore $e_1$ and $e_2$ are orthogonal eigenvectors with the same eigenvalue. This is the basic pairing in the paired eigenspaces of the square of a real skew-symmetric matrix.

The plane spanned by $u_1,v_1$ is an invariant subspace for $M$, sinceIts orthogonal complement is also invariant: for $w$ orthogonal to both, $u_1^{T}Mw=-(M{u}_1{)}^{T}w=0$ and $v_1^{T}Mw=-(M{v}_1{)}^{T}w=0$. The restriction of the real symmetric matrix $M^2$ to this nonempty complement therefore has a unit eigenvector $u_2$, by the spectral theorem for real symmetric matrices.

If its eigenvalue is $-{\mu }_2^2<0$, the argument in part (b) shows that $v_2=M{u}_2/{\mu }_2$ is a unit eigenvector orthogonal to $u_2$. It also lies in the same complement; explicitly,Repeating the construction decomposes every negative eigenspace into orthogonal pairs. The zero eigenspace has dimension $n-2r$ for some number $r$ of pairs, and therefore has the same parity as $n$. This is the paired eigenspaces of the square of a real skew-symmetric matrix property.

For $n=2m$, there can be $m$ distinct negative eigenvalues and no zero, or at most $m-1$ negative ones plus zero, because a nonempty zero eigenspace has dimension at least two. For $n=2m+1$, there are at most $m$ distinct negative ones plus the mandatory zero. HenceThe bound is attained by skew two-by-two blocks with distinct positive parameters, adding one zero direction when $n$ is odd.