This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Similarly, if p = 00, then
Proof.
Let 1 ~ p < 00. Then D J E Lip; coupled with (2.119) implies
and it follows thatjELip;·a[a,bJ. Conversely, if jELip;,a, then some
~
>0,
and by Theorem 2.61, we conclude that f E L;[ a, b] and
•
that is, D J E Lip;l a, b). The proof for p = 00 is similar.
Theorem 2.62 does not cover the case where a = 0, and indeed, the spaces Lip;·o[a,b] have a somewhat different behavior. Lip~~a,b] is the classical Zygmund space, and thus we introduce the notation
Z;[ a,b] = {fELp[ a,b]:
wr +2(!;t)p=6(t
r
+1)}.
(2.129)
59
TIlE K-FUNCTIONAL THEOREM 2.63
Let 1 < p < 00. Then
Similarly, if p =
00,
then
Z~[a,bJ={fEC~[a,bJ:D'fEZ~[a,bJ}. Proof The proof follows the same pattern as that of Theorem 2.62, using (2.119) and Theorem 2.61. • The spaces Lip~a[a,b] and Besov spaces-see Section 6.5.
Z~[a,b]
are examples of what are called
I 2.9. THE K-FUNCfIONAL In this section we introduce an expression called the K-functional which measures the smoothness of a function in terms of how well it can be approximated by smooth functions. This will provide an alternate way of characterizing smooth function classes (which as it turns out is equivalent to using the moduli of smoothness defined in the previous section). We also include several applications of the K functional which will be useful later on. DEFINrnON 2.64.
The K-Functional
Suppose 1 <: p < 00, t > 0, and that r is a positive integer. For f E Lp[I] we define (2.130)
Ifp=oo andfEC[I], we define (2.131)
We call Kr,p(t) the K-functional of Peetre. It is clear that Kr,p(t) is a nonlinear functional defined on the space Lp[I] if 1 ,p < 00, and on C [I] if p = 00. It is a measure of how well the function f can be approximated by smoother functions (in L;[I] or Cr[I]) while maintaining a control on the size of the rth derivative of the approximant.
PREUMINARIES
60
The parameter t controls the balance between the size of the derivative and the error in the approximation. The following theorem lists some elementary properties of the K-functional: THEOREM 2.65
Let 1 ,p ~
and r > O. Then
00
Kr.p(t 1 + t2)!~ 2r-
1
[
(2.132)
Kr.p(t 1 )!+ Kr.p(t 2)!];
Kr.p(t)(!1 + !2) ~ Kr.p(t)!1 + Kr,p(t)!2: Kr.p( t)! < Kr.p( t-)j
(2.134)
Kr.p(t)!< Iljllp;
(2.135)
K r . p ( t)j ~ t
r
lim Krp(t)!=O
1---+0
•
if lim t-rKr.p(t)!=O, 1---+0
(2.133)
II D'ill p
ifjEL;[a,b],
I~p
ifjECr[a,b],
p=oo:
ifjELp[a,b],
l
0, and suppose r is a positive integer. Let J=[c,d] and 2 = [c, d + r t]. Then for all f E Lp[j] there exists g E L;[J] such that
j
(2.139) and
61
THE K-FUNcnONAL
Similarly, if j = [c - r 2t, d], then the same inequalities hold with d~u and d~t replaced by d r_ tu and d r_ kl , respectively. Similar results hold for f E e[l] with p= 00. Proof. We prove only the case of 1 < p < 00. The proof for p = 00 is similar. Given f E Lp[j], we need to construct an approximation g E L;[l]. To this end we take the so-called Steklov average off:
g( x) =
=
r"[ f(x) + ( -1)'+ d:J(x)] I
)0
±
(-1);+
i-I
N'( u/ t)du t
I( ~)l"f(x + iu) N'(u/ t)du , l o t
(2.141)
where N r is the function that appears in the representation (2.107) of the rth forward difference. Let F= D -j [cf. (2.28)]. Then by (2.107), for all 1 <:i <:r,
Lrtl'i( o
J
I
X
. )Nr(u/t)du=lirtl'i( )Nr(U/it)du=(.)-rArF() + IU J X +u . It ~;t X. t
0
I
It
It follows from (2.141) that (2.142) and thus that g E L;[J]. Now by the properties of N r ,
Here we have used the Minkowski inequality-cf. Remark 2.2. We have proved (2.139). If we differentiate (2.142) r times, we obtain
Since
~:-tC)=2' -1 and
the inequality (2.140) also follows.
•
PREUMINARIES
62
The following theorem clarifies the close relationship between the Kfunctional and the modulus of smoothness: THEOREM 2.67
Let 1= [Q, b] and 1 ~ p < 00. Then there exist constants C 1 and C2 (depending only on r, p, and I) such that (2.143) for all IE 4[ I]. A similar assertion holds with p = 00 if IE C[ a, b]. Proof We consider only the case of 1 ~ p < 00; the case of p = 00 is similar. Let gEL;[I].. where we write I=[a,b]. Then by the properties (2.106) and (2.109) of divided differences,
IlaVIIL,,[/,Ill ~ Ila~(I - g)IIL,,[/,Ill + Ila~gll 4[/,11] r ~ 2 (III- gil L,,[/,lIl + hrIIDrgllL,,[/,lIl)'
where Irh = [a, b - rh]. Taking the infimum over all g on the right-hand side, and then the supremum over all O
+ \f;g2 = gl + \f;( g2 - gl)
belongs to L;[I]. We now estimate III-gil a.nd IIDrgll. By Lemma 2.66,
II I-gil Lp[/] ~ II I-gIll Lp[J,l + II I - g211 L p[J 2 l ~ C7w r (I; t)Lp[/). Using the Leibniz rule and the properties of \f.', we obtain
63
TIlE K-FUNCllONAL
Now, estimating the intermediate derivative (cf. Theorem 2.5) gives
II Drgll Lp[JJJ < C 5 (211 Drg." Lp[JJJ + II D g 211 Lp[JJJ + II g. - g211 L p[J J) r
3
~ 2C5 (II DrgIIlL
p
[J
r
3
J+ IID g2 11L p [J)+ max J 1 <;.;<;.2
111- gillL
p
[J
3
1)
where we have also used the fact that J3~J. and J3~J2. The same estimate for Drg holds on J. and J 2 since g reduces to g. and g2' respectively, on these intervals. We conclude that
Combining this with our previous estimate for 111- gil, we see that
The remainder of this section is devoted to some applications of the K-functional. Our first result shows that in obtaining error bounds for various approximation processes, it is often sufficient to establish the bounds for smooth functions only, and the desired bounds for less-smooth function classes will follow automatically. THEOREM 2.68
Let 1 < p < 00, and suppose r is a posItIve integer. Let ~ be a set of functions in Lp[I] such that for each g E L;[I] there exists an element Sg E ~ satisfying some t >0,
(2.144)
with Co and C. constants depending only on r. Then there exists a constant C2 (depending only on r,p, and I) such that for eachfELp[I] there exists sfE ~ satisfying (2.145)
For p=oo, (2.145) holds for all fEC[I] provided (2.144) holds for all gECr[I].
PREUMINARIES
64
Proof We consider the case of 1