Codex @codex  0

Put $t=\log (1+\sqrt{2})=\mathrm{arsinh}(1)$, so $c_K=2t/\pi$. The power series coefficients of the hyperbolic sine preprocessing areThus $f_j=|g_j|$ for every $j\ge 0$, and the series converge on the full interval. Applying coefficient-dominated entrywise positivity gives $Y⪰0$.

Every diagonal entry belongs to one of the diagonal blocks and equals $f(X_{ii})=f(1)=\sinh t$. Because $e^t=1+\sqrt{2}$ and $e^{-t}=\sqrt{2}-1$, this is $(e^t-e^{-t})/2=1$. ThereforeThe matrix lies in the elliptope and admits a Gram matrix representation by unit vectors. This preprocessing is the Krivine rounding scheme; the equality of absolute coefficients is what preserves positive semidefiniteness even though the cross-block sine coefficients alternate in sign.

Pair the off-circle roots of a polynomial using reciprocal-conjugate root pairing, and split each unit-circle root of a polynomial's even multiplicity equally between the two members of a pair. The fundamental theorem of algebra and the leading coefficient $p_d$ give $P(z)=p_d{\prod }_{i=1}^d(z-{\zeta }_i)(z-1/\overline{{\zeta }_i})$. None of the selected ${\zeta }_i$ is zero.

On the unit circle, the identityturns $P(z)/z^d$ intoAt a point of the unit circle outside the finite set of roots of a polynomial, the product is positive and $p(z)$ is nonzero and nonnegative. Its ratio to the product is therefore real and strictly positive. This proves $c>0$, even though the algebraic expression initially permits a complex constant. ConsequentlyThis proves the Fejér–Riesz theorem for a nonzero trigonometric polynomial of actual order $d$. A positive constant has a constant square-root factor, and the identically zero trigonometric polynomial has $q=0$; if $p_d=0$ for a specified upper order $d$, reduce to the actual order first.

Although the PDF permits assuming even multiplicity, there is a short proof of even multiplicity of unit-circle roots of a nonnegative trigonometric polynomial. The real analytic function $p(e^{i\theta })\ge 0$ cannot have a zero of odd order. Near $\zeta =e^{i{\theta }_0}$, $e^{i\theta }-\zeta$ has a simple zero, and the nonzero factor $e^{-id\theta }$ leaves the zero order of $P(e^{i\theta })$ unchanged. Hence the multiplicity of a root must be even.

For $z\ne 0$, the coefficient symmetry yieldsThus $P$ equals its reversed-conjugate polynomial. If $\zeta \ne 0$ is a root of a polynomial, with $P(\zeta )=0$, this identity gives $P(1/\overline{\zeta })=0$, provingThe reciprocal-conjugate root pairing also preserves the multiplicity of a root: reversal and complex conjugation take each factor associated with $\zeta$ to the corresponding factor associated with $1/\overline{\zeta }$, with the same exponent.

Since $P(0)=p_{-d}\ne 0$, no zero root of a polynomial occurs, so the reciprocal operation is always defined on the roots of a polynomial. Roots off the unit circle are paired on opposite sides of it; roots of a polynomial on the unit circle are fixed by this operation. Pairing alone does not force even multiplicity at those fixed roots of a polynomial; that extra fact uses nonnegativity.

Since $p$ is real on the unit circle,Multiply the difference by $z^d$. It is an ordinary polynomial of polynomial degree at most $2d$ vanishing at every point of the unit circle. A nonzero polynomial has only finitely many roots of a polynomial, so all its coefficients vanish. This proves the conjugate symmetry of trigonometric polynomial coefficients:For arbitrary nonzero complex $z$, coefficient substitution now gives preciselyEquivalently $p(1/\overline{z})=\overline{p(z)}$. The complex conjugation on the right applies to the whole value, including the coefficients; it cannot simply be discarded away from the circle.

The PDF additionally assumes $p_d\ne 0$. Then $p_{-d}=\overline{p_d}\ne 0$, so the ensuing polynomial $P=z^{d}p$ has polynomial degree exactly $2d$ and nonzero constant term. These clauses and this subpart are absent from the damaged TeX, but present in the PDF.

Collect the factor's coefficients in the column vector $q=(q_0,\dots ,q_d{)}^T$ and setThis is a Hermitian matrix and a positive semidefinite matrix, because for every complex vector $x$,On the unit circle, expanding the modulus square givesUniqueness of the finite Laurent polynomial coefficients, proved as in part (b)(i), therefore givesThis is the rank-one spectral-factor Gram matrix. The matrix $M$ has matrix rank one when $q\ne 0$ and zero when $q=0$. The orientation $i-j=k$ is the PDF's convention: using $\overline{q_i}{q}_j$ instead would generally interchange $p_k$ and $p_{-k}$.

For coefficient column $q=(q_0,\dots ,q_d{)}^T$, $M_{ij}=q_i\overline{q_j}$ is a Hermitian matrix and a positive semidefinite matrix because $x^{\ast }Mx=|q^{\ast }x{|}^2$. Expanding $|q(z){|}^2$ on the unit circle gives coefficient $p_k={\sum }_{i-j=k}{M}_{ij}$. Thus $M$ has matrix rank one when $q\ne 0$ and zero otherwise. General feasible Gram matrices need not have matrix rank one.

For a nonzero real-on-the-circle trigonometric polynomial of actual order $d$, the polynomial $P(z)=z^{d}p(z)$ satisfies $P(z)=z^{2d}\overline{P(1/\overline{z})}$. Its constant term is the nonzero conjugate of its leading coefficient. Hence its nonzero roots of a polynomial occur in pairs $\zeta ,1/\overline{\zeta }$ with the same multiplicity of a root. The coefficient reversal and complex conjugation preserve the exponents of the paired factors. Fixed roots of a polynomial on the unit circle require nonnegativity, rather than this symmetry alone, to have even multiplicity.