MT2002 Analysis

Previous page
(Properties of uniform convergence)
Contents Next page
(The intermediate value theorem)

The Weierstrass approximation theorem

One of the most important ways in which a metric is used is in approximation. Given a function f, finding a sequence which converges to f in the metric dinfinity is called uniform approximation. The most important result in this area is due to the German mathematician Karl Weierstrass (1815 to 1897).

The Weierstrass Approximation theorem
Any continuous function on a bounded interval can be uniformly approximated by polynomial functions.

Proof
There are several different ways of proving this important theorem. Here is a method which introduces concepts which are important in other areas of mathematics too.

Definition

If f and g are suitable functions on R, then the convolution f * g is the function defined by f * g(x) = intR f(x - t) g(t) dt (suitable means ensuring that the integral exists).

This concept of convolution is important in the theory of Laplace transforms among other places.

It turns out that the set X of suitable functions is than a ring under the operations + and * in much the same way that X forms a ring under the usual addition and multiplication.

The Laplace transform laplace is then a ring homomorphism from (X + *) to (X + .)
That is: laplace(f + g) = laplace(f) + laplace(g) and laplace(f * g) = laplace(f).laplace(g).

Thinking about convolution as an algebraic operation, we may ask: Is there an identity element for this operation?
The answer is: Almost!

The English mathematician Paul Dirac (1902 to 1984) one of the most important founders of Quantum Mechanics, invented the delta-function.
This is a "function" with the properties:
delta(x) = 0 if x noteq 0 and intR delta(x) dx = 1.

You should think of it as "The density function of a unit mass or charge at the origin".

Of course it is not really a function since we would have to have delta(0) = infinity in a rather special way, but it turns out that provided one only uses it in integrals everything is OK.

For example, f * delta(x) = intR f(x - t) delta(t) dt = f(x) since delta(t) = 0 except at t = 0.

What we will now do is find a sequence of functions (Kn) which approximate the delta-function. The sequence (Kn* f) will then approximate delta * f = f.


Definition

The n-th Landau kernel function Kn= cn(1 - x2)n for x belongs [-1, 1] and 0 otherwise, where cn is chosen so that intR Kn = 1.


Here are graphs of some of these functions:

Note that these are the graphs of the density functions of unit masses concentrated on smaller and smaller areas.

Lemma
If f is a continuous function on the interval [-1, 1] then Kn * f is a polynomial.

Proof
Kn* f(x) = intm11Kn(x - t)f(t) dt and Kn is a polynomial and so Kn(x - t) can be expanded as g0(t) + g1(t) = ... + g2n(t)x2n and so the integral is a polynomial in x.

Lemma
The sequence (Kn * f) rarrow f in dinfinity.

Proof
We need to show that Kn has "most of its area" concentrated near x = 0.
First we estimate how big cn is:
intm11(1 - t)2)ndt = 2int01(1 - t)n(1 + t)ndt gte 2 intm11(1 - t)ndt = 2/(n+1).
Since intR Kn= 1 we must have cnlte (n+1)/2.
[In fact, cn grows like a multiple of sqrtn. For large n, cn is approximately 0.565sqrtn.]
Look at the area under Kn which is not near 0.
intd1Kn(t) dt = intd1cn(1 - t2)ndt lte (n+1)/2 intd1(1 - delta2)ndt
since Kn is decreasing on [delta, 1] and this is (n + 1)/2 (1-delta2)n(1-delta).
If r = 1 - delta2 then (n + 1)rn--> 0 as n rarrow infinity.
We are told that f is continuous and by a theorem we will prove in the next section we may assume that f is bounded by M (say).
If x belongs [0, 1] then given epsilon > 0 we can find delta > 0 such that if |t| < delta then |f(x - t) - f(x)| < epsilon.
So now look at the convolution : Kn* f.
|f(x) - Kn* f(x)| = intm11|f(x) - f(x - t)| Kn(t) dt = intm1md + intmdd + intd1.
Now on [-1, -delta] and on [delta, 1] we have Kn(t) is small if we choose delta small. In fact, we can choose delta so that Kn(t) < epsilon/M here and then the first and third integrals are < epsilon.
For the middle integral, intmdd|f(x) - f(x - t)|Kn(t) dt lte intmddepsilonKn(t) dt < epsilon since intm11Kn(t) dt = 1.
Thus |f(x) - Kn* f(x)| is small when n is large and we have our convergence. This completes the proof of the Weierstrass approximation theorem.


Remarks


  1. If you take a function like x goesto |x| with a graph:
    which is continuous but which is not differentiable at x = 0, then we can approximate it uniformly by polynomial functions which are (of course) all differentiable.
    Thus the uniform limit of differentiable functions is not necessarily differentiable.


  2. The Weierstrass theorem is about functions which are continuous on a closed bounded inteval like [a, b].
    Although one can define uniform limits of functions on (say) the whole real line R, there are continuous functions which "grow too fast" (like the exponential function ex) or grow too slowly (like sin(x)) to be approximated well on the whole line. Of course such functions can all be approximated well on a "finite bit" of R.


Previous page
(Properties of uniform convergence)
Contents Next page
(The intermediate value theorem)

JOC September 2002