C L Stone Popular Books

C L Stone Biography & Facts

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 and simplified the proof. 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, a variety of other families of continuous functions on X {\displaystyle X} are shown to suffice, as is detailed below. 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: A constructive proof of this theorem 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 metrizable and separable it follows that C[a, b] has cardinality at most 2ℵ0. (Remark: This cardinality result also follows from the fact that a continuous function on the reals is uniquely determined by its restriction to the rationals.) Stone–Weierstrass theorem, real version The set C[a, b] of continuous real-valued functions on [a, b], together with the supremum norm || f || = supa ≤ x ≤ b | f (x)|, is a Banach algebra, (that is, 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] (that is, 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) ≠ p(y). Now we may state: 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 C0(X, R) be the space of real-valued continuous functions on X that vanish at infinity; that is, a continuous function  f  is in C0(X, R) if, for every ε > 0, there exists a compact set K ⊂ X such that  | f |  < ε on X \ K. Again, C0(X, R) is a Banach algebra with the supremum norm. A subalgebra A of C0(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: This version clearly implies the previous version in the case when X is compact, since in that case C0(X, R) = C(X, R). There are also more general versions of the Stone–Weierstrass that weaken the assumption of local compactness. 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  f1, ...,  fn  on X and continuous functions g1, ..., gn on Y such that || f − Σ fi gi || < ε. The theorem has many other applications to analysis, including: Fourier series: The set of linear combinations of functions en(x) = e2π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 en are an orthonormal basis of the space L2([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 ) {\displaystyle C(X,\mathbb {C} )} of complex-valued continuous functions on the compact space X {\displaystyle X} , again with the topology of uniform convergence. This is a C*-algebra with the *-operation given by pointwise complex conjugation. The complex unital *-algebra generated by S {\displaystyle S} consists of all those functions that can be obtained from the elements of S {\displaystyle 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 net of complex-valued functions uniformly approximates a given function, f n → f {\displaystyle f_{n}\to f} , then the real parts of those functions uniformly approximate the real part of that function, Re ⁡ f n → Re .... Discover the C L Stone popular books. Find the top 100 most popular C L Stone books.