
related topics 
{math, number, function} 
{work, book, publish} 
{@card@, make, design} 

In mathematical analysis, the Weierstrass approximation theorem states that every continuous function defined on an interval [a,b] can be uniformly approximated as closely as desired by a polynomial function. Because polynomials are among the simplest functions, and because computers can directly evaluate polynomials, this theorem has both practical and theoretical relevance, especially in polynomial interpolation. The original version of this result was established by Karl Weierstrass in 1885.
Marshall H. Stone considerably generalized the theorem (Stone 1937) and simplified the proof (Stone 1948). His result is known as the Stone–Weierstrass theorem. The Stone–Weierstrass theorem generalizes the Weierstrass approximation theorem in two directions: instead of the real interval [a,b], an arbitrary compact Hausdorff space X is considered, and instead of the algebra of polynomial functions, approximation with elements from more general subalgebras of C(X) is investigated. The Stone–Weierstrass theorem is a vital result in the study of the algebra of continuous functions on a compact Hausdorff space.
Further, there is a generalization of the Stone–Weierstrass theorem to noncompact Tychonoff spaces, namely, any continuous function on a Tychonoff space is approximated uniformly on compact sets by algebras of the type appearing in the Stone–Weierstrass theorem and described below.
Contents
Weierstrass approximation theorem
The statement of the approximation theorem as originally discovered by Weierstrass is as follows:
A constructive proof of this theorem (for ƒ realvalued) using Bernstein polynomials is outlined on that page.
Full article ▸


related documents 
Yoneda lemma 
Positivedefinite matrix 
Morphism 
Boolean algebra (structure) 
Finite difference 
Hypercomplex number 
Cauchy's integral formula 
Liouville number 
Even and odd permutations 
Power set 
Integer factorization 
Antiderivative 
Solvable group 
Line integral 
Blackboard bold 
Topology 
Julia set 
Expander graph 
Heapsort 
LL parser 
Algebraically closed field 
Maxflow mincut theorem 
Polytope 
Gamma function 
Stokes' theorem 
Separation axiom 
Parameter 
Supervised learning 
Tychonoff space 
Associative array 
