As readers of my blog may know, I am very fond of Walter Rudin’s text *Principles of Mathematical Analysis *(a.k.a. “Baby Rudin”), in particular the exercises. Full disclosure: frustration, not fondness, was my first emotion working with this text. I read Baby Rudin periodically, usually to be surprised by all the things that I missed during my last round of reading.

One of the big “principles” of analysis, to borrow Rudin’s language, is uniform approximation of real- or complex-valued continuous functions defined on compact metric spaces by “classes” of “nice” functions, such as polynomials. In the second half of the 19th century, German mathematician Karl Weierstrass showed that the real polynomials are uniformly dense in the space of continuous functions on the closed unit interval.

Theorem(Weierstrass) Suppose is a continuous function. For any given, there exists a polynomial such that

There are a few different proofs of Weierstrass theorem (Theorem 7.26). One particularly interesting–and constructive–proof uses Bernstein polynomials and the weak law of large numbers (WLLN). Said proof can be found in my notes on laws of large numbers. Note that this is *not* the proof presented in Baby Rudin. In the 1930s, American mathematician Marshall H. Stone, the son of a U.S. Supreme Court Chief Justice, substantially generalized Weierstrass’ result both in terms of the underlying domain of the continuous functions and the class of nice functions. Formulating Stone’s result requires some more advanced machinery, which we introduce here.

We say that a collection of functions on a set *separates points* on if, for all distinct points , there exists a function such that . If, for every point , there exists a function such that . We say that is an *algebra* if it satisfies the following conditions:

1. ;

2. ;

3.

for all and .

Theorem(Stone) Suppose is an algebra of real-valued continuous functions defined on a compact metric space , such that separates points on and vanishes at no point of . Then, for any continuous function and given, there exists a function such that

The proof that Rudin presents of the above version of Stone’s theorem (Theorem 7.32) involves showing that, for any , there exists a polynomial such that

where . This is an immediate consequence of Weierstrass’ theorem, since is a continuous function; however, one does not actually need the full strength of Weierstrass’ theorem. Indeed, showing this claim is Exercise 23 in Chapter 7 of Baby Rudin.

Set . We define a sequence of polynomials inductively by

We will show that , as , uniformly on the interval . Observe that

I claim that on . Since

,

for all . So the inequalities hold on . Suppose that the inequalities hold on , for some positive integer . Then

by our induction hypothesis. Furthermore,

for all . Using induction, the nonnegativity of , and the inequality , we obtain the estimate

We seek a bound independent of for the RHS of the inequality. The function has critical points at

Using the first-derivative test, we see that has a global maximum on at and therefore