Not Maths

All Questions
We use the notation $\mathcal{G}$, $\mathcal{H}$, $\gamma_{2\lambda}$, $\tau_x$, $C$, $D$ as defined previously.
(a) Let $n \in \mathbf{N}_*$ and $(x_i)_{1 \leq i \leq n}$ a family of real numbers such that for all $i, j \in \llbracket 1,n \rrbracket$ we have $x_i \neq x_j$ when $i \neq j$. Show that the function $\sum_{i=1}^n \alpha_i \tau_{x_i}(\gamma_{2\lambda})$ is zero if and only if $\alpha_i = 0$ for all $1 \leq i \leq n$ (Hint: One may proceed by induction on $n$).
(b) Deduce that there exists a unique linear map $D$ from $\mathcal{H}$ to $\mathcal{G}$ such that $D \circ C(g) = g$ for all $g \in \mathcal{G}$ and $C \circ D(h) = h$ for all $h \in \mathcal{H}$.
(c) Show that for all $h \in \mathcal{H}$, we have for all $x \in \mathbf{R}$ that $h(x) = \left(\tau_x(\gamma_\lambda) \mid D(h)\right)$.
For all $f \in E$, we set, $$\forall s \in [0,1], \quad T(f)(s) = \int_0^1 k_s(t) f(t)\,\mathrm{d}t$$ where $k_s(t) = \begin{cases} t(1-s) & \text{if } t < s \\ s(1-t) & \text{if } t \geqslant s. \end{cases}$ For all $f \in E$, show that $T(f)$ is of class $\mathcal{C}^2$ then that $T(f)'' = -f$.
We denote by $\mathscr { R }$ the set of totally real numbers and we admit that there exists a function $t : \mathscr { R } \rightarrow \mathbb { Q }$ satisfying the following two properties: (i) for $x , y \in \mathscr { R }$ and $\lambda , \mu \in \mathbb { Q }$, we have $t ( \lambda x + \mu y ) = \lambda t ( x ) + \mu t ( y )$ (ii) for $x$ totally positive, we have $t ( x ) \geqslant 0$ and the equality is strict if $x \neq 0$.
We consider a non-zero totally real number $z$. By definition, there exists a monic polynomial $Z ( X ) \in \mathbb { Q } [ X ]$ that annihilates $z$. We write $Z ( X )$ in the form: $$Z ( X ) = X ^ { d } - \left( a _ { d - 1 } X ^ { d - 1 } + \cdots + a _ { 1 } X + a _ { 0 } \right)$$ with $d \in \mathbb{N} ^ { * }$ and $a _ { i } \in \mathbb { Q }$ for all $i \in \{ 0 , \ldots , d - 1 \}$. We further assume that $Z ( X )$ is chosen so that $d$ is minimal among the degrees of monic polynomials $P ( X ) \in \mathbb{Q} [ X ]$ such that $P ( z ) = 0$. We consider the matrix $S$ of size $d \times d$ whose coefficient $(i, j)$, $1 \leqslant i , j \leqslant d$, equals $t ( z ^ { i + j } )$. For $X , Y \in \mathbb { R } ^ { d }$, we set $B ( X , Y ) = X ^ { T } S Y$.
13a. Show that $B ( X , X ) > 0$ for $X \in \mathbb { Q } ^ { d }$, $X \neq 0$.
13b. Deduce that the matrix $S$ is invertible.
For all $(h_1, h_2) \in \mathcal{H} \times \mathcal{H}$, we denote $(h_1 \mid h_2)_{\mathcal{H}} = c_\lambda \left(D(h_1) \mid D(h_2)\right)$ where $c_\lambda$ is introduced in question (11a).
(a) Verify that $(\mid)_{\mathcal{H}}$ defines an inner product on $\mathcal{H}$.
(b) Show that for all $x \in \mathbf{R}$ and $h \in \mathcal{H}$ we have $h(x) = \left(\tau_x(\gamma_{2\lambda}) \mid h\right)_{\mathcal{H}}$.
(c) Show that for all $h \in \mathcal{H}$ we have $$\|h\|_\infty \leq \|h\|_{\mathcal{H}}$$ where we have set $\|h\|_\infty = \sup_{x \in \mathbf{R}} |h(x)|$ and $\|h\|_{\mathcal{H}} = (h \mid h)_{\mathcal{H}}^{1/2}$.
For all $f \in E$, we set, $$\forall s \in [0,1], \quad T(f)(s) = \int_0^1 k_s(t) f(t)\,\mathrm{d}t$$ Show that $T$ is injective.
We denote by $\mathscr { R }$ the set of totally real numbers and we admit that there exists a function $t : \mathscr { R } \rightarrow \mathbb { Q }$ satisfying the following two properties: (i) for $x , y \in \mathscr { R }$ and $\lambda , \mu \in \mathbb { Q }$, we have $t ( \lambda x + \mu y ) = \lambda t ( x ) + \mu t ( y )$ (ii) for $x$ totally positive, we have $t ( x ) \geqslant 0$ and the equality is strict if $x \neq 0$.
We consider a non-zero totally real number $z$. By definition, there exists a monic polynomial $Z ( X ) \in \mathbb { Q } [ X ]$ that annihilates $z$. We write $Z ( X )$ in the form: $$Z ( X ) = X ^ { d } - \left( a _ { d - 1 } X ^ { d - 1 } + \cdots + a _ { 1 } X + a _ { 0 } \right)$$ with $d \in \mathbb{N} ^ { * }$ and $a _ { i } \in \mathbb { Q }$ for all $i \in \{ 0 , \ldots , d - 1 \}$. We further assume that $Z ( X )$ is chosen so that $d$ is minimal among the degrees of monic polynomials $P ( X ) \in \mathbb{Q} [ X ]$ such that $P ( z ) = 0$. We consider the matrix $S$ of size $d \times d$ whose coefficient $(i, j)$, $1 \leqslant i , j \leqslant d$, equals $t ( z ^ { i + j } )$. For $X , Y \in \mathbb { R } ^ { d }$, we set $B ( X , Y ) = X ^ { T } S Y$.
Show that $B$ is an inner product on $\mathbb { R } ^ { d }$.
We denote by $\mathscr { R }$ the set of totally real numbers and we admit that there exists a function $t : \mathscr { R } \rightarrow \mathbb { Q }$ satisfying the following two properties: (i) for $x , y \in \mathscr { R }$ and $\lambda , \mu \in \mathbb { Q }$, we have $t ( \lambda x + \mu y ) = \lambda t ( x ) + \mu t ( y )$ (ii) for $x$ totally positive, we have $t ( x ) \geqslant 0$ and the equality is strict if $x \neq 0$.
We consider a non-zero totally real number $z$. We write $Z ( X ) = X ^ { d } - \left( a _ { d - 1 } X ^ { d - 1 } + \cdots + a _ { 1 } X + a _ { 0 } \right)$ with $d$ minimal. We consider the matrix $S$ of size $d \times d$ whose coefficient $( i , j )$ equals $t \left( z ^ { i + j } \right)$. For $X , Y \in \mathbb { R } ^ { d }$, we set $B ( X , Y ) = X ^ { T } S Y$.
Show that $B$ is an inner product on $\mathbb { R } ^ { d }$.
We fix two $p$-tuples $(x_i)_{i \in \llbracket 1,p \rrbracket}$ and $(a_i)_{i \in \llbracket 1,p \rrbracket}$ of real numbers. We assume that the $x_i$ are pairwise distinct. We denote $\mathcal{S} = \{h \in \mathcal{H} \mid h(x_i) = a_i\}$ the set of $h \in \mathcal{H}$ that equal $a_i$ at $x_i$ for all $i \in \llbracket 1,p \rrbracket$. We denote $J : \mathcal{H} \rightarrow \mathbf{R}$ defined by $J(h) = \frac{1}{2}\|h\|_{\mathcal{H}}^2$ and $J_* = \inf\{J(h) \mid h \in \mathcal{S}\}$. We denote $\mathcal{S}_* = \{h \in \mathcal{S} \mid J(h) = J_*\}$.
Show that $\mathcal{S}_*$ has at most one element.
For all $f \in E$, we set, $$\forall s \in [0,1], \quad T(f)(s) = \int_0^1 k_s(t) f(t)\,\mathrm{d}t$$ Determine the image of $T$.
We denote by $\mathscr { R }$ the set of totally real numbers and we admit that there exists a function $t : \mathscr { R } \rightarrow \mathbb { Q }$ satisfying the following two properties: (i) for $x , y \in \mathscr { R }$ and $\lambda , \mu \in \mathbb { Q }$, we have $t ( \lambda x + \mu y ) = \lambda t ( x ) + \mu t ( y )$ (ii) for $x$ totally positive, we have $t ( x ) \geqslant 0$ and the equality is strict if $x \neq 0$.
We consider a non-zero totally real number $z$. By definition, there exists a monic polynomial $Z ( X ) \in \mathbb { Q } [ X ]$ that annihilates $z$. We write $Z ( X )$ in the form: $$Z ( X ) = X ^ { d } - \left( a _ { d - 1 } X ^ { d - 1 } + \cdots + a _ { 1 } X + a _ { 0 } \right)$$ with $d \in \mathbb{N} ^ { * }$ and $a _ { i } \in \mathbb { Q }$ for all $i \in \{ 0 , \ldots , d - 1 \}$. We further assume that $Z ( X )$ is chosen so that $d$ is minimal among the degrees of monic polynomials $P ( X ) \in \mathbb{Q} [ X ]$ such that $P ( z ) = 0$. We consider the matrix $S$ of size $d \times d$ whose coefficient $(i, j)$, $1 \leqslant i , j \leqslant d$, equals $t ( z ^ { i + j } )$. For $X , Y \in \mathbb { R } ^ { d }$, we set $B ( X , Y ) = X ^ { T } S Y$.
15a. Show that there exists a basis $(e _ { 1 } , \ldots , e _ { d })$ of $\mathbb { R } ^ { d }$ with $e _ { i } \in \mathbb { Q } ^ { d }$ for all $i$ and $B ( e _ { i } , e _ { j } ) = 0$ for $i \neq j$.
15b. Deduce that there exist $P \in \mathrm { GL } _ { d } ( \mathbb { Q } )$ and $q _ { 1 } , \ldots , q _ { d } \in \mathbb { Q }$, $q _ { i } > 0$, such that: $$S = P ^ { T } \cdot \operatorname { Diag } \left( q _ { 1 } , \ldots , q _ { d } \right) \cdot P$$
We denote by $\mathscr { R }$ the set of totally real numbers and we admit that there exists a function $t : \mathscr { R } \rightarrow \mathbb { Q }$ satisfying the following two properties: (i) for $x , y \in \mathscr { R }$ and $\lambda , \mu \in \mathbb { Q }$, we have $t ( \lambda x + \mu y ) = \lambda t ( x ) + \mu t ( y )$ (ii) for $x$ totally positive, we have $t ( x ) \geqslant 0$ and the equality is strict if $x \neq 0$.
We consider a non-zero totally real number $z$. We write $Z ( X ) = X ^ { d } - \left( a _ { d - 1 } X ^ { d - 1 } + \cdots + a _ { 1 } X + a _ { 0 } \right)$ with $d$ minimal. We consider the matrix $S$ of size $d \times d$ whose coefficient $( i , j )$ equals $t \left( z ^ { i + j } \right)$. For $X , Y \in \mathbb { R } ^ { d }$, we set $B ( X , Y ) = X ^ { T } S Y$.
15a. Show that there exists a basis $\left( e _ { 1 } , \ldots , e _ { d } \right)$ of $\mathbb { R } ^ { d }$ with $e _ { i } \in \mathbb { Q } ^ { d }$ for all $i$ and $B \left( e _ { i } , e _ { j } \right) = 0$ for $i \neq j$.
15b. Deduce that there exist $P \in \mathrm { GL } _ { d } ( \mathbb { Q } )$ and $q _ { 1 } , \ldots , q _ { d } \in \mathbb { Q } , q _ { i } > 0$, such that: $$S = P ^ { T } \cdot \operatorname { Diag } \left( q _ { 1 } , \ldots , q _ { d } \right) \cdot P$$
We fix two $p$-tuples $(x_i)_{i \in \llbracket 1,p \rrbracket}$ and $(a_i)_{i \in \llbracket 1,p \rrbracket}$ of real numbers with the $x_i$ pairwise distinct. We use the notation $\mathcal{S}$, $J$, $J_*$, $\mathcal{S}_*$, $(\mid)_{\mathcal{H}}$ as defined previously.
Let $\mathcal{H}_0 = \{h \in \mathcal{H} \mid h(x_i) = 0\ \forall i \in \llbracket 1,p \rrbracket\}$ and $\tilde{h} \in \mathcal{S}_*$ (we assume here $\mathcal{S}_*$ non-empty).
Show that $\left(\tilde{h} \mid h_0\right)_{\mathcal{H}} = 0$ for all $h_0 \in \mathcal{H}_0$.
For all $f \in E$, we set, $$\forall s \in [0,1], \quad T(f)(s) = \int_0^1 k_s(t) f(t)\,\mathrm{d}t$$ Let $\lambda \in \mathbb{R}$ be a nonzero eigenvalue of $T$ and $f$ be an associated eigenvector. Show that $f$ is a solution of the differential equation $\lambda f'' = -f$.
We denote by $\mathscr { R }$ the set of totally real numbers and we admit that there exists a function $t : \mathscr { R } \rightarrow \mathbb { Q }$ satisfying the following two properties: (i) for $x , y \in \mathscr { R }$ and $\lambda , \mu \in \mathbb { Q }$, we have $t ( \lambda x + \mu y ) = \lambda t ( x ) + \mu t ( y )$ (ii) for $x$ totally positive, we have $t ( x ) \geqslant 0$ and the equality is strict if $x \neq 0$.
We consider a non-zero totally real number $z$. By definition, there exists a monic polynomial $Z ( X ) \in \mathbb { Q } [ X ]$ that annihilates $z$. We write $Z ( X )$ in the form: $$Z ( X ) = X ^ { d } - \left( a _ { d - 1 } X ^ { d - 1 } + \cdots + a _ { 1 } X + a _ { 0 } \right)$$ with $d \in \mathbb{N} ^ { * }$ and $a _ { i } \in \mathbb { Q }$ for all $i \in \{ 0 , \ldots , d - 1 \}$. We further assume that $Z ( X )$ is chosen so that $d$ is minimal among the degrees of monic polynomials $P ( X ) \in \mathbb{Q} [ X ]$ such that $P ( z ) = 0$.
We set: $$M = \left( \begin{array} { c c c c c } 0 & 0 & \cdots & 0 & a _ { 0 } \\ 1 & 0 & \ddots & 0 & a _ { 1 } \\ 0 & \ddots & \ddots & \vdots & \vdots \\ \vdots & \ddots & \ddots & 0 & a _ { d - 2 } \\ 0 & \cdots & 0 & 1 & a _ { d - 1 } \end{array} \right)$$
Compute the characteristic polynomial of $M$.
We consider a non-zero totally real number $z$. We write $Z ( X ) = X ^ { d } - \left( a _ { d - 1 } X ^ { d - 1 } + \cdots + a _ { 1 } X + a _ { 0 } \right)$ with $d$ minimal and $a_i \in \mathbb{Q}$. We set: $$M = \left( \begin{array} { c c c c c } 0 & 0 & \cdots & 0 & a _ { 0 } \\ 1 & 0 & \ddots & 0 & a _ { 1 } \\ 0 & \ddots & \ddots & \vdots & \vdots \\ \vdots & \ddots & \ddots & 0 & a _ { d - 2 } \\ 0 & \cdots & 0 & 1 & a _ { d - 1 } \end{array} \right)$$ Compute the characteristic polynomial of $M$.
We fix two $p$-tuples $(x_i)_{i \in \llbracket 1,p \rrbracket}$ and $(a_i)_{i \in \llbracket 1,p \rrbracket}$ of real numbers with the $x_i$ pairwise distinct. We use the notation $\mathcal{S}$, $\mathcal{S}_*$, $\mathcal{H}_0$, $(\mid)_{\mathcal{H}}$, $\gamma_{2\lambda}$, $\tau_x$ as defined previously. We denote $\mathcal{H}_0^\perp = \{h \in \mathcal{H} \mid \forall h_0 \in \mathcal{H}_0\ (h \mid h_0)_{\mathcal{H}} = 0\}$ the orthogonal subspace to $\mathcal{H}_0$ in $\mathcal{H}$.
(a) Show that $\mathcal{S}_* = \mathcal{S} \cap \mathcal{H}_0^\perp$.
(b) Show that $\mathcal{H}_0^\perp$ contains the vector subspace of $\mathcal{H}$ spanned by the functions $\tau_{x_i}(\gamma_{2\lambda})$ for $i \in \llbracket 1,p \rrbracket$.
For all $f \in E$, we set, $$\forall s \in [0,1], \quad T(f)(s) = \int_0^1 k_s(t) f(t)\,\mathrm{d}t$$ Determine the eigenvalues of $T$ and show that the associated eigenspaces are one-dimensional.
Let $X$ be a real and discrete random variable and $m \in \mathbb { R }$. For $T \in \mathbb { R } _ { + } ^ { * }$, we set $V _ { m } ( T ) = \frac { 1 } { 2 T } \int _ { - T } ^ { T } \phi _ { X } ( t ) \mathrm { e } ^ { - \mathrm { i } m t } \mathrm {~d} t$. We assume that $X ( \Omega )$ is finite and we use the notations of question 1: $X ( \Omega ) = \left\{ x _ { 1 } , \ldots , x _ { r } \right\}$ with $a _ { k } = \mathbb { P } \left( X = x _ { k } \right)$. Using the result of Q15, deduce that $V _ { m } ( T ) \xrightarrow [ T \rightarrow + \infty ] { } \mathbb { P } ( X = m )$.
We denote by $\mathscr { R }$ the set of totally real numbers and we admit that there exists a function $t : \mathscr { R } \rightarrow \mathbb { Q }$ satisfying the following two properties: (i) for $x , y \in \mathscr { R }$ and $\lambda , \mu \in \mathbb { Q }$, we have $t ( \lambda x + \mu y ) = \lambda t ( x ) + \mu t ( y )$ (ii) for $x$ totally positive, we have $t ( x ) \geqslant 0$ and the equality is strict if $x \neq 0$.
We consider a non-zero totally real number $z$. By definition, there exists a monic polynomial $Z ( X ) \in \mathbb { Q } [ X ]$ that annihilates $z$. We write $Z ( X )$ in the form: $$Z ( X ) = X ^ { d } - \left( a _ { d - 1 } X ^ { d - 1 } + \cdots + a _ { 1 } X + a _ { 0 } \right)$$ with $d \in \mathbb{N} ^ { * }$ and $a _ { i } \in \mathbb { Q }$ for all $i \in \{ 0 , \ldots , d - 1 \}$. We further assume that $Z ( X )$ is chosen so that $d$ is minimal among the degrees of monic polynomials $P ( X ) \in \mathbb{Q} [ X ]$ such that $P ( z ) = 0$. We consider the matrix $S$ of size $d \times d$ whose coefficient $(i, j)$, $1 \leqslant i , j \leqslant d$, equals $t ( z ^ { i + j } )$. For $X , Y \in \mathbb { R } ^ { d }$, we set $B ( X , Y ) = X ^ { T } S Y$.
We set: $$M = \left( \begin{array} { c c c c c } 0 & 0 & \cdots & 0 & a _ { 0 } \\ 1 & 0 & \ddots & 0 & a _ { 1 } \\ 0 & \ddots & \ddots & \vdots & \vdots \\ \vdots & \ddots & \ddots & 0 & a _ { d - 2 } \\ 0 & \cdots & 0 & 1 & a _ { d - 1 } \end{array} \right)$$
There exist $P \in \mathrm { GL } _ { d } ( \mathbb { Q } )$ and $q _ { 1 } , \ldots , q _ { d } \in \mathbb { Q }$, $q _ { i } > 0$, such that $S = P ^ { T } \cdot \operatorname { Diag } \left( q _ { 1 } , \ldots , q _ { d } \right) \cdot P$.
17a. Verify that the matrix $S M$ is symmetric.
17b. Deduce that the matrix $R M R ^ { - 1 }$ is symmetric where $R = \operatorname { Diag } \left( \sqrt { q _ { 1 } } , \ldots , \sqrt { q _ { d } } \right) \cdot P$.
We consider a non-zero totally real number $z$. We write $Z ( X ) = X ^ { d } - \left( a _ { d - 1 } X ^ { d - 1 } + \cdots + a _ { 1 } X + a _ { 0 } \right)$ with $d$ minimal and $a_i \in \mathbb{Q}$. We consider the matrix $S$ of size $d \times d$ whose coefficient $( i , j )$ equals $t \left( z ^ { i + j } \right)$, and $P \in \mathrm{GL}_d(\mathbb{Q})$, $q_1, \ldots, q_d \in \mathbb{Q}$, $q_i > 0$ such that $S = P^T \cdot \operatorname{Diag}(q_1, \ldots, q_d) \cdot P$. We set: $$M = \left( \begin{array} { c c c c c } 0 & 0 & \cdots & 0 & a _ { 0 } \\ 1 & 0 & \ddots & 0 & a _ { 1 } \\ 0 & \ddots & \ddots & \vdots & \vdots \\ \vdots & \ddots & \ddots & 0 & a _ { d - 2 } \\ 0 & \cdots & 0 & 1 & a _ { d - 1 } \end{array} \right)$$
17a. Verify that the matrix $S M$ is symmetric.
17b. Deduce that the matrix $R M R ^ { - 1 }$ is symmetric where $R = \operatorname { Diag } \left( \sqrt { q _ { 1 } } , \ldots , \sqrt { q _ { d } } \right) \cdot P$.
We fix two $p$-tuples $(x_i)_{i \in \llbracket 1,p \rrbracket}$ and $(a_i)_{i \in \llbracket 1,p \rrbracket}$ of real numbers with the $x_i$ pairwise distinct. Let $\alpha \in \mathbf{R}^p$ (resp. $a \in \mathbf{R}^p$) be the vector with coordinates $(\alpha_i)_{i \in \llbracket 1,p \rrbracket}$ (resp. $(a_i)_{i \in \llbracket 1,p \rrbracket}$) and $h_\alpha = \sum_{i=1}^p \alpha_i \tau_{x_i}(\gamma_{2\lambda})$. The matrix $K$ is defined by $K_{ij} = \exp\left(-\frac{|x_i - x_j|^2}{2\lambda}\right)$ (here in the case $d=1$).
(a) Show that $h_\alpha$ is an interpolant if and only if $K\alpha = a$ where $K$ is the matrix introduced in question (6) (here in the case $d = 1$).
(b) Show that $K$ is invertible.
For all $k \in \mathbb{N}^*$, we set $g_k(x) = \sqrt{2}\sin(k\pi x)$. We denote by $G = \operatorname{Vect}\left((g_k)_{k \in \mathbb{N}^*}\right)$ and $H = G^\perp$. Justify that, for all $(f,g) \in E^2$, we have $$\langle T(f), g \rangle = \langle f, T(g) \rangle$$ One may use question 12.
We denote by $\mathscr { R }$ the set of totally real numbers and we admit that there exists a function $t : \mathscr { R } \rightarrow \mathbb { Q }$ satisfying the following two properties: (i) for $x , y \in \mathscr { R }$ and $\lambda , \mu \in \mathbb { Q }$, we have $t ( \lambda x + \mu y ) = \lambda t ( x ) + \mu t ( y )$ (ii) for $x$ totally positive, we have $t ( x ) \geqslant 0$ and the equality is strict if $x \neq 0$.
We consider a non-zero totally real number $z$. By definition, there exists a monic polynomial $Z ( X ) \in \mathbb { Q } [ X ]$ that annihilates $z$. We write $Z ( X )$ in the form: $$Z ( X ) = X ^ { d } - \left( a _ { d - 1 } X ^ { d - 1 } + \cdots + a _ { 1 } X + a _ { 0 } \right)$$ with $d \in \mathbb{N} ^ { * }$ and $a _ { i } \in \mathbb { Q }$ for all $i \in \{ 0 , \ldots , d - 1 \}$. We further assume that $Z ( X )$ is chosen so that $d$ is minimal among the degrees of monic polynomials $P ( X ) \in \mathbb{Q} [ X ]$ such that $P ( z ) = 0$.
Construct a symmetric matrix with rational coefficients for which $z$ is an eigenvalue.
We consider a non-zero totally real number $z$. We write $Z ( X ) = X ^ { d } - \left( a _ { d - 1 } X ^ { d - 1 } + \cdots + a _ { 1 } X + a _ { 0 } \right)$ with $d$ minimal and $a_i \in \mathbb{Q}$. We consider the matrix $S$ of size $d \times d$ whose coefficient $( i , j )$ equals $t \left( z ^ { i + j } \right)$, and $P \in \mathrm{GL}_d(\mathbb{Q})$, $q_1, \ldots, q_d \in \mathbb{Q}$, $q_i > 0$ such that $S = P^T \cdot \operatorname{Diag}(q_1, \ldots, q_d) \cdot P$. We set $R = \operatorname{Diag}\left(\sqrt{q_1}, \ldots, \sqrt{q_d}\right) \cdot P$ and $M$ the companion matrix of $Z(X)$.
Construct a symmetric matrix with rational coefficients for which $z$ is an eigenvalue.
We fix two $p$-tuples $(x_i)_{i \in \llbracket 1,p \rrbracket}$ and $(a_i)_{i \in \llbracket 1,p \rrbracket}$ of real numbers with the $x_i$ pairwise distinct. We use the notation $\alpha_*$, $h_\alpha$, $K$, $a$, $\mathcal{S}_*$, $J_*$, $(\mid)_{\mathcal{H}}$ as defined previously.
Deduce that there exists $\alpha_* \in \mathbf{R}^p$ such that $\mathcal{S}_* = \{h_{\alpha_*}\}$ and calculate the value of $J_*$ in terms of $K$ and $a$.