Weierstrass Approximation Theorem

Polynomials are dense in the space of continuous functions on a closed interval
Weierstrass Approximation Theorem

Weierstrass Approximation Theorem: Let f:[a,b]Rf:[a,b]\to\mathbb{R} be and let ε>0\varepsilon>0. Then there exists a polynomial pp such that supx[a,b]f(x)p(x)<ε. \sup_{x\in[a,b]} |f(x)-p(x)|<\varepsilon.

This theorem is foundational in approximation theory: continuous functions can be by simple algebraic objects (polynomials). It is also a prototype of many “density” results in functional analysis.

Proof sketch: One standard proof uses Bernstein polynomials on [0,1][0,1]: Bn(f)(x)=k=0nf ⁣(kn)(nk)xk(1x)nk, B_n(f)(x)=\sum_{k=0}^n f\!\left(\frac{k}{n}\right)\binom{n}{k}x^k(1-x)^{n-k}, which are polynomials. of ff and concentration properties of the binomial distribution imply Bn(f)fB_n(f)\to f uniformly. A linear change of variables transfers the result from [0,1][0,1] to [a,b][a,b].