Matrix Norm, Convergence, and Inequality

Questions involving matrix norms, convergence of matrix sequences or powers, bounding matrix expressions, or proving inequalities relating matrix quantities.

grandes-ecoles 2024 Q1 View
Give a necessary and sufficient condition on $R_u$ for $\mathbb{M}_n(u) = \emptyset$ and give an example of $u$ for which this equality holds.
grandes-ecoles 2024 Q11a View
Let $A \in \mathscr{M}_n(\mathbb{C})$. We denote by $\mathbb{C}[A]$ the set of elements of $\mathscr{M}_n(\mathbb{C})$ of the form $P(A)$ where $P \in \mathbb{C}[X]$ is a polynomial. We denote $$(\mathbb{C}[A])^* = \left\{B \in \mathbb{C}[A] \cap \mathrm{GL}_n(\mathbb{C}) \mid B^{-1} \in \mathbb{C}[A]\right\}$$ Show that there exists an open set $U$ of $\mathbb{C}[A]$ containing $0$ and an open set $V$ of $\mathbb{C}[A]$ containing the identity matrix $I_n$ such that the exponential function induces a continuous bijection from $U \subset \mathbb{C}[A]$ to $V$ whose inverse is a continuous function on $V$.
grandes-ecoles 2024 Q11b View
Let $A \in \mathscr{M}_n(\mathbb{C})$. We denote by $\mathbb{C}[A]$ the set of elements of $\mathscr{M}_n(\mathbb{C})$ of the form $P(A)$ where $P \in \mathbb{C}[X]$ is a polynomial. We denote $$(\mathbb{C}[A])^* = \left\{B \in \mathbb{C}[A] \cap \mathrm{GL}_n(\mathbb{C}) \mid B^{-1} \in \mathbb{C}[A]\right\}$$ Using the result of question 11a, deduce that $\exp(\mathbb{C}[A])$ is an open set of $\mathbb{C}[A]$.
grandes-ecoles 2024 Q12 View
Let $A \in \mathscr{M}_n(\mathbb{C})$. We denote by $\mathbb{C}[A]$ the set of elements of $\mathscr{M}_n(\mathbb{C})$ of the form $P(A)$ where $P \in \mathbb{C}[X]$ is a polynomial. We denote $$(\mathbb{C}[A])^* = \left\{B \in \mathbb{C}[A] \cap \mathrm{GL}_n(\mathbb{C}) \mid B^{-1} \in \mathbb{C}[A]\right\}$$ Show that $\exp(\mathbb{C}[A])$ is a closed set of $(\mathbb{C}[A])^*$.
grandes-ecoles 2024 Q11a View
Let $A \in \mathscr{M}_n(\mathbb{C})$. We denote by $\mathbb{C}[A]$ the set of elements of $\mathscr{M}_n(\mathbb{C})$ of the form $P(A)$ where $P \in \mathbb{C}[X]$ is a polynomial. We denote $$(\mathbb{C}[A])^* = \left\{B \in \mathbb{C}[A] \cap \mathrm{GL}_n(\mathbb{C}) \mid B^{-1} \in \mathbb{C}[A]\right\}.$$ Show that there exists an open set $U$ of $\mathbb{C}[A]$ containing $0$ and an open set $V$ of $\mathbb{C}[A]$ containing the identity matrix $I_n$ such that the exponential function induces a continuous bijection from $U \subset \mathbb{C}[A]$ to $V$ whose inverse is a continuous function on $V$.
grandes-ecoles 2024 Q11b View
Let $A \in \mathscr{M}_n(\mathbb{C})$. We denote by $\mathbb{C}[A]$ the set of elements of $\mathscr{M}_n(\mathbb{C})$ of the form $P(A)$ where $P \in \mathbb{C}[X]$ is a polynomial. We denote $$(\mathbb{C}[A])^* = \left\{B \in \mathbb{C}[A] \cap \mathrm{GL}_n(\mathbb{C}) \mid B^{-1} \in \mathbb{C}[A]\right\}.$$ Using the result of question 11a, deduce that $\exp(\mathbb{C}[A])$ is an open set of $\mathbb{C}[A]$.
grandes-ecoles 2024 Q12 View
Let $A \in \mathscr{M}_n(\mathbb{C})$. We denote by $\mathbb{C}[A]$ the set of elements of $\mathscr{M}_n(\mathbb{C})$ of the form $P(A)$ where $P \in \mathbb{C}[X]$ is a polynomial. We denote $$(\mathbb{C}[A])^* = \left\{B \in \mathbb{C}[A] \cap \mathrm{GL}_n(\mathbb{C}) \mid B^{-1} \in \mathbb{C}[A]\right\}.$$ Show that $\exp(\mathbb{C}[A])$ is a closed set of $(\mathbb{C}[A])^*$.
grandes-ecoles 2024 Q2 View
Verify that $(A, B) \mapsto \langle A, B \rangle$ is an inner product on the vector space $\mathscr{M}_{d}(\mathbb{R})$. We denote by $\|A\| = \sqrt{\langle A, A \rangle}$ the associated norm.
grandes-ecoles 2024 Q4 View
Let $D = \operatorname{Diag}(\alpha_{1}, \ldots, \alpha_{d})$ be a diagonal matrix with positive coefficients and let $R \in \mathrm{O}_{d}(\mathbb{R})$.
  • [(a)] Show that for all $1 \leqslant i \leqslant d$, we have $|R_{ii}| \leqslant 1$ where $R_{ii}$ is the $i$-th diagonal coefficient of $R$.
  • [(b)] Deduce that $\langle D, R \rangle \leqslant \operatorname{tr}(D)$.
grandes-ecoles 2024 Q25 View
We consider $R \in \mathrm{O}_{d}(\mathbb{R})$ with $\operatorname{det}(R) = -1$, $D = \operatorname{Diag}(\alpha_{1}, \ldots, \alpha_{d})$ with $\alpha_{i} \geqslant 0$ in decreasing order, $U = (U_{ij})_{1 \leqslant i,j \leqslant d}$, and $S_{dd}$ as defined in question 24.
  • [(a)] Show that $S_{dd} = \sum_{j=1}^{d} \alpha_{j} U_{jd}^{2}$ where $U = (U_{ij})_{1 \leqslant i,j \leqslant d}$.
  • [(b)] Deduce that $\langle D, R \rangle \leqslant \left(\sum_{i=1}^{d-1} \alpha_{i}\right) - \alpha_{d}$.
grandes-ecoles 2025 Q21 View
In this part, we assume that $n$ is a power of 2: we write $n = 2 ^ { k }$ with $k \in \mathbf { N } ^ { \star }$. Deduce that there exists a vector subspace $F$ of dimension $k$ of $\mathbf { R } ^ { n }$ such that: $$\forall x \in F , \quad \alpha _ { 1 } \sqrt { n } \| x \| _ { 2 } ^ { \mathbf { R } ^ { n } } \leq \| x \| _ { 1 } ^ { \mathbf { R } ^ { n } } \leq \beta _ { 1 } \sqrt { n } \| x \| _ { 2 } ^ { \mathbf { R } ^ { n } } .$$ By ordering the $n$ elements of $\{ - 1,1 \} ^ { k }$ arbitrarily, you may use the map $T$ defined on $\mathbf { R } ^ { k }$ by $T \left( a _ { 1 } , \ldots , a _ { k } \right) = \left( \sum _ { i = 1 } ^ { k } a _ { i } \varepsilon _ { i } \right) _ { \left( \varepsilon _ { 1 } , \ldots , \varepsilon _ { k } \right) \in \{ - 1,1 \} ^ { k } }$.
grandes-ecoles 2025 QP2-1 View
Problem 2, Part 1: Adapted norms
We denote by $\mathrm { M } _ { d } ( \mathbb { C } )$ the space of $d \times d$ square matrices with complex coefficients and we identify $\mathbb { C } ^ { d }$ with the space of column vectors of size $d$.
For a vector $x = \left( x _ { 1 } , \ldots , x _ { d } \right) \in \mathbb { C } ^ { d }$, we define $\| x \| _ { \infty } = \max _ { 1 \leqslant i \leqslant d } \left| x _ { i } \right|$ and $\| x \| _ { 1 } = \sum _ { i = 1 } ^ { d } \left| x _ { i } \right|$.
Let $A \in \mathrm { M } _ { d } ( \mathbb { C } )$. Determine a necessary and sufficient condition on $A$ for the map $x \mapsto \| A x \| _ { \infty }$ to define a norm on $\mathbb { C } ^ { d }$.
grandes-ecoles 2025 QP2-2 View
Problem 2, Part 1: Adapted norms
We denote by $\mathrm { M } _ { d } ( \mathbb { C } )$ the space of $d \times d$ square matrices with complex coefficients and we identify $\mathbb { C } ^ { d }$ with the space of column vectors of size $d$.
For a vector $x = \left( x _ { 1 } , \ldots , x _ { d } \right) \in \mathbb { C } ^ { d }$, we define $\| x \| _ { \infty } = \max _ { 1 \leqslant i \leqslant d } \left| x _ { i } \right|$ and $\| x \| _ { 1 } = \sum _ { i = 1 } ^ { d } \left| x _ { i } \right|$.
Given a matrix $A \in \mathrm { M } _ { d } ( \mathbb { C } )$ we define $$\| A \| = \sup _ { \| x \| _ { \infty } \leqslant 1 } \| A x \| _ { \infty } .$$
a. Show that this defines a norm on $\mathrm { M } _ { d } ( \mathbb { C } )$ and that there exists $x _ { 0 } \in \mathbb { C } ^ { d }$ such that $\left\| x _ { 0 } \right\| _ { \infty } = 1$ and $\left\| A x _ { 0 } \right\| _ { \infty } = \| A \|$. b. Show that for all $( A , B ) \in \mathrm { M } _ { d } ( \mathbb { C } )$ we have $\| A B \| \leqslant \| A \| \cdot \| B \|$.
grandes-ecoles 2025 QP2-3 View
Problem 2, Part 1: Adapted norms
We denote by $\mathrm { M } _ { d } ( \mathbb { C } )$ the space of $d \times d$ square matrices with complex coefficients and we identify $\mathbb { C } ^ { d }$ with the space of column vectors of size $d$.
For a vector $x = \left( x _ { 1 } , \ldots , x _ { d } \right) \in \mathbb { C } ^ { d }$, we define $\| x \| _ { \infty } = \max _ { 1 \leqslant i \leqslant d } \left| x _ { i } \right|$ and $\| x \| _ { 1 } = \sum _ { i = 1 } ^ { d } \left| x _ { i } \right|$.
Given a matrix $A \in \mathrm { M } _ { d } ( \mathbb { C } )$ we define $\| A \| = \sup _ { \| x \| _ { \infty } \leqslant 1 } \| A x \| _ { \infty }$. For $1 \leqslant i \leqslant d$ we define $L _ { i } = \left( a _ { i , j } \right) _ { 1 \leqslant j \leqslant d }$ as the $i ^ { \mathrm { th } }$ row vector of $A$. Show that $$\| A \| = \max _ { 1 \leqslant i \leqslant d } \left\| L _ { i } \right\| _ { 1 } .$$
grandes-ecoles 2025 Q4 View
Give a bound for $H_n$ in the case where $J_n$ is moreover an orthogonal matrix distinct from $\pm I_n$.
grandes-ecoles 2025 Q26 View
As in the third part, we assume that $B = A + \mathbf{u u}^T$ with $A \in \mathcal{S}_n(\mathbb{R})$ a symmetric matrix, and $\mathbf{u} \in \mathbb{R}^n$ a vector such that $\|\mathbf{u}\| = 1$. We denote by $\lambda_1 \leqslant \lambda_2 \leqslant \cdots \leqslant \lambda_n$ the eigenvalues of $A$ and $\mu_1 \leqslant \mu_2 \leqslant \cdots \leqslant \mu_n$ those of $B$. We admit that $$\lambda_1 \leqslant \mu_1 \leqslant \lambda_2 \leqslant \mu_2 \leqslant \cdots \leqslant \lambda_n \leqslant \mu_n.$$ We further assume that there exists an integer $m \in \{1,2,\ldots,n-1\}$ such that the eigenvalues of $A$ satisfy $$0 = \lambda_1 = \lambda_2 = \cdots = \lambda_m < \lambda_{m+1} \leqslant \cdots \leqslant \lambda_n.$$ Let $\varepsilon \in ]0, \lambda_{m+1}[$. We suppose that $\left\langle \mathbf{u}, \left(A - \varepsilon \mathbb{I}_n\right)^{-1} \mathbf{u} \right\rangle < -1$. Show that $\operatorname{Tr}\left(\left(B - \varepsilon \mathbb{I}_n\right)^{-1}\right) > \operatorname{Tr}\left(\left(A - \varepsilon \mathbb{I}_n\right)^{-1}\right)$.