If polynomials with integer monomial coefficients converge uniformly to , their values at zero and one are integers converging to and . A convergent integer sequence is eventually constant: once all its terms lie in an interval of length less than one they must agree. Hence both endpoint values are integers.
Conversely assume those values are integers. The rounded Bernstein polynomial is an integer-coefficient polynomial, because its displayed scalar coefficients are integers and each expands with integer coefficients. Part b gives its vanishing distance from . For completeness, the remaining uniform convergence follows directly from uniform continuity. Let have the binomial distribution with parameters ; then , , and . Splitting into and its complement, and applying Chebyshev's inequality, gives
where is the modulus of continuity. First choose to make the first term small uniformly, then take large. The triangle inequality now gives . We have proved the integer-coefficient polynomial approximation characterization

Articles by others on the same topic (0)

There are currently no matching articles.