Symmetrix matrix $A\in\mathbb{R}^{n,n}$ is negatively defined. Then:
a. $\det_n(A)<0$
b. $a_{i,i} < 0$ for $i=1,2...,n$
c. matrix $A^2$ is positively defined.
a. it is not true, using fact about negative definition, for even $n=2k$ we have that $(-1)^{n}\det_{n}(A)>0\Leftrightarrow \det_n(A) >0$
b. I have no clue.
c. is not true,
$A= \left[ \begin{array}{ccc}
-2 & 1 \\
1 & -2 \end{array} \right]$
$\det_1(A) = -2$
$\det_2(A) = 3$
Am I ok ? What about corectness of a, c ? How to solve b ?
Edit - solution for b
We assume by contradiction: $a_{j,j} \ge 0$. Then I replace $j-th$ row with first row and $j-th$ column with first. Then $a_{1,1} \ge 0$. By these operations (replacing rows and column) don't change neither determinant nor minor, hence definition of change should be still negative. However, $\det A_{1} \ge 0$ so matrix can't be negatively defined. Contradiction.