<!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>Bernstein operators of second kind and blending systems: Bernstein operators of second kind and blending systems</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>Bernstein operators of second kind and blending systems</h1>
<p class="authors">
<span class="author">Daniela Inoan\(^\ast \), Fadel Nasaireh\(^\ast \) Ioan Raşa\(^\ast \)</span>
</p>
<p class="date">October 27, 2016.</p>
</div>
<p>\(^\ast \)Technical University of Cluj-Napoca, Department of Mathematics, Memorandumului str. no. 28, Cluj-Napoca, Romania, e-mail: <span class="tt">{daniela.inoan, Fadel.Nasaireh,<br />Ioan.Rasa}@math.utcluj.ro</span>. </p>

<div class="abstract"><p> We consider the fundamental polynomials associated with the Bernstein operators of second kind. They form a blending system for which we study some shape preserving properties. Modified operators are introduced; they have better interpolation properties. The corresponding blending system is also studied. </p>
<p><b class="bf">MSC.</b> 47A58 </p>
<p><b class="bf">Keywords.</b> Blending system, total positivity, shape preserving properties </p>
</div>
<h1 id="a0000000002">1 Introduction</h1>
<p>A system \((f_0, f_1, \dots , f_m)\) of nonnegative, continuous functions on an interval \([a,b]\) is said to be a <em>blending system</em> if </p>
<div class="displaymath" id="a0000000003">
  \[  \sum _{i=1}^m f_i(x)=1, \  \textrm{for all} \  x \in [a,b].  \]
</div>
<p> If \(P_0, P_1, \dots , P_m \in \mathbb {R}^s\) are some given points, using a blending system one can define the curve </p>
<div class="displaymath" id="a0000000004">
  \[  \gamma (t)=\sum _{i=1}^m f_i(t)P_i, \quad t\in [a,b].  \]
</div>
<p> The points \(P_0, P_1, \dots , P_m\) are called <em>control points</em> of the curve \(\gamma \) with respect to the blending system \((f_0, f_1, \dots , f_m)\). </p>
<p>Blending systems are important instruments in Computer Aided Geometric Design (see <span class="cite">
	[
	<a href="#Carnicer1996" >1</a>
	]
</span>, <span class="cite">
	[
	<a href="#Carnicer1996JCAM" >2</a>
	]
</span> and the references therein). Of particular interest are the blending systems for which some shape properties of the curve \(\gamma \) are inherited from the properties of the control polygon \(P_0P_1\dots P_m \). Bernstein and B-spline bases are well-known systems of totally positive blending functions that preserve monotonicity and convexity. In <span class="cite">
	[
	<a href="#Carnicer1996" >1</a>
	]
</span>, <span class="cite">
	[
	<a href="#Floater1999" >3</a>
	]
</span> were given general results that connect shape preservation with the total positivity of the system of functions. </p>
<p>We will study some properties of two particular blending systems derived from an operator introduced by P. Soardi in <span class="cite">
	[
	<a href="#Soardi1991" >9</a>
	]
</span>. </p>
<p>Let \(n \geq 1\), \(n \in \mathbb {N} \) and \(m=[n/2]\). The positive linear Soardi operator \(\beta _n \) is defined for a function \(f \in C[0,1] \) and \(x \in [0,1]\) by </p>
<div class="displaymath" id="a0000000005">
  \[  \beta _nf(x)= \sum _{k=0}^m f\left( \tfrac {n-2m+2k}{n}\right) w_{n,k}(x),  \]
</div>
<p> where \(w_{n,k}\) are the fundamental polynomials </p>
<div class="displaymath" id="a0000000006">
  \begin{align*} & w_{n,k}(x)=\\ & =\tfrac {n+1-2m+2k}{(n+1)2^{n+1}x}\tbinom {n+1}{m-k}\Big((1-x)^{m-k}(1+x)^{n+1-m+k}\! -\! (1-x)^{n+1-m+k}(1+x)^{m-k} \Big). \end{align*}
</div>
<p> Monotonicity or convexity preserving properties and a Voronovskaja-type formula for this operator can be found in <span class="cite">
	[
	<a href="#Rasa-Revue" >8</a>
	]
</span>. In <span class="cite">
	[
	<a href="#Ra2006" >7</a>
	]
</span> there were given some inequalities for generalized convex functions that involve the operator \(\beta _n\). A recursive de Casteljau type algorithm for this operator was described in <span class="cite">
	[
	<a href="#Inoan-Rasa2013" >5</a>
	]
</span>. <div class="theorem_thmwrapper " id="a0000000007">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">1</span>
  </div>
  <div class="theorem_thmcontent">
  <p>The system \((w_{n,0}(x), w_{n,1}(x), \dots , w_{n,m}(x))\), \(x \in [0,1]\) is a blending system. </p>

  </div>
</div> <div class="proof_wrapper" id="a0000000008">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div>It follows directly from the fact that \(\beta _n1=1\), which is proved in <span class="cite">
	[
	<a href="#Soardi1991" >9</a>
	]
</span>. </p>
<h1 id="a0000000009">2 Total positivity</h1>
<p>We recall (see <span class="cite">
	[
	<a href="#Karlin1968" >6</a>
	]
</span>, <span class="cite">
	[
	<a href="#Goodman1996" >4</a>
	]
</span> for instance) that a system of functions \((u_0, \dots ,u_m)\) defined on an interval \(I\) is <em>totally positive (TP)</em> if for any \(t_0, \dots , t_p \in I\) with \(t_0 {\lt}t_1 {\lt} \dots {\lt} t_p\) the corresponding collocation matrix </p>
<div class="equation" id="eq:total-posit">
<p>
  <div class="equation_content">
    \begin{equation} \label{eq:total-posit} M\left( \begin{array}{c} u_0, \dots , u_m \\ t_0, \dots , t_p \end{array} \right)= \left( u_j(t_i)\right)_{i=0,\dots ,p; j=0,\dots ,m} \end{equation}
  </div>
  <span class="equation_label">1</span>
</p>
</div>
<p> has only nonnegative minors. </p>
<p>The system is <em>totally positive of order \(r\) (\(TP_r\))</em>, \(1\leq r \leq m+1\) if for any collocation matrix (<a href="#eq:total-posit">1</a>), all the \(k \times k\) minors, \(k \in \{ 1, \dots , r\} \) are nonnegative. </p>
<p>A system of functions \((u_0, \dots ,u_m)\) is a <em>Chebyshev system</em> if all its square collocation matrices \(M\left( \begin{array}{c} u_0, \dots , u_m \\ t_0, \dots , t_m \end{array} \right)\) have positive determinant. If the determinant is nonnegative, the system is <em>weak Chebyshev</em>. </p>
<p><div class="lemma_thmwrapper " id="lem:sinhip">
  <div class="lemma_thmheading">
    <span class="lemma_thmcaption">
    Lemma
    </span>
    <span class="lemma_thmlabel">2</span>
  </div>
  <div class="lemma_thmcontent">
  <p> Let \(0{\lt}a_0{\lt}a_1 {\lt} \dots {\lt} a_m\), \(m \in \mathbb {N}\). The system </p>
<div class="displaymath" id="a0000000010">
  \[  (\sinh a_0t, \sinh a_1t, \dots , \sinh a_mt)  \]
</div>
<p> is totally positive on \([0,\infty )\). </p>

  </div>
</div> <div class="proof_wrapper" id="a0000000011">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div>Let \(0\leq t_0{\lt}t_1 {\lt} \dots {\lt}t_m\). We study the minors of the corresponding collocation matrix. </p>
<p>For \(s \in \{ 0, \dots ,m\} \) denote </p>
<div class="displaymath" id="a0000000012">
  \[  M(s,t)=\sinh a_st=\sum _{i=0}^\infty \tfrac {a_s^{2i+1}t^{2i+1}}{(2i+1)!},\quad K(s,i)=\tfrac {a_s^{2i+1}}{(2i+1)!}, \quad E(i,t)=t^{2i+1}.  \]
</div>
<p> Let \(\{ s_1, \dots ,s_k\}  \subset \{ 0,\dots ,m\} \) be row indices and \(\{ s_1^\prime , \dots ,s_k^\prime \}  \subset \{ 0,\dots ,m\} \) column indices in a minor of the collocation matrix. Then, using the basic composition formula (see for instance <span class="cite">
	[
	<a href="#Karlin1968" >6</a>
	]
</span>) we have: </p>
<div class="displaymath" id="a0000000013">
  \begin{align*} &  \left| \begin{array}{ccc} \displaystyle \sinh a_{s_1}t_{s_1^\prime } &  \dots &  \sinh a_{s_k}t_{s_1^\prime } \\ \dots &  \dots &  \dots \\ \sinh a_{s_1}t_{s_k^\prime } &  \dots &  \sinh a_{s_k}t_{s_k^\prime } \end{array} \right| =\\ & = M \left( \begin{array}{c} s_1, \dots ,s_k \\ t_{s_1^\prime }, \dots , t_{s_k^\prime } \end{array} \right) \\ &  = \sum _{0 \leq i_1 {\lt} \dots {\lt} i_k {\lt} \infty } K \left( \begin{array}{c} s_1, \dots ,s_k \\ i_1, \dots , i_k \end{array} \right) E \left( \begin{array}{c} i_1, \dots , i_k \\ t_{s_1^\prime }, \dots , t_{s_k^\prime } \end{array} \right)\\ & = \sum _{0 \leq i_1 {\lt} \dots {\lt} i_k {\lt} \infty } \! \! \! \tfrac {1}{(2i_1+1)!\dots (2i_k+1)!} \left| \begin{array}{ccc} \displaystyle a_{s_1}^{2i_1+1} &  \dots &  a_{s_k}^{2i_1+1} \\ \dots &  \dots &  \dots \\ a_{s_1}^{2i_k+1} &  \dots &  a_{s_k}^{2i_k+1} \end{array} \right| \cdot \left| \begin{array}{ccc} \displaystyle t_{s_1^\prime }^{2i_1+1} &  \dots &  t_{s_k^\prime }^{2i_1+1} \\ \dots &  \dots &  \dots \\ t_{s_1^\prime }^{2i_k+1} &  \dots &  t_{s_k^\prime }^{2i_k+1} \end{array} \right|\\ &  \geq 0. \end{align*}
</div>
<p> The next property was mentioned in <span class="cite">
	[
	<a href="#Rasa-Revue" >8</a>
	]
</span>; we give here a more detailed proof. </p>
<p><div class="theorem_thmwrapper " id="teo:total-posit">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">3</span>
  </div>
  <div class="theorem_thmcontent">
  <p> The system \((w_{n,0}, \dots , w_{n,m})\) is totally positive on \([0,1]\). </p>

  </div>
</div> <div class="proof_wrapper" id="a0000000014">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div>We have </p>
<div class="displaymath" id="a0000000015">
  \begin{equation*} \begin{split} & w_{n,k}(x)=\\ & =\tfrac {n+1-2m+2k}{(n+1)2^{n+1}}\tbinom {n+1}{m-k} \tfrac {1}{x}(1-x^2)^{\frac{n+1}{2}} \left[ \left( \tfrac {1+x}{1-x} \right)^{\frac{n+1}{2}-m+k} - \left( \tfrac {1+x}{1-x} \right)^{-\frac{n+1}{2}+m-k} \right] \end{split}\end{equation*}
</div>
<p> so with the exception of a strictly positive factor, the system is </p>
<div class="displaymath" id="a0000000016">
  \[  \left( ( e^t )^{\frac{n+1}{2}-m} - (e^t )^{-\frac{n+1}{2}+m}, \dots , ( e^t )^{\frac{n+1}{2}} - ( e^t)^{-\frac{n+1}{2}} \right)  \]
</div>
<p> where we used the notation \(\frac{1+x}{1-x}=e^t\). We get \(t=\log \frac{1+x}{1-x}\), an increasing function on \([0,\infty )\) and the system </p>
<div class="displaymath" id="a0000000017">
  \[  ({\mathcal{S}}) \quad (\sinh a_0t, \sinh a_1t, \dots , \sinh a_mt),  \]
</div>
<p> with \(a_j=\frac{n+1}{2}-m+j\). </p>
<p>From Lemma <a href="#lem:sinhip">2</a> we have that the system \(({\mathcal{S}})\) is totally positive and according to <span class="cite">
	[
	<a href="#Goodman1996" >4</a>
	]
</span>, page 161, this implies the total positivity of \((w_{n,0}, \dots , w_{n,m})\). </p>
<p><div class="theorem_thmwrapper " id="teo:Cebasev">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">4</span>
  </div>
  <div class="theorem_thmcontent">
  <p> For each \(j=0,1,\dots , m\), </p>
<div class="displaymath" id="a0000000018">
  \[  ({S_j}) \quad (w_{n,j}(x), w_{n,j+1}(x), \dots , w_{n,m}(x))  \]
</div>
<p> is a Chebyshev system on \([0,1]\). </p>

  </div>
</div> <div class="proof_wrapper" id="a0000000019">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div>Let \(x \in (0,1)\). As in the previous proof, we see that instead of \((S_j)\) is enough to study the system \((\sinh a_jt, \sinh a_{j+1}t, \dots , \sinh a_mt)\), with \(0{\lt}a_j{\lt} \dots {\lt} a_m\) and \(t \in (0,\infty )\). For any \(0{\lt}t_j{\lt}t_{j+1}{\lt} \dots {\lt} t_m\), the determinant \(\Delta =\left| \begin{array}{ccc} \displaystyle \sinh a_{j}t_{j} &  \dots &  \sinh a_{m}t_{j} \\ \dots &  \dots &  \dots \\ \sinh a_{j}t_{m} &  \dots &  \sinh a_{m}t_{m} \end{array} \right|\) can be written like in the proof of Lemma <a href="#lem:sinhip">2</a> and we obtain that it is strictly positive. </p>
<p>Let \(x\in (0,1]\) and consider \(0{\lt} x_j {\lt} \dots {\lt} x_m \leq 1\). The situation differs from the previous case only if \(x_m=1\). Then </p>
<div class="displaymath" id="a0000000020">
  \begin{equation*} \begin{split} &  \left| \begin{array}{cccc} w_{n,j}(x_j) &  w_{n,j+1}(x_j) &  \dots &  w_{n,m}(x_j) \\ \dots &  \dots &  \dots &  \dots \\ w_{n,j}(1) &  w_{n,j+1}(1) &  \dots &  w_{n,m}(1) \end{array} \right| = \\ &  = \left| \begin{array}{cccc} w_{n,j}(x_j) &  w_{n,j+1}(x_j) &  \dots &  w_{n,m}(x_j) \\ \dots &  \dots &  \dots &  \dots \\ 0 &  0 &  \dots &  1 \end{array} \right| \\ & = \left| \begin{array}{cccc} w_{n,j}(x_j) &  w_{n,j+1}(x_j) &  \dots &  w_{n,m-1}(x_j) \\ \dots &  \dots &  \dots &  \dots \\ w_{n,j}(x_{m-1}) &  w_{n,j+1}(x_{m-1}) &  \dots &  w_{n,m-1}(x_{m-1}) \end{array} \right| {\gt}0, \end{split}\end{equation*}
</div>
<p> like in the previous case. </p>
<p>Let \(x \in [0,1)\) and consider \(0 \leq x_j {\lt} \dots {\lt} x_m {\lt} 1\). The situation differs from the first case only if \(x_1=0\). Then, instead of \(\Delta \) we will have, with \(0=t_j{\lt} t_{j+1} {\lt} \dots {\lt}t_m\), </p>
<div class="displaymath" id="a0000000021">
  \begin{equation*} \begin{split} &  \left| \begin{array}{ccc} \tfrac {\sinh a_jt_j}{t_j} &  \dots &  \tfrac {\sinh a_mt_j}{t_j} \\ \sinh a_jt_{j+1} &  \dots &  \sinh a_mt_{j+1} \\ \dots &  \dots &  \dots \\ \sinh a_jt_{m} &  \dots &  \sinh a_mt_{m} \end{array} \right| =\! \!  \sum _{0 \leq i_j {\lt} \dots {\lt} i_m {\lt} \infty } \! \! \!  \tfrac {1}{(2i_j+1)!}\dots \tfrac {1}{(2i_m+1)!} \Delta _1 \cdot \Delta _2 {\gt}0, \end{split}\end{equation*}
</div>
<p> since we have \(\displaystyle \Delta _1= \left| \begin{array}{ccc} a_j^{2i_j+1} &  \dots &  a_m^{2i_j+1} \\ \dots &  \dots &  \dots \\ a_j^{2i_m+1} &  \dots &  a_m^{2i_m+1} \end{array} \right| {\gt}0\),<br />\(\Delta _2=\left| \begin{array}{cccc} t_j^{2i_j} &  t_{j+1}^{2i_j+1} &  \dots &  t_{m}^{2i_j+1} \\ \dots &  \dots &  \dots &  \dots \\ t_j^{2i_m} &  t_{j+1}^{2i_m+1} &  \dots &  t_{m}^{2i_m+1} \end{array} \right|=0\) for \(i_j{\gt}0\) and \(\Delta _2{\gt}0\) for \(i_j=0\). </p>
<p>The case \(x \in [0,1]\), with \(0=x_j{\lt}x_{j+1} {\lt} \dots {\lt} x_m=1\) can be treated as a combination of the previous three cases. </p>
<h1 id="a0000000022">3 Shape preserving properties</h1>
<p>A blending system \((f_0, \dots ,f_m)\) is said to be <em>monotonicity preserving</em> <span class="cite">
	[
	<a href="#Carnicer1996" >1</a>
	]
</span> if \(\alpha _0 \leq \alpha _1 \leq \dots \leq \alpha _m\) implies that \(\sum _{i=0}^m \alpha _i f_i(t)\) is an increasing function. </p>
<p>The system is said to be <em>strictly monotonicity preserving</em> if \(\alpha _0 {\lt} \alpha _1 {\lt} \dots {\lt} \alpha _m\) implies that \(\sum _{i=0}^m \alpha _i f_i(t)\) is strictly increasing. </p>
<p>In the case of a monotonicity preserving blending system, if the projections of the control points \(P_0, \dots ,P_m\) onto a line are ordered, then the projections of the points of the curve \(\gamma \) on the same line are also ordered. <div class="lemma_thmwrapper " id="a0000000023">
  <div class="lemma_thmheading">
    <span class="lemma_thmcaption">
    Lemma
    </span>
    <span class="lemma_thmlabel">5</span>
  </div>
  <div class="lemma_thmcontent">
  <p><span class="cite">
	[
	<a href="#Carnicer1996" >1</a>
	, 
	Corollary 2.4
	]
</span> A totally positive blending system is monotonicity preserving. </p>

  </div>
</div> This allows us to state, following directly from Theorem <a href="#teo:total-posit">3</a>: </p>
<p><div class="theorem_thmwrapper " id="teo:monotonic-preser">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">6</span>
  </div>
  <div class="theorem_thmcontent">
  <p> Soardi’s blending system \((w_{n,0}, \dots , w_{n,m})\) is monotonicity preserving. </p>

  </div>
</div> <div class="lemma_thmwrapper " id="lem:prop21Carnicer">
  <div class="lemma_thmheading">
    <span class="lemma_thmcaption">
    Lemma
    </span>
    <span class="lemma_thmlabel">7</span>
  </div>
  <div class="lemma_thmcontent">
  <p><span class="cite">
	[
	<a href="#Carnicer1996" >1</a>
	, 
	Proposition 2.1
	]
</span>  Let \((f_0, \dots ,f_m)\) be a blending system on \([a,b]\) and let </p>
<div class="displaymath" id="a0000000024">
  \[  g_i=\sum _{j=i}^m f_j, \quad i=0,\dots , m.  \]
</div>
<p> Then: </p>
<p>a) \((f_0, \dots ,f_m)\) is monotonicity preserving if and only if \(g_1, \dots , g_m\) are increasing functions. </p>
<p>b) \((f_0, \dots ,f_m)\) is strictly monotonicity preserving if and only if \(g_1, \dots , g_m\) are increasing functions and \(\sum _{i=1}^m g_i\) is strictly increasing. </p>

  </div>
</div> <div class="theorem_thmwrapper " id="teo:strictly-monotonic-preser">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">8</span>
  </div>
  <div class="theorem_thmcontent">
  <p> Soardi’s blending system \((w_{n,0}, \dots , w_{n,m})\) is strictly monotonicity preserving. </p>

  </div>
</div> <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>According to Theorem <a href="#teo:monotonic-preser">6</a> and Lemma <a href="#lem:prop21Carnicer">7</a> we have to prove only that the function \(\sum _{i=1}^m g_i=\sum _{i=1}^m iw_{n,i}\) is strictly increasing. </p>
<p>It was proved in <span class="cite">
	[
	<a href="#Rasa-Revue" >8</a>
	, 
	Theorem 2.1
	]
</span>, that if a function \(f \in C[0,1]\) is strictly increasing then \(\beta _n f\) is also strictly increasing. </p>
<p>Let \(f \in C[0,1]\) be such that \(f\left( \frac{n-2m+2k}{n} \right)=k\), for \(k=0,\dots ,m\) and such that it is strictly increasing. Then also </p>
<div class="displaymath" id="a0000000026">
  \[  \sum _{i=1}^m iw_{n,i}=\sum _{i=1}^m f\left( \tfrac {n-2m+2i}{n} \right)w_{n,i}=\beta _n f  \]
</div>
<p> is strictly increasing. </p>
<p>As a consequence of the property of monotonicity preserving, the blending system \((w_{n,0},\dots ,w_{n,m})\) is also length diminishing (see <span class="cite">
	[
	<a href="#Carnicer1996" >1</a>
	]
</span>), that is the length of the curve \(\sum _{i=0}^m P_iw_{n,i}\) is smaller then the length of the control polygon \(P_0P_1\dots P_m\). </p>
<p>The fact that Soardi’s blending system is totally positive and a Chebyshev system implies also some other properties: geometrically (strictly) convexity preserving (see <span class="cite">
	[
	<a href="#Carnicer1996" >1</a>
	, 
	Theorems 3.9 and 3.10
	]
</span>) or geometrically (strictly) k-convexity preserving (see <span class="cite">
	[
	<a href="#Carnicer1996" >1</a>
	, 
	Proposition 5.7 and 5.8
	]
</span>). </p>
<h1 id="a0000000027">4 A modified Soardi operator</h1>
<p>Starting from Soardi’s operator we define \(\Gamma _n :C[0,1]\to C[0,1]\) by </p>
<div class="displaymath" id="a0000000028">
  \[  \Gamma _nf=\tfrac {e_1}{\beta _ne_1}\beta _nf+\left( 1- \tfrac {e_1}{\beta _ne_1} \right) f(0).  \]
</div>
<p>This is a positive linear operator. It easy to prove, by direct computation, that \(\Gamma _ne_0=e_0\), \(\Gamma _ne_1=e_1\) and \(\Gamma _nf(0)=f(0)\), \(\Gamma _nf(1)=f(1)\) for every \(f \in C[0,1]\). To obtain a blending system we consider two situations: \(n\) being even or odd. </p>
<p>For \(n=2m\), we have </p>
<div class="displaymath" id="a0000000029">
  \[  \Gamma _n f(x)= \sum _{k=0}^m f\left( \tfrac {n-2m+2k}{n}\right) \gamma _{n,k}(x),  \]
</div>
<p> where </p>
<div class="displaymath" id="a0000000030">
  \begin{align*}  \gamma _{n,0}(x)=& \tfrac {x}{\beta _ne_1(x)}\left( w_{n,0}(x)-1 \right) +1, \\ \gamma _{n,k}(x)=& \tfrac {x}{\beta _ne_1(x)} w_{n,k}(x), \quad \textrm{for} \  k=1,2, \dots ,m. \end{align*}
</div>
<p>For \(n=2m+1\), we have </p>
<div class="displaymath" id="a0000000031">
  \[  \Gamma _n f(x)= f(0)\theta _{n,0}(x)+\sum _{k=0}^m f\left( \tfrac {n-2m+2k}{n}\right) \theta _{n,k+1}(x),  \]
</div>
<p> where </p>
<div class="displaymath" id="a0000000032">
  \begin{align*}  \theta _{n,0}(x)=&  -\tfrac {x}{\beta _ne_1(x)}+1 , \\ \theta _{n,k+1}(x)=& \tfrac {x}{\beta _ne_1(x)} w_{n,k}(x), \quad \textrm{for} \  k=0,1, \dots ,m. \end{align*}
</div>
<p><div class="theorem_thmwrapper " id="a0000000033">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">9</span>
  </div>
  <div class="theorem_thmcontent">
  <p>For \(n=2m\) the system \((\gamma _{n,0}(x), \gamma _{n,1}(x), \dots , \gamma _{n,m}(x))\), \(x \in [0,1]\) is a blending system. </p>
<p>For \(n=2m+1\) the system \((\theta _{n,0}(x), \theta _{n,1}(x), \dots , \theta _{n,m+1}(x))\), \(x \in [0,1]\) is a blending system. </p>

  </div>
</div> <div class="proof_wrapper" id="a0000000034">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div>It follows directly from \(\Gamma _ne_0=e_0\). </p>
<p><div class="lemma_thmwrapper " id="a0000000035">
  <div class="lemma_thmheading">
    <span class="lemma_thmcaption">
    Lemma
    </span>
    <span class="lemma_thmlabel">10</span>
  </div>
  <div class="lemma_thmcontent">
  <p>For any \(n \in \mathbb {N}\), the function \(g:[0,1] \to \mathbb {R}\), \(g(x)=\frac{x}{\beta _n e_1(x)}\) is strictly increasing. </p>

  </div>
</div> <div class="proof_wrapper" id="a0000000036">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div>Denote \(h(x)=\beta _n e_1(x) -x \beta _n^\prime e_1(x)\). We have \( h^\prime (x)=-x \beta _n^{\prime \prime } e_1(x) \leq 0 \), since \(\beta _n e_1(x)\) is a convex function (see <span class="cite">
	[
	<a href="#Rasa-Revue" >8</a>
	, 
	Theorem 2.1
	]
</span>). Thus \(h\) is decreasing on \([0,1]\). By direct computation we get \(h(1)=\frac{1}{n}{\gt}0\), which implies \(h(x){\gt}0\) for any \(x\in [0,1]\). Finally the conclusion follows from \(g^\prime (x)=\frac{h(x)}{(\beta _n e_1(x))^2}{\gt}0\). </p>
<p><div class="theorem_thmwrapper " id="a0000000037">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">11</span>
  </div>
  <div class="theorem_thmcontent">
  <p>a) For any even number \(n=2m\), the blending system \((\gamma _{n,0}(x), \gamma _{n,1}(x), \dots , \gamma _{n,m}(x))\) is strictly monotonicity preserving. </p>
<p>b) For any odd number \(n=2m+1\), the blending system </p>
<div class="displaymath" id="a0000000038">
  \[  (\theta _{n,0}(x), \theta _{n,1}(x), \dots , \theta _{n,m+1}(x)) \]
</div>
<p> is strictly monotonicity preserving. </p>

  </div>
</div> <div class="proof_wrapper" id="a0000000039">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div>We will use Lemma <a href="#lem:prop21Carnicer">7</a>. For \(n=2m\) and \(i=1, \dots , m\) we have </p>
<div class="displaymath" id="a0000000040">
  \[  g_i=\sum _{j=i}^m \gamma _{n,j}(x)=\tfrac {x}{\beta _n e_1(x)} \sum _{j=i}^m w_{n,j}(x)  \]
</div>
<p> By the previous lemma, the function \(\frac{x}{\beta _n e_1(x)}\) is strictly increasing. Also the function \(\sum _{j=i}^m w_{n,j}(x)\) is strictly increasing since \((w_{n,0}, \dots , w_{n,m})\) is monotonicity preserving. So \(g_i\) is increasing and Lemma <a href="#lem:prop21Carnicer">7</a> gives the monotonicity preserving property of \((\gamma _{n,0}(x), \gamma _{n,1}(x), \dots , \gamma _{n,m}(x))\). </p>
<p>Moreover, the function </p>
<div class="displaymath" id="a0000000041">
  \[  \sum _{i=1}^m g_i= \tfrac {x}{\beta _n e_1(x)} \sum _{i=1}^m iw_{n,i}(x)  \]
</div>
<p> is strictly increasing, so the blending system is strictly monotonicity preserving. </p>
<p>The case \(n=2m+1\) can be treated in the same way. </p>
<p><small class="footnotesize">  </small></p>
<div class="bibliography">
<h1>Bibliography</h1>
<dl class="bibliography">
  <dt><a name="Carnicer1996">1</a></dt>
  <dd><p><i class="sc">J.M. Carnicer, M. García-Esnaola, J.M. Peña</i>, <i class="it">Bases with Convexity Preserving Properties</i>, Advanced Topics in Multivariate Approximation, F.Fontanella, K. Jetter and P.J. Laurent (eds.), World Scientific Publishing 1996, pp.&#160;17–31. </p>
</dd>
  <dt><a name="Carnicer1996JCAM">2</a></dt>
  <dd><p><a href ="https://doi.org/10.1016/0377-0427(95)00240-5"> <i class="sc">J.M. Carnicer, M. García-Esnaola, J.M. Peña</i>, <i class="it">Convexity of rational curves and total positivity</i>, J. Comput. Appl. Math., <b class="bf">71</b> (2) (1996), pp.&#160;365–382. <img src="img-0001.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Floater1999">3</a></dt>
  <dd><p><a href ="http://doi.org/10.1006/jath.1998.3219"> <i class="sc">M.S. Floater</i>, <i class="it">Total Positivity and Convexity Preservation</i>, J. Approx. Theory, <b class="bf">96</b> (1) (1999), pp.&#160;46–66. <img src="img-0001.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Goodman1996">4</a></dt>
  <dd><p><i class="sc">Tim N.T. Goodman</i>, <i class="it">Total Positivity and the Shape of Curves</i>, Total Positivity and its Applications, M. Gasca and Ch. Micchelli (eds.), Kluver Academic Publishers, 1996, pp.&#160;157–186. </p>
</dd>
  <dt><a name="Inoan-Rasa2013">5</a></dt>
  <dd><p><a href ="http://doi.org/10.1007/s11075-012-9688-1"> <i class="sc">D. Inoan, I. Raşa</i>, <i class="it">A recursive algorithm for Bernstein operators of second kind</i>, Numer. Algor., <b class="bf">64</b> (4) (2013), pp&#160;.699–706. <img src="img-0001.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Karlin1968">6</a></dt>
  <dd><p><i class="sc">S. Karlin</i>, <i class="it">Total Positivity</i>, Stanford University Press, California, 1968. </p>
</dd>
  <dt><a name="Ra2006">7</a></dt>
  <dd><p><i class="sc">I. Raşa</i>, <i class="it">Classes of convex functions associated with Bernstein operators of second kind</i>, Math. Ineq. Appl., <b class="bf">9</b>(4) (2006), pp.&#160;599–605. </p>
</dd>
  <dt><a name="Rasa-Revue">8</a></dt>
  <dd><p><a href ="http://ictp.acad.ro/jnaat/journal/article/view/2000-vol29-no2-art9"> <i class="sc">I. Raşa</i>, <i class="it">On Soardi’s Bernstein operators of second kind</i>, Rev. Anal. Numér. Theór. Approx., <b class="bf">29</b> (2000), no. 2 , pp.&#160;191–199. <img src="img-0001.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Soardi1991">9</a></dt>
  <dd><p><i class="sc">P. Soardi</i>, <i class="it">Bernstein polynomials and random walks on hypergroups</i>, Probability measures on groups \(X\), Oberwolfach (1990), Plenum, New York 1991, pp.&#160;387–393. </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>