grandes-ecoles 2011 QI.B.1

grandes-ecoles · France · centrale-maths2__mp Invariant lines and eigenvalues and vectors Eigenvalue constraints from matrix properties
For $n \in \mathbb{N}^*$, $A \in \mathcal{S}_n(\mathbb{R})$ and $i \in \llbracket 1; n \rrbracket$, we denote by $A^{(i)}$ the square matrix of order $i$ extracted from $A$, consisting of the first $i$ rows and the first $i$ columns of $A$.
Let $A \in \mathcal{S}_n(\mathbb{R})$. We assume that $A$ is positive definite.
For all $i \in \llbracket 1; n \rrbracket$, show that the matrix $A^{(i)}$ is positive definite and deduce that $\operatorname{det}\left(A^{(i)}\right) > 0$.
For $n \in \mathbb{N}^*$, $A \in \mathcal{S}_n(\mathbb{R})$ and $i \in \llbracket 1; n \rrbracket$, we denote by $A^{(i)}$ the square matrix of order $i$ extracted from $A$, consisting of the first $i$ rows and the first $i$ columns of $A$.

Let $A \in \mathcal{S}_n(\mathbb{R})$. We assume that $A$ is positive definite.

For all $i \in \llbracket 1; n \rrbracket$, show that the matrix $A^{(i)}$ is positive definite and deduce that $\operatorname{det}\left(A^{(i)}\right) > 0$.