grandes-ecoles 2012 QI.C.4
Multi-Part Structured Problem Involving Binomial Expansions
We denote by $\mathcal { C }$ the vector space of continuous functions from $[ 0,1 ]$ to $\mathbb { R }$, equipped with the supremum norm $\| f \| _ { \infty } = \sup _ { x \in [ 0,1 ] } | f ( x ) |$. For $f \in \mathcal { C }$ and $n \in \mathbb { N } ^ { * }$, the $n$-th Bernstein polynomial of $f$ is defined by $$B _ { n } ( f ) ( x ) = \sum _ { k = 0 } ^ { n } f \left( \frac { k } { n } \right) \binom { n } { k } x ^ { k } ( 1 - x ) ^ { n - k }$$ for all $x \in [ 0,1 ]$.
Let $f : [ 0,1 ] \rightarrow \mathbb { R }$ be a continuous function, piecewise $C ^ { 1 }$. Deduce from the above that, for all real $r > 0$, there exists a polynomial $P$ with real coefficients such that $\forall x \in [ 0,1 ] , f ( x ) - r \leqslant P ( x ) \leqslant f ( x ) + r$.