I am trying to solve the following problem. I'm studying for an exam.
Let $A$ be a real $n \times n$ matrix such that $A^2$ is negative definite. Prove that $n$ must be even.
The only hint given is that $A^2$ being negative definite means that $\langle A^2x, x \rangle < 0$ for every $x \in \mathbb{R}^n \backslash \{0\}$. It does not say, but I suppose $A$ must also be symmetric. My attempt at a solution is the following. Let $x$ be an arbitrary eigenvector of $A$ with eigenvalue $\lambda$ (negative definite real matrices are diagonalizable). We have that \begin{equation} \langle A^2x, x \rangle = (AAx)^{\top}x = x^{\top}A^2x = \lambda^2 x^{\top}x = \lambda^2 ||x||^2 < 0. \end{equation} This means that $\lambda^2 < 0$ and thus, every eigenvalue of $A$ must be complex. Hence, $n$ must be even. But we also have \begin{equation} ||Ax||^2 = \langle Ax, Ax \rangle = (Ax)^{\top}Ax = x^{\top}A^2x = \langle A^2x, x \rangle < 0, \end{equation} which makes no sense. Where have I gone wrong? Could it be that in this case negative definite does not entail symmetric? Any help is appreciated.