• Sonuç bulunamadı

Averaged modulus of smoothness and two-sided monotone approximation in Orlicz spaces

N/A
N/A
Protected

Academic year: 2021

Share "Averaged modulus of smoothness and two-sided monotone approximation in Orlicz spaces"

Copied!
12
0
0

Yükleniyor.... (view fulltext now)

Tam metin

(1)

Volume 47 (5) (2018), 1108  1119

Averaged modulus of smoothness and two-sided

monotone approximation in Orlicz spaces

Hüseyin Koç∗†and Ramazan Akgün

Abstract

The paper deals with basic properties of averaged modulus of smooth-ness in Orlicz spaces L∗

ϕ. Some direct and inverse two-sided

approxima-tion problems in L∗

ϕ are proved. In the last section, some inequalities

concerning monotone two sided approximation by trigonometric poly-nomials in L∗

ϕ are considered.

Keywords: Orlicz spaces, Averaged modulus of smoothness.

Mathematics Subject Classication (2010): Primary 46E30; Secondary 42A05, 41A17.

Received : 19.08.2016 Accepted : 19.06.2017 Doi : 10.15672/HJMS.2017.480

1. Introduction

The problems of approximation by trigonometric or algebraic polynomials in classical Orlicz spaces were investigated by several mathematicians. In 1966, Tsyganok [26] ob-tained the Jackson type inequality of trigonometric approximation. In 1965, Kokilashvili [17] obtained inverse theorems of trigonometric approximation. In 1966, Ponomarenko [20] proved some direct theorem of trigonometric approximation by summation means of Fourier series. In 1968, Cohen [9] proved some direct theorem of trigonometric approxi-mation by its partial sum of Fourier series. In Orlicz spaces when the generating Young function satisfying quasiconvexity condition similar problems were investigated by Akgün, Isralov, Jafarov, Koç, Ramazanov and others [1, 2, 3, 5, 4, 11, 14, 15, 12, 13, 16, 21].

On the other hand, monotone approximation of functions by trigonometric polynomi-als [23] and Jackson type theorems for monotone approximation of functions by trigono-metric polynomials in the classical Lebesgue spaces Lp [25] were proved by Shadrin.

Ganelius [10], Babenko and Ligun [8], Sadrin [23] proved theorems about one sided ap-proximation by trigonometric polynomials for functions in Lp-metric.

Ministry of national education of Republic of Turkey, Balkesir, Turkey, Email : huseyinkoc79@yahoo.com

Corresponding Author.

Balikesir University, Faculty of Arts and and Sciences, Department of Mathematics, Ça§³ Yerle³kesi, 10145, Balkesir, Turkey, Email: rakgun@balikesir.edu.tr

(2)

In this paper rstly we give basic properties of averaged modulus of smoothness in Or-licz spaces L∗

ϕ. Then we prove some direct and inverse two-sided approximation problems

in Orlicz spaces L∗

ϕ. Finally we study monotone two sided approximation by

trigonomet-ric polynomials in Orlicz spaces L∗ ϕ.

Firstly we give basic denitions and notations.

We can consider a right continuous, monotone increasing function ϕ : [0, ∞) → [0, ∞) with ϕ(0) = 0; lim

t→∞ϕ(t) = ∞and ϕ(t) > 0 whenever t > 0; then the function dened by

N (x) = Z |x|

0

ϕ(t)dt

is called N-function [18]. The class of increasing N-functions will be denoted by Φ. When ϕ is an N-function [18] we always denote by ψ(u) the mutually complementary N-function of ϕ. Everywhere in this work we suppose that ϕ is an N-function. The class of real-valued functions which denoted by Lϕ dened on I := [a, b] ⊂ R such that;

ρ (u; ϕ) := Z

I

ϕ [|u (x)|] dx < ∞

are called Orlicz classes. The class of measurable functions f dened on I such that the product f (x) g(x) is integrable over (a, b) for every measurable function g ∈ Lψ, will be

denoted by L∗

ϕ(I)which is called Orlicz space. We put

kf kL∗ ϕ(I):= supg Z I f (x)g(x)dx

where the supremum being taken with respect to all g with ρ (g; ψ) ≤ 1. When I = T := [0, 2π]we set L∗ϕ:= L∗ϕ(I)and kfkL∗

ϕ:= kf kL∗ϕ(I).

1.1. Denition. [25] Let M [a, b] be the set of bounded and measurable functions on interval [a, b] and M := M [0, 2π] . Let ϕ is an N-function, f ∈ M ∩ L∗

ϕ and x ∈ T.

Suppose that sequence t± n

1 of trigonometric polynomials satisfy the monotonicity

condition: t+1 ≥ t + 2 ≥ ... ≥ t + n ≥ ... ≥ f ≥ ... ≥ t − n ≥ ... ≥ t − 2 ≥ t − 1. The quantity b En(f )ϕ:= inf n t+n− t − n L∗ ϕ: t ± n ∈ Tn, t+n ≥ f ≥ t − n o

is called the best two sided monotone approximation of the function f ∈ M ∩ L∗ ϕ by

polynomials from Tn, which is consist of all real trigonometric polynomials of degree at

most n.

1.2. Denition. If f ∈ M we can dene T−

n(f ) := {t ∈Tn: t(x) ≤ f (x)for every x ∈ R} ,

T+

n(f ) := {T ∈Tn: f (x) ≤ T (x)for every x ∈ R} .

In case ϕ is an N-function and f ∈ M ∩ L∗ ϕ we set En−(f )ϕ:= inf t∈T− n(f ) kf − tkL∗ ϕ, E + n(f )ϕ:= inf T ∈T+ n(f ) kT − f kL∗ ϕ. The quantities E−

n(f )ϕ and En+(f )ϕ are, respectively, called the best lower(upper)

one-sided approximation errors for f ∈ M ∩ L∗ ϕ. e En(f )ϕ:= inf n kT − tkL∗ ϕ: t, T ∈Tn, t(x) ≤ f (x) ≤ T (x)for every x ∈ R o .

(3)

be the error of two-sided approximation for f ∈ M ∩L∗

ϕ. Similarly, the best trigonometric

approximation error for f ∈ L∗

ϕis dened as usual by En(f )ϕ:= infS∈Tnkf − SkL∗ ϕ. We note that En(f )ϕ≤ E ± n(f )ϕ≤ eEn(f )ϕ, bEn(f )ϕ [19].

Let ϕ be a N-function and for arbitrary r = 0, 1, 2, ..., there exists an r-times continuously dierentiable function f ∈ M, such that

lim sup n→∞ e En(f )ϕ En(f )ϕ = ∞.

This gives us the question of the estimation of the value ofEen(f )ϕ [24].

2. The averaged modulus of smoothness

2.1. Denition. For h ≥ 0, k ∈ N, the expression ∆khf (x) = k X m=0 (−1)m+k k m ! f (x + mh), ∆hf (x) = ∆1hf (x)

is called k-th dierence of the function f with step h at a point x, where k

m !

= k!

m!(k − m)! is the binomial coecients.

2.2. Denition. We dene the modulus of continuity of the function f ∈ M[a, b] by (2.1) ω (f ; δ) = sup f (x) − f (x0) : x − x0 ≤ δ; x, x 0 ∈ [a, b] , δ ∈ [0, b − a] . 2.3. Denition. The modulus of smoothness of a function f ∈ M[a, b] of order k is the following function, δ ∈ [0, (b − a)/k]

(2.2) ωk(f ; δ) = sup n ∆ k hf (x) : |h| ≤ δ; x, x + kh ∈ [a, b] o .

2.4. Denition. Let C [a, b] be the set of continuous functions on interval [a, b] . The local modulus of smoothness of function of f of order k ∈ N at a point x ∈ [a, b] is the following function, δ ∈ 0,b−a

k  : ωk(f, x; δ) = sup  ∆ k hf (t) : t, t + kh ∈  x −kδ 2, x + kδ 2  ∩ [a, b]  . We set ωk(f ; δ) = kωk(f, .; δ)kC[a,b].

2.5. Denition. Let ϕ is an N-function, h ≥ 0 and

Ih:=    [a, b − h] : 0 ≤ h ≤ b − a, ∅ : h > b − a, [0, 2π] : I = T.

The integral modulus of the function f ∈ M [a, b] ∩ L∗

ϕ(I)of order k ∈ N is the following

function of δ ∈ 0,b−a k  : ωk(f ; δ)ϕ= sup 0≤h≤δ sup g Z Ikh ∆ k hf (x) |g(x)| dx : g ∈ Lψ, ρ(g, ψ) ≤ 1  .

(4)

2.6. Denition. When ϕ is an N-function, the averaged modulus of smoothness of the function f ∈ M [a, b] ∩ L∗

ϕ(I)of order k ∈ N is the following function of δ ∈ 0,b−ak  :

τk(f ; δ)ϕ= kωk(f, .; δ)kL∗ ϕ(I) = sup g Z I |ωk(f, x, δ)| |g(x)| dx; g ∈ Lψ, ρ(g, ψ) ≤ 1  . 2.7. Lemma. In Orlicz spaces L∗

ϕ(I)the averaged modulus of smoothness τk(f ; ·)ϕ has

the following properties: If ϕ is an N-function, f, g ∈ L∗

ϕ(I), k, n ∈ N, 0 < δ 0 ≤ δ00 and δ, λ > 0,then (1.) τk(f ; δ0)ϕ≤ τk(f ; δ00)ϕ, δ 0≤ δ00 , (2.) τk(f + g; δ)ϕ≤ τk(f ; δ)ϕ+ τk(g; δ)ϕ, (3.) τk(f ; δ)ϕ≤ 2τk−1(f ;k−1k δ)ϕ, (4.) τk(f ; δ)ϕ≤ δτk−1(f0;k−1k δ)ϕ, (5.) τk(f ; nδ)ϕ≤ (2n) k+1 τk(f ; δ)ϕ, (5.)0 τk(f ; λδ)ϕ≤ (2(λ + 1))k+1τk(f ; δ)ϕ, (6.) τk(f ; δ)ϕ≤ δ kf0kLϕ(I), (6.)0 τk(f ; δ)ϕ≤ c(k)δk f (k) Lϕ(I) ,

(7.) If f is bounded variation on [a, b], then τk(f ; δ)ϕ≤ δVabf where Vabf is the total

variation of f on [a, b] .

Proof. (1.) Let δi∈ [0, b − a](i = 1, 2) and δ1≥ δ2. Using

ωk(f, x; δ2) ≤ ωk(f, x; δ1) and τk(f ; δi)ϕ= sup g Z I |ωk(f, x; δi)| |g(x)| dx; g ∈ Lψ, ρ(g, ψ) ≤ 1  we get (1.) (2.) By the properties ∆ k h(f + g) ≤ ∆ k h(f ) + ∆ k h(g) , ωk(f + g, ·; δ) ≤ ωk(f, ·; δ) + ωk(g, ·; δ) and τk(f + g; δ)ϕ= sup g Z I |ωk(f + g, x; δ)| |g(x)| dx; g ∈ Lψ, ρ(g, ψ) ≤ 1  one can nd kωk(f + g, ·; δ)kL∗

ϕ(I)≤ kωk(f, ·; δ)kL∗ϕ(I)+ kωk(g, ·; δ)kL∗ϕ(I).

This gives (2.) (3.) By ∆k hf (·) = ∆ k−1 h f (· + h) − ∆ k−1 h f (·)we have ωk(f, x; δ) = sup  ∆ k hf (t) : t, t + kh ∈  x −kδ 2, x + kδ 2  ∩ [a, b]  ≤ sup  ∆ k−1 h f (t + h) : t, t + kh ∈  x −kδ 2 , x + kδ 2  ∩ [a, b]  + + sup  ∆ k−1 h f (t) : t, t + kh ∈  x −kδ 2 , x + kδ 2  ∩ [a, b]  . Last two terms can be majorized by τk−1(f ;k−1k δ)ϕand hence (3.) follows.

(5)

(4.) Since [22] (2.3) ∆khf (t) = h Z 0 ∆k−1h f0(t + u)du, h > 0 we obtain sup  ∆ k hf (t) : t, t + kh ∈  x −kδ 2, x + kδ 2  ∩ [a, b]  (2.4) ≤ sup Z h 0 ∆ k−1 h f 0 (t + u) du : t, t + kh ∈  x −kδ 2, x + kδ 2  ∩ [a, b]  . If t, t + kh ∈ x −kδ 2 , x + kδ

2 ∩ [a, b]and h > 0, then the points t + u, t + u + (k − 1)h in

the same interval for 0 ≤ u ≤ h. Then ∆k−1 h f 0 (t + u) ≤ ωk−1(f0, x; δ0)with δ0= k−1k δ. Continuing from (2.4) ωk(f, x; δ) ≤ δωk−1  f0, x; k k − 1δ  , x ∈ [a, b].

If we take the Orlicz norm of both sides of the last inequality we obtain (4.). (5.) From [22, p.9 ] the identity

∆kn,hf (t) = (n−1)k X i=0 An,ki ∆khf (t + ih) where An,k i are dened by (1 + t + ... + tn−1)k= (n−1)k X i=0 An,ki ti the inequality (2.5) ωk(f, x; nδ) ≤ (2n−1)k X i=0 A2n,ki 2n−1 X ∗ j=1 ωk  f, x − (n − j)kδ 2; δ  holds where (2.6) (n−1)k X i=0 An,ki = nk

and the only terms to appear in the sum P

∗ are those for which x − (n − j) kδ

2 ∈ [a, b].

Now taking the Orlicz norm of both sides of (2.5), and by using equation (2.6) we obtain

(2.7) τk(f ; nδ)ϕ≤ (2n)k(2n − 1)τk(f ; δ)ϕ. (5.)0 Let λ > 0. Then ∃n 0 ∈ N : n0− 1 ≤ λ < n0. Hence (n0− 1)δ ≤ λδ < n0δ for δ > 0and n0≤ λ + 1. τk(f ; λδ)ϕ (1.) ≤ τk(f ; n0δ)ϕ (2.7) ≤ (2n0)k(2n0− 1)τk(f ; δ)ϕ = (2(λ + 1))k(2(λ + 1) − 1)τk(f ; δ)ϕ≤ (2(λ + 1))k(2(λ + 1))τk(f ; δ)ϕ = (2(λ + 1))k+1τk(f ; δ)ϕ as desired.

(6)

(6.) Let us extend f outside the interval [a, b] by setting f(x) = f(a), x < a and f (x) = f (b), x > b. Then for every x ∈ [a, b] we have

ω (f, x; δ) = sup  f (t0) − f (t00) : t 0 , t00∈  x −δ 2, x + δ 2  = sup ( Zt00 t0 f0(t)dt : t0, t00∈  x −δ 2, x + δ 2 ) ≤ Z x+δ2 x−δ2 f0(t) dt = Z δ2 −δ 2 f0(x + t) dt. From this inequality, taking the Orlicz norm, we obtain

τ1(f ; δ)ϕ= kω(f, ·; δ)kL∗ ϕ(I)≤ Z δ2 −δ 2 f0(· + t) L∗ ϕ(I) dt = δ f0 L∗ ϕ(I) .

More generally, if the function f has a bounded derivative (of order k), from properties (4.) and (6.) we obtain the following property of τ1(f ; δ)ϕ.

(6.)0 Since τk(f ; δ) (4.) ≤ δτk−1  f0; k k − 1δ  ϕ we can write τk(f ; δ) ≤ δ k k − 1δτk−2 f 00 ;  k k − 1 2 δ ! ϕ ≤ δ2  k k − 1 2 δτk−3 f 000 ;  k k − 1 3 δ ! ϕ ≤ ... ≤ δk−1  k k − 1 k−1 τ1 f(k−1);  k k − 1 k−1 δ ! ϕ (6.) ≤ δk  k k − 1 k f (k) L∗ ϕ(I) = ckδk f (k) L∗ ϕ(I) . (7.) Let f(x) = f(a), x < a and f(x) = f(b), x > b. Then

ω (f, ·; δ) ≤ Vx+ δ 2 x−δ 2 f (·) . Therefore τ1(f ; δ)ϕ≤ kω (f, ·; δ)kL∗ ϕ(I)≤ Vx+ δ 2 x−δ2f L∗ ϕ(I) = sup g Z I Vx+ δ 2 x−δ2f (x) |g(x)| dx; g ∈ Lψ, ρ(g, ψ) ≤ 1  ≤δVabf  sup g Z I |g(x)| dx; g ∈ Lψ, ρ(g, ψ) ≤ 1  ≤ δVb af.

(7)

3. Main results

3.1. Theorem. Let ϕ be an N-function and f ∈ M [a, b] ∩ L∗

ϕ(I) . For any δ > 0,

inequalities

(3.1) c1ωk(f ; δ)ϕ≤ τk(f ; δ)ϕ≤ c2ωk(f ; δ) (b − a)

holds, where the constants c1 depend only on ϕ, k and c2 depend only on ϕ.

Proof. We set for h > 0 A := sup g Z Ikh ∆ k hf (x) |g(x)| dx; g ∈ Lψ, ρ(g, ψ) ≤ 1  . Then A ≤ sup g    b−kh Z a ωk  f, x +kh 2 , δ  |g(x)| dx; g ∈ Lψ, ρ(g, ψ) ≤ 1    ≤ sup g      b−kh2 Z a+kh2 |ωk(f, x, δ)| |g(x)| dx; g ∈ Lψ, ρ(g, ψ) ≤ 1      .

From Denition 2.6, the last expression ≤ kωk(f, ., δ)kL

ϕ(I)≤ sup0≤h≤δkωk(f, ., h)kL∗ϕ(I)

= sup

0≤h≤δ

τk(f ; h)ϕ≤ τk(f ; δ)ϕ.

Now ωk(f ; δ)ϕ= sup 0≤h≤δ

Agives the left hand side of (3.1). For the proof of the right hand side of (3.1) τk(f ; δ)ϕ= sup g Z I |ωk(f, x, δ)| |g(x)| dx; g ∈ Lψ, ρ(g, ψ) ≤ 1  ≤ kωk(f, ., δ)kC[a,b]k1kL∗ ϕ(I).

Then, from Young inequality, we nd k1kL∗

ϕ(I)≤ Cϕ(b − a).Hence from Denition 2.6

τk(f ; δ)ϕ≤ c2ωk(f ; δ) (b − a).

 3.2. Theorem. Let ϕ be a N-function, k ∈ N and f ∈ L∗

ϕ∩ M. Then there is a constant

c > 0,dependent only on k and ϕ, such that the inequality e

En(f )ϕ≤ ck,ϕτk(f,

1 n)ϕ holds for n ∈ N.

Proof. We know from [24, Lemma 5] that there exist trigonometric polynomials t+ n, t−n ∈

Tnwith the property

t+n ≥ f ≥ t − n and (3.2) t+n(x) − t − n(x) ≤ 16 Z π 0 ωk(f, x, 2t)Ir,m(t)dt

(8)

where k, r, m ∈ N, n = r (m − 1), Ir,m(t) = γr,m h sin mt/2 m sin t/2 i2r , and (1/γr,m) = R T h sin mt/2 m sin t/2 i2r dt.

Taking Orlicz norm and changing the order of integration we obtain (3.3) Een(f )ϕ≤ 16 Z π 0 τk(f, 2t)ϕIr,m(t)dt. For any i ≤ 2 (r − 1) Z π 0 Ir,m(t)tidt

is equivalent to m−i ([24, p.180]). Choosing r such that k ≤ 2r − 3 and m = bn rc + 1

with regard to property (5.)0

,we have Z π 0 τk(f, 2t)ϕIr,m(t)dt ≤ ck,ϕ Z π 0 (2mt + 2)k+1τk(f, 1 m)ϕIr,m(t)dt (3.4) ≤ Ck,ϕτk(f, 1 m)ϕ≤ ck,ϕτk(f, r n)ϕ≤ Ck,ϕτk(f, 1 n)ϕ. (3.2), (3.3) and (3.4) gives e En(f )ϕ≤ Ck,ϕτk(f, 1 n)ϕ.  3.3. Theorem. Let k ∈ N. If ϕ is a N-function and f ∈ L∗

ϕ∩ M, then (3.5) τk  f,1 n  ϕ ≤ck,ϕ nk n X v=0 (v + 1)k−1E (v, f, ϕ) holds for n ∈ N, where

E (v, f, ϕ)n= En(f )ϕ or = En±(f )ϕ or =Een(f )ϕ or =Ebn(f )ϕo and

constant ck,ϕ> 0dependent only on k and ϕ.

Proof. It is enough to prove (3.5) for E (v, f, ϕ) = En(f )ϕ. Let n ∈ N and let the

trigonometric polynomial Tn∈Tnbe such that En(f )ϕ= kf − TnkL

ϕ.For δ > 0, τk(f ; δ)ϕ≤ τk(f − Tn; δ)ϕ+ τk(Tn; δ)ϕ (3.6) ≤ ck h kf − TnkL∗ ϕ i + τk(Tn; δ)ϕ= ckEn(f )ϕ+ τk(Tn; δ)ϕ.

We set n = 2v0.Then from (3.6) we obtain

τk(f ; δ)ϕ≤ v0 X i=1 [τk(f ; δ)ϕ+ τk(T2i− T2i−1; δ)ϕ] (3.7) +τk(f ; δ)ϕ+ τk(T1− T0; δ)ϕ+ 2k(kδn + 1)En(f )ϕ. From property (60.) τk(Tn; δ)ϕ≤ kδk (T2i− T2i−1) (k) L∗ ϕ ≤ kδk2ikkT2i− T2i−1kL∗ ϕ≤ kδ k 2ikhkf − T2ikL∗ ϕ+ kf − T2i−1kL∗ϕ i (3.8) ≤ kδk 2ikhkf − T2ikL∗ ϕ+ kf − T2i−1kL∗ϕ i ≤ 2kδk 2ikE2i−1(f )ϕ. From (3.7) and (3.8)

(9)

τk(f ; δ)ϕ≤ 4kδk v0 X i=1 h 2ikE2i−1(f )ϕ+ 2kδkE0(f )ϕ+ 2k(knδ + 1)En(f )ϕ i (3.9) ≤ 4k+1 kδk n X v=0 h (v + 1)k−1Ev(f )ϕ+ 2k(knδ + 1)En(f )ϕ i Let δ = 1 n.From (3.9) τk(f ; δ)ϕ≤ 4k+1kn −k n X v=0 h (v + 1)k−1Ev(f )ϕ+ 2 k (k + 1)En(f )ϕ i ≤ 23k+1 n−k n X v=0 (v + 1)k−1Ev(f )ϕ. If 2v0 ≤ n < 2v0+1, τk(f ; 1 n)ϕ≤ τk(f ; 1 2v0)ϕ≤ 2 3k+1 n−v0k n X v=0 (v + 1)k−1Ev(f )ϕ ≤ 24k+1n−k n X v=0 (v + 1)k−1Ev(f )ϕ= c nk n X v=0 (v + 1)k−1Ev(f )ϕ.  From last two theorems we have the following two corollaries.

3.4. Corollary. Let k ∈ N. If ϕ is a N-function, f ∈ L∗

ϕ∩ M, and e En(f )ϕ=O n−σ  , σ > 0, n ∈ N, then τk(f ; δ)ϕ=    O (δσ) ; k > σ, O (δσ|log (1/δ)|) ; k = σ, O (δα ) ; k < σ, hold.

3.5. Denition. Let k ∈ N and ϕ be an N-function. For 0 < σ < k we set Lipσ (k, ϕ) := f ∈ L∗

ϕ∩ M : τk(f ; δ)ϕ=O (δσ), δ > 0 .

3.6. Corollary. Let k ∈ N, ϕ be an N-function, 0 < σ < k and let f ∈ L∗

ϕ∩ M. Then

the following conditions are equivalent: (a) f ∈ Lipσ (k, ϕ). (b) Een(f )ϕ=O n

−σ

, n ∈ N.

Our monotone approximation estimate is given in the following.

3.7. Theorem. Suppose that r ∈ N, ϕ be an N-function and f, f(r) ∈ L

ϕ∩ M.Then

there exists sequences t+ n ∞ 1 ,t − n ∞ 1 , t ± n ∈Tn, such that t+1 ≥ t + 2 ≥ ... ≥ t + n ≥ ... ≥ f ≥ ... ≥ t − n ≥ ... ≥ t − 2 ≥ t − 1, t+n− t − n L∗ ϕ ≤ cr,ϕn −r f (r) L∗ ϕ

(10)

To proof this theorem we need the following lemmas. Let f ∗ g := 1 2π Z π −π f (x − t)g(t)dt denote the convolution of f and g.

3.8. Lemma. [23] Suppose D1(u) = u − π, u ∈ [0, 2π), D1(4 + 2π) = D1(u).Then there

exist sequences U+ n ∞ 1 ,U − n ∞ 1 , U ± n ∈Tn,such that U1+≥ U + 2 ≥ ... ≥ U + n ≥ ... ≥ D1≥ ... ≥ U − n ≥ ... ≥ U − 2 ≥ U − 1 , Un+− U − n 1 ≤ c n, for n ∈ N.

3.9. Lemma. Suppose that f is absolutely continuous on T, f0∈ L

ϕ∩ M and there exist

a sequence {Tn}∞1 , Tn ∈Tn such that T1 ≥ T2 ≥ ... ≥ Tn ≥ ... ≥ f0. Then there exist

sequences R+ n ∞ 1 ,R − n ∞ 1 , R ± n ∈Tn, so that R1+≥ R + 2 ≥ ... ≥ R + n ≥ ... ≥ f ≥ ... ≥ R − n ≥ ... ≥ R − 2 ≥ R − 1, and R+n− R − n L∗ ϕ ≤ c n Tn− f 0 L∗ ϕ , n ∈ N.

Proof of Lemma 3.9. Let Tn(x) = a0+ n−1

P

k=1

(akcos kx + bksin kx) andTen(x) = Tn(x) −

a0, h(x) = f (x) − Rx 0 Ten(t)dt. Then from [10] h(x) = A − D1∗ h 0 = A − D1∗ (f 0 − eTn) = A + D1∗ ( eTn− f 0 ), where A = A(f) is a constant. By using U+

n and Un−of Lemma 3.8 we put

Q+n = A + U + n ∗ (Tn− f 0 ), Q−n = A + U − n ∗ (Tn− f 0 ), Rn+(x) = Zx 0 e Tn(t)dt + Q+n(x), R − n(x) = Zx 0 e Tn(t)dt + Q − n(x).

By using the fact that a0

R TD1(u)du = 0,we have R+n− R + n+1 = R + n− f − R + n+1− f  = Un+− D1 ∗ (Tn− f0) − Un+1+ − D1 ∗ (Tn+1− f0) = Un+− U + n+1 ∗ (Tn− f 0 ) + Un+1+ − D1 ∗ (Tn− Tn+1) ≥ 0. Monotonicity of R− n ∞

1 can be established analogously. Finally

R+n− R + n+1 L∗ ϕ = U + n − U − n ∗ (Tn− f0) L∗ ϕ ≤ 1 2π Un+− U − n 1 Tn− f0) L∗ ϕ ≤ c n Tn− f0) L∗ ϕ.  Proof. For f, f0∈ L

ϕwe set f+0(x) = max {0, f0(x)}and f−0(x) = max {0, −f0(x)}. Then

f = A − D1∗ f0 = A − D1∗ f+0 + D1 ∗ f−0. Putting t+n = A − Un−∗ f+0 + Un+ ∗ f−0, t−n = A − Un+∗ f 0 ++ U − n ∗ f 0

−,we can show by exactly the same argument as in Lemma

3.9 that t+1 ≥ t + 2 ≥ ... ≥ t + n ≥ ... ≥ f ≥ ... ≥ t − n ≥ ... ≥ t − 2 ≥ t − 1,

(11)

and we have t+n − t − n L∗ ϕ ≤ U + n − U − n ∗ f 0 +− f 0 −  L∗ ϕ ≤ 1 2π U + n − U − n  1 f0 L∗ ϕ ≤ c n f0 L∗ ϕ.

Applying Lemma 3.9 (r − 1) times, the proof of the Theorem 3.7 is obtained.  Acknowledgements Authors are indepted to referees for his/her valuable suggestions and remarks.

References

[1] Akgün, R. Inequalities for one sided approximation in Orlicz spaces, Hacet. J. Math. Stat. 40 (2), 231-240, 2011.

[2] Akgün, R., Approximating polynomials for functions of weighted Smirnov-Orlicz spaces,J. Funct. Spaces Appl. 41, Article ID 982360, 2012.

[3] Akgün, R., Some inequalities of trigonometric approximation in weighted Orlicz spaces, Math. Slovaca 66 (1), 217-234, 2016.

[4] Akgün, R. and Isralov, D. M. Simultaneous and converse approximation theorems in weighted Orlicz spaces, Bull. Belg. Math. Soc. Simon Stevin 17 (1), 13-28, 2010.

[5] Akgün, R. and Isralov, D. M. Approximation in weighted Orlicz spaces, Math. Slovaca, 61 (4), 601-618, 2011.

[6] Akgün, R. and Koç, H. Approximation by interpolating polynomials in weighted symmetric Smirnov spaces, Hacet. J. Math. Stat. 41 (5), 643-649, 2012.

[7] Akgün, R. and Koç, H. Simultaneous approximation of functions in Orlicz spaces with Muckenhoupt weights, Complex Var. Elliptic Equ. 61 (8), 1107-1115, 2016.

[8] Babenko, V. F. and Ligun, A. A. The order of the best one-sided approximation by polyno-mials and splines in the Lp-metric, Math. Notes 19 (3), 194-198, 1976.

[9] Cohen, E. On the degree of approximation of a function by the partial sums of its Fourier series, Trans. Amer. Math. Soc. 235, 3574, 1978.

[10] Ganelius, T. On one-sided approximation by trigonometric polynomials, Math. Scand., 4, 247-256, 1956.

[11] Isralov, D. M. and Guven, A. Approximation by trigonometric polynomials in weighted Orlicz spaces. Studia Math. 174 (2), 147168, 2006.

[12] Jafarov, S. Z., Approximation by Fejér sums of Fourier trigonometric series in weighted Orlicz spaces. Hacet. J. Math. Stat. 42 (3), 259268, 2013.

[13] Jafarov, S. Z., Approximation by linear summability means in Orlicz spaces. Novi Sad J. Math. 44 (2), 161172, 2014.

[14] Jafarov, S. Z., Approximation of functions by de la Vallée-Poussin sums in weighted Orlicz spaces. Arab. J. Sci. Eng. (Springer) 5 (3), 125137, 2016.

[15] Jafarov, S. Z., Approximation of periodic functions by Zygmund means in Orlicz spaces. J. Class. Anal. 9 (1) , 4352, 2016.

[16] Koç, H. Simultaneous approximation by polynomials in Orlicz spaces generated by quasi-convex Young functions, Kuwait J. Sci. 43 (4), 18-31, 2016.

[17] Kokila²vili, V. M. An inverse theorem of the constructive theory of functions in Orlicz spaces, (Russian) Soob²£. Akad. Nauk Gruzin. SSR 37 (1965), 263270.

[18] Krasnosel'ski, M. A. and Ruticki, Y. B. Convex functions and Orlicz spaces, Translated from the rst Russian edition by Leo F. Boron, Popko Noordho Ltd., Groningen.1961. [19] Lorentz, G. G. and Golitschek, M. V. and Makovoz, Y Constructive approximation:

Ad-vanced problems, Springer-Verlag, 1996.

[20] Ponomarenko, V. G. Approximation of periodic functions in an Orlicz space, (Russian) Sibirsk. Mat. Zh. 7, 13371346, 1966.

[21] Ramazanov, A.-R. K. On approximation by polynomials and rational functions in Orlicz spaces, Anal. Math. 10 (2), 117132, 1984.

[22] Sendov, B. and Popov,V. A. The averaged moduli of smoothness, Pure Appl. Math.,(New York), Wiley, Chichester, 1988.

(12)

[23] Shadrin, A. Yu. Monotone approximation of functions by trigonometric polynomials, Mat. Zametki, 34 (3), 375-386, 1983.

[24] Shadrin, A.Yu., Orders of one sided approximations of functions in Lp-metric, Anal. Math.

12, 175-184, 1986.

[25] Shadrin, A.Yu., Jackson type theorems for monotone approximation of functions by trigono-metric polynomials, Mat. Zametki, 42 (6), 790-809, 1987.

[26] Tsyganok, I. I. A generalization of a theorem of Jackson, Mat. Sbornik 71 (113), 257-260, 1966.

Referanslar

Benzer Belgeler

attitude in learners (Abaylı, 2001; Kırkgöz, 2011; Shenton &amp; Pagett, 2007). Taking this into consideration, possible future studies could investigate whether digital

This is a quasi-experimental research study conducted over a period of four months, focusing on the development of young learners‟ willingness to communicate in English as a

[17] determined fatigue properties of ductile iron which were applied on four different grades austem- pered heat treatment under bending fatigue test.. They observed that the

Certified that this thesis conforms to the formal standards of the Institute of Economics and Social

HC: healthy controls; ADHD: attention-deficit hyperactivity disorder; CCN: cognitive control network; DMN: default mode network; SN: salience network; PFC: prefrontal cortex;

Our study with the retinoid derivative 17 on 11 different breast cancer cells and a comparative analysis of RAR and RXR gene expression reveal the importance of RXRs in breast

The eleven questions in the first part were concerned with the behaviors of teenagers like their favorite shopping mall, most frequently visited shopping mall,