 Solution

First address the positivity request in part (a), which has no separate Solution heading in the stub. For $x\in [0,1]$, each $x^k(1-x{)}^{n-k}$ and each coefficient $c_k$ is nonnegative. Their sum is therefore nonnegative, including at the endpoints:This is the elementary direction of the positive Bernstein coefficients for a strictly positive polynomial criterion; the converse developed later needs strict positivity.

For completeness, the convergence fact listed as (i) also has a short proof. If $K\sim \mathrm{Bin}(n,x)$, the Bernstein polynomial is $B_n(f)(x)=\mathbb{E}[f(K/n)]$. Its mean argument is $x$ and $\mathrm{Var}(K/n)=x(1-x)/n\le 1/(4n)$. Given $ϵ>0$, uniform continuity of $f$ on the compact interval supplies $\delta >0$ such that $|f(s)-f(t)|<ϵ$ whenever $|s-t|\le \delta$. By Chebyshev's inequality, uniformly in $x$,Letting $n\to \infty$ and then $ϵ\downarrow 0$ proves $\boxed{\Vert B_n(f)-f{\Vert }_{\infty }\to 0}$. The two numbered items in the source are assumptions supplied for later parts, not additional exam questions; their stub sections contain these supporting derivations.