See

discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/315461552

Szasz-Gamma operators based on Dunkl

analogue

Article March 2017

CITATIONS READS

0 5

2 authors:

Abdul Wafi Nadeem Rao

Jamia Millia Islamia Jamia Millia Islamia
26 PUBLICATIONS 66 CITATIONS 18 PUBLICATIONS 64 CITATIONS

SEE PROFILE SEE PROFILE

All content following this page was uploaded by Nadeem Rao on 16 June 2017.

The user has requested enhancement of the downloaded file. All in-text references underlined in blue are added to the original document
and are linked to publications on ResearchGate, letting you access and read them immediately.
Szasz-Gamma operators based on Dunkl ana-
logue
Abdul Wafi and Nadeem Rao

Abstract. The aim of this article is to construct a new Szasz-Gamma

operators via Dunkl analogue. We discuss basic approximation results
in terms of classical Korovkin theorem and modulus of continuity. For
our operators, we investigated local approximation results by means of
Peetres K-functional, second order modulus of smoothness, Lipschitz
class and Lipschitz maximal function. Next, we derive weighted ap-
proximation theorems in terms of weighted Korovkin type theorem and
weighted modulus of continuity. Lastly, A-Statistical result and rate of
convergence for functions with derivative of bounded variation are also
studied.
Mathematics Subject Classification (2010). 41A10; 41A25; 41A28; 41A30;
41A35; 41A36.
Keywords. Dunkl analogue; Durrmeyer operators; Szasz-Gamma oper-
ators; rate of convergence.

1. Introduction
Szasz [20] introduced linear positive operators which are now known as clas-
sical Szasz operators. He investigated uniform and pointwise approximation
on positive semi axis (0, ) by these sequences of positive linear operators
for continuous functions only. To approximate Lebesgue integrable functions,
Mazhar and Totik [11] introduced Szasz-Durrmeyer operators as

Z
X (nx)k (nt)k
Sn (f ; x) = ne nx
ent f (t), n N = {1, 2, 3, . . . }. (1.1)
k! k!
k=0 0
Several generalizations of positive linear operators in integral form were
discussed by the authors to approximate aSclass of Lebesgue integral functions
( see [12], [13], [9]). For j N0 = {0} N, i 0 and f C[0, ), Sucu

This work is carried out with the support of UGC BSR fellowship.
2 Abdul Wafi and Nadeem Rao

[19] presented a Szasz type operators using a generalization of exponential

function [17] as follows

1 X (nx)j
 
j + 2ij
Sn (f ; x) := f , (1.2)
ei (nx) j=0 i (j) n

where

X tj
ei (t) = , t [0, ). (1.3)
(j)
j=0 i

Here

22j j!(j + i + 1/2) 22j+1 j!(j + i + 3/2)

i (2j) = , i (2j + 1) =
(i + 1/2) (i + 1/2)

and the recursive relation for i is defined as

(j + 1) = (j + 1 + 2ij+1 )i (j), j N0 , (1.4)

with

0 if j 2N,
j = .
1 if j 2N + 1

Later on, various generalizations of the operators defined by (1.2) and their
approximation results are studied by the authors vitz Icoz et al. ([7], [8]),
Mursaleen et al. [14], Karaisa and Karakoc [15] etc. Motivated by the idea of
Sucu [19], we gave Szasz-Durrmeyer operators using Dunkl analogue as

1 X (nx)j nj+2ij ++1
Z
Dnf (x) = tj+2ij + ent f (t)dt,
ei (nx) j=0 i (j) (j + 2ij + + 1) 0

(1.5)
R
where (t) = 0 xt ex dx is the gamma function and 0. We noticed that
for i = = 0, the sequence of operators introduced in (1.5) reduce to the
operators defined in (1.1). In this paper, we discussed basic convergence the-
orems, pointwise approximation results in several functional spaces. Lastly,
weighted approximation results and rate of convergence for functions with
derivative of bounded variation are studied.
 Szasz-Gamma operators based on Dunkl analogue 3

2. Preliminaries
Lemma 2.1. For i, x 0 and generating function defined by (1.3), we have

1 X (nx)j
= 1,
ei (nx) j=0 i (j)

1 X (nx)j
(j + 2ij ) = nx,
ei (nx) j=0 i (j)

!
1 X (nx)j ei (nx)
(j + 2ij )2 = 2 2
n x + 1 + 2i nx,
ei (nx) j=0 i (j) ei (nx)

!
1 X (nx)j ei (nx)
(j + 2ij )3 = 3 3
n x + 3 2i n2 x2
ei (nx) j=0 i (j) ei (nx)
 
ei (nx)
+ 1 + 4i2 + 2i nx,
ei (nx)

!
1 X (nx)j ei (nx)
(j + 2ij )4 = 4 4
n x + 6 + 4i n3 x3
ei (nx) j=0 i (j) ei (nx)
 
ei (nx)
+ 7 + 4i2 8i n2 x2
ei (nx)
 
ei (nx) ei (nx)
+ 1 + 12i2 + 6i + 8i3 nx.
ei (nx) ei (nx)
Proof. In the view of equation (1.3) and using property of j , i.e., j+1 =
(1)j + j and equation (1.4), we can easily prove Lemma 2.1. 

In order to prove basic estimates and approximation results, we consider

test functions and central moments as e (t) = t , {0, 1, 2, 3} and x (t)(t
x) , {1, 2, 3} respectively.
Lemma 2.2. For the operators given by (1.5), we have
Dne0 (x) = 1,
+1
Dne1 (x) = x+ ,
n 
ei (nx) x ( + 1)( + 2)
Dne2 (x) = 2
x + 4 + 2 + 2i + ,
ei (nx) n n2
ei (nx) x2
 
Dne3 (x) = 3
x + 9 + 3 2i + 18 + 3( + 5) + 4i2
ei (nx) n
!
ei (nx) x 3 + 62 + 11 + 6
+ 2i(8 + 3) + ,
ei (nx) n2 n3
   
ei (nx) 1
Dne4 (x) = 4
x + 16 + 4 + 4i +o .
ei (nx) n2
4 Abdul Wafi and Nadeem Rao

Proof. Using Lemma 2.1, we have for = 0

1 X (nx)j nj+2ij ++1
Z
Dne0 (x) = tj+2ij + ent dt
ei (nx) j=0 i (j) (j + 2ij + + 1) 0

1 X (nx)j (j + 2ij + + 1)
=
ei (nx) j=0 i (j) (j + 2ij + + 1)
= 1.

For = 1

1 X (nx)j nj+2ij ++1
Z
Dne1 (x) = tj+2ij ++1 ent dt,
ei (nx) j=0 i (j) (j + 2ij + + 1) 0

1 X (nx)j (j + 2ij + + 2)
=
ei (nx) j=0 i (j) n(j + 2ij + + 1)

X (nx)j
1 (j + 2ij + + 1)
= (j + 2ij + + 1)
nei (nx) j=0 i (j) (j + 2ij + + 1)
+1
= x+ .
n
For = 2

1 X (nx)j nj+2ij ++1
Z
Dne2 (x) = tj+2ij ++2 ent dt
ei (nx) j=0 i (j) (j + 2ij + + 1) 0

1 X (nx)j (j + 2ij + + 3)
=
ei (nx) j=0 i (j) n2 (j + 2ij + + 1)

1 X (nx)j (j + 2ij + + 2)(j + 2ij + + 1)
=
ei (nx) j=0 i (j) n2

X (nx)j
1
= ((j + 2ij )2 + (2 + 3)(j + 2ij )
n2 ei (nx) j=0 i (j)
+ ( + 1)( + 2))
 
ei (nx) x ( + 1)( + 2)
= x2 + 4 + 2 + 2i + .
ei (nx) n n2

Similarly, we can prove rest part of the Lemma 2.2. 

Lemma 2.3. Let Dnf be defined by (1.5). Then we get

 Szasz-Gamma operators based on Dunkl analogue 5

1 +1
Dn x (x) = ,
n 
2 ei (nx) x ( + 1)( + 2)
Dn x (x) = 2 + 2i + ,
ei (nx) n n2
 
4 1
Dn x (x) = o .
n
Proof. From 2.2 and linearity property
1
Dn x (x) = Dnt (x) xDn1 (x),
2 2
Dn x (x) = Dnt (x) 2xDnt (x) + x2 Dn1 (x),
4 4 3 2
Dn x (x) = Dnt (x) 4xDnt (x) + 6x2 Dnt (x) 4x3 Dnt (x) + x4 Dn1 (x),
we can prove Lemma 2.3. 

Using Cauchy-Schwarz inequality and Lemma 2.3, for large value of n,

we have
r
(i, )x  12
2

Dnx (x) Dn x (x) , (2.1)
n
where (i, ) is a constant depending on i and . In order to prove rate of
convergence for functions with derivative of bounded variation, we rewrite
Dnf defined by (1.5) as
Z
Dnf (x) = xn (t)f (t)dt, (2.2)
0

where xn (t) be the kernal function is given by

1 X (nx)j nj+2ij ++1
xn (t) = tj+2ij + ent .
ei (nx) j=0 i (j) (j + 2ij + + 1)

Remark 2.4. One can notice that for i = = 0, the estimates proved in
Lemma 2.2 and Lemma 2.3 for the operators Dnf defined by (1.5) reduce to
the basic estimates proved by Mazhar and Totik [11] for the operators Dn
given in (1.1).

3. Basic convergence results

Definition 3.1. Let f C[0, ). Then, modulus of continuity for a uniformly
continuous function f defined as

(f ; ) = sup |f (t) f (y)|, t, y [0, ).

|ty|
6 Abdul Wafi and Nadeem Rao

For a uniformly continuous function f in C[0, ) and > 0, we get

(t y)2
 
|f (t) f (y)| 1 + (f ; ). (3.1)
2
Theorem 3.1. For f C[0, ) E and Dnf be the operators defined by (1.5),
T
f
D
(n (x) converges to f uniformly on each compact
) subset of [0, ) where E :=
f (x)
f : x 0, 1+x 2 is convergent as x .

Proof. Using (vi) property in Theorem 4.1.4 in [1], it is enough to show that

Dne (x) e (x), for = 0, 1, 2.

Using Lemma 2.2, it is obvious Dne0 (x) e0 (x) as n . Next, for = 1
 
+1
lim Dne1 (x) = lim x + = e1 (x).
n n n
For = 2, we get
   
ei (nx) x ( + 1)( + 2)
lim Dne2 (x) = lim x2 + 4 + 2 + 2i +
n n ei (nx) n n2
= x2 .
Which proves Theorem 3.1. 
Theorem 3.2. (See [18]) Let L : C([a, b]) B([a, b]) be a linear and positive
operator and let x be the function defined by

x (t) = |t x|, (x, t) [a, b] [a, b].

If f CB ([a, b]) for any x [a, b] and any > 0, the operator L verifies:
p
|(Lf )(x) f (x)| |f (x)||(Le0 )(x) L|{(Le0 )(x) + 1 (Le0 )(x)(L2x )(x)}f ().

Theorem 3.3. For Dnf be the operators given by (1.5) and f CB [0, ), we
have

|Dnf (x) f (x)| 2(f ; ),

q
2
where = Dn x (x) and CB [0, ) is the space of continuous and bounded
functions defined on [0, ).
Proof. Using Lemma 2.2, Lemma 2.3 and Theorem 3.2, we get
q
2
|Dnf (x) f (x)| {1 + 1 Dn x }(f ; ).
q
2
On taking = Dn x (x), we arrive at the required result. 
 Szasz-Gamma operators based on Dunkl analogue 7

4. Pointwise approximation results

Here, we shall study pointwise approximation results in the space of real
valued continuous and bounded functions CB [0, ) endowed with the norm
kf k = sup |f (x)|. For any f CB [0, ) and > 0, Peeters K-functional
0x<
is defined as
K2 (f, ) = inf {kf gk + kg 00 k : g CB
2
[0, )},
where CB2
[0, ) = {g CB [0, ) : g 0 , g 00 CB [0, )}. From DeVore and
Lorentz [[2], p.177, Theorem 2.4], there exits an absolute constant C > 0 in
such a way

K2 (f ; ) C2 (f ; ),
where 2 (f ; ) is the second order modulus of continuity is defined as

2 (f ; ) = sup sup |f (x + 2h) 2f (x + h) + f (x)|.
0<h x[0,)

In order to deal with the proof of Theorem 4.2, we consider the auxiliary
operator Db f as
n

 
b f (x) = Df (x) + f (x) f +1
D n n x+ . (4.1)
n
2
Lemma 4.1. For g CB [0, ), x 0 and i, 0, one get

b ng (x) g(x)|
|D nx kg 00 k,
where
 
ei (nx) x ( + 1)(2 + 3)
nx = 2 + 2i + .
ei (nx) n n2
Proof. Using auxiliary operators defined by (4.1), we have

b 1 (x) = 1, D
D b x (x) = 0 and |D
b f (x)| 3kf k. (4.2)
n n n
2
Using Taylor expansion for g CB [0, ), we obtain

Zt
0
g(t) = g(x) + (t x)g (x) + (t v)g 00 (v)dv. (4.3)
x

Applying b nf
D in (4.3), we obtain
!
Rt
(tv)g 00 (v)dv
= g 0 (x)D
x
b ng (x) g(x)
D b ntx (x) + D
bn (x).
8 Abdul Wafi and Nadeem Rao

From (4.1) and (4.2), we have

!
Rt
(tv)g 00 (v)dv
b g (x) g(x)
D bn x
= D (x)
n
!
Rt x+ +1
(tv)g 00 (v)dv;x n
Z !
+1
v g 00 (v)dv.
x
= Dn x+
n
x
!
 Rt   x+Z +1
(tv)g 00 (v)dv;x n ! 
   +1 
v g 00 (v)dv .
g  x
|Dn (x) g(x)| Dn + x+
b   
   n 
x
(4.4)
Since,

 Zt 
 
 (t v)g (v)dv  (t x)2 k g 00 k .
00
(4.5)
 
 
x
Then

 x+Z +1
n !   2
 +1 00
 +1
x+ v g (v)dv  k g 00 k . (4.6)
 
n n

 
x

Combining (4.4), (4.5) and (4.6), we have

( !2 )
+1
|D
b n (g; x) g(x)| Dnf ((t x)2 ; x) + kg 00 k
n
= nx kg 00 k.

2
Theorem 4.2. Let f CB [0, ). Then, there exists a constant C > 0 such
that

p

| Dnf (x) f (x) | C2 f ; nx + (f ; Dnx (x)),
where nx is defined in Lemma 4.1.
2
Proof. For g CB b , we
[0, ) and f CB [0, ) and by the definition of D n
obtain

|Dnf (x) f (x)| |Db (f g) (x)| + |(f g)(x)| + |D

b g (x) g(x)|
 n  n
  + 1  
+ f x + f (x).
 
 n 
 Szasz-Gamma operators based on Dunkl analogue 9

From Lemma 4.1 and relations in (4.2), one get

 
  + 1 
|Dnf (x) f (x)| 4kf gk + b ng (x)
|D g(x)| + f x + f (x)
 
 n 
 
4kf gk + n (x)kg 00 k + f ; Dnx (x) .
Using definition of Peetres K-functional, we have
p
|Dnf (x) f (x)| C2 f ; n (x) + (f ; Dnx (x)).

This completes the proof Theorem 4.2. 

For two fixed real values k1 , k2 > 0, we consider the Lipschitz type space
[16] as

n |t x| o
LipkM1 ,k2 () := f CB [0, ) : |f (t) f (x)| M : x, t (0, ) ,
(t + k1 x + k2 x2 ) 2
where M > 0 and (0, 1].
Theorem 4.3. For f LipkM1 ,k2 (), we have

! 2
n (x)
|Dnf (x) f (x)| M , (4.7)
k1 x + k2 x2
2
where x > 0 and n (x) = Dn x (x).
Proof. For = 1, we have
|Dnf (x) f (x)| Dn(|f (t)f (x)|) (x)
!
|tx|
1
(t+k1 x+k2 x2 ) 2
M Dn (x).
1 1
Since t+k1 x+k2 x2 < k1 x+k2 x2 for all x (0, ), we get
M 2 1
|Dnf (x) f (x)| 1 (Dn(tx) (x)) 2
(k1 x + k2 x2 ) 2
! 21
n (x)
M .
k1 x + k2 x2
Thus the Theorem 4.3 holds for = 1. Next, for (0, 1) and from Holders
inequality with p = 2 and q = 2
2
, we get
 2
 2
f (|f (t)f (x)|)
|Dn (x) f (x)| Dn (x)
!! 2
|t x|2
M Dnf .
(t + k1 x + k2 x2 )
10 Abdul Wafi and Nadeem Rao

1 1
Since t+k1 x+k2 x2 < k1 x+k2 x2 for all x (0, ), we obtain

! 2
Dnf (|t x|2 ; x)
|Dnf (x) f (x)| M
k1 x + k2 x2
 (x)  2
n
M .
k1 x + k2 x2
Hence, we prove Theorem 4.3. 

In the last of this section, we shall prove local approximation in terms

of pth order Lipschitz-type maximal function given by Lenze [10] as follows

|f (t) f (x)|

ep (f ; x) = sup , x [0, ) and p (0, 1]. (4.8)
t6=x,t(0,) |t x|p

Theorem 4.4. Let f CB [0, ) and p (0, 1]. Then, for all x [0, ), we
have

  p2
|Dnf (x) f (x)| ep (f ; x) n (x) .

Proof. We have

|Dnf (x) f (x)| Dnf (|f (t) f (x)|; x).

From equality (4.8), we have

|Dnf (x) f (x)| ep (f ; x)Dnf (|t x|p ; x).

Using Holders inequality with p = 2
p and q = 2
2p , we have

p
|Dnf (x) f (x)| ep (f ; x) Dnf (|t x|2 ; x) 2 ,

which prove the desired result. 

5. weighted approximation
Here, we recall some notation from [4] to prove next result. Let B1+x2 [0, ) =
{f (x) : |f (x)| Mf (1 + x2 ), 1 + x2 is weight function, Mf is a constant de-
pending on f and x [0, )}, C1+x2 [0, ) is the space of continuous function
in B1+x2 [0, ) with the norm kf (x)k1+x2 = sup |f (x)| k
1+x2 and C1+x2 [0, ) =
x[0,)
f (x)
{f C1+x2 : lim 2 = k, where k is a constant depending on f }.
|x| 1+x
 Szasz-Gamma operators based on Dunkl analogue 11

Modulus of continuity for the function f defined on closed interval [0, a]

with a > 0 is denoted as follows
a (f, ) = sup sup |f (t) f (x)|. (5.1)
|tx| x,t[0,a]

Theorem 5.1. Let f C1+x2 [0, ) and b+1 (f ; ) be its modulus of continuity
defined on [0, b + 1] [0, ). Then, we have
p
kDnf (x) f (x)kC[0,b] 6Mf (1 + b2 )n (b) + 2b+1 (f ; n (b)),
where n (b) = Dnf (b2 ; b).
Proof. From ([6], p. 378), for x [0, b] and t [0, ), we have
 
2 2|t x|
|f (t) f (x)| 6Mf (1 + b )(t x) + 1 + b+1 (f ; ).

This implies that

Df (|t x|; x)
 
|Dnf (x) f (x)| 6Mf (1 + b2 )Dnf ((t x)2 ; x) + 1 + n b+1 (f ; ).

Thus, using Lemma 2.3, for x [0, b], we have

p !
n (b)
|Dnf (x) f (x)| 6Mf (1 + b2 )n (b) + 1+ b+1 (f ; ).

Choosing = n (b), we arrive at the desired result. 

Theorem 5.2. If the operators Dnf defined by (1.5) from C1+x

k
2 [0, ) to B1+x2 [0, )

satisfying the conditions

lim kDnf (ei ; x) xi k1+x2 = 0, i = 0, 1, 2,

n
k
then for each C1+x 2 [0, )

lim kDnf (x) f k1+x2 = 0.

n

Proof. To prove Theorem 5.2, it is enough to show that

lim kDnf (ei ; x) xi k1+x2 = 0, i = 0, 1, 2.

n

From Lemma 2.2, we have

|Dnf (1; x) 1|
kDnf (e0 ; x) x0 k1+x2 = sup = 0 for i = 0.
x[0,) 1 + x2
12 Abdul Wafi and Nadeem Rao

For i = 1
+1
kDnf (e1 ; x) x1 k1+x2 = sup n
x[0,) 1 + x2
+1 1
= sup .
n x[0,) 1 + x2

This implies that kDnf (e1 ; x) x1 k1+x2 0 an n . For i = 2

 
  
e (nx) (+1)(+2) 
 4 + 2 + 2i ei i (nx) nx +

 n2 

kDnf (e2 ; x) x2 k1+x2 = sup
x[0,) 1 + x2
 
4 + 2 + 2i eei i(nx)
(nx) x
sup 2
n x[0,) 1 + x

( + 1)( + 2) 1
+ sup .
n2 x[0,) 1 + x2

Which shows that kDnf (e2 ; x) x2 k1+x2 0 an n . 

Let f Ck [0, ), Yuksel and Ispir [21] introduced weighted modulus

of continuity as follows

|f (x + h) f (x)|
(f ; ) = sup .
x[0,),0<h 1 + (x + h)2
k
Lemma 5.3. [21] Let f C1+x 2 [0, ). Then

(i) (f ; ) is a monotone increasing function of ;

(ii) lim+ (f ; ) = 0;
0
(iii) for each m N, (f ; m) m(f ; );
(iv) for each [0, ), (f ; ) (1 + )(f ; )
and for t, x [0, ), one get

 
|t x|
1 + 2 (1 + x2 ) 1 + (t x)2 (f ; ). (5.2)



|f (t) f (x)| 2 1 +

k
Theorem 5.4. Let f C1+x 2 [0, ). Then, we have

|Dnf (x) f (x)|

   
1 1
sup C(i, ) 1 + f; ,
x[0,) (1 + x2 )3 n n
where Ci is a constant depending on i and .

Proof. Using (5.2) and x, t (0, ), we have

 Szasz-Gamma operators based on Dunkl analogue 13

Dnf (|t x|; x)

 
|Dnf (x) 1 + 2 (1 + x2 )


f (x)| 2 1 +

1 + Dnf ((t x)2 ; x) (f ; ).


(5.3)

Applying Cauchy-Schwarz inequality for (5.3), we get

|Dnf (x) f (x)| 2 1 + 2 (1 + x2 )(f ; ) 1 + Dnf ((t x)2 ; x)

q q
Dnf ((t x)2 ; x) Dnf ((t x)2 ; x)Dnf ((t x)4 ; x)
!
+ + .

(5.4)

Using Lemma 2.3, we get

(1 + x) (1 + x + x2 + x3 )
Dnf ((t x)2 ; x) C1 (i, ) and Dnf ((t x)4 ; x) C2 (i, ) .(5.5)
n n

From (5.4) and (5.5), we have

(1 + x)
|Dnf (x) f (x)| 2 1 + 2 (1 + x2 )(f ; ) 1 + C1 (i, )



n
q q
(1+x+x2 +x3 ) !
C1 (i, ) (1+x)
n C1 (i, ) (1+x)
n C2 (i, ) n
+ + .

p p
On choosing = 1n and C(i, ) = {1+C1 (i, )+ C1 (i, )+ C1 (i, )C2 (i, )},
we get the required result.


Here, we shall prove a theorem to approximate each function belongs to

k
C1+x 2 [0, ). Similar result is discussed by Gadjiev [4] for locally integrable

functions.

k
Theorem 5.5. For f C1+x 2 [0, ) and > 0, we have

|Dnf (x)| f (x)

lim sup = 0.
n x[0,) (1 + x2 )1+
14 Abdul Wafi and Nadeem Rao

Proof. For any fixed real number x0 > 0, one has

|Dnf (x)| f (x) |Dnf (x)| f (x) |Dnf (x)| f (x)
sup 2 1+
sup + sup
x[0,) (1 + x ) xx0 (1 + x2 )1+ xx0 (1 + x2 )1+
kDnf (x)| f (x)kC[0,x0 ]
|Dnf (1 + t2 ; x)| |f (x)|
+ kf k1+x2 sup 2 1+
+ sup 2 1+
xx0 (1 + x ) xx0 (1 + x )
= I1 + I2 + I3 , say. (5.6)
Since |f (x)| kf k1+x2 (1 + x2 ), we have
|f (x)|
I3 = sup
xx0 (1 + x2 )1+
kf k1+x2 (1 + x2 ) kf k1+x2
sup .
xx0 (1 + x2 )1+ (1 + x2 )
Let  > 0 be arbitrary real number. Then, from Theorem 3.1 there exists
n1 N such that
1 
2  
I2 < kf k 1+x 2 1 + x + for all n1 n,
(1 + x2 ) 3kf k1+x2
kf k1+x2 
< 2
+ for all n1 n.
(1 + x ) 3
This implies that
kf k1+x2 
I2 + I3 < 2 2
+ .
(1 + x ) 3
kf k1+x2
Next, let for a large value of x0 , we have (1+x2 )
< 6 .
2
I2 + I3 < for all n1 n. (5.7)
3
From Theorem 5.2, there exists n2 > n in such a way

I1 = kDnf (f ) f kC[0,x0 ] < for all n2 n. (5.8)
3
Let n3 = max(n1 , n2 ). Then, combining (5.6), (5.7) and (5.8), we have
|Dnf (x)| f (x)
sup 2 1+
< .
x[0,) (1 + x )

Hence, the proof of Theorem 5.5 is completed. 

6. A-Statistical approximation
Gadjiev et al [5] was the first who introduced Statistical approximation theo-
rems in operators theory. Here, we recall same notation from [5], let A = (ank )
 Szasz-Gamma operators based on Dunkl analogue 15

be a non-negative infinite suitability matrix. For a given sequence x := (xk ),

the A-transform of x denoted by Ax : ((Ax)n ) is defined as

X
(Ax)n = ank xk ,
k=1

provided the series converges for each n. A is said to be regular if lim(Ax)n =

L whenever lim x = L. Then x = (xn ) is said to beP a A-statistically convergent
to L i.e. stA lim x = L if for every  > 0, limn k:|xk L| ank = 0.

Theorem 6.1. Let A = (ank ) be a non-negative regular suitability matrix and

x 0. Then, we have

k
stA lim kDnf (x) f k1+x2+ = 0, for all f C1+x 2+ [0, ) and > 0.
n

Proof. From ([3], p. 191, Th. 3), it is sufficient to show that for = 0

stA lim kDnf (ei ; x) ei k1+x2 = 0, for i {0, 1, 2}. (6.1)

n

Using Lemma 2.3, we have

1  + 1 
kDnf (e1 ; x) xk1+x2 = sup 2 n 
x[0,) 1 + x
+1 1
= sup .
n x[0,) 1 + x2

Now, for a given  > 0, we define the following sets

( )
M1 : = n: kDnf (e1 ; x) xk 
( )
+1
M2 : = n:  .
n
P P
This implies that M1 M2 , which shows that kM1 ank kM2 ank .
Hence, we have

stA lim kDnf (e1 ; x) xk1+x2 = 0. (6.2)

n

For i = 2 and using Lemma 2.3, we have

16 Abdul Wafi and Nadeem Rao

 
1  ei (nx) x
kDnf (e2 ; x) x2 k1+x2 = sup 2
4 + 2 + 2i
x[0,) 1 + x  ei (nx) n

( + 1)( + 2) 
+
n2


 
ei (nx) 1 x
= 4 + 2 + 2i sup
ei (nx) n x[0,) 1 + x2
( + 1)( + 2) 1
+ sup .
n2 x[0,) 1 + x2
For a given > 0, we have the following sets
( )

f 2
T1 : = n : Dn (e2 ; x) x 

(   )
ei (nx) 1 
T2 : = n : 4 + 2 + 2i
ei (nx) n 2
( )
( + 1)( + 2) 
T3 : = n: 2
.
n 2
S
This implies that T1 T2 T3 . By which, we get
X X X
ank ank + ank .
kT1 kT2 kT3

As n , we have

stA lim kDnf (e2 ; x) x2 k1+x2 = 0. (6.3)

n
This completes the proof of Theorem 6.1. 

7. Rate of convergence
Here, we shall investigate rate of convergence for the operators Dnf given
by (2.2) for the functions with derivative of bounded variation. Let f
DBV (0, ), 0 be the space of functions defined on (0, ) with derivative
of bounded variation on every subinterval of (0, ) and |f (t)| M t , for all
t > 0.
Lemma 7.1. Let x > 0 and > 0. Then, for sufficiently large value of n, we
have
Ry (i,)x
i. n (x, y) = 0 Kn (x, t)dt (xy)
1
2 n , 0 y < x.

R 1 (i,)x
ii. 1 n (x, z) = z Kn (x, t)dt (zx)2 n x < z < .
 Szasz-Gamma operators based on Dunkl analogue 17

Proof. To prove (i), we have

y y  2
xt
Z Z
n (x, y) = Kn (x, t)dt Kn (x, t)dt
0 0 xy
1
Df ((t x)2 , t)dt
(x y)2 n
1 (i, )x
.
(x y)2 n
Similarly, we can prove (ii). 

Theorem 7.2. Let f DBV (0, ), > 0. Then, for sufficient large value of
n and x (0, ), we have

  r  0 
 + 1   fx0 (x+) + fx0 (x)   f (x+) f 0 (x) 

(i, )x x x
|Dnf (x) f (x)| +
   
 n   2  n

 2



[ n] x x
(i, )x X _ 0 x _ 0
+ (fx ) + (fx )dt
n t
n x
k=1 x+ n

x+ xn x
[ n] x+ u
x _ 0 (i, )x X _ 0
+ (fx )dt + (fx ),
n x n x k=1

where

0 0

0
f (t) f (x+) if x < t < ,
fx (t) = 0 if t = x,
0 0
f (t) f (x+) if 0 t < x
Wm 0 0
and l (fx ) indicates the total variation of fx on [l, m].

Proof. From the hypothesis, we have

1 0 0 1
f 0 (u) = (f (x+) + f 0 (x)) + fx (u) + (f 0 (x+) f 0 (x))sgn(u x)
2  2 
1
+ x (u) f 0 (u) (f 0 (x+) + f 0 (x)) , (7.1)
2
where

1 if u = x
x (u) =
6 x.
0 if u =

From (2.2), we have

18 Abdul Wafi and Nadeem Rao

Z
Dnf (x) f (x) = [f (t) f (x)]xn (t)dt
0
Z Z t 
= f 0 (u)du xn (t)dt
0 x
Z xZ x 
= f 0 (u)du xn (t)dt
0 t
Z Z t 
+ f 0 (u)du xn (t)dt = M1 + M2 , say.
x x
(7.2)
Rt
Since x
x (u)du = 0 and from (7.1), we have
Z x Z x 
1 0 0
M1 = (f (x+) + f 0 (x)) + fx (u)
0 t 2
 
1 0 0
+ (f (x+) f (x))sgn(u x) du xn (t)dt
2
Z x Z Z x 
1 0 0 x 0
= (f (x+) + f (x)) (x t)n (t)dt + fx (u)du xn (t)dt
2 0 0 t
Z x
1 0 0
(f (x+) + f (x)) (x t)xn (t)dt. (7.3)
2 0

Similarly, we obtain

Z Z Z t 
1 0
M2 = (f (x+) + f 0 (x)) (t x)xn (t)dt + fx0 (u)du xn (t)dt
2
Zxx x x
1 0
+ (f (x+) + f 0 (x)) (x t)xn (t)dt. (7.4)
2 0

Combining (7.2), (7.3) and (7.4), we have

Z
1 0
Dnf (x) f (x) (f (x+) + f 0 (x)) (t x)xn (t)dt
2
Z0
1 0 0
+ (f (x+) + f (x)) |t x|xn (t)dt
2
Z xZ x  0
0
fx (u)du xn (t)dt
0 t
Z Z t 
+ fx0 (u)du xn (t)dt.
x x

Hence
 Szasz-Gamma operators based on Dunkl analogue 19

 
1 0
|Dnf (x)  (f (x+) + f 0 (x)) |Dnf ((t x); x)|

f (x)| 2 
 
1 0
 (f (x+) + f 0 (x)) Dnf (|t x|; x)

+ 2 
Z xZ x  
0 x
 
+ 
 fx (u)du n (t)dt
0 t
Z Z t  
0 x
 
+ 
 fx (u)du n (t)dt. (7.5)
x x

Let

Z x Z x 
An (fx0 ; x) = fx0 (u)du xn (t)dt
0 t

and
Z Z t 
Bn (fx0 ; x) = fx0 (u)du xn (t)dt.
x x
Rm
Next, we calculate An (f 0 x ; x) and Bn (f 0 x ; x). Since l n (x, t)dt 1 for all
[l, m] (0, ). Then, using Lemma 7.1 and integral by part with y = x xn ,
we get

Z x Z x  Z x

An (fx0 ; x) = fx0 (u)du (x, t)dt = fx0 (t)n (x, t)dt
0 t t n 0

Z x
|An (fx0 ; x)| |fx0 (t)|n (x, t)dt
0
Z x xn Z x
|fx0 (t)|n (x, t)dt + |fx0 (t)|n (x, t)dt.
0 x xn

Since fx0 (x) = 0 and n (x, t) 1, we have

Z x Z x
|fx0 (t)|n (x, t)dt = |fx0 (t) fx0 (x)|n (x, t)dt
x xn x xn
Z x x
_  x
 _ Z x
fx0 dt fx0 dt
x xn t x xn x xn

x
x _ 0
= f .
n x x
x n
20 Abdul Wafi and Nadeem Rao

x
Putting t = x u
Z x xn Z x xn
0 (i, )x 0 dt
|fx (t)|n (x, t)dt |fx (t)|
0 n 0 (x t)2
Z x
x xn _
(i, )x 0 dt
(fx )
n 0 t
(x t)2

Z n x [ n] x
(i, )x _ (i, )x X _ 0
= (fx ) (fx ).
n t x n t
x u k=1

Consequently

x [ n] x
 0
 x _ 0 (i, )x X _ 0
(f ; x) f + (fx ) (7.6)
 
An x 
n x x n t
x n
k=1

and
Z Z t  
0 0
x
 
Bn (fx ; x) = 
 fx (u)du n (t)dt
 Z0 Zx 
 2x t
0


x
fx (u)du (1 n (t))dt
 
t

 x x 
Z Z t  
0
fx (u)du xn (t)dt
 
+ 

Z2x x

x
 

 (f (t) f (x)) n (t)dt 

2x
Z 
|f 0 (x+)|  (t x)xn (t)dt
 
+
2x
Z 2x 
0
fx (u)du |(1 xn (t))dt
 
+ 

x
Z 2x
0
+ |fx (t)||(1 xn (t))dt|. (7.7)
x

Z 2x Z x+ xn
0 0
|fx (t)||(1 xn (t))dt| = |fx (t)||(1 xn (t))dt|
x x
Z 2x
0
+ |fx (t)||(1 xn (t))dt|
x+ xn

= P1 + P2 , say . (7.8)

Since fx0 (x) = 0 and n (x, t) 1, we have

 Szasz-Gamma operators based on Dunkl analogue 21

x+ xn
Z x+ xn Z x+ xn
0 0 _ 0
P1 = |fx (t) fx (x)||(1 xn (t))dt| (fx )dt
x x x
x+ xn
x _ 0
= (fx )dt. (7.9)
n x
x
Putting t = x + u

Z 2x Z 2x
0 (i, )x 0 0 dt
P2 = |fx (t)|(1 xn (t))dt |fx (t) fx (x)|
x+ xn n x+ xn (x t)2
x
Z 2x t Z n x+
_u
(i, )x _ dt (i, )x
(fx ) 2
(fx )du
n x+ xn x (x t) n 1 x
x
[ n] x+ u
(i, )x X _ 0
(fx ). (7.10)
n x k=1

Combining equation (7.8), (7.9) and (7.10), we obtain

x+ x x
2x n [ n] x+
(i, )x X _u 0
Z
0 x _ 0
|fx (t)|(1 xn (t))dt (fx )dt + (fx ). (7.11)
x n x n x k=1

In view of (7.5), (7.6), (7.7), (7.11) and Lemma 7.1, we prove the Theorem
7.2. 

References
[1] F. Altomare, M. Campiti, Korovkin-Type approximation Theory and its applica-
tions. De Gruyter Studies in Mathematics, Appendix A By Michael Pannenberg
and Appendix B By Fendinand Beckho, Walter De Gruyter, Berlin, Germany.
17 (1994).
[2] R. A. DeVore, G.G. Lorentz, Constructive Approximation. Grudlehren der
Mathematischen Wissenschaften [Fundamental principales of Mathematical Sci-
ences]. (Springer-Verlag, Berlin, 1993).
[3] O. Duman, C. Orhan, Statistical approximation by positive linear operators.
Studio Math. 16 (2) (2004) 187-197.
[4] A. D. Gadziev, Theorems of the type of P.P. Korovkins theorems. Mat. Zametki
20 (5) (1976) 781-786 (in Russian), Math. Notes 20 (5-6) (1976) 995-998 (Engl.
Trans.).
[5] A. D. Gadjiev, C. Orhan, Some approximation theorems via statistical conver-
gence. Rocky Mountain J. Math. 32 (1) (2007) 129-138.
[6] E. Ibikli, E. A. Gadjieva, The order of approximation of some unbounded func-
tions by the sequence of positive linear operators. Turkish J. Math. 19 (3) (1995)
331-337.
22 Abdul Wafi and Nadeem Rao

[7] G. Icoz, B. Cekim, Dunkl generalization of Szasz operators via q-calculus. J.

Inequal. Appl. 2015, 2015:284, 11 pp.
[8] G. Icoz, B. Cekim, Stancu-type generalization of Dunkl analogue of Szasz-
Kantorovich operators. Math. Met. Appl. Sci. 2015, DOI: 10.1002/mma.3602.
[9] A. Kajla, P. N. Agrawal, Szasz-Durrmeyer type operators based on Charlier
polynomials. Appl. Math. Comput. 268 (2015) 1001-1014.
[10] B. Lenze, On Lipschitz type maximal functions and their smoothness spaces.
Nederl Akad Indag Math. 50 (1988) 53-63.
[11] S. M. Mazhar, V. Totik, Approximation by modified Szasz operators. Acta Sci.
Math. (Szeged) 49 (1-4) (1985) 257-269.
[12] M. Mursaleen, Md. Nasiruzzaman, H. M. Shrivastwa, Approximation by bicom-
plex beta operators in compact (B)C-disks. Math. Met. Appl. Sci. (2016) DOI:
10.1002/mma.3739.
[13] M. Mursaleen, Md. Nasiruzzaman, H. M. Shrivastwa Approximation properties
for modified q-Bernstein-Kantorovich operators. Numer. Funct. Anal. Optim. 36
(5) (2015) 1178-1197.
[14] M. Mursaleen, Md. Nasiruzzaman, A Dunkl generalization of q-parametric
Szasz-Mirakjan operators. 2015, arXiv:1511.06628 [math.CA]
[15] A. Karaisa, F. Karakoc, Stancu Type Generalization of Dunkl Analogue of Szasz
Operators. Adv. Appl. Clifford Algebras (2016) 26: 1235. doi:10.1007/s00006-
016-0643-4
[16] M. A. Ozarslan, H. Aktuglu, Local approximation for certain King type opera-
tors. Filomat. 27 (2013) 173-181.
[17] M. Rosenblum, Generalized Hermite polynomials and the Bose-like oscillator
calculus. Oper. Theory Adv. Appl. 73 (1994) 369-396.
[18] O. Shisha, B. Bond, The degree of convergence of linear positive operators.
Proc. Nat. Acad. Sci. USA, 60 (1968) 1196-1200.
[19] S. Sucu, Dunkl analogue of Szasz operators. Appl. Math. Comput. 244 (2014)
42-48.
[20] O. Szasz, Generalization of S. Bernsteins polynomials to the infinite interval.
J. Research Nat. Bur. Standards. 45 (1950) 239-245.
[21] I. Yuksel, N. Ispir, Weighted approximation by a certain family of summation
integral-type operators. Comput. Math. Appl. 52 (10-11) (2006) 14-63-1470.

Abdul Wafi
Department of Mathematics
Faculty of Natural Sciences
Jamia Millia Islamia
New Delhi-110025
India
e-mail: awafi@jmi.ac.in
 Szasz-Gamma operators based on Dunkl analogue 23

Nadeem Rao
Department of Mathematics
Faculty of Natural Sciences
Jamia Millia Islamia
New Delhi-110025
India
e-mail: nadeemrao1990@gmail.com

View publication stats