Volume 2013, Issue 1 598963
Research Article
Open Access

Korovkin Second Theorem via B-Statistical A-Summability

M. Mursaleen

M. Mursaleen

Department of Mathematics, Aligarh Muslim University, Aligarh 202002, India amu.ac.in

Search for more papers by this author
A. Kiliçman

Corresponding Author

A. Kiliçman

Department of Mathematics and Institute for Mathematical Research, University Putra Malaysia, 43400 Serdang, Selangor, Malaysia upm.edu.my

Search for more papers by this author
First published: 14 February 2013
Citations: 10
Academic Editor: Feyzi Başar

Abstract

Korovkin type approximation theorems are useful tools to check whether a given sequence of positive linear operators on C[0,1] of all continuous functions on the real interval [0,1] is an approximation process. That is, these theorems exhibit a variety of test functions which assure that the approximation property holds on the whole space if it holds for them. Such a property was discovered by Korovkin in 1953 for the functions 1, x, and x2 in the space C[0,1] as well as for the functions 1, cos, and sin in the space of all continuous 2π-periodic functions on the real line. In this paper, we use the notion of B-statistical A-summability to prove the Korovkin second approximation theorem. We also study the rate of B-statistical A-summability of a sequence of positive linear operators defined from C2π() into C2π().

1. Introduction and Preliminaries

Let be the set of all natural numbers, K, and Kn = {kn : kK}. Then the natural density of K is defined by
()
if the limit exists, where the vertical bars indicate the number of elements in the enclosed set, C1 = (C, 1) is the Cesàro matrix of order 1, and χK denotes the characteristic sequence of K given by
()
A sequence x = (xk) is said to be statistically convergent to L if for every ε > 0, the set Kε : = {k:|xkL | ≥ ε} has natural density zero (cf. Fast [1]); that is, for each ε > 0,
()
In this case, we write L = st − lim  x.   By the symbol st we denote the set of all statistically convergent sequences. Statistical convergence of double sequences is studied in [2, 3].
A matrix is called regular if it transforms a convergent sequence into a convergent sequence leaving the limit invariant. The well-known necessary and sufficient conditions (Silverman-Toeplitz) for A to be regular are
  • (i)

    | | A|| = sup nk|ank| < ;

  • (ii)

    lim n  ank = 0, for each k;

  • (iii)

    lim n  ∑kank = 1.

Freedmann and Sember [4] generalized the natural density by replacing C1 with an arbitrary nonnegative regular matrix A. A subset K of has A-density if
()
exists. Connor [5] and Kolk [6] extended the idea of statistical convergence to A-statistical convergence by using the notion of A-density.

A sequence x is said to be A-statistically convergent to L if δA(Kϵ) = 0 for every ϵ > 0. In this case we write stA − lim xk = L. By the symbol stA we denote the set of all A-statistically convergent sequences.

In [7], Edely and Mursaleen generalized these statistical summability methods by defining the statistical A-summability and studied its relationship with A-statistical convergence.

Let A = (aij) be a nonnegative regular matrix. A sequence x is said to be statistically A-summable to L if for every ϵ > 0, δ({in:|yiL | ≥ ϵ}) = 0; that is,
()
where yi = Ai(x). Thus x is statistically A-summable to L if and only if Ax is statistically convergent to L. In this case we write L = (A) st − lim x = st − lim Ax. By (A) st we denote the set of all statistically A-summable sequences. A more general case of statistically A-summability is discussed in [8].

Quite recently, Edely [9] defined the concept of B-statistical A-summability for nonnegative regular matrices A and B which generalizes all the variants and generalizations of statistical convergence, for example, lacunary statistical convergence [10], λ-statistical convergence [11], A-statistical convergence [6], statistical A-summability [7], statistical (C, 1)-summability [12], statistical (H, 1)-summability [13], statistical -summability [14], and so forth.

Let A = (aij) and B = (bnk) be two nonnegative regular matrices. A sequence x = (xk) of real numbers is said to be B-statisticallyA-summable to L if for every ϵ > 0, the set K(ϵ) = {i : |yiL| ≥ ϵ} has B-density zero, thus
()
where In this case we denote by . The set of all B-statistically A-summable sequences will be denoted by .

Remark 1. (1) If A = I (unit matrix), then is reduced to the set of B-statistically convergent sequences which can be further reduced to lacunary statistical convergence and λ-statistical convergence for particular choice of the matrix B.

(2) If B = (C, 1) matrix, then is reduced to the set of statistically A-summable sequences.

(3) If A = B = (C, 1) matrix, then is reduced to the set of statistically (C, 1)-summable sequences.

(4) If B = (C, 1) matrix and A = (ajk) are defined by

()
then is reduced to the set of statistically -summable sequences, where p = (pk) is a sequence of nonnegative numbers, such that p0 > 0 and
()

(5) If B = (C, 1) matrix and A = (ajk) are defined by

()
where , then is reduced to the set of statistically (H, 1)-summable sequences.

(6) If a sequence is convergent, then it is B-statistically A-summable, since Ax converges and has B-density zero, but not conversely.

(7) The spaces st,  stB,  (A)st, and are not comparable, even if A = B(≠(C, 1)).

(8) If a sequence is A-summable, then it is B-statistically A-summable.

(9) If a sequence is bounded and A-statistically convergent, then it is A-summable and hence statistically A-summable ([7], see Theorem 2.1) and B-statistically A-summable but not conversely.

Example 2. (1) Let us define A = (aij), B = (bnk), and x = (xk) by

()
Then
()

Here x ∉ st, x ∉ (A)st, x ∉ stA, and , but     x is B-statistically A-summable to 1, since δB{i : |yi − 1| ≥ ϵ} = 0. On the other hand we can see that x is B-summable and hence x is B-statistically B-summable, A-statistically B-summable, B-statistically convergent, and statistically B-summable.

Let F() denote the linear space of all real-valued functions defined on . Let C() be the space of all functions f continuous on . We know that C() is a Banach space with norm
()
We denote by C2π() the space of all 2π-periodic functions fC() which is a Banach space with
()

The classical Korovkin first and second theorems statewhatfollows [15, 16]:

Theorem I. Let (Tn) be a sequence of positive linear operators from C[0,1] into F[0,1]. Then lim nTn(f, x) − f(x)∥ = 0, for all fC[0,1] if and only if   lim nTn(fi, x) − ei(x)∥ = 0, for i = 0,1, 2, where e0(x) = 1,  e1(x) = x, and e2(x) = x2.

Theorem II. Let (Tn) be a sequence of positive linear operators from C2π() into F(). Then lim nTn(f, x) − f(x)∥ = 0,  for all fC2π() if and only if   lim nTn(fi, x) − fi(x)∥ = 0,  for i = 0,1, 2, where f0(x) = 1,  f1(x) = cos x, and f2(x) = sinx.

We write Ln(f; x) for Ln(f(s); x), and we say that L is a positive operator if  L(f; x) ≥ 0 for all f(x) ≥ 0.

The following result was studied by Duman [17] which is A-statistical analogue of Theorem II.

Theorem A. Let A = (ank) be a nonnegative regular matrix, and let (Tk) be a sequence of positive linear operators from C2π() into C2π(). Then for all fC2π()

()
if and only if
()

Recently, Karakuş and Demirci [18] proved Theorem II for statistical A-summability.

Theorem B. Let A = (ank) be a nonnegative regular matrix, and let (Tk) be a sequence of positive linear operators from C2π() into C2π(). Then for all fC2π()

()
if and only if
()

Several mathematicians have worked on extending or generalizing the Korovkin′s theorems in many ways and to several settings, including function spaces, abstract Banach lattices, Banach algebras, and Banach spaces. This theory is very useful in real analysis, functional analysis, harmonic analysis, measure theory, probability theory, summability theory, and partial differential equations. But the foremost applications are concerned with constructive approximation theory which uses it as a valuable tool. Even today, the development of Korovkin-type approximation theory is far frombeingcomplete. Note that the first and the second theorems of Korovkin are actually equivalent to the algebraic and the trigonometric version, respectively, of the classical Weierstrass approximation theorem [19]. Recently, such type of approximation theorems has been proved by many authors by using the concept of statistical convergence and its variants, for example, [2028]. Further Korovkin type approximation theorems for functions of two variables are proved in [2932]. In [29, 33] authors have used the concept of almost convergence. In this paper, we prove Korovkin second theorem by applying the notion of B-statistical A-summability. We give here an example to justify that our result is stronger than Theorems II, A, and B. We also study the rate of B-statistical A-summability of a sequence of positive linear operators defined from C2π() into C2π().

2. Main Result

Now, we prove Theorem II for B-statistically A-summability.

Theorem 3. Let A = (ank) and B = (bnk) be nonnegative regular matrices, and let (Tk) be a sequence of positive linear operators from C2π() into C2π(). Then for all fC2π()

()
if and only if
()

Proof. Since each of 1, cos x, and sinx belongs to C2π(), conditions (19) follow immediately from (18). Let the conditions (19) hold and fC2π(). Let I  be a closed subinterval of length 2π of   . Fix xI. By the continuity of f at x, it follows that for given ε > 0 there is a number δ > 0, such that for all t

()
whenever |tx | < δ. Since f is bounded, it follows that
()
for all t. For all t ∈ (xδ, 2π + xδ], it is well known that
()
where ψ(t) = sin2((tx)/2). Since the function fC2π() is 2π-periodic, the inequality (22) holds for t.

Now, operating Tk(1; x) to this inequality, we obtain

()
Now, taking sup xI, we get
()
where K : = ε + ∥f2π + (∥f2π/sin2(δ/2)). Now replace Tk(·, x) by ∑kamkTk(·, x) and then by Bm(·, x) in (24) on both sides. For a given r > 0 choose ε > 0, such that ε < r. Define the following sets
()
Then DD1D2D3, and so δB(D) ≤ δB(D1) + δB(D2) + δB(D3). Therefore, using conditions (19) we get (18).

This completes the proof of the theorem.

3. Rate of B-Statistical A-Summability

In this section, we study the rate of B-statistical A-summability of a sequence of positive linear operators defined from C2π() into C2π().

Definition 4. Let A = (aij) and B = (bnk) be two nonnegative regular matrices. Let (αn) be a positive nonincreasing sequence. We say that the sequence x = (xk) is B-statistically A-summable to the number L with the rate o(αn) if for every ε > 0,

()
where K(ϵ) = {i : |yiL| ≥ ϵ} and yi = Ai(x) = ∑jaijxj as described above. In this case, we write .

As usual we have the following auxiliary result whose proof is standard.

Lemma 5. Let (αn) and (βn) be two positive nonincreasing sequences. Let x = (xk) and y = (yk) be two sequences, such that and . Then

  • (i) , for any scalar c,

  • (ii) ,

  • (iii) ,

where γn = max {αn, bn}.

Now, we recall the notion of modulus of continuity. The modulus of continuity of fC2π(), denoted by ω(f, δ), is defined by
()
It is well known that
()

Then prove the following result.

Theorem 6. Let (Tk) be a sequence of positive linear operators from C2π() into C2π(). Suppose that

  • (i)

    ,

  • (ii)

    , where and  φx(y) = sin2((yx)/2).

Then for all fC2π(), we have
()
where γn = max {αn, βn}.

Proof. Let fC2π() and x ∈ [−π, π]. Using (28), we have

()
Put . Hence we get
()
where K = max {∥f2π, 1 + π2}. Hence
()
Now, using Definition 4 and Conditions (i) and (ii), we get the desired result.

This completes the proof of the theorem.

4. Example and Concluding Remark

In the following we construct an example of a sequence of positive linear operators satisfying the conditions of Theorem 3 but does not satisfy the conditions of Theorems II, A, and B.

For any n, denote by Sn(f) the nth partial sum of the Fourier series of f; that is,
()
For any n, write
()
A standard calculation gives that for every t
()
where
()
The sequence (φn) n is a positive kernel which is called the Fejér kernel, and the corresponding operators Fn,  n ≥ 1, are called the Fejér convolution operators. We have
()
Note that the Theorems II, A, and B hold for the sequence (Fn). In fact, we have for every fC2π(),
()
Let A = (aij), B = (bnk), and x = (xk) be defined as in Example 2. Let Ln : C2π() → C2π() be defined by
()
Then x is not statistically convergent, not A-statistically convergent, and not statistically A-summable, but it is B-statistically A−summable to 1. Since x is B-statistically A-summable to 1, it is easy to see that the operator Ln satisfies the conditions (19), and hence Theorem 3 holds. But on the other hand, Theorems II, A, and B do not hold for our operator defined by (39), since x (and so Ln) is not statistically convergent, not A-statistically convergent, and not statistically A-summable.

Hence our Theorem 3 is stronger than all the above three theorems.

Acknowledgments

This joint work was done when the first author visited University Putra Malaysia as a visiting scientist during August 27–September 25, 2012. The author is very grateful to the administration of UPM for providing him local hospitalities.

      The full text of this article hosted at iucr.org is unavailable due to technical difficulties.