Equicontinuous Uniformly Equicontinuous, For Brevity in The Following
Equicontinuous Uniformly Equicontinuous, For Brevity in The Following
Equicontinuous Uniformly Equicontinuous, For Brevity in The Following
function.
First, we prove that the sequence {f
(k)
n
} is equicontinuous for
all k. We have f
(k)
n
(x) f
(k)
n
(y) = f
(k+1)
n
(z)(x y) for some z
between x, y by mean value theorem. Thus
|f
(k)
n
(x) f
(k)
n
(y)| = |f
(k+1)
n
(z)||(x y)| M
k+1
|x y|,
and the previous problem nishes the proof.
Now do the diagonal trick. By theorem proved in class, since
{f
n
} is equicontinuous and uniformly bounded (by M
0
), we can
nd a subsequence f
11
, f
12
, . . . which converges uniformly in the
interval. The sequence {f
1n
} is also uniformly bounded and
1
2
equicontinuous, so we can extract a subsequence which is uni-
formly convergent. This means, there is a subsequence of {f
1n
},
say {f
2n
} such that {f
2n
} is uniformly convergent. We can
continue this and get subsequences {f
pn
} such that {f
(p1)
pn
} is
uniformly convergent. Finally, as in class, one checks that the
subsequence f
11
, f
22
, . . . has all the required properties.
(4) Prove that the set of all polynomials of degree at most N (xed)
and coecients in [1, 1] is uniformly bounded and equicontin-
uous in any compact interval.
If P is any such polynomial and x is any point in our interval,
we have P(x) = a
0
+ a
1
x + + a
N
x
N
with |a
i
| 1 for all i
and thus, |P(x)| 1 + |x| + + |x|
N
and the last term is
a continuous function on a compact set and hence bounded,
independent of the a
i
, x. So, we see that the family of these
polynomials is uniformly bounded.
Again, if P is as above, for any two points x = y we have,
|P(x) P(y)| = |x y||a
1
+ a
2
(x + y) + a
3
(x
2
+ xy + y
2
) + + a
N
x
N
y
N
x y
|
|x y|(1 + 2M + 3M
2
+ + NM
N1
)
where M is a positive number such that |x| M for all x in
our compact interval. Rest is clear from an earlier problem.
(5) Prove that the family of polynomials P of degree at most N
with |P(x)| 1 on [0, 1] is equicontinuous on [0, 1].
We use a fact from the last homework. Let P
k
be polynomials
of degree at most N for 0 k N such that
1
0
P
k
x
j
dx = 0
for all j = k and 0 j N and
1
0
P
k
x
k
dx = 1. If P(x) =
a
0
+ a
1
x + + a
N
x
N
is any polynomial with |P(x)| 1 for
all x [0, 1], we see that a
k
=
1
0
P
k
Pdx and thus |a
k
|
1
0
|P
k
|dx = M
k
. So, all the coecients are uniformly bounded
and then the proof is exactly as in the previous problem.
(6) Let P
0
= 0 and P
n+1
(x) = P
n
(x) +
x
2
P
2
n
(x)
2
.
(a) Prove that |x| P
n+1
(x) = (|x| P
n
(x))
1
|x|+Pn(x)
2
.
Deduce that 0 P
n
(x) P
n+1
(x) |x| if |x| 1.
The formula is obvious.
|x| P
n+1
(x) = |x| P
n
(x)
x
2
P
2
n
(x)
2
= (|x| P
n
(x))
1
|x| + P
n
(x)
2
3
Assume we have proved the result for n, the initial case be-
ing obvious. Then we need to prove that P
n
(x) P
n+1
(x)
|x|. Since 0 P
n
(x) |x|, we see that |x| P
n
(x) +|x|
2|x| and thus,
(1) 1
|x|
2
1
|x| + P
n
(x)
2
1 |x|.
It is clear that this inequality implies what we need.
(b) Show that |x| P
n
(x) |x|(1
|x|
2
)
n
<
2
n+1
for |x| 1.
The equation (1) above immediately implies the rst part
of inequality by induction. For the second part, check that
the function x(1
x
2
)
n
attains its maximum at x =
2
n+1
in
[0, 1].
(c) Prove that {P
n
} converges uniformly to the function g(x) =
|x| in [1, 1].
Less said the better.