# Question: Let f x be a continuous function defined for 0

Let f(x) be a continuous function defined for 0 ≤ x ≤ 1. Consider the functions

(called Bernstein polynomials) and prove that

Let X1, X2, . . . be independent Bernoulli random variables with mean x. Show that

Bn(x) = E[f(X1 + · · · + Xn / n)]

and then use Theoretical Exercise 4.

Since it can be shown that the convergence of Bn(x) to f (x) is uniform in x, the preceding reasoning provides a probabilistic proof of the famous Weierstrass theorem of analysis, which states that any continuous function on a closed interval can be approximated arbitrarily closely by a polynomial.

(called Bernstein polynomials) and prove that

Let X1, X2, . . . be independent Bernoulli random variables with mean x. Show that

Bn(x) = E[f(X1 + · · · + Xn / n)]

and then use Theoretical Exercise 4.

Since it can be shown that the convergence of Bn(x) to f (x) is uniform in x, the preceding reasoning provides a probabilistic proof of the famous Weierstrass theorem of analysis, which states that any continuous function on a closed interval can be approximated arbitrarily closely by a polynomial.

**View Solution:**## Answer to relevant Questions

Delegates from 10 countries, including Russia, France, England, and the United States, are to be seated in a row. How many different seating arrangements are possible if the French and English delegates are to be seated next ...From a set of n people, a committee of size j is to be chosen, and from this committee, a subcommittee of size i, i ≤ j, is also to be chosen. (a) Derive a combinatorial identity by computing, in two ways, the number of ...Customers arrive at a bank at a Poisson rate λ. Suppose that two customers arrived during the first hour. What is the probability that (a) Both arrived during the first 20 minutes? (b) At least one arrived during the first ...In Example 2c we simulated the absolute value of a unit normal by using the rejection procedure on exponential random variables with rate 1. This raises the question of whether we could obtain a more efficient algorithm by ...Let F be the distribution function F(x) = xn 0 < x < 1 (a) Give a method for simulating a random variable having distribution F that uses only a single random number. (b) Let U1, . . . ,Un be independent random numbers. ...Post your question