For , define its Bernstein polynomialIf , thenLet . By uniform continuity, for any choose such that whenever . Splitting the expectation according to that event and using Chebyshev's inequality gives, uniformly in ,For sufficiently large this is below . Thus uniformly on . An affine change of variable treats every compact interval, proving the Weierstrass approximation theorem.
True. For each , the Weierstrass approximation theorem gives a polynomial such thatFor each fixed , this estimate applies once , so pointwise.
False. Take the bounded nonconstant continuous function . If polynomials converged uniformly to on , then each sufficiently late would be bounded on and hence constant. A uniform limit of constants is constant, a contradiction. More generally, the globally uniform limit of real polynomials is itself a polynomial.
False. The bounded continuous function on has no limit at zero. If polynomials converged uniformly to it there, they would be uniformly Cauchy on and hence on by continuity at zero. Their uniform limit on would continuously extend to zero, which is impossible.
True. First choose polynomials uniformly by the Weierstrass approximation theorem. Let be the Lagrange interpolation polynomials for the nodes , so . SetThen for every , while
True. By the Weierstrass approximation theorem, choose polynomials with uniformly. Define by integrating exactly times and choose the integration constants so thatThen , and repeated use of the fundamental theorem of calculus givesEvery derivative therefore converges uniformly as required.
Articles by others on the same topic
There are currently no matching articles.