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\}$$ For $a \in \mathbb{R}$, we define the application $$\begin{array}{ccc} Z_a : [0,1] & \longrightarrow & \mathbb{C} \\ t & \longmapsto & t + iat(1-t) \end{array}$$ Show that the application $$\begin{array}{rcc} ]0,1[ \times \mathbb{R} & \longrightarrow & \mathbb{C} \\ (t,a) & \longmapsto & Z_a(t) \end{array}$$ is injective.

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\}.$$ For $a \in \mathbb{R}$, we define the application $$\begin{array}{ccc} Z_a : [0,1] & \longrightarrow & \mathbb{C} \\ t & \longmapsto & t + iat(1-t). \end{array}$$ Show that the application $$\begin{array}{clc} ]0,1[ \times \mathbb{R} & \longrightarrow & \mathbb{C} \\ (t,a) & \longmapsto & Z_a(t) \end{array}$$ is injective.

We consider $n$ a strictly positive integer and $\mathscr{E}_{d}^{n}(\mathbb{R}) = \{ \boldsymbol{z} = (\boldsymbol{z}_{i})_{1 \leqslant i \leqslant n} \mid \boldsymbol{z}_{i} \in \mathbb{R}^{d}, 1 \leqslant i \leqslant n \}$ equipped with the norm $\|\boldsymbol{z}\| = \sqrt{\sum_{i=1}^{n} |\boldsymbol{z}_{i}|^{2}}$. For all $\boldsymbol{x}, \boldsymbol{y} \in \mathscr{E}_{d}^{n}(\mathbb{R})$, we denote $\delta(\boldsymbol{x}, \boldsymbol{y}) = \inf\{ \|\boldsymbol{y} - g \cdot \boldsymbol{x}\| \mid g \in \operatorname{Dep}(\mathbb{R}^{d}) \}$.

• [(a)] Show that for all $\boldsymbol{x}, \boldsymbol{y} \in \mathscr{E}_{d}^{n}(\mathbb{R})$ and all $g \in \operatorname{Dep}(\mathbb{R}^{d})$, we have $$\|g \cdot \boldsymbol{y} - g \cdot \boldsymbol{x}\| = \|\boldsymbol{y} - \boldsymbol{x}\|.$$
• [(b)] Deduce that $\delta(\boldsymbol{x}, \boldsymbol{y}) = \delta(\boldsymbol{y}, \boldsymbol{x})$.
• [(c)] Show that for all $(\boldsymbol{x}, \boldsymbol{y}, \boldsymbol{z}) \in \mathscr{E}_{d}^{n}(\mathbb{R})^{3}$ and $(g, g^{\prime}) \in (\operatorname{Dep}(\mathbb{R}^{d}))^{2}$, we have $$\|\boldsymbol{z} - g \cdot \boldsymbol{x}\| \leqslant \|\boldsymbol{z} - (gg^{\prime}) \cdot \boldsymbol{y}\| + \|g^{\prime} \cdot \boldsymbol{y} - \boldsymbol{x}\|$$
• [(d)] Deduce that $\delta(\boldsymbol{x}, \boldsymbol{z}) \leqslant \delta(\boldsymbol{x}, \boldsymbol{y}) + \delta(\boldsymbol{y}, \boldsymbol{z})$.

In this subsection, we assume that $J_n = J_n^{(\mathrm{C})}$, the matrix introduced in subsection A-II.
We set $G_h : x \longmapsto \frac{(x-h)^2}{2\beta} - \ln(2\operatorname{ch}(x))$. We now assume that $h > 0$.
We set $\gamma_h = G_h''(u_h)$ and we denote $f_h : x \longmapsto \frac{\widehat{G}_h(x)}{x^2}$. Show that $f_h$ can be extended to a continuous function on all of $\mathbb{R}$ by setting $f_h(0) = \frac{\gamma_h}{2}$.

In this subsection, we assume that $J_n = J_n^{(\mathrm{C})}$, the matrix introduced in subsection A-II.
We set $G_h : x \longmapsto \frac{(x-h)^2}{2\beta} - \ln(2\operatorname{ch}(x))$.
Show that $G_0'$ establishes a continuous bijection from $[u_0; +\infty[$ to $\mathbb{R}_+$. Deduce that the function $u : h \longmapsto u_h$ is continuous on $\mathbb{R}_+$ and differentiable on $\mathbb{R}_+^*$.

In this subsection, we still assume that $J_n = J_n^{(\mathrm{C})}$. Moreover, we assume that $\beta = 1$ and $h = 0$.
We are given $x \in \mathbb{R}$ and $\varepsilon > 0$. Let $k$ be a non-zero natural integer such that $k \geqslant \frac{2}{\varepsilon Z_\infty}$. We define the function $$f_k : u \in \mathbb{R} \longmapsto \begin{cases} 1 & \text{if } u \leqslant x \\ 1 - k(u-x) & \text{if } x < u \leqslant x + \frac{1}{k} \\ 0 & \text{otherwise} \end{cases}$$
Show that $f_k$ is $k$-Lipschitz on $\mathbb{R}$.

Let $\mathcal{F}_n$ be the $\mathbb{R}$-vector space of functions $f : \mathbb{R}^n \rightarrow \mathbb{R}$. For all $X \subset \mathbb{R}^n$, we denote $\mathbb{1}_X$ the indicator function of $X$. Let $\mathcal{U}_n$ be the vector subspace of $\mathcal{F}_n$ generated by the functions $\mathbb{1}_P$ where $P$ is a polytope of $\mathbb{R}^n$.
Let $f \in \mathcal{U}_1$. Prove that for all $x \in \mathbb{R}$ the limit of $f(y)$ as $y$ tends to $x$ while satisfying $y > x$, denoted $\lim_{y \rightarrow x^+} f(y)$, exists and that there exist finitely many reals $x \in \mathbb{R}$ such that $f(x) \neq \lim_{y \rightarrow x^+} f(y)$.

Let $\mathcal{F}_n$ be the $\mathbb{R}$-vector space of functions $f : \mathbb{R}^n \rightarrow \mathbb{R}$. For all $X \subset \mathbb{R}^n$, we denote $\mathbb{1}_X$ the indicator function of $X$. Let $\mathcal{U}_n$ be the vector subspace of $\mathcal{F}_n$ generated by the functions $\mathbb{1}_P$ where $P$ is a polytope of $\mathbb{R}^n$.
Prove that the following definition allows us to define a linear form $\chi_n : \mathcal{U}_n \rightarrow \mathbb{R}$. We define $\chi_1(f)$ by the sum $\chi_1(f) = \sum_{x \in \mathbb{R}} \left(f(x) - \lim_{y \rightarrow x^+} f(y)\right)$, then for $f \in \mathcal{U}_n$ with $n > 1$, we set $$\chi_n(f) = \chi_1(g) \text{ with } g \text{ defined by } g(z) = \chi_{n-1}(f_z) \text{ for } z \in \mathbb{R}.$$ We will show at the same time the formula $\chi_n(\mathbb{1}_P) = 1$ for every polytope $P$ of $\mathbb{R}^n$ and we will justify that $\chi_n$ is independent of the coordinate system, namely that for every invertible linear map $A : \mathbb{R}^n \rightarrow \mathbb{R}^n$ we have $\chi_n(f \circ A) = \chi_n(f)$ for all $f \in \mathcal{U}_n$.

Let $n \geq 1$ be an integer. We denote by $\mathbb{C}[[\mathbb{Z}^n]]$ the $\mathbb{C}$-vector space of functions $f : \mathbb{Z}^n \rightarrow \mathbb{C}$, $\mathcal{R}$ the $\mathbb{C}$-vector space of rational elements, $\mathcal{T}$ the $\mathbb{C}$-vector space of torsion elements, and $\mathbb{C}(\mathbb{Z}^n)$ the field of fractions of $\mathbb{C}[\mathbb{Z}^n]$.
We define a $\mathbb{C}$-linear map $\mathrm{I} : \mathcal{R} \rightarrow \mathbb{C}(\mathbb{Z}^n)$ as follows. If $f \in \mathcal{R}$ satisfies $Qf = P$ with $P, Q \in \mathbb{C}[\mathbb{Z}^n]$, we set $\mathrm{I}(f) = \frac{P}{Q}$. Show that $\mathrm{I}$ is well defined, and that it is a linear map with kernel $\mathcal{T}$ satisfying $\mathrm{I}(Pf) = P\,\mathrm{I}(f)$ for all $f \in \mathcal{R}$ and $P \in \mathbb{C}[\mathbb{Z}^n]$.

We consider a convex function $f \in \mathcal{C}(\mathbb{R})$, admitting a minimizer $x_* \in \mathbb{R}$, and $\tau > 0$. The sequence $(x_n)_{n \in \mathbb{N}}$ is defined by $x_{n+1} := p_f(x_n)$. Show that $\left|p_f(x) - p_f(y)\right| \leq |x-y|$ for all $x, y \in \mathbb{R}$. Deduce that the sequence $\left(\left|x_n - x_*\right|\right)_{n \in \mathbb{N}}$ is decreasing.