# .

# Stone–Weierstrass theorem

In mathematical analysis, the Weierstrass approximation theorem states that every continuous function defined on a closed 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 using the Weierstrass transform.

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.

A different generalization of Weierstrass' original theorem is Mergelyan's theorem, which generalizes it to functions defined on certain subsets of the complex plane.

Weierstrass approximation theorem

The statement of the approximation theorem as originally discovered by Weierstrass is as follows:

- Suppose
*ƒ*is a continuous complex-valued function defined on the real interval [*a*,*b*]. For every*ε*> 0, there exists a polynomial function*p*over**C**such that for all*x*in [*a*,*b*], we have |*ƒ*(*x*) −*p*(*x*) | <*ε*, or equivalently, the supremum norm ||*ƒ*−*p*|| <*ε*. If*ƒ*is real-valued, the polynomial function can be taken over**R**.

A constructive proof of this theorem (for *ƒ* real-valued) using Bernstein polynomials is outlined on that page.

Applications

As a consequence of the Weierstrass approximation theorem, one can show that the space *C*[*a*,*b*] is separable: the polynomial functions are dense, and each polynomial function can be uniformly approximated by one with rational coefficients; there are only countably many polynomials with rational coefficients. Since *C*[*a*,*b*] is Hausdorff and separable it follows that *C*[*a*,*b*] has cardinality equal to 2^{ℵ0} — the same cardinality as the cardinality of the reals.

Stone–Weierstrass theorem, real version

The set *C*[*a*,*b*] of continuous real-valued functions on [*a*,*b*], together with the supremum norm ||*f*|| = sup_{x∈[a,b]} |*f*(*x*)|, is a Banach algebra, (i.e. an associative algebra and a Banach space such that ||*fg*|| ≤ ||*f*||·||*g*|| for all *f*, *g*). The set of all polynomial functions forms a subalgebra of *C*[*a*,*b*] (i.e. a vector subspace of *C*[*a*,*b*] that is closed under multiplication of functions), and the content of the Weierstrass approximation theorem is that this subalgebra is dense in *C*[*a*,*b*].

Stone starts with an arbitrary compact Hausdorff space *X* and considers the algebra *C*(*X*,**R**) of real-valued continuous functions on *X*, with the topology of uniform convergence. He wants to find subalgebras of *C*(*X*,**R**) which are dense. It turns out that the crucial property that a subalgebra must satisfy is that it *separates points*: a set *A* of functions defined on *X* is said to separate points if, for every two different points *x* and *y* in *X* there exists a function *p* in *A* with *p*(*x*) not equal to *p*(*y*).

The statement of Stone–Weierstrass is:

- Suppose
*X*is a compact Hausdorff space and*A*is a subalgebra of*C*(*X*,**R**) which contains a non-zero constant function. Then*A*is dense in*C*(*X*,**R**) if and only if it separates points.

This implies Weierstrass’ original statement since the polynomials on [*a*,*b*] form a subalgebra of *C*[*a*,*b*] which contains the constants and separates points.

Locally compact version

A version of the Stone–Weierstrass theorem is also true when *X* is only locally compact. Let *C*_{0}(*X*, **R**) be the space of real-valued continuous functions on *X* which vanish at infinity; that is, a continuous function *f* is in *C*_{0}(*X*, **R**) if, for every *ε* > 0, there exists a compact set *K* ⊂ *X* such that *f < ε* on *X* \ *K*. Again, *C*_{0}(*X*, **R**) is a Banach algebra with the supremum norm. A subalgebra *A* of *C*_{0}(*X*, **R**) is said to **vanish nowhere** if not all of the elements of *A* simultaneously vanish at a point; that is, for every *x* in *X*, there is some *f* in *A* such that *f*(*x*) ≠ 0. The theorem generalizes as follows:

- Suppose
*X*is a*locally compact*Hausdorff space and*A*is a subalgebra of*C*_{0}(*X*,**R**). Then*A*is dense in*C*_{0}(*X*,**R**) (given the topology of uniform convergence) if and only if it separates points and vanishes nowhere.

This version clearly implies the previous version in the case when *X* is compact, since in that case *C*_{0}(*X*, **R**) = *C*(*X*, **R**). There are also more general versions of the Stone–Weierstrass that weaken the assumption of local compactness.^{[1]}

Applications

The Stone–Weierstrass theorem can be used to prove the following two statements which go beyond Weierstrass's result.

- If
*f*is a continuous real-valued function defined on the set [*a,b*] × [*c,d*] and*ε*> 0, then there exists a polynomial function*p*in two variables such that |*f*(*x,y*) −*p*(*x,y*) | <*ε*for all*x*in [*a,b*] and*y*in [*c,d*]. - If
*X*and*Y*are two compact Hausdorff spaces and*f*:*X×Y*→**R**is a continuous function, then for every*ε*> 0 there exist*n*> 0 and continuous functions*f*_{1},*f*_{2}, …,*f*on_{n}*X*and continuous functions*g*_{1},*g*_{2}, …,*g*on_{n}*Y*such that ||*f*− ∑*f*|| <_{i}g_{i}*ε*.

The theorem has many other applications to analysis, including:

- Fourier series: The set of linear combinations of functions
*e*(_{n}*x*) =*e*^{2πinx},*n*∈**Z**is dense in*C*([0,1]/{0,1}), where we identify the endpoints of the interval [0,1] to obtain a circle. An important consequence of this is that the*e*are an orthonormal basis of the space L_{n}^{2}([0,1]) of square-integrable functions on [0,1].

Stone–Weierstrass theorem, complex version

Slightly more general is the following theorem, where we consider the algebra C(X,C) of complex-valued continuous functions on the compact space X, again with the topology of uniform convergence. This is a C*-algebra with the *-operation given by pointwise complex conjugation.

Let X be a compact Hausdorff space and let S be a subset of C(X,C) which separates points. Then the complex unital *-algebra generated by S is dense in C(X,C).

The complex unital *-algebra generated by S consists of all those functions that can be obtained from the elements of S by throwing in the constant function 1 and adding them, multiplying them, conjugating them, or multiplying them with complex scalars, and repeating finitely many times.

This theorem implies the real version, because if a sequence of complex-valued functions uniformly approximate a given function f, then the real parts of those functions uniformly approximate the real part of f. As in the real case, an analog of this theorem is true for locally compact Hausdorff spaces.

Lattice and boolean ring versions

Let *X* be a compact Hausdorff space. Stone's original proof of the theorem used the idea of boolean rings inside C(*X*,**R**); that is, subsets *B* of C(*X*,**R**) such that for every *f*, *g* in *B*, the functions *f*+*g* and max{*f*,*g*} are also in *B*. The boolean ring version of the Stone–Weierstrass theorem states (Hewitt & Stromberg 1965, Theorem 7.29):

- Suppose
*X*is a compact Hausdorff space and*B*is a family of functions in C(*X*,**R**) such that*B*separates points.*B*contains the constant function 1.- If
*f*∈*B*then*af*∈*B*for all constants*a*∈**R**. *B*is a boolean ring; that is, if*f*,*g*∈*B*, then*f*+*g*∈*B*and max{*f*,*g*} ∈*B*.

- Then
*B*is dense in C(*X*,**R**).

A similar version of the theorem applies to lattices in C(*X*,**R**). A subset *L* of C(*X*,**R**) is called a lattice if for any two elements *f*, *g* in *L*, the functions max(*f*,*g*) and min(*f*,*g*) also belong to *L*. The lattice version of the Stone–Weierstrass theorem states:

- Suppose
*X*is a compact Hausdorff space with at least two points and*L*is a lattice in C(*X*,**R**) with the property that for any two distinct elements*x*and*y*of*X*and any two real numbers*a*and*b*there exists an element*f*in*L*with*f*(*x*) =*a*and*f*(*y*) =*b*. Then*L*is dense in C(*X*,**R**).

The above versions of Stone–Weierstrass can be proven from this version once one realizes that the lattice property can also be formulated using the absolute value |*f*| which in turn can be approximated by polynomials in *f*.

More precise information is available:

- Suppose
*X*is a compact Hausdorff space with at least two points and*L*is a lattice in C(*X*,**R**). The function φ in C(*X*,**R**) belongs to the closure of*L*iff for each pair of distinct points*x*and*y*in*X*and for each ε > 0 there exists some*f*in*L*for which |*f*(*x*) - φ(*x*)| < ε and |*f*(*y*) - φ(*y*)| < ε.

Bishop's theorem

Another generalization of the Stone–Weierstrass theorem is due to Errett Bishop. Bishop's theorem is as follows (Bishop 1961):

- Let
*A*be a closed subalgebra of the Banach space*C*(*X*,**C**) of continuous complex-valued functions on a compact Hausdorff space*X*. Suppose that*f*∈*C*(*X*,**C**) has the following property:*f*|_{S}∈*A*_{S}for every maximal set*S*⊂*X*such that*A*_{S}contains no non-constant real functions.

- Then
*f*∈*A*.

Glicksberg (1962) gives a short proof of Bishop's theorem using the Krein–Milman theorem in an essential way, as well as the Hahn–Banach theorem. See also Rudin (1973, §5.7).

See also

- Runge's phenomenon shows that finding a polynomial
*P*such that*ƒ*(*x*) =*P*(*x*) for some finely spaced*x*=*x*_{n}is a bad way to attempt to find a polynomial approximating*ƒ*uniformly. However, as is shown in Walter Rudin's Principles of Mathematical Analysis, one can easily find a polynomial*P*uniformly approximating*ƒ*by convolving*ƒ*with a polynomial kernel. - Mergelyan's theorem, concerning polynomial approximations of complex functions.

Notes

^ Miguel Carrion-Alvarez. Variations on a theme of Gelfand and Naimark.

References

Bishop, Errett (1961), "A generalization of the Stone–Weierstrass theorem", Pacific Journal of Mathematics 11 (3): 777–783.

Glicksberg, Irving (1962), "Measures Orthogonal to Algebras and Sets of Antisymmetry", Transactions of the American Mathematical Society (Transactions of the American Mathematical Society, Vol. 105, No. 3) 105 (3): 415–435, doi:10.2307/1993729, JSTOR 1993729.

Hewitt, E; Stromberg, K (1965), Real and abstract analysis, Springer-Verlag.

Rudin, Walter (1976), Principles of mathematical analysis (3rd. ed.), McGraw-Hill, ISBN 978-0070542358.

Rudin, Walter (1973), Functional analysis, McGraw-Hill, ISBN 0-07-054236-8.

Historical works

The historical publication of Weierstrass (in German language) is freely available from the digital online archive of the Berlin Brandenburgische Akademie der Wissenschaften:

K. Weierstrass (1885). Über die analytische Darstellbarkeit sogenannter willkürlicher Functionen einer reellen Veränderlichen. Sitzungsberichte der Königlich Preußischen Akademie der Wissenschaften zu Berlin, 1885 (II).

Erste Mitteilung (part 1) pp. 633–639, Zweite Mitteilung (part 2) pp. 789–805.

Important historical works of Stone include:

Stone, M. H. (1937), "Applications of the Theory of Boolean Rings to General Topology", Transactions of the American Mathematical Society (Transactions of the American Mathematical Society, Vol. 41, No. 3) 41 (3): 375–481, doi:10.2307/1989788, JSTOR 1989788.

Stone, M. H. (1948), "The Generalized Weierstrass Approximation Theorem", Mathematics Magazine 21 (4): 167–184, doi:10.2307/3029750, JSTOR 3029750; 21 (5), 237–254.

Books

'Optimization: Insights and Applications', Jan Brinkhuis and Vladimir Tikhomirov: 2005, Princeton University Press

Retrieved from "http://en.wikipedia.org/"

All text is available under the terms of the GNU Free Documentation License