1 Introduction and preliminaries

The concept of statistical convergence for sequences of real numbers was introduced by Fast [1] and further studied many others.

Let K ⊆ ℕ and K n = {kn : kK}. Then the natural density of K is defined by δ(K) = lim n n-1|K n | if the limit exists, where |K n | denotes the cardinality of K n .

A sequence x = (x k ) of real numbers is said to be statistically convergent to L provided that for every ε > 0 the set K ε :={k∈ℕ:|xk-L|≥ε} has natural density zero, i.e. for each ε > 0,

lim n 1 n | { k n : | x k - L | ε } | = 0 .

In this case we write st- lim x = L. Note that if x = (x k ) is convergent then it is statistically convergent but not conversely. The idea of statistical convergence of double sequences has been intruduced and studied in [2, 3].

Let A = (a nk ), n, k∈ℕ, be an infinite matrix and x = (x k ) be a sequence. Then the (transformed) sequence, Ax := (y n ), is denoted by

y n : = k = 1 a n k x k ,

where it is assumed that the series on the right converges for each n∈ℕ. We say that a sequence x is A-summable to the limit if y n as n → ∞.

A matrix transformation is said to be regular if it maps every convergent sequence into a convergent sequence with the same limit. The well-known conditions for two dimensional matrix to be regular are known as Silverman-Toeplitz conditions.

In [4], Edely and Mursaleen have given the notion of statistical A-summability for single sequences and statistical A-summability for double sequences has recently been studied in [5].

Let A = (a nk ) be a nonnegative regular summability matrix and x = (x k ) be a sequence of real or complex sequences. We say that x is statistically A-summable to L if for every ε > 0,

δ n : y n - L ε = 0 .

So, if x is statistically A-summable to L then for every ε > 0,

lim m 1 m n m : y n - L ε = 0 .

Note that if a sequence is bounded and A-statistically convergent to L, then it is A-summable to L; hence it is statistically A-summable to L but not conversely (see [4]).

Example 1.1. Let A = (C, 1), the Cesàro matrix and the sequence u = (u k ) be defined by

u k = 1 if k is odd, 0 if k is even .
(1.1)

Then u is is A-summable to 1 2 (and hence statistically A-summable to 1/2) but not statistically (and not A-statistically as well) convergent.

Let I := [0, ∞) and C(I) denote the space of all continuous real valued functions on I. Let C B (I):= {fC(I): f is bounded on I}.C(I) and C B (I) are equipped with norm

||f| | C ( I ) := sup x I |f ( x ) |.

Let H ω (I) denote the space of all real valued functions f on I such that

| f ( s ) - f ( x ) | ω f ; s 1 + s - x 1 + x ,

where ω is the modulus of continuity, i.e.

ω ( f ; δ ) = sup s , x I { | f ( s ) - f ( x ) | : | s - x | δ } .

It is to be noted that any function fH ω (I) is continuous and bounded on I.

The following Korovkin type theorem (see [6]) was proved by Çakar and Gadjiev [7].

Theorem A. Let (L n ) be a sequence of positive linear operators from H ω (I) into C B (I). Then for all fH ω (I)

lim n L n ( f ; x ) - f ( x ) C B ( I ) = 0

if and only if

lim n L n ( f i ; x ) - g i C B ( I ) = 0 ( i = 0 , 1 , 2 ) ,

where

g 0 ( x ) = 1 , g 1 ( x ) = x 1 + x , g 2 ( x ) = x 1 + x 2 .

Erkuş and Duman [8] have given the st A -version of the above theorem for functions of two variables.Quite recently, Korovkin type of approximation theorems have been proved in [9, 10] by using almost convergence; in [1115] by using variants of statistical convergence and in [1619] for functions of two variables by using statistical convergence, A-statistical convergence and statistical A-summability of double sequences. In this article, we use the notion of statistical A-summability to prove a Korovkin type approximation theorem for functions of two variables with the help of test functions 1 , x 1 + x , y 1 + y , ( x 1 + x ) 2 + ( y 1 + y ) 2 .

2 Main result

Let I = [0, ∞) and K = I × I. We denote by C B (K) the space of all bounded and continuous real valued functions on K equipped with norm

| | f | | C B ( K ) : = sup ( x , y ) K | f ( x , y ) | , f C B ( K ) .

Let H ω* (K) denote the space of all real valued functions f on K such that

| f ( s , t ) - f ( x , y ) | ω * f ; s 1 + s - x 1 + x 2 + t 1 + t - y 1 + y 2 ,

where ω* is the modulus of continuity, i.e.

ω * ( f ; δ ) = sup ( s , t ) , ( x , y ) K | f ( s , t ) - f ( x , y ) | : ( s - x ) 2 + ( t - y ) 2 δ .

It is to be noted that any function fHω*(K) is bounded and continuous on K, and a necessary and sufficient condition for fHω*(K) is that

lim δ 0 ω * ( f ; δ ) = 0 .

We prove the following result:

Theorem 2.1. Let A = (a nk ) be nonnegative regular summability matrix. Let (T k ) be a sequence of positive linear operators from Hω*(K) into C B (K). Then for all fHω*(K)

s t  -  lim n k = 1 a n k T k ( f ; x , y ) - f ( x , y ) C B ( K ) = 0
(2.0)

if and only if

s t  -  lim n k = 1 a n k T k ( 1 ; x , y ) - 1 C B ( K ) = 0
(2.1)
s t  -  lim n k = 1 a n k T k s 1 + s ; x , y - x 1 + x C B ( K ) = 0
(2.2)
s t  -  lim n k = 1 a n k T k t 1 + t ; x , y - y 1 + y C B ( K ) = 0
(2.3)
s t  -  lim n k = 1 a n k T k s 1 + s 2 + t 1 + t 2 ; x , y - x 1 + x 2 + y 1 + y 2 C B ( K ) = 0 .
(2.4)

Proof. Since each of the functions f 0 ( x , y ) = 1 , f 1 ( x , y ) = x 1 + x , f 2 ( x , y ) = y 1 + y , f 3 ( x , y ) = x 1 + x 2 + y 1 + y 2 belongs to Hω*(K), conditions (2.1)-(2.4) follow immediately from (2.0).

Let fHω*(K) and (x, y) ∈ K be fixed. Then for ε > 0 there exist δ1, δ2> 0 such that |f(s, t)-f(x, y)| < ε holds for all (s, t) ∈ K satisfying | s 1 + s - x 1 + x |< δ 1 and | t 1 + t - y 1 + y |< δ 2 .

Let

K ( δ ) : = ( s , t ) K : s 1 + s - x 1 + x 2 + t 1 + t - y 1 + y 2 < δ = min { δ 1 , δ 2 } .

Hence

| f ( s , t ) - f ( x , y ) | = | f ( s , t ) - f ( x , y ) | χ K ( δ ) ( s , t ) + | f ( s , t ) - f ( x , y ) | χ K \ K ( δ ) ( s , t ) ε + 2 N χ K \ K ( δ ) ( s , t )
(2.5)

Where χ D denotes the characteristic function of the set D and N=||f| | C B ( K ) . Further we get

χ K \ K ( δ ) ( s , t ) 1 δ 1 2 s 1 + s - x 1 + x 2 + 1 δ 2 2 t 1 + t - y 1 + y 2 .
(2.6)

Combining (2.5) and (2.6), we get

| f ( s , t ) - f ( x , y ) | ε + 2 N δ 2 s 1 + s - x 1 + x 2 + t 1 + t - y 1 + y 2 ,
(2.7)

After using the properties of f, a simple calculation gives that

| T k ( f ; x , y ) f ( x , y ) | ε + M { | T k ( f 0 ; x , y ) f 0 ( x , y ) | + | T k ( f 1 ; x , y ) f 1 ( x , y ) | + | T k ( f 2 ; x , y ) f 2 ( x , y ) | + | T k ( f 3 ; x , y ) f 3 ( x , y ) | } ,
(2.8)

where

M:=ε+N+ 4 N δ 2 .

Now replacing T k (f; x, y) by k = 1 a n k T k ( f ; x , y ) and taking sup(x,y)∈K, we get

k = 1 a n k T k ( f ; x , y ) - f ( x , y ) C B ( K ) ε + M k = 1 a n k T k ( f 0 ; x , y ) - f 0 ( x , y ) C B ( K ) + k = 1 a n k T k ( f 1 ; x , y ) - f 1 ( x , y ) C B ( K ) + k = 1 a n k T k ( f 2 ; x , y ) - f 2 ( x , y ) C B ( K ) + k = 1 a n k T k ( f 3 ; x , y ) - f 3 ( x , y ) C B ( K ) .
(2.9)

For a given r > 0 choose ε > 0 such that ε < r. Define the following sets

D : = n : k = 1 a n k T k ( f ; x , y ) - f ( x , y ) C B ( K ) r , D 1 : = n : k = 1 a n k T k ( f 0 ; x , y ) - f 0 ( x , y ) C B ( K ) r - ε 4 K , D 2 : = n : k = 1 a n k T k ( f 1 ; x , y ) - f 1 ( x , y ) C B ( K ) r - ε 4 K , D 3 : = n : k = 1 a n k T k ( f 2 ; x , y ) - f 2 ( x , y ) C B ( K ) r - ε 4 K , D 4 : = n : k = 1 a n k T k ( f 3 ; x , y ) - f 3 ( x , y ) C B ( K ) r - ε 4 K .

Then from (2.9), we see that DD1D2D3D4 and therefore δ(D) ≤ δ(D1) + δ(D2) + δ(D3) + δ(D4). Hence conditions (2.1)-(2.4) imply the condition (2.0).

This completes the proof of the theorem.

If we replace the matrix A in Theorem 2.1 by identity matrix, then we immediately get the following result which is due to Erkuş and Duman [8]:

Corollay 2.2. Let A = (a nk ) be nonnegative regular summability matrix. Let (T k ) be a sequence of positive linear operators from Hω*(K) into C B (K). Then for all fHω*(K)

s t  -  lim k T k ( f ; x , y ) - f ( x , y ) C B ( K ) = 0
(2.10)

if and only if

s t  -  lim k T k ( 1 ; x , y ) - 1 C B ( K ) = 0 ,
(2.11)
s t  -  lim k T k s 1 + s ; x , y - x 1 + x C B ( K ) = 0 ,
(2.12)
s t  -  lim k T k t 1 + t ; x , y - y 1 + y C B ( K ) = 0 ,
(2.13)
s t  -  lim k T k s 1 + s 2 + t 1 + t 2 ; x , y - x 1 + x 2 + y 1 + y 2 C B ( K ) = 0 .
(2.14)

3 Statistical rate of convergence

In this section, using the concept of statistical A-summability we study the rate of convergence of positive linear operators with the help of the modulus of continuity. Let us recall, for fHω*(K)

|f ( s , t ) -f ( x , y ) | ω * f ; s 1 + s - x 1 + x 2 + t 1 + t - y 1 + y 2 ,

where

ω * ( f ; δ ) = sup ( s , t ) , ( x , y ) K | f ( s , t ) - f ( x , y ) | : ( s - x ) 2 + ( t - y ) 2 δ .

We have the following result:

Theorem 3.1. Let A = (a nk ) be nonnegative regular summability matrix. Let (T k ) be a sequence of positive linear operators from Hω*(K) into C B (K). Assume that

(i) s t  - li m n k = 1 a n k T k ( f 0 ) - f 0 C B ( K ) = 0 ,

(ii) st- limn→ 0ω*(f; δ n ) = 0, where

δ n = k = 1 a n k T k ( ψ ) C B ( K )  with  ψ = ψ ( s , t ) = s 1 + s - x 1 + x 2 + t 1 + t - y 1 + y 2 .

Then for all fHω*(K)

st -  lim n k = 1 a n k T k ( f ) - f C B ( K ) =0.

Proof. Let fHω*(K) be fixed and (x, y) ∈ K be fixed. Using linearity and positivity of the operators T k for all n∈ℕ, we have

k = 1 a n k T k ( f ; x , y ) - f ( x , y ) k = 1 a n k T k ( | f ( s , t ) - f ( x , y ) | ; x , y ) + | f ( x , y ) | k = 1 a n k T k ( f 0 ; x , y ) - f 0 ( x , y ) k = 1 a n k T k ω * f ; δ s 1 + s - x 1 + x 2 + t 1 + t - y 1 + y 2 δ ; x , y + | | f | | C B ( K ) k = 1 a n k T k ( f 0 ; x , y ) - f 0 ( x , y ) k = 1 a n k T k 1 + s 1 + s - x 1 + x 2 + t 1 + t - y 1 + y 2 δ ω * ( f ; δ ) ; x , y + | | f | | C B ( K ) k = 1 a n k T k ( f 0 ; x , y ) - f 0 ( x , y ) k = 1 a n k ω * ( f ; δ ) T k 1 + s 1 + s - x 1 + x 2 + t 1 + t - y 1 + y 2 δ 2 ; x , y + | | f | | C B ( K ) k = 1 a n k T k ( f 0 ; x , y ) - f 0 ( x , y ) ω * ( f ; δ ) k = 1 a n k T k ( f 0 ; x , y ) - f 0 ( x , y ) + | | f | | C B ( K ) | k = 1 a n k T k ( f 0 ; x , y ) - f 0 ( x , y ) + ω * ( f ; δ ) + ω * ( f ; δ ) δ 2 k = 1 a n k T k s 1 + s - x 1 + x 2 + t 1 + t - y 1 + y 2 ; x , y .

Hence

k = 1 a n k T k ( f ) - f C B ( K ) . | | f | | C B ( K ) k = 1 a n k T k ( f 0 ) - f 0 C B ( K ) + ω * ( f ; δ ) k = 1 a n k T k ( f 0 ) - f 0 C B ( K ) + ω * ( f ; δ ) δ 2 k = 1 a n k T k ( ψ ) C B ( K ) + ω * ( f ; δ ) .

Now if we choose δ : = δ n : = k = 1 a n k T k ( ψ ) C B ( K ) then

k = 1 a n k T k ( f ) - f C B ( K ) . | | f | | C B ( K ) k = 1 a n k T k ( f 0 ) - f 0 C B ( K ) + ω * ( f ; δ n ) k = 1 a n k T k ( f 0 ) - f 0 C B ( K ) + 2 ω * ( f ; δ n ) .

Therefore

k = 1 a n k T k ( f ) - f C B ( K ) . M k = 1 a n k T k ( f 0 ) - f 0 C B ( K ) + ω * ( f ; δ n ) k = 1 a n k T k ( f 0 ) - f 0 C B ( K ) + ω * ( f ; δ n ) ,
(3.1)

where M=max { 2 , | | f | | C B ( K ) } . Now, for a given r > 0, choose ε > 0 such that ε > r. Let us write

E : = n : k = 1 a n k T k ( f ; x , y ) - f ( x , y ) C B ( K ) r , E 1 : = n : k = 1 a n k T k ( f 0 ; x , y ) - f 0 ( x , y ) C B ( K ) r 3 K , E 2 : = n : ω * ( f ; δ n ) r 3 K , E 3 : = n : ω * ( f ; δ n ) k = 1 a n k T k ( f 0 ; x , y ) - f 0 ( x , y ) C B ( K ) r 3 K .

Then EE1E2E3 and therefore δ(E) ≤ δ(E1) + δ(E2) + δ(E3). Using conditions (i) and (ii) we conclude

s t  -  lim n k = 1 a n k T k ( f ) - f C B ( K ) = 0 .

This completes the proof of the theorem.

4 Example and the concluding remark

We show that the following double sequence of positive linear operators satisfies the conditions of Theorem 2.1 but does not satisfy the conditions of Corollary 2.2 and Theorem 2.1 of [8].

Example 4.1. Consider the following Bleimann et al. [20] (of two variables) operators:

B n ( f ; x , y ) : = 1 ( 1 + x ) n ( 1 + y ) n j = 0 n k = 0 n f j n - j + 1 , k n - k + 1 n j n k x j y k ,
(4.1)

where fH ω (K), K = [0, ∞) × [0, ∞) and n∈ℕ.

Since

( 1 + x ) n = j = 0 n m j x j ,

it is easy to see that

B n ( f 0 ; x , y ) 1= f 0 ( x , y ) .

Also by simple calculation, we obtain

B n ( f 1 ; x , y ) = n n + 1 x 1 + x x 1 + x = f 1 ( x , y ) ,

and

B n ( f 2 ; x , y ) = n n + 1 y 1 + y y 1 + y = f 2 ( x , y ) .

Finally, we get

B n ( f 3 ; x , y ) = n ( n - 1 ) ( n + 1 ) 2 x 1 + x 2 + n ( n + 1 ) 2 x 1 + x + n ( n - 1 ) ( n + 1 ) 2 y 1 + y 2 + n ( n + 1 ) 2 y 1 + y x 1 + x 2 + y 1 + y 2 = f 3 ( x , y ) .

Now, take A = C(1, 1) and define u = (u n ) by (1.1). Let the operator L n : H ω (K) → C B (K) be defined by

L n ( f ; x , y ) = ( 1 + u n ) B n ( f ; x , y ) .

It is easy to see that the sequence (L n ) satisfies the conditions (2.1)-(2.4). Hence by Theorem 2.1, we have

s t  -  lim m n = 1 a m n L n ( f ; x , y ) - f ( x , y ) C B ( K ) = s t  -  lim m 1 m n = 1 m L n ( f ; x , y ) - f ( x , y ) C B ( K ) = 0 .

On the other hand, the sequence (L n ) does not satisfy the conditions of Theorem A and Corollary 2.2 and Theorem 2.1 of [8], since (L n ) is neither convergent nor statistically (nor A-statistically) convergent. That is, Theorem A, Corollary 2.2 and Theorem 2.1 of [8] do not work for our operators L n . Hence our Theorem 2.1 is stronger than Corollary 2.2 and Theorem 2.1 of [8].