On preservation of binomial operators

Binomial operators are the most important extension to Bernstein operators, defined by (LnQf)(x)=1bn(1)∑k=0n(nk)bk(x)bn−k(1−x)f(kn),f∈C[0,1],\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \bigl(L^{Q}_{n} f\bigr) (x)=\frac{1}{b_{n}(1)} \sum ^{n}_{k=0}\binom { n}{k } b_{k}(x)b_{n-k}(1-x)f\biggl( \frac{k}{n}\biggr),\quad f\in C[0, 1], $$\end{document} where {bn}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\{b_{n}\}$\end{document} is a sequence of binomial polynomials associated to a delta operator Q. In this paper, we discuss the binomial operators {LnQf}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\{L^{Q}_{n} f\}$\end{document} preservation such as smoothness and semi-additivity by the aid of binary representation of the operators, and present several illustrative examples. The results obtained in this paper generalize what are known as the corresponding Bernstein operators.


Introduction
Bernstein operators, also known as Bernstein polynomials, are typical positive linear operators, defined as follows: (B n f )(x) = n k=0 n k x k (1x) n-k f k n , n = 1, 2, . . . , which were first introduced by Bernstein in [6], and more detailed discussions were given by Lorentz in [19]. Thanks to its simple and graceful form, as well as the favorable properties of approximation and preservation, Bernstein operators have attracted a good deal of attention, with hundreds of related research publications [2, 7, 9, 11-13, 17, 19, 28, 29, 38]. Due to the properties of approximation and preservation, Bernstein operators are applied to CAGD (computer aided geometric design) and IM (industrial manufacture). For example, Bézier nets, which are powerful tools to express and design curves and surfaces in CAGD, are constructed by Bernstein operators. For Bernstein operators, there are various extensions and modifications. Among them, binomial operators should be the most important extension as they maintain key structural characteristics of Bernstein operators, which were first introduced by Popoviciu in [27], defined as follows: where {b n } is a sequence of binomial polynomials, that is, b n (x) is a polynomial of exact degree n satisfying, for any x, y ∈ [0, 1], and Q is a delta operator uniquely determined by the sequence of binomial polynomials {b n }. These sequences and their generalizations have been studied by many mathematicians [10,15,22,24,25,[33][34][35][36]. In [32], Roman and Rota pointed out that many polynomial sequences occurring in various mathematical circumstances turn out to be of binomial type. The study of binomial polynomial sequences may go back to Bell [5], but at that time, one only used the less efficient generating function method. Before 1970, Mullin and Rota in [26] introduced a simpler and more convenient operator method, umbral calculus, which is a linear-algebraic theory used to study certain types of polynomial functions that play an important role in applied mathematics [3,18]. Preservation of operators belong to theoretical basis of CAGD, involving preservation of smoothness, preservation of shape, one-side approximation, variation diminishing, the best constants in approximation of preservation and so on, on which there has been considerable research in [1,3,8,16,18,20,40]. Here we would also like to mention Refs. [39,41], in which the authors investigate properties of preserving shape such as convexity, star-shape, semi-additivity and those under the average for the Szász-Kantorovich operators and Baskakov-Kantorovich operators, respectively.
For binomial operators, their approximation and preservation have been considered in [4,23]. In [23], we may observe preservation of monotonicity, convexity and Lipschitz for the binomial operators, but still there are many other problems of preservation to explore, which is a main motivation of this article. In the present paper we show the binomial operators preserving smoothness and semi-additivity, which appear in the third section. In the next section, we introduce some relevant notations and the corresponding preservation of Bernstein operators.

Bernstein operators and preservation
First,we define some classes of functions.
A function f is said to be upper semi-additive (lower semi-additive) on [0, 1], if it satisfies Let M > 0 and 0 < α ≤ 1, we define where ω(f ; t) is the modulus of continuity of f , defined by We denote a continuous modulus function on [0, 1] by ω(t), that is, ω(t) is non- then ω(f ; t) is a continuous modulus function, and conversely, if f is a continuous modulus Next, we set out for some well-known results on preservation of smoothness for Bernstein operators as follows ( [20], Theorem A).
, for all n ≥ 1, and the constant 2 is optimal.

Binomial operators and preservation
It is well known that the behavior of an operator strongly depends on its structure. From [40] we can find binomial operators have the following so-called binary representation similar to Bernstein operators.
Lemma Let L Q n be binomial operators defined above, then In this section we suppose all binomial operators L Q n to be positive and denote L Q n ∈ B. By the lemma, we can obtain the following theorem. Proof By the definition of the sequence of binomial polynomials, we can derive easily By the definition of B nkl (x, y) and exchanging the order of the sum, we have By the identities above and L Q n ∈ B, we obtain which means that ω(L Q n f ; h) ≤ 2ω(f ; h). From Theorem A in Sect. 2, we know the constant 2 is optimal. According to Theorem 3.1, it is easy to get the following corollary.
Corollary 1 If f ∈ H ω , then L Q n f ∈ H 2ω , for all n ≥ 1.
When ω(t) is concave (upper convex), the constant 2 above could be substituted for by 1.

Theorem 3.2
If ω(t) is concave (upper convex) and f ∈ H ω , then L Q n f ∈ H ω , for all n ≥ 1.
Proof By the lemma, direct computation gives, for x, y ∈ [0, 1], x ≤ y, From [23], we see that, if f (x) is concave (upper convex) on [0, 1], then which means that ω(L Q n f ; h) ≤ ω(h), that is, L Q n f ∈ H ω . This completes the proof.
In particular, on taking ω(h) = h α , by Theorem 3.2 we have the following result, which can be found in [27,30]. By the definition of B nkl (x, y) and exchanging the order of the sum, we have Thus, from which one derives the binomial operators to preserve the upper semi-additivity. That completes the proof.

Theorem 3.4 If ω(h) be a continuous modulus function on
Hence, This finishes the proof. Along the same lines, we may prove that binomial operators preserve lower semi-additivity.
As an application of these theorems above, in the following we give several specific cases.
Case 3.1 If the delta operator Q = D (ordinary differential operator), then the associated sequence of binomial polynomials is {x n }, that is, b k (x) = x k , therefore the corresponding binomial operator is As is well known, this is the case of the famous Bernstein operators. In this case, Theorems 3.1-3.4 as well as their corollaries hold for the binomial operators L D n .

Case 3.2
If the delta operator Q = = e D -I (forward difference operator), then the corresponding binomial operators are which are called Stancu operators [36]. Since the sequence of binomial polynomials associated to is b n (x) = (x) n = x(x + 1) · · · (x + n -1), n = 0, 1, . . . , which implies L n ∈ B, Theorems 3.1-3.4 as well as their corollaries hold for all for the binomial operators L n .
Remark 1 Since when the delta operator Q = ∇ = I -e -D (back difference operator), associated to which is the sequence of binomial polynomials b n (x) = [x] n = x(x -1) · · · (xn + 1), n = 0, 1, . . . , the corresponding binomial operators L ∇ n are not well defined, in this case being replaced by (see [40]) is the sequence of binomial polynomials associated to T, which implies L T n ∈ B, therefore Theorems 3.1-3.4 as well as their corollaries hold all for this binomial operator.
Remark 2 Here the results in Cases 3.2 and 3.3 are new. Binomial operators preserving star-shape and shape under the average we may study elsewhere.