For a carefully chose system of odes := f ; ; :::; g; ; our results imply i particular, that the Lebesgue costat k (W k; ; )k L (R) satises uiformly f
|
|
- Sharon Ford
- 6 years ago
- Views:
Transcription
1 The Lebesgue fuctio ad Lebesgue costat of Lagrage Iterpolatio for Erd}os Weights S. B. Dameli Jauary, 5 Jauary 997 bstract We establish poitwise as well as uiform estimates for Lebesgue fuctios associated with a large class of Erd}os weights o the real lie. Erd}os weight is of the form: W := exp( Q) where Q : R R is eve ad is of faster tha polyomial growth at iity. The archetypal examples are (i) (ii) where W k; (x) := exp ( Q k; (x)) Q k; (x) := exp k (jxj ) ; > ; k : Here exp k := exp (exp (exp(:::))) deotes the kth iterated expoetial. where Q ;B (x) := exp W ;B (x) := exp ( Q ;B (x)) B log + x ; B > ad > :
2 For a carefully chose system of odes := f ; ; :::; g; ; our results imply i particular, that the Lebesgue costat k (W k; ; )k L (R) satises uiformly for N ; := sup xr j (W k; ; )j (x) k (W k; ; )k L log : (R) Moreover, we show that this choice of odes is optimal with respect to the zeros of the orthoormal polyomials geerated by W : Ideed, let U := fx j; : j g; ; where the x k; are the zeros of the orthogoal polyomials p W ; : geerated by W : The i particular, we have uiformly for N; k 6 k (W k; ; U )k L (R) 6 j= log j Here, log j := log (log (log (:::))) deotes the jth iterated logarithm. We deduce sharp theorems of uiform covergece of weighted Lagrage iterpolatio together with rates of covergece. I particular, these results apply to W k; ad W ;B : : Itroductio ad Statemet of Results I this paper, we ivestigate Lebesgue bouds ad uiform covergece of Lagrage iterpolatio for Erd}os weights. We recall that a Erd}os weight has the form: W := exp ( Q) where Q : R R is eve ad is of faster tha polyomial growth at iity. The archetypal examples are (i) W k; (x) := exp ( Q k; (x)) ; (.)
3 where Q k; (x) := exp k (jxj ) ; k ; > : Here exp k := exp (exp (exp(:::))) deotes the kth iterated expoetial. (ii) W ; (x) := exp ( Q ;B (x)) (.) where Q ;B (x) := exp log + x B ; B ad is large eough but xed. Throughout, let f : R R be cotiuous ad satisfy the decay coditio, We set lim jfw j (x) = : (.3) jxj E [f] W; := if P P k(f P ) (x) W (x)k L (R) (.) to be the error of best weighted polyomial approximatio to f from P ; : Here, P deotes the class of polyomials of degree : It is well kow ([9]) that E [f] W; as : Now let := f ; ; :::; g; ; be a arbitrary set of odes. The Lagrage iterpolatio polyomial to f with respect to is deoted by L [f; W; ]: Thus, if l j; ( ) P ; j ; are the fudametal polyomials of Lagrage iterpolatio at j ; j ; satisfyig, l j; ( ) ( j; ) = j;k ; k ; the, L [f; W; ] (x) = j= f ( j; ) l j; ( ) (x) P : (.5) 3
4 Now write, kw (f L [f; W; ])k L (R) E [f] W; + W (x) j= = E [f] W; + k (W; )k L (R) jl j; ( )(x)j W ( j ) L (R) C (.6) where k (W; )k L is called the Lebesgue costat with respect to the (R) weight W ad the set of odes ; ad (W; ) is the correspodig Lebesgue fuctio. Usig (:6), we see that estimates of the size of the Lebesgue costat eable oe to deduce theorems o uiform covergece of Lagrage iterpolatio. s the subject of weighted Lagrage iterpolatio is a extesively researched ad widely studied subject, we refer the reader to [; 5; 6; 7; ; ;, 3; ; 5]: Now give a weight W : R (; ] as above, we may dee orthoormal polyomials satisfyig p (x) := p (W ; x) = x + :::; with = (W ) > ; Z R p (W ; x)p m (W ; x)w (x)dx = m : We deote the zeros of p by Put < x ; < x ; < ::: < x ; < x ; < : U := fx j; : j g; : (.7) To formulate our results, we eed a suitable class of Erd}os weights from [8] : Deitio.. Let W := exp ( Q) ; where Q : R R is eve, cotiuous, Q exists i (; ) ; Q (j) i (; ) ; j = ; ; Q () > i (; ) ad the fuctio T (x) := + xq (x) Q (.8) (x)
5 is icreasig i (; ) with lim x T (x) = ; T + := Moreover, we assume that for some C j > ; j 3; ad for every " > ; The, we write W E: C T (x) xq (x) Q(x) lim T (x) > : (.9) x + C ; x C 3 (.) T (x) = O ((Q(x)) " ) ; x : (.) The priciple examples of W E are W k; ad W ;B give by (:) ad (:) respectively. For more o this subject we refer the reader to [; 3; ; 8]: To state our results, we eed some more otatio: We eed the Mhaskar-Rakhmaov-Sumber a u deed as the positive root of the equatio u = Z a u tq (a u t) dt p ; u > : (.) t Here, a u exists ad is a strictly icreasig fuctio of u [8; 9] : mogst its uses is the iite-ite rage iequality kp W k L (R) = kp W k L[ ;] ; P P ; (.3) Note that depeds oly o the degree of the polyomial P ad ot o P itself. Now choose y [ ; ] so that jp W (y )j = kp W k L (R) : (.) s W is eve, we may assume that y : We will show later that i fact y > ad is very \close" to : Fix y as above. Fially set := (T ( )) 3 ; ; (.5) 5
6 ad (x) := 8 >< >: max 8 < q : jxj ; q T () jxj ; ; jxj a +L : (.6) ( ) ; jxj Here, L > is xed, but large eough throughout. For more o these special sequeces of fuctios, we refer the reader to [5; 8] : Here ad throughout, 9 = = O (b ) ; b ad = o (b ) will mea respectively that there exist costats C j > ; j = ; ; 3; idepedet of ; such that b C ; C b C 3 ad lim a = : b Similar otatio will be used for fuctios ad sequeces of fuctios. Bouds for Lebesgue costats ad uiform covergece of Lagrage Iterpolatio for U ; : We begi our ivestigatio with the sequece of odes, U ; ; deed by (:7) : We prove: Theorem.. Let W E : The, uiformly for N ; k (W; U )k L (R) 6 T (a ) 6 : (.7) I particular, give " > ; there exists C > idepedet of such that k (W; U )k L (R) C 6 +" : We deduce: 6
7 Corollary.3. Let W E ad r : The there exists C j > j = ; idepedet of ad f so that for N, (a) k(f L [f; W; U ]) W k L (R) Here, C E [f] W; 6 T (a ) 6 C r; (f; W; ) 6 T (a ) 6 : (.8) r; (f; W; t) := sup <ht W r h (f) t (x) L (jxj(t)) + if k(f P ) W k P P L 5 (jxj(t)) ; t > r is the weighted modulus of smoothess of f, (t) := if a u : a u u t ; (.9) ad for a iterval J ad h > ; r h(f; x; J) := t (x) := jxj (t) + T ( (t)) ; x R; (.) 8 >< >: P ri= ( ) i f x + rh ih r ; x rh i J ; otherwise (b) Moreover, if f satises f (r) W L (R); the give " > ; 3 9 >= >; : Here C 3 > is idepedet of : k(f L [f; W; U ]) W k L (R) C 3 a r 6 T (a ) 6 (.) C 3 6 +" r : (.) Thus we ca esure uiform covergece for every r : 7
8 Remark. It is istructive at this poit to recall that for Q = Q k; of (:) ; T ( ) = ky j= log j : Moreover, i geeral, give " > ad ; T ( ) = O ( " ) : (See also (.7)). We thus observe that we may dispese with the T ( ) 6 o the right had side of (:7) by isertig a extra weightig factor ito the left had side of (:7) i the followig sese: Uder the hypotheses of Theorem :; we have uiformly for N ; (W; U ) jxj + T ( ) 6 L (R) This follows easily usig the proof of (:7) ad (:) : 6 : (.3) better behavig Lebesgue fuctio. We observe that although (:) yields uiform covergece for every r ; we ca substatially improve our results, by choosig our iterpolatio poits more carefully. For weights o the real lie, J. Szabados was the rst to exploit this idea ad may of the proofs i this sectio rely heavily o his ideas [] : Motivated by (:3) ad recallig the deitio of y i (:) ad U i (:7) ; we set: ad prove: V + := f y ; y g [ U ; ; Theorem.. Let W E: The uiformly for N ; k + (W; V + )k L log : (.) (R) 8
9 Thus, by addig two completely ew poits of iterpolatio, we ca achieve the much better order log i compariso to the order (T ( )) 6 that we obtaied merely usig the zeros of p : We deduce, Corollary.5. Let W E ad r : The there exists C j > j = ; idepedet of f ad so that for N ; (a) k(f L + [f; W; V + ]) W k L (R) C E [f] W; log C r; (f; W; ) log : (.5) (b) Moreover, if f satises f (r) W L (R) the, give " > ; Here C 3 > is idepedet of : k(f L [f; W; U ]) W k L (R) a r C 3 log (.6) C 3 r+" log : (.7) Remark. atural questio arises as to whether (:) holds (i a lower boud sese) for ay system of odes, at least for some Erd}os weight. This ad related questios will be cosidered i a future paper. Poitwise estimates for (W; U ): We preset poitwise estimates for (W; U ): We emphasize our results ad briey sketch their proofs i Sectio 5 as the argumets are straightforward, but rather legthy. Theorem.6. Let W E: (a) The for N ;there exists C > such that for jxj + L ; (W; U )(x) C [ + p jp W j (x) (.8) 33 jxj jxj + 55 : (x) 9
10 Moreover, we have uiformly for jxj x ; ad ; (W; U )(x) + p jp W j (x) (.9) 33 jxj jxj + 55 : (x) (b) Uiformly for N ad ( + L ) jxj ; (W; U )(x) p jp W j (x)[ + ]: (.3) (c) Uiformly for N ad jxj ; (W; U )(x) a 3 jp W j (x) [ + ]: (.3) jxj Structure of this paper. We close this sectio with some otatio ad remarks cocerig the structure of this paper. Throughout, C; C ; C ::: > will deote costats idepedet of ; x ad P P : The same symbol does ot ecessarily deote the same costat i dieret occurreces. We write C 6= C (L) to idicate that C is idepedet of L: This paper is orgaized as follows: I Sectio, we preset our techical lemmas. I Sectio 3, we preset the proofs of our upper bouds for (.7) ad (.). I Sectio, we prove Theorems. ad. ad Corollaries.3 ad.5. Fially i Sectio 5, we sketch briey the mai ideas i the proof of Theorem.6. Techical Lemmas Lemma.. Let W E ad set x ; := x ; ( ) ad x ;+ := x ; : (a) There exists > idepedet of ad L such that for ; x ; : (.)
11 (b) Uiformly for ad j ; x j; x j+; (x j; ) : (.) (c) Uiformly for ad < j ; ad ad (d) For ; jx j;j jx j+;j (.3) (x j; ) (x j+; ) : (.) sup jp W j (x) xr jxj a sup jp W j (x) 6 T (a ) xr 6 a (.5) : (.6) Proof: This is part of Lemma. of [5] : Now x i (:) : Lemma.. Let W E: (a) Give " > ad ; there exists C > idepedet of such that, C " ; T ( ) C " ad CT ( ) " : (.7) (b) Give < < ; we have uiformly for C; T ( ) T ( ) : (.8) (c) Uiformly for u (C; ); v [ u ; u] ; we have a u a v u v T ( ) : (.9) (d) Give m N ad N ; we have for every fp k g m k= P m W k= jp k j L (R) = m W k= jp k j L [ ;] : (.)
12 Moreover, give r > ; there exists C = C (r) > idepedet of ; m ad P k such that W jxj + T ( ) 6 m k= C W jp k j jxj + T ( ) L (R) 6 m k= jp k j L [ a r(+) ;a r(+) ] : (.) Proof. (a){(c) are part of Lemma.3 of [5] ; (:) follows as i Lemma of [] ad the (:) follows usig (:) ad the method of Lemma 3.3 i [3] : Our ext lemma establishes how \close" y is to : Lemma.3: Let W E; N ad y as i (:) : The, we have for some B > idepedet of ad L: ( B ) y (.) Proof. By (:5) ; (:6) ad the deitio of [see (:5)] ; there exist C j > ; j = ; such that The, this gives C a (T ( )) 6 jp (y )j W (y ) C a mi ( y ; ) : (.3) max y ; C 3 : (.) Now by the deitio of y ; we have clearly that y : Moreover, if y ( ) the (:) is satised with B = : Suppose the, that y < ( ): The (:) becomes y C
13 which agai implies (:) with B = C : Now, x B i (:) : Lemma.. Let W E: (a) Uiformly for ; j ad x R; jl j; (U )(x)j a 3 W (x j; ) jx j;j p (x) : (.5) x x j; (b) There exists C > such that uiformly for ; j ad x R; jl j; (U ) (x)w (x)j W (x j; ) C: (.6) (c) Uiformly for ad j ; a 3 (x j; ) jx j;j jp W j (x j; ) a jp W j (x j; ) jx j;j : (.7) (d) For ; j ad jxj ; there exists C > such that jp (x)j W (x) C a 3 (x) (x j; ) jx j;j jx x j; j : (.8) 3 5 Proof. (a), (b) ad (c) are (:3) ; (:) ad (:) resp i [5] : (d) is (:8) i [8] : Lemma.5. Let W E ad let l +;+ (V + ) ad l +;+ (V + ) be respectively the fudametal polyomials of degree + at the poits y ad -y : The there exists C > such for all x R; jl +;+ (V + )j (x) W (x) W (y ) C (.9) 3
14 ad jl +;+ (V + )j (x) W (x) W ( y ) C: (.) Proof. We prove (:9) : (:) is similar. First observe that l +;+ (V + ) (x) = p (x) (y + x) y p (y ) P + (.) ad satises l +;+ (V + ) (y ) = ; (.) l +;+ (V + ) (x j; ) = ; j (.3) ad l +;+ (V + ) ( y ) = : Observe that by (:) ; we may assume that jxj + : The by (:6) ; (:9) ; the deitio of y ; (:) ad (:) ; l +;+ (V + )W (x) W (y ) C W (x) jp (x)j jy + xj y jp (y )j W (y ) a 6 T ( ) 6 a C ( B ) a 6 T ( ) 6 C : We ext eed a lemma which gives a estimate of the distace betwee y ad jx j; j ; j : Lemma.6. Let W E: The for N ad uiformly for j ; we have jy jx j; jj jx j;j : (.)
15 Proof. We begi with our lower boud. We cosider two cases: Case : jx j; j ( L ) : Note that here, Moreover (:) implies jx j;j 3L : jx j;j 3L (.5) if L is large eough. Next observe that by (:) ad the deitio of [see (:6)] ; we have that (y ) T ( ) (B + L) : (.6) Now as Q ad jp j are both eve fuctios, the deitio of (:6) ; (:6) ; (:8) ; (:5) ad (:6) yield uiformly for j : jy jx j; jj C C Case : jx j; j ( L ) : Observe that if L is large eough, jy jx j; jj jx j;j jx j;j ( ( ) y ) : (.7) Now by (:) ; ( ( ) y ) " jx j;j # (.8) if jx j;j B + L : (.9) 5
16 But the it is easy to see that jx j; j ( L ) implies (:9) if L is large eough ad so we have (:8) : (:7) the becomes jy jx j; jj jx j;j ad we have our lower boud for this case as well. The upper boud is easier. We agai distiguish two cases: Case : jx j; j : Here, if L is large eough, we have by (:) ; jy jx j; jj L + jx j;j = jx j;j : Case : jx j; j ( + ) : Here if L is large eough, we have by (:) ad (:) ; jy jx j; jj B + x ; (B + ) " jx j;j # : The lemma is proved. Let us put x j; := x j; x j+;, j : We prove: Lemma.7: Let W E; N ; r > ad jxj a r : The there exists C j > j = ; such that for j ; (a) W (x) l j; (U ) (x) W (x j; ) C jx j;j jxj x j; jx x j; j : (.3) 6
17 (b) W (x) l j;+ (V + ) (x) W (x j; ) C jx j;j 3 jxj 3 x j; jx x j; j : (.3) Proof. We begi rst with (:3) : First ote that (:5) ad (:6) show that uiformly for ad x; The by (:3) ; jp (x)j W (x) C a W (x) l j; (U ) (x) W (x j; ) = W (x) jp (x)j W (x j; ) jp (x j; )j jx x j; j a C C jxj jxj + L W (x j; ) jp (x j; )j jx x j; j jx j;j by (:) ad (:7) : So we have (:3) : We ow proceed with (:3) : First observe that for j ; jxj l j;+ (V + ) (x) = y x y x j; x j; : (.3) jx x j; j : l j; (U ) (x) : (.33) Next, we claim that jy xj C 3 jxj : (.3) We cosider two cases: 7
18 Case : jxj : Here much as i the proof of Lemma.6, if L is large eough. Case : < jxj a r : Here, usig (:9) ; jy jxjj B + jxj C 3 jxj so that jxj a r C T ( ) C 5 jxj jy jxjj j y j + j jxjj C 6 jxj so (:3) is established. The (:) ; (:3), (:33) ad (:3) yield (:3) : 3 The Proofs of our Upper Bouds I this sectio we establish our upper bouds for (:7) ad (:) : Throughout we assume that W E; x R is xed ad x k(x); is that zero of p closest to x: We eed two lemmas. Lemma 3.. There exist M ad > with the followig properties: (a) If jxj h ; + L i the: 8
19 (i) fj : jj k (x)j g j : jx x j; j M (ii) x xk(x)k; (x) ; k = ; : (iii) (b) If jxj [ ( + L ); ); for all j : x x k(x)3; > M jx x j; j > M h i Proof. Suppose rst that x ; + L j ; we have jtj jx j;j x j; x j+; jx j;j by (:6) ; (:) ad (:) if L is large eough. We coclude usig (:6) ad (3:) that (x) : (3.) (x) : (3.) (x) (3.3) : Observe that if t [x j+; ; x j; ] ; x j; t jx j;j C (x j; ) (L ) (3.) (t) (x j; ) uiformly for j; ad t [x j+; ; x j; ] : (3.5) h i Now by deitio of x k(x); ; we must have x x k(x)+; ; x k(x); or x h i x k(x); ; x k(x) ; at least whe x x; : Usig (:3) h ad (:) if ecessary, i we may assume without loss of geerality that x x k(x)+; ; x k(x); : The by (:) ad (3:5) ; x x k(x); xk(x) ; x k(x)+; x k(x); C 9 (x) : (3.6)
20 Usig (3:6) ad (:) we see that it is possible to choose M such that (3:) holds at least whe x x ; : Suppose x x ; : We may the suppose that L is chose large eough such that x 3; L ad the jx x 3; j + L L (x) usig (:5) ad (:6) : Thus also i this case, it is possible to choose M such that (3:) holds. Parts (ii) ad (iii) of the lemma the follow similarly. Now x M ad i Lemma 3. ad put J := [x ; ; x ; ] h x k(x)+; x k(x) i (3.7) if jxj h ; + L i ad J := [x ; ; x ; ] (3.8) if jxj [ ( + L ; ): We modify the deitio i (3:7) accordigly if jxj x ; : We have the followig estimate. Lemma 3.. Uiformly for j ad N ; j= j =[k(x)+;k(x) ] x j; jx x j; j = 8 >< >: O (a ) ; < < O (log ) ; = O (x) ; > : 9 >= >; (3.9) Proof. First ote that if jxj + L ;we have uiformly for N ad j ; jx tj jx x j; j ; t [x j+; ; x j; ] ; j = [k (x) + ; k (x) ] : (3.)
21 This follows much as i [3] usig Lemma 3: (a) ad (:) sice, x t x x j; = t x j; x x j; x j; x j+; x x j; C ad similarly we ca boud x x j; x t : The, from (:) ad the deitio of J i (3:7) ; we obtai j= j =[k(x)+;k(x) ] = 8 >< >: x j; jx x j; j = O O (a ) ; < < O (log ) ; = O (x) > : Z jtja(+) tj 9 >= >; : dt jx tj The case for jxj + L is similar but easier. We may ow proceed with the proofs of our upper bouds. We begi with: The Proof of the Upper boud i (.7). From (:3) we have for j ; W (x) l j; (U ) (x) W (x j; ) jx j;j Thus, by (:6) ad usig the above, we have (W; U ) (x) = j= j[k(x)+;k(x) ] + C j =[k(x)+;k(x) ] + L jxj + L W (x) jl j; (U ) (x)j W (x j; ) W (x) jl j; (U ) (x)j W (x j; jx j;j + L jxj + L x j; jx x j; j : x j; jx x j; j : (3.)
22 First observe that we may write jx j;j jxj + L + L + jx x j; j jxj + L : (3.) Next we observe that usig (:) ; we may assume without loss of geerality that jxj : The (3:) becomes usig the deitio of ; [see (:5)] jx j;j jxj + L + L = O () + 6 T ( ) 6 jx xj; j Thus usig (:6) ; (3:9) ad (3:3) ; we ow rewrite (3:) as, (W; U ) (x) ad so we have takig sups, as required. We ow preset, j[k(x)+;k(x) ] + a j =[k(x)+;k(x) ] x j; + O jx x j =[k(x)+;k(x) ] j; j = O () + O (log ) + O 6 T (a ) 6 = O 6 T (a ) 6 k (W; U )k L (R) = O 6 T (a ) 6 The Proof of our Upper boud i (.). Firstly, from (:3) we have for j ; W (x) l j;+ (V + ) (x) W (x j; ) jx j;j 3 + L jxj + L : (3.3) 6 T ( ) 6 xj; a jx x j; j 3 (3.) (3.5) x j; jx x j; j : (3.6)
23 Thus by (:6), (:9), (:) ad (3:6) ; we have + (W; V + ) (x) O () + + C = O () + j= j[k(x)+;k(x) ] j= j =[k(x)+;k(x) ] (x) W (x) jl j;+ (V + ) (x)j W (x j; ) jx j;j + L jxj + L 3 x j; jx x j; j (3.7) (x) (3.8) where ad (x) := (x) := C j= j[k(x)+;k(x) ] j= j =[k(x)+;k(x) ] W (x) jl j;+ (V + ) (x)j W (x j; jx j;j + L jxj + L 3 x j; jx x j; j : We observe that usig (:) ; we may assume without loss of geerality that jxj + : We begi with the estimatio of P (x) : Note, that by (:) ; (:33) ad (:3) ; (x) = = O j= j[k(x)+;k(x) ] j= j[k(x)+;k(x) ] y x y x W (x) jl j;(u ) (x)j W (x j; ) jxj jx j;j + L + L W (x) jl j; (U ) (x)j W (x j; ) : 3 (3.9)
24 Next, usig (:) ; (:) ad (:) ; it is easy to see that if L is large eough, we have uiformly for x ad j [k (x) + ; k (x) ] ; so that by (:6) : (x) = jxj jx j;j j= j[k(x)+;k(x) ] + L + L W (x) jl j; (U ) (x)j W (x j; ) = O () (3.) We ow tur to the delicate estimatio of P (x) : Much as i (3:) ;we observe that for j we jxj jx j;j + L + L 3 + The, usig (3:) ; we may write where, (x) = O js x j; jx x j; j + js a 3 jx x j; j jx x j; j 3 a 3 jx j; j 3 + L x j; S = fj : j ; j = [k (x) + ; k (x) ]g ; = O (log ) + O by (3.9) = O (log ) + js x j; C : (3.) jx j; j 3 + L jx x j; j (ja jx j; jj + L ) 3 js jx j; j( ) x j; jx x j; j (a jx j; j) 3 C C
25 + O js jx j; j>( ) x j; T ( ) jx x j; j a 3 C : (3.) Next, usig the Geometric ad rithmetic mea iequality ad (3:9) agai, we may cotiue (3:) as (x) = O (log ) + O B js jx j; j( ) + O T ( ) a 3 = O (log ) + O x j; C jx x j; j + O js jx j; j>( ) js jx j; j>( ) C x j; jx x j; j js jx j; j( ) C x j; jx j; j C (3.3) where i the last lie we used (:5) ; (:6) ; (:) ad (:) : Now it remais to observe that the spacig (:) ad (:6) ; imply that there exist at most ite umber of j such that jx j; j > ( ) : The (3:) yields, (x) = O (log ) + O () = O (log ) : (3.) Combiig (3:3) with (3:9) ad takig sups yields as required. k + (W; V + )k L = O (log ) (3.5) (R) The Proofs of Theorems. ad. ad Corollaries.3 ad.5. I this sectio we preset the proofs of our lower bouds i (:7) ad (:) : We deduce Theorems. ad. ad Corollaries.3 ad.5. 5
26 We begi with, The Proof of our lower boud i (.7). Write (W; U ) (x) = W (x) jp (x)j j= p (x j; ) W (x j; ) jx x j; j : (.) I particular, (:) becomes usig (:6) ; (:9) ; (:) ad (:7) ; (W; U ) (y ) C x j; a C 5 6 T (a ) 6 a a 6 T ( ) 6 jx j; j x j; a : (.) Now it remais to observe that the spacig (:) ad (:6) imply that there exist C 3 j such that x j; [; a ]: The (:) becomes so that as required. (W; U ) (y ) C 6 T (a ) 6 k (W; U )k L (R) (W; U ) (y ) C 5 6 T (a ) 6 ; (.3) We ow tur to the proof of our lower boud (:) : Here a choice of x = y is ot suciet to achieve our lower boud ad we eed to proceed more carefully. Ideed, we will show that the poit we eed sits \far" away from : The Proof of our lower boud for (.). First we claim that there exists y R satisfyig jyj ; for some < < ad uiformly for ; a p W (y) : (.) 6
27 To see this, observe rst that if < < is give, the by (:6) ; (:) ad (:9) ; there exists > C j, j + such that jx j;+ j [; ]. Now choose y = y = x k;+ for some k + such that jy j [; ]. The (:9) ad (:7) give a jp W j (y ) ad (:) is established. Fix y as above. We ow proceed as follows. Sice y < cy ; for some < c < ; we have by (:9) ; (:) ; (:33) ad (:) ; + (W; V + ) (y ) Thus, j= C W (y ) W (x j; ) y y y j= W (y ) W (x j; ) l j; (U ) (y ) l j; (U ) (y ) C (W; U ) (y ) C 3 a jp W j (y ) log C log : ad we have proved our lower boud. We may ow preset: k + (W; V + )k L (R) C log (.5) The Proof of Theorem.. This follows immediately from (3:5) ad (:3) The Proof of Corollary.3: (:8) follows from the represetatio (:6) ; (:7) ad Theorem : of [] : (:) ad (:) follow from (:8) ;Corollary :7 of [3] ad (:7) : The Proof of Theorem.. This follows immediately from (3:) ad (:5) : The Proof of Corollary.5. (:5) follows from the represetatio (:6) ; (:) ad Theorem : of [] : (:6) ad (:7) follow from (:5) ;Corollary :7 of [3] ad (:7) : 7
28 5 Poitwise estimates of (W;U ) I this sectio, we sketch briey the proof of Theorem :6: Fix x; x k(x); ; M; ad J as i Sectio 3: Step : ad Set S := Now write: ( S := ( j : j ; jx x j; j j : j ; S 3 := ) (x) ; (x) jx x j; j M j : j ; jx x j; j > M (U ; W ) (x) := js (x) + js (x) + (x) : js 3 (x) : ) (x) Step : Estimatio of P js (x) ad P js (x). First observe that it suces to estimate the above sums for x h ; + L for they are idetically zero outside this rage of x: Moreover, recall that we may assume by symmetry that x > : The the followig holds: Lemma 5.. Let W E. (a) There exists C such that uiformly for ad x h ; + L i, js (x) C : (5.) Moreover, uiformly for ad x [; x ; ] ; js (x) : (5.) 8 i
29 (b) Uiformly for x h ; + L i ad N ; js (x) p jp W j (x) jxj : (5.3) Proof. First ote that (:6) gives js (x) = W (x) jl j; (U ) (x)j W (x j; ) js C C js for some C > idepedet of x ad as the above sum is ite. For the lower sum, we use the weighted Erd}os-Tura iequality (see for example [5]) ; l j; (U ) (x) W (x) W (x j; ) + l j+; (U ) (x) W (x) W (x j+; ) (5.) valid for ; j ad x [x j+; ; x j; ] : If x x ; ;we may assume without loss of geerality that x h x k(x)+; ; x k(x); i : The (5:) gives js (x) W (x) Thus (5:) ad (5:) follow. k(x)+ j=k(x) l j; (U ) (x) W (x j; ) C : It remais to show (5:3) : Here we rst observe that by (:) we have uiformly for j S ; (x j; ) jx j; x j; j jx x j; j : (5.5) The (:5) ad (5:5) easily yield js (x) p jp W j (x) jxj 9
30 as required. Prelimiary estimatio of P js 3 (x): Lemma 5.. Let W E. (a) If jxj ;we have uiformly for x ad N ; js 3 (x) p p W (x) Z jtja(+) tj jtj jx tj (b) If jxj ;we have uiformly for x ad N ; js 3 (x) p a p W (x) jxj Z jtja(+) tj dt: (5.6) jtj dt: (5.7) h Proof. We cosider the case x ; + L i ad x x; : The other cases are similar. By (:) ad (:5) ; Z xj; jx j; j js 3 (x) p p W (x) j[;][k(x)+;k(x) ] x j+; jx x j; j The much as i (3:) ; (5:8) readily yields (5:6) for this case. dt: (5.8) Step : Estimatio of J := Z jtja(+) tj jtj dt: We ow record the followig techical estimate for J : h i Lemma 5.3. Let W E ad suppose that x ; + L uiformly for x ad N ; J jxj jxj 3 : The + : (5.9) (x)
31 Step 5: The Proof of Theorem.6. Observe that for jxj + L jxj (x) ; > if L is large eough. The (5:) ; (5:) ; (5:3) ad (5:9) yield the result for this case. Theorem.6 (b) ad (c) are similar but easier. 6 ckowledgemet The author would like to thak J. Szabados for allowig him the use of the preprit [] : The author also thaks the referees for their useful commets with regard to the presetatio of this paper. Refereces [] S. S. Boa, Weighted Mea Covergece of Lagrage Iterpolatio, Ph.D. Thesis, Ohio State Uiversity, Columbus, Ohio, 98. [] S. B. Dameli, Smoothess theorems for Erd}os weights II, submitted to Joural of pproximatio Theory. [3] S. B. Dameli, Coverse ad smoothess theorems for Erd}os weights i L p ( < p ); submitted to Joural of pproximatio Theory. [] S. B. Dameli ad D. S. Lubisky, Jackso theorems for Erd}os weights i L p ( < p ) ; submitted to Joural of pproximatio Theory. [5] S. B. Dameli ad D. S. Lubisky, Necessary ad suciet coditios for mea covergece of Lagrage iterpolatio for Erd}os weights, Caad. Math. J., (996) ;
32 [6] G. Freud, Lagragesche iterpolatio uber die ullstelle der Hermitesche orthogoalpolyome, Studia Sci. Math, Hugar. (969), [7]. Kopmacher, \Liear operators ad Christoel fuctios associated with Orthogoal polyomials", Ph.D. thesis, Uiversity of the Witwatersrad, Johaesburg, 985. [8]. L. Levi, D. S. Lubisky ad T. Z. Mthembu, Christoel fuctios ad orthogoal polyomials for Erd}os weights o ( ; ), Redicoti di Matematica e delle sue pplicazioi (di Roma), (99), 99{89. [9] D. S. Lubisky, Ideas of Weighted polyomial approximatio o ( ; ) ; Proc. Eighth Texas Symposium o pproximatio Theory, eds.(chui et al), World Scietic, Sigapore, (995) : [] D. Matjila, Lagrage Iterpolatio for Freud weights, Ph.D. Thesis, Uiversity of the Witwatersrad, 993. [] D. M. Matjila, Bouds for Lebesgue fuctios for Freud weights, Joural of pproximatio Theory, 79 (99), [] P. Nevai, Lagrage iterpolatio at the zeros of Laugerre polyomials, Mat. Lapok., (97) ; 9 6: [3] P. Nevai, Fourier Series ad iterpolatio II, Mat. Lapok (973), 9-6. [] J. Szabados, \Weighted Lagrage iterpolatio ad Hermite-Fejer iterpolatio o the real lie", Preprit. [5] J. Szabados ad P. Vertesi, Iterpolatio of Fuctios, World Scietic, Sigapore, 99. S. B. Dameli, Departmet of Mathematics, 3
33 Uiversity of the Witwatersrad, PO Wits 5, South frica. 33
where x R ad W is a xed weight fuctio. Frequetly, the fuctio I[f; ] is called the Hilbert trasform of W f. We assume the weight fuctio W to be of Freu
Iterpolatory Product Quadratures for Cauchy Pricipal Value Itegrals with Freud Weights S. B. Dameli Ceter for Applicable Aalysis ad Number Theory, Uiversity of the Witwatersrad, P. O. Wits 050, Republic
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationMarcinkiwiecz-Zygmund Type Inequalities for all Arcs of the Circle
Marcikiwiecz-ygmud Type Iequalities for all Arcs of the Circle C.K. Kobidarajah ad D. S. Lubisky Mathematics Departmet, Easter Uiversity, Chekalady, Sri Laka; Mathematics Departmet, Georgia Istitute of
More informationThe Degree of Shape Preserving Weighted Polynomial Approximation
The Degree of Shape Preservig eighted Polyomial Approximatio Day Leviata School of Mathematical Scieces, Tel Aviv Uiversity, Tel Aviv, Israel Doro S Lubisky School of Mathematics, Georgia Istitute of Techology,
More informationON RECURRENCE COEFFICIENTS FOR RAPIDLY DECREASING EXPONENTIAL WEIGHTS
ON RECURRENCE COEFFICIENTS FOR RAPIDLY DECREASING EXPONENTIAL WEIGHTS E. LEVIN, D. S. LUBINSKY Abstract. Let, for example, W (x) = exp exp k x, x [ ] where > 0, k ad exp k = exp (exp ( exp ())) deotes
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More information. Prelimiaries ad otatios Let f C q [ 1 1] be give, where q 0. The for a xed r such that q < r q + 1 we dee a polyomial H r f of degree at most + r 1
Poitwise Gopegauz Estimates for Iterpolatio T. Kilgore ad J. Presti Abstract We derive some ew poitwise estimates for the error i simultaeous approximatio of a fuctio f C q [ 1 1] ad its derivatives by
More informationTR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT
TR/46 OCTOBER 974 THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION by A. TALBOT .. Itroductio. A problem i approximatio theory o which I have recetly worked [] required for its solutio a proof that the
More informationMath Solutions to homework 6
Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there
More informationMa 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5
Ma 42: Itroductio to Lebesgue Itegratio Solutios to Homework Assigmet 5 Prof. Wickerhauser Due Thursday, April th, 23 Please retur your solutios to the istructor by the ed of class o the due date. You
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationRandom Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.
Radom Walks o Discrete ad Cotiuous Circles by Jeffrey S. Rosethal School of Mathematics, Uiversity of Miesota, Mieapolis, MN, U.S.A. 55455 (Appeared i Joural of Applied Probability 30 (1993), 780 789.)
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationAn Interpolation Process on Laguerre Polynomial
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 10 (2017), pp. 7089-7099 Research Idia Publicatios http://www.ripublicatio.com A Iterpolatio Process o Laguerre Polyomial
More informationWeek 10. f2 j=2 2 j k ; j; k 2 Zg is an orthonormal basis for L 2 (R). This function is called mother wavelet, which can be often constructed
Wee 0 A Itroductio to Wavelet regressio. De itio: Wavelet is a fuctio such that f j= j ; j; Zg is a orthoormal basis for L (R). This fuctio is called mother wavelet, which ca be ofte costructed from father
More informationUniversity of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!
Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad
More informationA Proof of Birkhoff s Ergodic Theorem
A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed
More informationFall 2013 MTH431/531 Real analysis Section Notes
Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters
More informationMath 113, Calculus II Winter 2007 Final Exam Solutions
Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this
More informationSelf-normalized deviation inequalities with application to t-statistic
Self-ormalized deviatio iequalities with applicatio to t-statistic Xiequa Fa Ceter for Applied Mathematics, Tiaji Uiversity, 30007 Tiaji, Chia Abstract Let ξ i i 1 be a sequece of idepedet ad symmetric
More informationRandomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)
Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black
More informationApproximation theorems for localized szász Mirakjan operators
Joural of Approximatio Theory 152 (2008) 125 134 www.elsevier.com/locate/jat Approximatio theorems for localized szász Miraja operators Lise Xie a,,1, Tigfa Xie b a Departmet of Mathematics, Lishui Uiversity,
More informationSmallest Eigenvalues of Hankel Matrices for Exponential Weights
Smallest Eigevalues of Hakel Matrices for Expoetial Weights Y. Che ad D.S. Lubisky Departmet of Mathematics Imperial College 8 Quee s Gate Lodo SW7 B Eglad y.che@ic.ac.uk The School of Mathematics Georgia
More informationIntegrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number
MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios
More informationINFINITE SEQUENCES AND SERIES
INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationRiemann Sums y = f (x)
Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, o-egative fuctio o the closed iterval [a, b] Fid
More information2 Banach spaces and Hilbert spaces
2 Baach spaces ad Hilbert spaces Tryig to do aalysis i the ratioal umbers is difficult for example cosider the set {x Q : x 2 2}. This set is o-empty ad bouded above but does ot have a least upper boud
More informationMath 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions
Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x
More informationApplication to Random Graphs
A Applicatio to Radom Graphs Brachig processes have a umber of iterestig ad importat applicatios. We shall cosider oe of the most famous of them, the Erdős-Réyi radom graph theory. 1 Defiitio A.1. Let
More informationLimit distributions for products of sums
Statistics & Probability Letters 62 (23) 93 Limit distributios for products of sums Yogcheg Qi Departmet of Mathematics ad Statistics, Uiversity of Miesota-Duluth, Campus Ceter 4, 7 Uiversity Drive, Duluth,
More informationThe log-behavior of n p(n) and n p(n)/n
Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity
More informationAssignment 5: Solutions
McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece
More informationA collocation method for singular integral equations with cosecant kernel via Semi-trigonometric interpolation
Iteratioal Joural of Mathematics Research. ISSN 0976-5840 Volume 9 Number 1 (017) pp. 45-51 Iteratioal Research Publicatio House http://www.irphouse.com A collocatio method for sigular itegral equatios
More informationMath 2784 (or 2794W) University of Connecticut
ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really
More informationOn polynomial and barycentric interpolations
Special Issue for the 10 years of the Padua poits, Volume 8 2015 Pages 17 22 O polyomial ad barycetric iterpolatios László Szili a Péter Vértesi b Abstract The preset survey collects some recet results
More informationLecture 3 The Lebesgue Integral
Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified
More informationWeighted Approximation by Videnskii and Lupas Operators
Weighted Approximatio by Videsii ad Lupas Operators Aif Barbaros Dime İstabul Uiversity Departmet of Egieerig Sciece April 5, 013 Aif Barbaros Dime İstabul Uiversity Departmet Weightedof Approximatio Egieerig
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More informationMATH4822E FOURIER ANALYSIS AND ITS APPLICATIONS
MATH48E FOURIER ANALYSIS AND ITS APPLICATIONS 7.. Cesàro summability. 7. Summability methods Arithmetic meas. The followig idea is due to the Italia geometer Eresto Cesàro (859-96). He shows that eve if
More information1 Approximating Integrals using Taylor Polynomials
Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................
More informationVECTOR SEMINORMS, SPACES WITH VECTOR NORM, AND REGULAR OPERATORS
Dedicated to Professor Philippe G. Ciarlet o his 70th birthday VECTOR SEMINORMS, SPACES WITH VECTOR NORM, AND REGULAR OPERATORS ROMULUS CRISTESCU The rst sectio of this paper deals with the properties
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationarxiv: v1 [math.fa] 3 Apr 2016
Aticommutator Norm Formula for Proectio Operators arxiv:164.699v1 math.fa] 3 Apr 16 Sam Walters Uiversity of Norther British Columbia ABSTRACT. We prove that for ay two proectio operators f, g o Hilbert
More informationf n (x) f m (x) < ɛ/3 for all x A. By continuity of f n and f m we can find δ > 0 such that d(x, x 0 ) < δ implies that
Lecture 15 We have see that a sequece of cotiuous fuctios which is uiformly coverget produces a limit fuctio which is also cotiuous. We shall stregthe this result ow. Theorem 1 Let f : X R or (C) be a
More information1 Convergence in Probability and the Weak Law of Large Numbers
36-752 Advaced Probability Overview Sprig 2018 8. Covergece Cocepts: i Probability, i L p ad Almost Surely Istructor: Alessadro Rialdo Associated readig: Sec 2.4, 2.5, ad 4.11 of Ash ad Doléas-Dade; Sec
More information1+x 1 + α+x. x = 2(α x2 ) 1+x
Math 2030 Homework 6 Solutios # [Problem 5] For coveiece we let α lim sup a ad β lim sup b. Without loss of geerality let us assume that α β. If α the by assumptio β < so i this case α + β. By Theorem
More informationMiskolc Mathematical Notes HU e-issn Uniform approximation by means of some piecewise linear functions. Zoltán Finta
Miskolc Mathematical Notes HU e-issn 787-43 Vol. 3 (00, No, pp. 0- DOI: 0.854/MMN.00.56 Uiform approimatio by meas of some piecewise liear fuctios Zoltá Fita Mathematical Notes, Miskolc, Vol. 3., No..,
More informationESAIM: Probability and Statistics October 1996, Vol. 1, pp A NOTE ON `BIG-MATCH'
ESAIM: Probability ad Statistics October 996, Vol., pp. 89-93 A NOTE ON `BIG-MATCH' JEAN-MICHEL COULOMB Abstract. We preset a very simple proof of the existece of the value for `Big Match' rst show by
More informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
More informationA Note on the Kolmogorov-Feller Weak Law of Large Numbers
Joural of Mathematical Research with Applicatios Mar., 015, Vol. 35, No., pp. 3 8 DOI:10.3770/j.iss:095-651.015.0.013 Http://jmre.dlut.edu.c A Note o the Kolmogorov-Feller Weak Law of Large Numbers Yachu
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationPrecise Rates in Complete Moment Convergence for Negatively Associated Sequences
Commuicatios of the Korea Statistical Society 29, Vol. 16, No. 5, 841 849 Precise Rates i Complete Momet Covergece for Negatively Associated Sequeces Dae-Hee Ryu 1,a a Departmet of Computer Sciece, ChugWoo
More informationMATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and
MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f
More informationZ ß cos x + si x R du We start with the substitutio u = si(x), so du = cos(x). The itegral becomes but +u we should chage the limits to go with the ew
Problem ( poits) Evaluate the itegrals Z p x 9 x We ca draw a right triagle labeled this way x p x 9 From this we ca read off x = sec, so = sec ta, ad p x 9 = R ta. Puttig those pieces ito the itegralrwe
More informationMAS111 Convergence and Continuity
MAS Covergece ad Cotiuity Key Objectives At the ed of the course, studets should kow the followig topics ad be able to apply the basic priciples ad theorems therei to solvig various problems cocerig covergece
More informationRiesz-Fischer Sequences and Lower Frame Bounds
Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.
More informationThe natural exponential function
The atural expoetial fuctio Attila Máté Brookly College of the City Uiversity of New York December, 205 Cotets The atural expoetial fuctio for real x. Beroulli s iequality.....................................2
More informationTauberian theorems for the product of Borel and Hölder summability methods
A. Ştiiţ. Uiv. Al. I. Cuza Iaşi. Mat. (N.S.) Tomul LXIII, 2017, f. 1 Tauberia theorems for the product of Borel ad Hölder summability methods İbrahim Çaak Received: Received: 17.X.2012 / Revised: 5.XI.2012
More informationREAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS
REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai
More informationMath 341 Lecture #31 6.5: Power Series
Math 341 Lecture #31 6.5: Power Series We ow tur our attetio to a particular kid of series of fuctios, amely, power series, f(x = a x = a 0 + a 1 x + a 2 x 2 + where a R for all N. I terms of a series
More informationMath 312 Lecture Notes One Dimensional Maps
Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,
More informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS
More informationPhysics 116A Solutions to Homework Set #1 Winter Boas, problem Use equation 1.8 to find a fraction describing
Physics 6A Solutios to Homework Set # Witer 0. Boas, problem. 8 Use equatio.8 to fid a fractio describig 0.694444444... Start with the formula S = a, ad otice that we ca remove ay umber of r fiite decimals
More informationOn Random Line Segments in the Unit Square
O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,
More informationy X F n (y), To see this, let y Y and apply property (ii) to find a sequence {y n } X such that y n y and lim sup F n (y n ) F (y).
Modica Mortola Fuctioal 2 Γ-Covergece Let X, d) be a metric space ad cosider a sequece {F } of fuctioals F : X [, ]. We say that {F } Γ-coverges to a fuctioal F : X [, ] if the followig properties hold:
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics ad Egieerig Lecture otes Sergei V. Shabaov Departmet of Mathematics, Uiversity of Florida, Gaiesville, FL 326 USA CHAPTER The theory of covergece. Numerical sequeces..
More informationCouncil for Innovative Research
ABSTRACT ON ABEL CONVERGENT SERIES OF FUNCTIONS ERDAL GÜL AND MEHMET ALBAYRAK Yildiz Techical Uiversity, Departmet of Mathematics, 34210 Eseler, Istabul egul34@gmail.com mehmetalbayrak12@gmail.com I this
More informationInternational Journal of Mathematical Archive-3(4), 2012, Page: Available online through ISSN
Iteratioal Joural of Mathematical Archive-3(4,, Page: 544-553 Available olie through www.ima.ifo ISSN 9 546 INEQUALITIES CONCERNING THE B-OPERATORS N. A. Rather, S. H. Ahager ad M. A. Shah* P. G. Departmet
More informationPlease do NOT write in this box. Multiple Choice. Total
Istructor: Math 0560, Worksheet Alteratig Series Jauary, 3000 For realistic exam practice solve these problems without lookig at your book ad without usig a calculator. Multiple choice questios should
More informationDirichlet s Theorem on Arithmetic Progressions
Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty
More informationsin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =
60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece
More informationNotes 19 : Martingale CLT
Notes 9 : Martigale CLT Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: [Bil95, Chapter 35], [Roc, Chapter 3]. Sice we have ot ecoutered weak covergece i some time, we first recall
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationDANIELL AND RIEMANN INTEGRABILITY
DANIELL AND RIEMANN INTEGRABILITY ILEANA BUCUR We itroduce the otio of Riema itegrable fuctio with respect to a Daiell itegral ad prove the approximatio theorem of such fuctios by a mootoe sequece of Jorda
More informationMath 508 Exam 2 Jerry L. Kazdan December 9, :00 10:20
Math 58 Eam 2 Jerry L. Kazda December 9, 24 9: :2 Directios This eam has three parts. Part A has 8 True/False questio (2 poits each so total 6 poits), Part B has 5 shorter problems (6 poits each, so 3
More informationAppendix to Quicksort Asymptotics
Appedix to Quicksort Asymptotics James Alle Fill Departmet of Mathematical Scieces The Johs Hopkis Uiversity jimfill@jhu.edu ad http://www.mts.jhu.edu/~fill/ ad Svate Jaso Departmet of Mathematics Uppsala
More informationJournal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula
Joural of Multivariate Aalysis 102 (2011) 1315 1319 Cotets lists available at ScieceDirect Joural of Multivariate Aalysis joural homepage: www.elsevier.com/locate/jmva Superefficiet estimatio of the margials
More informationOrthogonal Dirichlet Polynomials with Arctangent Density
Orthogoal Dirichlet Polyomials with Arctaget Desity Doro S. Lubisky School of Mathematics, Georgia Istitute of Techology, Atlata, GA 3033-060 USA. Abstract Let { j } j= be a strictly icreasig sequece of
More informationSection 11.8: Power Series
Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i
More informationOn the behavior at infinity of an integrable function
O the behavior at ifiity of a itegrable fuctio Emmauel Lesige To cite this versio: Emmauel Lesige. O the behavior at ifiity of a itegrable fuctio. The America Mathematical Mothly, 200, 7 (2), pp.75-8.
More informationSOLUTIONS TO EXAM 3. Solution: Note that this defines two convergent geometric series with respective radii r 1 = 2/5 < 1 and r 2 = 1/5 < 1.
SOLUTIONS TO EXAM 3 Problem Fid the sum of the followig series 2 + ( ) 5 5 2 5 3 25 2 2 This series diverges Solutio: Note that this defies two coverget geometric series with respective radii r 2/5 < ad
More informationON BLEIMANN, BUTZER AND HAHN TYPE GENERALIZATION OF BALÁZS OPERATORS
STUDIA UNIV. BABEŞ BOLYAI, MATHEMATICA, Volume XLVII, Number 4, December 2002 ON BLEIMANN, BUTZER AND HAHN TYPE GENERALIZATION OF BALÁZS OPERATORS OGÜN DOĞRU Dedicated to Professor D.D. Stacu o his 75
More informationAPPROXIMATION BY BERNSTEIN-CHLODOWSKY POLYNOMIALS
Hacettepe Joural of Mathematics ad Statistics Volume 32 (2003), 1 5 APPROXIMATION BY BERNSTEIN-CHLODOWSKY POLYNOMIALS E. İbili Received 27/06/2002 : Accepted 17/03/2003 Abstract The weighted approximatio
More informationLecture 10 October Minimaxity and least favorable prior sequences
STATS 300A: Theory of Statistics Fall 205 Lecture 0 October 22 Lecturer: Lester Mackey Scribe: Brya He, Rahul Makhijai Warig: These otes may cotai factual ad/or typographic errors. 0. Miimaxity ad least
More informationMATH 312 Midterm I(Spring 2015)
MATH 3 Midterm I(Sprig 05) Istructor: Xiaowei Wag Feb 3rd, :30pm-3:50pm, 05 Problem (0 poits). Test for covergece:.. 3.. p, p 0. (coverges for p < ad diverges for p by ratio test.). ( coverges, sice (log
More informationLocal Approximation Properties for certain King type Operators
Filomat 27:1 (2013, 173 181 DOI 102298/FIL1301173O Published by Faculty of Scieces ad athematics, Uiversity of Niš, Serbia Available at: http://wwwpmfiacrs/filomat Local Approimatio Properties for certai
More informationMDIV. Multiple divisor functions
MDIV. Multiple divisor fuctios The fuctios τ k For k, defie τ k ( to be the umber of (ordered factorisatios of ito k factors, i other words, the umber of ordered k-tuples (j, j 2,..., j k with j j 2...
More information7 Sequences of real numbers
40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are
More informationAdditional Notes on Power Series
Additioal Notes o Power Series Mauela Girotti MATH 37-0 Advaced Calculus of oe variable Cotets Quick recall 2 Abel s Theorem 2 3 Differetiatio ad Itegratio of Power series 4 Quick recall We recall here
More informationIt is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.
Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable
More informationExponential Functions and Taylor Series
MATH 4530: Aalysis Oe Expoetial Fuctios ad Taylor Series James K. Peterso Departmet of Biological Scieces ad Departmet of Mathematical Scieces Clemso Uiversity March 29, 2017 MATH 4530: Aalysis Oe Outlie
More informationSeries III. Chapter Alternating Series
Chapter 9 Series III With the exceptio of the Null Sequece Test, all the tests for series covergece ad divergece that we have cosidered so far have dealt oly with series of oegative terms. Series with
More information5. Likelihood Ratio Tests
1 of 5 7/29/2009 3:16 PM Virtual Laboratories > 9. Hy pothesis Testig > 1 2 3 4 5 6 7 5. Likelihood Ratio Tests Prelimiaries As usual, our startig poit is a radom experimet with a uderlyig sample space,
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More information