Korovkin Second Theorem via B-Statistical A-Summability
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
- (i)
| | A|| = sup n∑k|ank| < ∞;
- (ii)
lim n ank = 0, for each k;
- (iii)
lim n ∑k ank = 1.
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.
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.
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
(5) If B = (C, 1) matrix and A = (ajk) are defined by
(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
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.
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 n∥Tn(f, x) − f(x)∥∞ = 0, for all f ∈ C[0,1] if and only if lim n∥Tn(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 n∥Tn(f, x) − f(x)∥∞ = 0, for all f ∈ C2π(ℝ) if and only if lim n∥Tn(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 f ∈ C2π(ℝ)
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 f ∈ C2π(ℝ)
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, [20–28]. Further Korovkin type approximation theorems for functions of two variables are proved in [29–32]. 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 f ∈ C2π(ℝ)
Proof. Since each of 1, cos x, and sinx belongs to C2π(ℝ), conditions (19) follow immediately from (18). Let the conditions (19) hold and f ∈ C2π(ℝ). Let I be a closed subinterval of length 2π of ℝ. Fix x ∈ I. By the continuity of f at x, it follows that for given ε > 0 there is a number δ > 0, such that for all t
Now, operating Tk(1; x) to this inequality, we obtain
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,
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) ,
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((y − x)/2).
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.
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.