<!DOCTYPE html>
<html lang="en">
<head>
<script>
  MathJax = { 
    tex: {
		    inlineMath: [['\\(','\\)']]
	} }
</script>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js">
</script>
<meta name="generator" content="plasTeX" />
<meta charset="utf-8" />
<meta name="viewport" content="width=device-width, initial-scale=1" />
<title>The first absolute moment for some operators: The first absolute moment for some operators</title>
<link rel="stylesheet" href="/var/www/clients/client1/web1/web/files/jnaat-files/journals/1/articles/styles/theme-white.css" />
</head>

<body>

<div class="wrapper">

<div class="content">
<div class="content-wrapper">


<div class="main-text">


<div class="titlepage">
<h1>The first absolute moment for some operators</h1>
<p class="authors">
<span class="author">Ovidiu T. Pop\(^\S \) Petru I. Braica\(^\ast \)</span>
</p>
<p class="date">December 15, 2009.</p>
</div>
<p>\(^\S \)National College “Mihai Eminescu", 5 Mihai Eminescu Street, 440014 Satu Mare, Romania, e-mail: <span class="tt">ovidiutiberiu@yahoo.com</span> </p>
<p>\(^\ast \) Secondary School “Grigore Moisil", 1 Mileniului Street, 440037 Satu Mare, Romania, e-mail: <span class="tt">petrubr@yahoo.com</span> </p>

<div class="abstract"><p> In this paper we will determinate the first absolute moments for Bernstein, Szász-Mirakjan, Bleimann-Butzer-Hahn, Meyer-König and Zeller operators. For the Szász-Mirakjan operators we give some properties with the absolute moment of high order. </p>
<p><b class="bf">MSC.</b> 41A10, 41A10, 41A36 </p>
<p><b class="bf">Keywords.</b> Bernstein’s polynomials, Szász-Mirakjan operators, Bleimann-Butzer-Hahn operators, Meyer-König and Zeller operators, absolute moment of high order </p>
</div>
<h1 id="a0000000002">1 Preliminaries</h1>
<p>Let \(\mathbb N\) be the set of positive integers and \(\mathbb N_{0}=\mathbb N\cup \{ 0\} \). For any \(m \in \mathbb N\), let \(B_m:C([0,1])\to C([0,1])\) be the Bernstein operators, defined by </p>
<div class="equation" id="1.1">
<p>
  <div class="equation_content">
    \begin{equation} \label{1.1} (B_m f)(x)=\sum \limits _{k=0}^{m}p_{m,k}(x)f\left(\tfrac {k}{m}\right), \end{equation}
  </div>
  <span class="equation_label">1.1</span>
</p>
</div>
<p> where \(p_{m,k}(x)\) are the fundamental Bernstein’s polynomials, given by </p>
<div class="equation" id="1.2">
<p>
  <div class="equation_content">
    \begin{equation}  \label{1.2} p_{m,k}(x)=\tbinom {m}{k}x^k(1-x)^{m-k}, \end{equation}
  </div>
  <span class="equation_label">1.2</span>
</p>
</div>
<p> for any \(x\in [0,1]\) and any \(k\in \{ 0,1,\ldots ,m\} \) (see [3] or [11]).<br />For any \(m\in \mathbb N\), let \(S_m:C_2([0,+\infty ))\to C([0,+\infty ))\) be the Szász-Mirakjan operators (see [4], [7], [11] or [12]), defined by </p>
<div class="equation" id="1.3">
<p>
  <div class="equation_content">
    \begin{equation} \label{1.3} (S_m f)(x)={\rm e}^{-mx}\sum \limits _{k=0}^{\infty }\tfrac {(mx)^k}{k!}f\left(\tfrac {k}{m}\right), \end{equation}
  </div>
  <span class="equation_label">1.3</span>
</p>
</div>
<p> for any \(x\in [0,+\infty )\).<br />The operators \(Z_m:B([0,1])\to C([0,1])\) defined by </p>
<div class="equation" id="1.4">
<p>
  <div class="equation_content">
    \begin{equation} \label{1.4} (Z_m f)(x)=\left(1-x\right)^{m+1} \sum \limits _{k=0}^{\infty }\tbinom {m+k}{k}x^{k}f\left(\tfrac {k}{m+k}\right), \end{equation}
  </div>
  <span class="equation_label">1.4</span>
</p>
</div>
<p> for any \(x\in [0,1)\) and \((Z_m f)(1)=f(1)\), \(m \in \mathbb N\), are called Meyer-König and Zeller operators (see [6] or [11]).<br />For \(m \in \mathbb N\), let the operators \(L_{m}:C_{B}([0,+\infty ))\to C_{B}([0,+\infty ))\), defined by </p>
<div class="equation" id="1.5">
<p>
  <div class="equation_content">
    \begin{equation} \label{1.5} (L_{m}f)(x)=\left(1+x\right)^{-m}\sum _{k=0}^{m} \tbinom {m}{k}x^{k}f\left(\tfrac {k}{m+1-k}\right), \end{equation}
  </div>
  <span class="equation_label">1.5</span>
</p>
</div>
<p> for any \(x\in [0,\infty )\). These operators are called Bleimann-Butzer-Hahn operators (see [2] or [11]).<br />In what follows, let \(I\subset \mathbb R\) be an interval. We recall that the functions \(\varphi _{x},\psi _{x}\! :\! I\! \to \! \mathbb R\) are defined by </p>
<div class="displaymath" id="a0000000003">
  \[ \varphi _{x}(t)=\left|t-x\right|,\  \  \  \psi _{x}(t)=t-x, \]
</div>
<p> for any \((x,t)\in I\times I\). For a sequence of operators \((L_m)_{m\geq 1}\), define \(T_{m,i}\) by </p>
<div class="equation" id="1.6">
<p>
  <div class="equation_content">
    \begin{equation} \label{1.6} (T_{m,i} L_m)(x)=m^i\left(L_m\psi ^i_x\right)(x), \end{equation}
  </div>
  <span class="equation_label">1.6</span>
</p>
</div>
<p> for any \(x\in I\), any \(m\in \mathbb N\) and any \(i\in \mathbb N_0\). </p>
<h1 id="a0000000004">2 Main Results</h1>
<p>In [5] is proved the following result contained in Theorem 2.1. </p>
<p><div class="theorem_thmwrapper " id="a0000000005">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">2.1</span>
  </div>
  <div class="theorem_thmcontent">
  <p>Let \(m\in \mathbb N\) and \(0\leq x\leq 1\). If \(i=\left[mx\right]\), then </p>
<div class="equation" id="2.1">
<p>
  <div class="equation_content">
    \begin{equation} \label{2.1} \left(B_m \varphi _x\right)\left(x\right)=2x(1-x)p_{m-1,i}\left(x\right). \end{equation}
  </div>
  <span class="equation_label">2.7</span>
</p>
</div>

  </div>
</div> </p>
<p><div class="theorem_thmwrapper " id="a0000000006">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">2.2</span>
  </div>
  <div class="theorem_thmcontent">
  <p>Let \(m\in \mathbb N\) and \(0\leq x\). If \(i=\left[mx\right]\), then </p>
<div class="equation" id="2.2">
<p>
  <div class="equation_content">
    \begin{equation} \label{2.2} \left(S_m\varphi _x\right)\left(x\right)=2x{\rm e}^{-mx}\tfrac {\left(mx\right)^i}{i!}. \end{equation}
  </div>
  <span class="equation_label">2.8</span>
</p>
</div>

  </div>
</div> <div class="proof_wrapper" id="a0000000007">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div>From \(i=[mx]\) it results \(i\leq mx{\lt}i+1\), equivalent with \(\cfrac {i}{m}\leq x{\lt}\cfrac {i+1}{m}\). We get </p>
<div class="displaymath" id="a0000000008">
  \begin{gather*}  (S_m \varphi _x)(x)={\rm e}^{-mx}\sum _{k=0}^{\infty }\tfrac {\left(mx\right)^k}{k!}\left| \tfrac {k}{m}-x\right|\\ =2{\rm e}^{-mx}\sum ^{i}_{k=0} \tfrac {\left(mx\right)^k}{k!}\left(x-\tfrac {k}{m} \right)+{\rm e}^{-mx}\sum ^{\infty }_{k=0}\tfrac {\left(mx\right)^k}{k!} \left(\tfrac {k}{m}-x\right)\\ =2{\rm e}^{-mx}\left[x\sum ^{i}_{k=0} \tfrac {\left(mx\right)^{k}}{k!}-x\sum ^{i}_{k=1} \tfrac {\left(mx\right)^{k-1}}{\left(k-1\right)!}\right]+\left(S_m e_{1}\right)\left(x\right)-x\left(S_{m} e_{0}\right)(x)\\ =2x {\rm e}^{-mx}\tfrac {\left(mx\right)^i}{i!}, \end{gather*}
</div>
<p> so (2.2) is obtained. </p>
<p><div class="theorem_thmwrapper " id="a0000000009">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">2.3</span>
  </div>
  <div class="theorem_thmcontent">
  <p>Let \(m\in \mathbb N\) and \(0\leq x{\lt}m\). If \(i=\left[\tfrac {(m+1)x}{x+1}\right]\), then </p>
<div class="equation" id="2.3">
<p>
  <div class="equation_content">
    \begin{equation} \label{2.3} (L_{m}\varphi _{x})(x)=x(1+x)^{-m}\left(2\tbinom {m}{i}x^{i}-x^{m}\right). \end{equation}
  </div>
  <span class="equation_label">2.9</span>
</p>
</div>

  </div>
</div> In the case when \(m\in \mathbb N\) and \(x\geq m\), then </p>
<div class="equation" id="2.4">
<p>
  <div class="equation_content">
    \begin{equation} \label{2.4} (L_{m}\varphi _{x})(x)=x^{m+1}(1+x)^{-m}. \end{equation}
  </div>
  <span class="equation_label">2.10</span>
</p>
</div>
<p> <div class="proof_wrapper" id="a0000000010">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div> From \(i=\left[\tfrac {\left(m+1\right)x}{x+1}\right]\) it results \(i\leq \tfrac {\left(m+1\right)x}{x+1}{\lt}i+1\), equivalent with \(xi+i\leq mx+x{\lt} xi+x+i+1\), from where \(\tfrac {i}{m-i+1}\leq x{\lt}\tfrac {i+1}{m-i}\). Taking that \(x{\lt}m\) into account, one obtains \(i=\left[\tfrac {\left(m+1\right)x}{x+1}\right]\leq \tfrac {\left(m+1\right)x}{x+1}{\lt}m\). </p>
<p>We get </p>
<div class="displaymath" id="a0000000011">
  \begin{align*} & (L_{m}\varphi _{x})(x)=(1+x)^{-m}\sum \limits _{k=0}^{m}\tbinom {m}{k}x^{k} \left|\tfrac {k}{m-k+1}-x\right|\\ & =2\left(1+x\right)^{-m} \sum \limits _{k=0}^{i}\tbinom {m}{k}x^{k}\left(x-\tfrac {k}{m-k+1}\right)\\ & \quad +(1+x)^{-m}\sum \limits ^{m}_{k=0}\tbinom {m}{k}x^{k}\left(\tfrac {k}{m-k+1}-x\right)\\ & =2\left(1\! +\! x\right)^{-m}\left(\! x\sum ^{i}_{k=1}\tbinom {m}{k}x^{k}-\sum ^{i}_{k=1} \tbinom {m}{k}x^{k}\tfrac {k}{m\! -\! k\! +\! 1}\! \right)\! +\! \left(L_{m}e_{1}\right)(x) \! -\! x\left(L_{m}e_{0}\right)(x)\\ & =2\left(1+x\right)^{-m}\left(x\sum ^{i}_{k=1} \tbinom {m}{k}x^{k}-x\sum ^{i}_{k=1}\tbinom {m}{k-1}x^{k-1} \right)-x\left(\tfrac {x}{1+x}\right)^{m}\\ & =2x(1+x)^{-m}\tbinom {m}{i}x^{i}-x\left(\tfrac {x}{1+x}\right)^{m} = x\left(1+x\right)^{-m}\left(2\tbinom {m}{i}x^{i}-x^{m}\right), \end{align*}
</div>
<p> so (2.3) is obtained. If \(x\geq m\), we have that \(\tfrac {k}{m-k+1}\leq x\), for any \(k\in \{ 0,1,\ldots ,m\} \) and then </p>
<div class="displaymath" id="a0000000012">
  \begin{gather*}  (L_{m}\varphi _{x})(x)=(1+x)^{-m}\sum \limits _{k=0}^{m}\tbinom {m}{k}x^{k} \left(x-\tfrac {k}{m-k+1}\right)\\ =x\left(L_{m}e_{0}\right)(x)-\left(L_{m}e_{1}\right)(x) =x^{m+1}(1+x)^{-m}, \end{gather*}
</div>
<p> so (2.4) holds. <div class="proof_wrapper" id="a0000000013">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div> </p>
<p><div class="theorem_thmwrapper " id="a0000000014">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">2.4</span>
  </div>
  <div class="theorem_thmcontent">
  <p>Let \(m\in \mathbb N\) and \(0\leq x{\lt}1\). If  \(i=\left[\tfrac {mx}{1-x}\right]\), then </p>
<div class="equation" id="2.5">
<p>
  <div class="equation_content">
    \begin{equation} \label{2.5} (Z_{m}\varphi _{x})(x)=2x^{i+1}(1-x)^{m+1}\tbinom {m+i}{i}. \end{equation}
  </div>
  <span class="equation_label">2.11</span>
</p>
</div>

  </div>
</div> <div class="proof_wrapper" id="a0000000015">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div> From \(i=\left[\tfrac {mx}{1-x}\right]\) it results \(i\leq \tfrac {mx}{1-x}{\lt}i+1\), equivalent with \(\tfrac {i}{m+i}\leq x{\lt}\tfrac {i+1}{m+i+1}\). We get </p>
<div class="displaymath" id="a0000000016">
  \begin{align*}  (Z_m\varphi _{x})(x)& =(1-x)^{m+1}\sum \limits _{k=0}^{i} \tbinom {m+k}{k}x^{k}\left|x-\tfrac {k}{m+k}\right|\\ & =2(1-x)^{m+1}\sum \limits _{k=0}^{i}\tbinom {m+k}{k}x^{k}\left(x-\tfrac {k}{m+k}\right)\\ & \quad +(1-x)^{m+1}\sum \limits _{k=0}^{\infty }\tbinom {m+k}{k}x^{k} \left(\tfrac {k}{m+k}-x\right)\\ & =2(1-x)^{m+1} \left(x\sum \limits ^{i}_{k=0}\tbinom {m+k}{k}x^{k}-\sum ^{i}_{k=1} \tbinom {m+k}{k}x^{k}\tfrac {k}{m+k}\right)+\\ & \quad +(Z_{m}e_{1})(x)-x(Z_{m}e_{0})(x)\\ & = 2x(1-x)^{m+1}\left(1+\sum \limits ^{i}_{k=1} \left(\tbinom {m+k}{k}x^{k}-\tbinom {m+k-1}{k-1}x^{k-1}\right)\right)\\ & =2x^{i+1}(1-x)^{m+1}\tbinom {m+i}{i}, \end{align*}
</div>
<p> so (2.5) is obtained. <div class="proof_wrapper" id="a0000000017">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div> </p>
<p>It is known the result contained in Lemma 2.5. </p>
<p><div class="lemma_thmwrapper " id="a0000000018">
  <div class="lemma_thmheading">
    <span class="lemma_thmcaption">
    Lemma
    </span>
    <span class="lemma_thmlabel">2.5</span>
  </div>
  <div class="lemma_thmcontent">
  <p>If \(m,n\in \mathbb N_{0}, m\neq 0\), then \(\left(B_{m}\psi _{x}^{n}\right)(x)\), with \(x\in [0,1]\) is a polynomial in variable \(x\). </p>

  </div>
</div> </p>
<p><div class="lemma_thmwrapper " id="a0000000019">
  <div class="lemma_thmheading">
    <span class="lemma_thmcaption">
    Lemma
    </span>
    <span class="lemma_thmlabel">2.6</span>
  </div>
  <div class="lemma_thmcontent">
  <p>If \(m,n\in \mathbb N\) and \(n\) is even, then </p>
<div class="equation" id="2.6">
<p>
  <div class="equation_content">
    \begin{equation} \label{2.6} \left(B_{m}\varphi _{x}^{n}\right)(x)=x(1-x)q_{m,n}(x), \end{equation}
  </div>
  <span class="equation_label">2.12</span>
</p>
</div>
<p> for any \(x\in [0,1]\), where \(q_{m,n}(x)\) is a polynomial in variable \(x\) and \(q_{m,n}(x){\gt}0\), for any \(x\in [0,1]\). </p>

  </div>
</div> </p>
<p><div class="proof_wrapper" id="a0000000020">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div> For \(m=1\), we get </p>
<div class="displaymath" id="a0000000021">
  \begin{align*}  \left(B_{1}\varphi _{x}^{n}\right)(x)& = \sum \limits _{k=0}^{1}(k-x)^{n}p_{1,k}(x)\\ & =x^{n}p_{1,0}(x)+(1-x)^{n}p_{1,1}(x)=x(1-x) q_{1,n}(x), \end{align*}
</div>
<p> where \(q_{1,n}(x)=x^{n-1}+(1-x)^{n-1}\).<br />For \(m\geq 2\), we get </p>
<div class="displaymath" id="a0000000022">
  \begin{align*}  \left(B_{m}\varphi _{x}^{n}\right)(x)& =\sum \limits _{k=0}^{m} \left(\tfrac {k}{m}-x\right)^{n}p_{m,k}(x)\\ & =x^{n}(1-x)^{m}+\sum \limits _{k=1}^{m-1} \left(\tfrac {k}{m}-x\right)^{n}p_{m,k}(x)+(1-x)^{n}x^{m}\\ & =x(1-x)q_{m,n}, \end{align*}
</div>
<p> where </p>
<div class="displaymath" id="a0000000023">
  \begin{align*}  q_{m,n}(x)&  =x^{n-1}(1-x)^{m-1}\\ & \quad +\sum \limits _{k=1}^{m-1} \left(\tfrac {k}{m}-x\right)^{n} \tbinom {m}{k}x^{k-1}(1-x)^{m-k-1} +(1-x)^{n-1}x^{m-1}. \end{align*}
</div>
<p> For any \(x\in [0,1]\), every summand from \(q_{m,n}(x)\) is positive. But for \(k=1\) and \(k=m-1\), which means \(\left(\tfrac {1}{m}-x\right)^n\tbinom {m}{1}(1-x)^{m-2}\), respectively <br />\(\left(\tfrac {m-1}{m}-x\right)^n\tbinom {m}{m-1}x^{m-2}\) cannot be simultaneously null.<br />Taking the above remark into account, it results </p>
<div class="displaymath" id="a0000000024">
  \[ \left(B_{m}\varphi _{x}^{n}\right)(x)=x(1-x)q_{m,n}(x) \]
</div>
<p> is a polynomial in variable \(x\) and \(q_{m,n}(x){\gt}0\), for any \(x\in [0,1]\). <div class="proof_wrapper" id="a0000000025">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div> </p>
<p><div class="corollary_thmwrapper " id="a0000000026">
  <div class="corollary_thmheading">
    <span class="corollary_thmcaption">
    Corollary
    </span>
    <span class="corollary_thmlabel">2.7</span>
  </div>
  <div class="corollary_thmcontent">
  <p>If \(m,n\in \mathbb N\), with \(n\) even, then </p>
<div class="equation" id="2.7">
<p>
  <div class="equation_content">
    \begin{equation} \label{2.7} \left(T_{m,n}B_{m}\right)(x)=m^{n}\left(B_{m}\psi _{x}^{n}\right)(x)=m^{n} \left( B_{m}\varphi _{x}^{n}\right)(x)=m^{n}x(1-x) q_{m,n}(x). \end{equation}
  </div>
  <span class="equation_label">2.13</span>
</p>
</div>

  </div>
</div> </p>
<p>For the Szász-Mirakjan operators, we get </p>
<div class="equation" id="2.8">
<p>
  <div class="equation_content">
    \begin{equation} \label{2.8} \left(T_{m,s}S_{m}\right)(x)=m^{s}\left(S_{m}\psi _{x}^{s}\right)(x)= m^{s}e^{-mx}\sum \limits _{k=0}^{\infty }\tfrac {(mx)^{k}}{k!}\left(\tfrac {k}{m}-x\right)^{s}, \end{equation}
  </div>
  <span class="equation_label">2.14</span>
</p>
</div>
<p> where \(m\in \mathbb N\), \(s\in \mathbb N_{0}\) and \(x\in [0,+\infty )\). </p>
<p><div class="lemma_thmwrapper " id="a0000000027">
  <div class="lemma_thmheading">
    <span class="lemma_thmcaption">
    Lemma
    </span>
    <span class="lemma_thmlabel">2.8</span>
  </div>
  <div class="lemma_thmcontent">
  <p>If \(m,s\in N\), with \(s\geq 2\), then the following </p>
<div class="equation" id="2.9">
<p>
  <div class="equation_content">
    \begin{equation} \label{2.9} \left((T_{m,s}S_{m})(x)\right)^{\prime }=m\sum _{i=0}^{s-2} \tbinom {s}{i}\left(T_{m,i}S_{m}\right)(x) \end{equation}
  </div>
  <span class="equation_label">2.15</span>
</p>
</div>
<p> holds, for any \(x\in [0,+\infty )\). </p>

  </div>
</div> </p>
<p><div class="proof_wrapper" id="a0000000028">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div> From (2.8), we obtain </p>
<div class="displaymath" id="a0000000029">
  \begin{align*} & \left((T_{m,s}S_{m})(x)\right)^{\prime }=\left(m^{s}{\rm e}^{-mx} \sum \limits _{k=0}^{\infty }\tfrac {(mx)^{k}}{k!} \left(\tfrac {k}{m}-x\right)^{s}\right)^{\prime }\\ & =-m^{s+1}{\rm e}^{-mx}\sum \limits _{k=0}^{\infty }\tfrac {(mx)^{k}}{k!} \left(\tfrac {k}{m}-x\right)^{s}+m^{s+1}{\rm e}^{-mx}\sum \limits _{k=0}^{\infty } \tfrac {(mx)^{k-1}}{(k-1)!}\left(\tfrac {k}{m}-x\right)^{s}-\\ & \quad -sm^{s}{\rm e}^{-mx}\sum \limits _{k=0}^{\infty }\tfrac {(mx)^{k}}{k!} \left(\tfrac {k}{m}-x\right)^{s-1}\\ & = -m\left(T_{m,s}S_{m}\right)(x)-ms \left(T_{m,s-1}S_{m}\right)(x)+m^{s+1}{\rm e}^{-mx}\sum \limits _{k=0}^{\infty } \tfrac {(mx)^{k}}{k!}\left(\tfrac {k+1}{m}-x\right)^{s}\\ & =-m\left(T_{m,s}S_{m}\right)(x)\! -ms\left(T_{m,s-1}S_{m}\right) (x)\! +\! m^{s+1}{\rm e}^{-mx}\sum _{k=0}^{\infty }\tfrac {(mx)^{k}}{k!} \left(\! \left(\! \tfrac {k}{m}-x\! \right)\! +\! \tfrac {1}{m}\right)^{s}\\ & =-m\left(T_{m,s}S_{m}\right)(x)-ms\left(T_{m,s-1}S_{m}\right) (x)\\ & \quad +m^{s+1}{\rm e}^{-mx}\sum _{k=0}^{\infty }\tfrac {(mx)^{k}}{k!}\sum _{i=0}^{s} \tbinom {s}{i}\left(\tfrac {1}{m}\right)^{s-i}\left(\tfrac {k}{m}-x\right)^{i}\\ & =-m\left(T_{m,s}S_{m}\right)(x)\! -ms\left(T_{m,s-1}S_{m}\right)(x)\! +\! \sum _{i=0}^{s} \tbinom {s}{i}m^{i+1}{\rm e}^{-mx}\sum _{k=0}^{\infty }\tfrac {(mx)^{k}}{k!} \left(\! \tfrac {k}{m}\! -x\! \right)^{i}\\ & =-m\left(T_{m,s}S_{m}\right)(x)-ms\left(T_{m,s-1}S_{m}\right)(x)+m \sum _{i=0}^{s}\tbinom {s}{i}\left(T_{m,i}S_{m}\right)(x) \end{align*}
</div>
<p> from where, the relation (2.9) follows. <div class="proof_wrapper" id="a0000000030">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div> </p>
<p><div class="lemma_thmwrapper " id="a0000000031">
  <div class="lemma_thmheading">
    <span class="lemma_thmcaption">
    Lemma
    </span>
    <span class="lemma_thmlabel">2.9</span>
  </div>
  <div class="lemma_thmcontent">
  <p>If \(m,s\in \mathbb N\), with \(s\geq 2\), then </p>
<div class="equation" id="2.10">
<p>
  <div class="equation_content">
    \begin{equation} \label{2.10} (T_{m,s}S_{m})(x)=m\sum _{i=0}^{s-2}\tbinom {s}{i}\int _{0}^{x}(T_{m,i}S_{m})(t){\rm d}t \end{equation}
  </div>
  <span class="equation_label">2.16</span>
</p>
</div>
<p> holds, for any \(x\in [0,\infty )\). </p>

  </div>
</div> </p>
<p><div class="proof_wrapper" id="a0000000032">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div> It yields immediately, taking that \((T_{m,s}S_{m})(0)=0\) into account and integrate the relation <a href="#2.9" class="eqref">2.15</a>. <div class="proof_wrapper" id="a0000000033">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div> For any \(m\in \mathbb N\) and any \(x\in [0,\infty )\), it is well known that \((T_{m,0}S_{m})(x)=1\), \((T_{m,1}S_{m})(x)=0\), then the following holds: </p>
<p><div class="corollary_thmwrapper " id="a0000000034">
  <div class="corollary_thmheading">
    <span class="corollary_thmcaption">
    Corollary
    </span>
    <span class="corollary_thmlabel">2.10</span>
  </div>
  <div class="corollary_thmcontent">
  <p>If \(m,s\in N\), with \(s\geq 4\), then </p>
<div class="equation" id="2.11">
<p>
  <div class="equation_content">
    \begin{equation} \label{2.11} (T_{m,s}S_{m})(x)=mx+m\sum _{i=2}^{s-2}\tbinom {s}{i}\int _{0}^{x}(T_{m,i}S_{m})(t){\rm d}t \end{equation}
  </div>
  <span class="equation_label">2.17</span>
</p>
</div>
<p> for any \(x\in [0,\infty )\). </p>

  </div>
</div> Let \(m\in \mathbb N\) and \(x\in [0,\infty )\). We obtain </p>
<div class="displaymath" id="a0000000035">
  \begin{align*}  (T_{m,0}S_{m})(x)=& (S_{m}e_{0})(x)=1,\\ (T_{m,1}S_{m})(x)=& m(S_{m}\psi _{x})(x)=m((S_{m}e_{1})(x)-x(S_{m}e_{0})(x))=0,\\ (T_{m,2}S_{m})(x)=& m\tbinom {2}{0}\int _{0}^{x}(T_{m,0}S_{m})(t){\rm d}t=mx,\\ (T_{m,3}S_{m})(x)=& m\left(\tbinom {3}{0}\int _{0}^{x} (T_{m,0}S_{m})(t){\rm d}t+\tbinom {3}{1}\int _{0}^{x}(T_{m,1}S_{m})(t){\rm d}t\right)=mx,\\ (T_{m,4}S_{m})(x)=& mx+m\tbinom {4}{2}\int _{0}^{x}(T_{m,2}S_{m})(t){\rm d}t=mx+3m^{2}x^{2}. \end{align*}
</div>
<p><div class="lemma_thmwrapper " id="a0000000036">
  <div class="lemma_thmheading">
    <span class="lemma_thmcaption">
    Lemma
    </span>
    <span class="lemma_thmlabel">2.11</span>
  </div>
  <div class="lemma_thmcontent">
  <p>If \(m,s\in \mathbb N\), with \(s{\gt}3\), then exist \(a_{2}^{(s)},a_{3}^{(s)},\ldots , a_{\left[{s/2}\right]}^{(s)}\geq 0\), \(a_{\left[{s/2}\right]}^{(s)}\neq 0\), such that </p>
<div class="equation" id="2.12">
<p>
  <div class="equation_content">
    \begin{equation} \label{2.12} (T_{m,s}S_{m})(x)=mx+m\sum \limits _{k=2}^{\left[{s/2}\right]}a_{k}^{(s)}x^{k}, \end{equation}
  </div>
  <span class="equation_label">2.18</span>
</p>
</div>
<p> for any \(x\in [0,\infty )\), where \(a_{k}^{(s)}\) depends of \(m\) and \(k\in \left\{ 2,3,\ldots ,\left[\tfrac {s}{2}\right]\right\} \). </p>

  </div>
</div> </p>
<p><div class="proof_wrapper" id="a0000000037">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div> We prove by mathematical induction. </p>
<p>For \(s=4\) we get \((T_{m,4}S_{m})(x)=mx+3m^{2}x^{2}\), so that \(a_{2}^{(4)}=3m{\gt}0.\)<br />We assume that </p>
<div class="displaymath" id="a0000000038">
  \[ (T_{m,j}S_{m})(x)=mx+m\sum \limits _{k=2}^{\left[{j/2}\right]}a_{k}^{(j)}x^{k}, \]
</div>
<p> for \(a_{2}^{(j)},a_{3}^{j},\ldots ,a_{\left[{j/2}\right]}^{(j)}\geq 0\), \(a_{\left[{j/2}\right]}^{(j)}\neq 0\), for any \(j\in \{ 4,5,\ldots ,s\} \). Taking relation <a href="#2.11" class="eqref">2.17</a> into account, we obtain </p>
<div class="displaymath" id="a0000000039">
  \begin{align*} & (T_{m,s+1}S_{m})(x)=\\ & =mx+m\Bigg(\tbinom {s+1}{2}\int _{0}^{x}(T_{m,2}S_{m})(t){\rm d}t +\tbinom {s+1}{3}\int _{0}^{x}(T_{m,3}S_{m})(t){\rm d}t\\ & \quad + \sum \limits _{i=4}^{s-1}\tbinom {s+1}{i} \int _{0}^{x}\bigg(mt+m\sum \limits _{k=2}^{\left[{i/2}\right]}a_{k}^{(i)}t^{k}\bigg){\rm d}t\Bigg)\\ & =mx+m\bigg(\tbinom {s+1}{2}\tfrac {mx^2}{2}+\tbinom {s+1}{3}\tfrac {mx^2}{2}+\sum \limits _{i=4}^{s-1}\tbinom {s+1}{i} \bigg(\tfrac {mx^2}{2}+m\sum \limits _{k=2}^{\left[{i/2}\right]} \tfrac {a_{k}^{(i)}}{k+1}x^{k+1}\bigg)\bigg)\\ & =mx+\tfrac {1}{2}\left(m\tbinom {s+1}{2}+m\tbinom {s+1}{3}+\ldots +m\tbinom {s+1}{s-1}\right) mx^{2}\\ & \quad +\left(m\tbinom {s+1}{4}\tfrac {a_{2}^{(4)}}{3}+m \tbinom {s+1}{5}\tfrac {a_{2}^{(5)}}{3}+\ldots +m \tbinom {s+1}{s-1}\tfrac {a_{2}^{(s-1)}}{3}\right)mx^{3}+\end{align*}
</div>
<div class="displaymath" id="a0000000040">
  \begin{align*} & \quad +\ldots +m\cdot a_{\left[\tfrac {s+1}{2}\right]}^{(s+1)}x^{\left[\tfrac {s+1}{2}\right]} \end{align*}
</div>
<p> where: </p>
<ul class="itemize">
  <li><p>if \(s\) is even, </p>
</li>
</ul>
<p> then for \(k\in \left\{ 2,3,\ldots ,\left[\tfrac {s-3}{2} \right]\right\} \) we get \(k+1{\lt}\left[\tfrac {s-2}{2}\right]+1= \left[\tfrac {s-1}{2}\right]+1=\left[\tfrac {s+1}{2}\right]\) and </p>
<div class="displaymath" id="a0000000041">
  \[  a_{\left[\tfrac {s+1}{2}\right]}^{(s+1)}=m \tbinom {s+1}{s-2}\tfrac {a_{\left[\tfrac {s-2}{2}\right]}^{(s-2)}} {\left[\tfrac {s-2}{2}\right]+1}+m\tbinom {s+1}{s-1} \tfrac {a_{\left[\tfrac {s-1}{2}\right]}^{(s-1)}}{\left[\tfrac {s-1}{2}\right]+1}{\gt}0;  \]
</div>
<ul class="itemize">
  <li><p>if \(s\) is odd, </p>
</li>
</ul>
<p> then for \(k\in \{ 2,3\ldots ,\left[\tfrac {s-2}{2}\right]\} \) we get \(k+1{\lt}\left[\tfrac {s-1}{2}\right]+1=\left[\tfrac {s+1}{2}\right]\) and </p>
<div class="displaymath" id="a0000000042">
  \[  a_{\left[\tfrac {s+1}{2}\right]}^{(s+1)}=m\tbinom {s+1}{s-1} \tfrac {a_{\left[\tfrac {s-1}{2}\right]}^{(s-1)}}{\left[\tfrac {s-1}{2}\right]+1}{\gt}0.  \]
</div>
<p> And now, the proof is done. <div class="proof_wrapper" id="a0000000043">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div> </p>
<p><small class="footnotesize">  </small></p>
<div class="bibliography">
<h1>Bibliography</h1>
<dl class="bibliography">
  <dt><a name="1">1</a></dt>
  <dd><p><i class="sc">M. Beker</i> and <i class="sc">R.J. Nessel</i>, <em>A global approximation theorem for Meyer-König and Zeller operators</em>, Math. Zeitschr., <b class="bf">160</b>, pp.&#160;195–206, 1978. </p>
</dd>
  <dt><a name="2">2</a></dt>
  <dd><p><i class="sc">G. Bleimann, P.L. Butzer</i> and <i class="sc">L.A. Hahn</i>, <em>Bernstein-type operator approximating continous function on the semi-axis</em>, Indag. Math., <b class="bfseries">42</b>, pp.&#160;255–262, 1980. </p>
</dd>
  <dt><a name="3">3</a></dt>
  <dd><p><i class="sc">S.N. Bernstein</i>, <em>Démonstration du théorème de Weierstrass fondée sur le calcul de probabilité</em>, Commun. Soc. Math. Kharkow (2), <b class="bfseries">13</b>, pp.&#160;1–2, 1912–1913. </p>
</dd>
  <dt><a name="4">4</a></dt>
  <dd><p><i class="sc">J. Favard</i>, <em>Sur les multiplicateurs d’interpolation</em>, J. Math. Pures Appl., (9), <b class="bfseries">23</b>, pp.&#160;219–247, 1994. </p>
</dd>
  <dt><a name="5">5</a></dt>
  <dd><p><i class="sc">J. Meier</i>, <em>Zur Approximation durch gewöhnliche und modifizierte Bernstein-Operatoren unter besonderer Berücksichtigung quantitaver Aussagen und asymtotischer Formeln, Staatsexamensarbeit</em>, Universität Duisburg, 1982. </p>
</dd>
  <dt><a name="6">6</a></dt>
  <dd><p><i class="sc">W. Meyer-König</i> and <i class="sc">K. Zeller</i>, <em>Bernsteinsche Potenzreihen</em>, Studia Math., <b class="bfseries">19</b>, pp.&#160;89–94, 1960. </p>
</dd>
  <dt><a name="7">7</a></dt>
  <dd><p><i class="sc">G.M. Mirakjan</i>, <em>Approximation of continuous functions with the aid of polynomials</em>, Dokl. Acad. Nauk SSSR, <b class="bfseries">31</b>, pp.&#160;201–205, 1941 (in Russian). </p>
</dd>
  <dt><a name="8">8</a></dt>
  <dd><p><i class="sc">M.W. Müller</i>, <em>Die Folge der Gammaoperatoren</em>, Dissertation, Stuttgart, 1967. </p>
</dd>
  <dt><a name="9">9</a></dt>
  <dd><p><i class="sc">O.T. Pop</i>, <em>About the first order modulus of smoothness</em>, Carpathian J. Math., <b class="bfseries">20</b>, pp.&#160;101–108, 2004. </p>
</dd>
  <dt><a name="10">10</a></dt>
  <dd><p><i class="sc">F. Schurer</i> and <i class="sc">F.W. Steutel</i>, <em>On the degree of approximation of functions in \(C^{1}([0,1[)\) by Bernstein polynomials</em>, T. H. Report 75-WSK-07, Eindhoven University of Technology, 1975. </p>
</dd>
  <dt><a name="11">11</a></dt>
  <dd><p><i class="sc">D.D. Stancu, Gh. Coman, O. Agratini</i> and <i class="sc">R. Trîmbiţaş</i>, <em>Numerical analysis and approximation theory</em>, I, Cluj University Press, Cluj-Napoca, 2001, (in Romanian). </p>
</dd>
  <dt><a name="12">12</a></dt>
  <dd><p><i class="sc">O. Szász</i>, <em>Generalization of S. N. Bernstein’s polynomials to the infinite interval,</em> J. Research, National Bureau of Standards, <b class="bfseries">45</b>, pp.&#160;239–245, 1950. </p>
</dd>
</dl>


</div>
</div> <!--main-text -->
</div> <!-- content-wrapper -->
</div> <!-- content -->
</div> <!-- wrapper -->

<nav class="prev_up_next">
</nav>

<script type="text/javascript" src="/var/www/clients/client1/web1/web/files/jnaat-files/journals/1/articles/js/jquery.min.js"></script>
<script type="text/javascript" src="/var/www/clients/client1/web1/web/files/jnaat-files/journals/1/articles/js/plastex.js"></script>
<script type="text/javascript" src="/var/www/clients/client1/web1/web/files/jnaat-files/journals/1/articles/js/svgxuse.js"></script>
</body>
</html>