Because is continuous on the compact interval , it is uniformly continuous and bounded; write . Given , choose such that
Then
The bound is independent of . Taking the supremum, then , gives a limit superior at most . Since is arbitrary,
This is the Bernstein polynomial proof of the Weierstrass approximation theorem.
Let and be independent. The displayed Bernstein polynomial is
Given , uniform continuity of supplies such that changing both coordinates by less than changes by less than . If , then Chebyshev inequality and
give, uniformly in ,
Thus uniformly.
Each is a polynomial, whose iterated integrals may be interchanged term by term. Uniform convergence permits passage to the limit in both iterated integrals, proving the asserted continuous-function form of Fubini's theorem.
Now suppose every monomial moment of vanishes. By linearity,
for every two-variable polynomial . The just-proved Bernstein approximation gives polynomials uniformly. Therefore
so . Statement (i) is true.
The rounded Bernstein polynomial replaces each coefficient in the unnormalized basis by its floor function. It therefore has integer coefficients in the ordinary monomial basis. If , only interior rounding errors remain and
To prove this, bound each interior rounding error by one. On , sum the resulting powers as a geometric series of ratio at most and maximize ; reflect for . On the middle interval each degree- product is at most . integer endpoints are necessary for this convergence: a noninteger endpoint produces a fixed nonzero rounding error there.
For fixed and , uniform convergence of normalized finite differences to , uniform continuity of , and imply uniformly. Positivity and partition of unity make Bernstein polynomials contractions in the supremum norm. Consequently . The differentiability assumption is essential; continuity alone does not define the target derivative.