Beruflich Dokumente
Kultur Dokumente
N. L. Carothers
Dept. of Mathematics & Statistics
Bowling Green State University
Bowling Green, OH 43403
carother @ math.bgsu.edu
Introduction
To begin, a polygonal function is a piecewise linear, continuous function; that is, a continuous function f : [ a, b ] R is a polygonal function if there are finitely many distinct
points a = x0 < x1 < < xn = b, called nodes, such that f is linear on each of the
intervals [ xk1 , xk ], k = 1, . . . , n. If we fix the nodes a = x0 < x1 < < xn = b, then
its clear that any polygonal function based on these nodes is completely determined by
its values at the nodes.
Our first result is due to Lebesgue. In fact, its the first observation in Lebesgues
first published paper Sur lapproximation des fonctions (complete references are given at
the end of this paper), which appeared in 1898; Lebesgue was 23 at the time. Lebesgues
observation is that uniformly continuous functions can be uniformly approximated by
polygonal functions. In what follows, we will use k k to denote the uniform, or sup-norm;
specifically, given a continuous function f on an interval [ a, b ], we write
kf k = max |f (x)|.
axb
Polygonal Functions
1. For each n, let Qn be the set of all polygonal functions that have nodes at x = k/n,
k = 0, . . . , n, and that take on only rational values at these points. Check that Qn is
a countable set, and hence the union of the Qn s is a countable dense set in C[ 0, 1 ].
Pn1
i=1
ai |x xi | + bx + d for some
Polygonal Functions
The upshot of Exercise 3 is that each polygonal function is a linear function plus a
linear combination of translates of the function |x|. If we knew that the function |x| could
be uniformly approximated by polynomials on, say, [1, 1 ], then we could fashion a proof
of the Weierstrass theorem. Lebesgues original proof uses the fact that the binomial series
1 z = 1 + c1 z + c2 z 2 + c3 z 3 + c4 z 4 + ,
where
cn =
(1) 1 3 (2n 3)
,
2 4 6 (2n)
1 (1 x2 ) = 1 + c1 (1 x2 ) + c2 (1 x2 )2 + c3 (1 x2 )3 +
8. Let a0 = 1 and an =
Polygonal Functions
from the First through purely elementary techniques. Whats more, Lebesgue pointed out
that the two results are actually equivalent; in other words, the First Theorem can likewise
be deduced from the Second. Since there are many independent proofs of the two theorems,
this is of some interest.
A somewhat simplified version of Lebesgues original proofs can be found in the books
by de La Vallee Poussin and by Natanson. Instead of pursuing Lebesgues proof, we
will next discuss Dunham Jacksons observation, taken from Jacksons Carus Monograph
Fourier Series and Orthogonal Polynomials, that Weierstrasss Second Theorem already
follows from Lebesgues first result and a few simple calculations.
Weierstrasss Second Theorem
To begin, we denote the collection of continuous, 2-periodic functions f : R R by
C 2 . Please note that each element of C 2 is completely determined by its values on, say,
[, ]. In particular, each element of C 2 is uniformly continuous (on all of R), and we
may continue to use the sup-norm; in this case,
kf k =
max |f (x)|.
x
f (x) cos nx dx =
a
1
c
f (b) sin nb f (a) sin na + 2 cos nb cos na .
n
n
m Z
1 X xk
f (x) cos nx dx =
f (x) cos nx dx
xk1
k=1
xk
f (x) cos nx dx =
xk1
ck
1
f (xk ) sin nxk f (xk1 ) sin nxk1 + 2 cos nxk cos nxk1 .
n
n
Polygonal Functions
f (x + t) f (x)
,
t
for 0 < | t | ,
and g(0) = 5.
[Hint: sin(n + 12 ) t = cos 2t sin nt + sin 2t cos nt. Thus, the integral can be written as a
sum of Fourier coefficients for the functions (t) cos 2t and (t) sin 2t .]
If we denote the n-th partial sum of the Fourier series for a fixed function f by
n
a0 X
sn (x) =
+
ak cos kx + bk sin kx ,
2
k=1
Polygonal Functions
then we may appeal to the familiar Dirichlet formula (and Exercise 12) to write:
1
sn (x) f (x) =
sin(n + 12 ) t
1
f (x + t) f (x)
dt =
t
2 sin 2
K. Weierstrass, Uber
die analytische Darstellbarkeit sogenannter willk
urlicher Functionen einer reellen