VOL. 75 1998 NO. 1
ON APPROXIMATION BY LAGRANGE INTERPOLATING POLYNOMIALS FOR A SUBSET
OF THE SPACE OF CONTINUOUS FUNCTIONS
BY
S. P. Z H O U (HANGZHOU)
We construct a C
kpiecewise differentiable function that is not C
kpiece- wise analytic and satisfies a Jackson type estimate for approximation by Lagrange interpolating polynomials associated with the extremal points of the Chebyshev polynomials.
1. Introduction. Let C
[−1,1]kbe the class of functions which have k continuous derivatives on [−1, 1], in particular, C
[−1,1]0= C
[−1,1]be the class of continuous functions on [−1, 1]. For a function f ∈ C
[−1,1], let L
n(f, x) be the nth Lagrange interpolating polynomial of f associated with the extremal points {x
j} = {cos(j − 1)π/n}
n+1j=1of the Chebyshev polynomials in [−1, 1].
An explicit formula for L
n(f, x) is L
n(f, x) = ω
n(x)
n
−f (1) 2(x − 1) +
n
X
l=2
(−1)
lf (x
l) x − x
l+ (−1)
n+1f (−1) 2(x + 1)
,
where ω
n(x) = √
1 − x
2sin(n arccos x).
It is well known that L
n(f, x) does not converge for all f ∈ C
[−1,1]. However, Mastroianni and Szabados [MS] considered a subset of C
[−1,1]and proved
Theorem 1. If f ∈ C
[−1,1]and if there is a partition of [−1, 1], −1 = a
s+1< a
s< . . . < a
0= 1, such that each f |
[aj+1,aj](j = 0, 1, . . . , s) is a polynomial , then, for |x| ≤ 1, as n → ∞,
|f (x) − L
n(f, x)| = O
√ 1 − x
2n
min
1, 1
n min
1≤j≤s|x − a
j|
. Recently, [Li] improved and generalized the above result to
1991 Mathematics Subject Classification: Primary 41A05.
[1]
Theorem 2. If f is C
kpiecewise analytic on [−1, 1] with singular points a
1, . . . , a
s, then, as n → ∞,
(1) |f (x) − L
n(f, x)| = O |ω
n(x)|
n
k+1min
1, 1
n min
1≤j≤s|x − a
j|
holds uniformly for x ∈ [−1, 1].
[Li] uses the following definition: A function f defined on [−1, 1] is called C
kpiecewise analytic on [−1, 1] if f ∈ C
[−1,1]kand if there is a partition of [−1, 1], −1 = a
s+1< a
s< . . . < a
0= 1, such that each f |
[aj+1,aj](j = 0, 1, . . . , s) has an analytic continuation to [−1, 1]. The points a
1, . . . , a
sare called the singular points of f .
At the end of the paper, Li wrote: “We . . . note that our term ‘piecewise analytic’ . . . has a different meaning from the usual one: We require that each analytic piece has an analytic continuation to [−1, 1]. The technical requirement is needed because of our method. We do not know if there exists a function that is not C
kpiecewise analytic but satisfies the estimation (1).”
In the present paper we construct a C
kpiecewise differentiable function that is not C
kpiecewise analytic and satisfies (1). Finally, based on some observations, we raise an open question.
2. Result
Definition. Let k ≥ 0. A function f defined on [−1, 1] is called C
kpiecewise differentiable on [−1, 1] with singular points a
1, . . . , a
sif f ∈ C
[−1,1]kand if there is a partition of [−1, 1], −1 = a
s+1< a
s< . . . < a
0= 1, such that each f |
[aj+1,aj](j = 0, 1, · · · , s) has k + 1 continuous derivatives on [a
j+1, a
j], but f does not have the (k + 1)th derivative at the singular points a
1, . . . , a
s.
Theorem 3. Let k ≥ 0. There is a C
kpiecewise differentiable function f (x) on [−1, 1] with singular point zero which does not have the (k + 2)th derivative at the endpoints ±1 and for which
(2) |f (x) − L
n(f, x)| = O |ω
n(x)|
n
k+1min
1, 1
nx
holds uniformly for x ∈ [−1, 1].
P r o o f. Let T
n(x) = cos(n arccos x) be the Chebyshev polynomial of degree n, and
S(x) =
x
k+1, x ≥ 0,
0, x < 0.
Set n
1= 2, and n
j+1= n
2jfor j = 1, 2, . . . Define f (x) = T (x) + S(x) :=
∞
X
j=1
n
−2k−4jT
nj(x) + S(x).
We show this is the desired function.
Obviously f ∈ C
[−1,1]k. The argument that f |
[−1,0]and f |
[0,1]have k + 1 continuous derivatives on [−1, 0] and [0, 1] respectively is also trivial. Also, we note that T (x) evidently has 2k + 3 continuous derivatives at zero and S(x) does not have the (k + 1)th derivative there; consequently, f (x) does not have the (k + 1)th derivative at zero. All those facts mean that f is C
kpiecewise differentiable on [−1, 1] with singular point zero.
Let n
j≤ n < n
j+1, j = 1, 2, . . . For any x ∈ [−1, 1] we have T (x) − L
n(T, x) = J (x) − L
n(J, x),
where J (x) = P
∞l=j+1
n
−2k−4lT
nl(x). Now for l ≥ j + 1, T
nl(x) − L
n(T
nl, x)
= ω
n(x) n
T
nl(1) − T
nl(x) 2(x − 1) +
n
X
m=2
(−1)
m(T
nl(x) − T
nl(x
m)) x − x
m+ (−1)
n+1(T
nl(x) − T
nl(−1)) 2(x + 1)
.
Hence there are ξ
mbetween x and x
mand an absolute constant C > 0 such that
|T
nl(x) − L
n(T
nl, x)|
≤ |ω
n(x)|
n
−T
n0l(ξ
1)
2 +
n
X
m=2
(−1)
mT
n0l(ξ
m) + (−1)
n+1T
n0l(ξ
n+1) 2
≤ Cn
2l|ω
n(x)| (by the Markov inequality).
Then
|J (x) − L
n(J, x)| ≤ C|ω
n(x)|
∞
X
l=j+1
n
−2k−2l≤ Cn
−2k−2j+1|ω
n(x)| ≤ Cn
−k−2|ω
n(x)|.
Together with the known result (see [Li]) that
|S(x) − L
n(S, x)| = O |ω
n(x)|
n
k+1min
1, 1
nx
holds uniformly for x ∈ [−1, 1], we have thus finished the proof of (2).
Denote by t
(j)kthe largest zero of T
n(k+1)j(x). We know that (3) n
−2j≤ 1 − t
(j)k≤ 1 − cos (k + 2)π
n
l≤ (k + 2)
2π
22n
2lsince the zeros of T
n(l+1)j(x) interlace those of T
n(l)j(x) for l = 0, 1, . . . We also notice that (T
n(k+1)j(1) − T
n(k+1)j(x))/(1 − x) = T
n(k+2)j(ξ) > 0, ξ ∈ [x, 1], for x ∈ [t
(j)k, 1], so that by (3),
T
n(k+1)j(1) − T
n(k+1)j(x)
1 − x > T
n(k+1)j(1) − T
n(k+1)j(t
(j)k) 1 − t
(j)k(4)
≥ 2n
2j(k + 2)
2π
2T
n(k+1)j(1) ≥ C
kn
2k+4jfor x ∈ [t
(j)k, 1], where C
kis a positive constant only depending upon k.
Write
T
(k+1)(1) − T
(k+1)(t
(j)k) 1 − t
(j)k= 1
1 − t
(j)kj
X
l=1
n
−2k−4l(T
n(k+1)l(1) − T
n(k+1)l(t
(j)k))
+ 1
1 − t
(j)k∞
X
l=j+1
n
−2k−4l(T
n(k+1)l(1) − T
n(k+1)l(t
(j)k)) =: I
1+ I
2. We check that, by (4),
I
1≥ C
kj,
while by inequality (3), the Markov inequality and the definition of {n
j},
|I
2| = O(1)n
2j∞
X
l=j+1
n
−2k−4lkT
n(k+1)l