# The Truncatedq-Bernstein Polynomials in the Case q

Authors: Mehmet Turan
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

The truncatedq-Bernstein polynomials B
n
,
m
,
q
f
;
x, n
∈
ℕ, and m
∈
ℕ
0 emerge naturally when the q-Bernstein polynomials of functions vanishing in some neighbourhood of 0 are considered. In this paper, the convergence of the truncated q-polynomials on 0
,
1 is studied. To support the theoretical results, some numerical examples are provided.


---

## Body

## 1. Introduction

Letq
>
0. For any nonnegative integer n, the q-integer  [
n
]
q is defined by
(1)
[
n
]
q
:
=
1
+
q
+
⋯
+
q
n
-
1
(
n
=
1,2
,
…
)
,
[
0
]
q
:
=
0
,
and the q-factorial  [
n
]
q
! is defined by
(2)
[
n
]
q
!
:
=
[
1
]
q
[
2
]
q
⋯
[
n
]
q
(
n
=
1,2
,
…
)
,
[
0
]
q
!
:
=
1
.
For integers 0
≤
k
≤
n, the q-binomial coefficient is defined by
(3)
[
n
k
]
q
:
=
[
n
]
q
!
[
k
]
q
!
[
n
-
k
]
q
!
.
Clearly, for q
=
1,
(4)
[
n
]
1
=
n
,
[
n
]
1
!
=
n
!
,
[
n
k
]
1
=
(
n
k
)
.
We also use the following standard notations:
(5)
(
a
;
q
)
0
:
=
1
,
(
a
;
q
)
k
:
=
∏
s
=
0
k
-
1
‍
(
1
-
a
q
s
)
,
(
a
;
q
)
∞
:
=
∏
s
=
0
∞
‍
(
1
-
a
q
s
)
.These notations and definitions can be seen in [1, Chapter 10]. The following generalization of the Bernstein polynomials based on the q-integers has been introduced by Phillips in [2].Definition 1.
For anyf
∈
C
[
0,1
], the q-Bernstein polynomials of f are defined by
(6)
B
n
,
q
(
f
;
x
)
=
∑
k
=
0
n
‍
f
(
[
k
]
q
[
n
]
q
)
p
n
k
(
x
)
,
n
∈
ℕ
,
where
(7)
p
n
k
(
x
)
:
=
[
n
k
]
q
x
k
(
x
;
q
)
n
-
k
,
k
=
0
,
1
,
…
,
n
.Whereas one can obtain the classical Bernstein polynomials forq
=
1, the name “q-Bernstein polynomials” will be used to refer to the case q
≠
1. For more information and open problems related to the q-Bernstein polynomials the reader is referred to [3].Theq-Bernstein polynomials as well as the classical Bernstein polynomials have some common properties (cf. [4] and references therein), such as the end-point interpolation property,
(8)
B
n
,
q
(
f
;
0
)
=
f
(
0
)
,
B
n
,
q
(
f
;
1
)
=
f
(
1
)
∀
q
>
0
,
n
∈
ℕ
,
and the shape-preserving properties in the case 0
<
q
<
1. Similar to the Bernstein polynomials, the q-Bernstein polynomials are degree reducing on the set of polynomials.As for the convergence properties of theq-Bernstein polynomials, they demonstrate a striking difference from those of the Bernstein polynomials. In general terms, this is true for various Bernstein-type operators based on the q-integers, and it is exactly the occurrence of new phenomena and insights that makes the study of the convergence of these operators attractive and challenging. During the last decade, the approximation by operators based on the q-integers has been investigated by many researchers (see, e.g., [5–10]).In this paper, the convergence of the truncatedq-Bernstein polynomials is addressed. Such polynomials come into the picture once the q-Bernstein polynomials are considered for the functions vanishing in some neighbourhood of 0. The truncation of functions and operators is a well-known and widely used tool in functional analysis and approximation theory. See, for example, a recent paper [11] where it has been used to prove a Daugavet-type inequality. As for the truncation of the classical Bernstein polynomials, it has been used by Cooper and Waldron in [12].Definition 2 (see [13]).
For anyf
:
[
0,1
]
→
ℝ, m
∈
ℕ
0, and n
≥
m, the m-truncated
q-Bernstein polynomials of f are
(9)
B
n
,
m
,
q
(
f
;
x
)
:
=
∑
k
=
n
-
m
n
‍
f
(
[
k
]
q
[
n
]
q
)
p
n
,
k
(
x
)
.In this paper, the properties of polynomials (9) are studied only in the case q
>
1. Throughout the paper, and unless stated otherwise, it is assumed that q
>
1 is fixed. For the sake of simplicity, the notations
(10)
𝕁
q
:
=
{
0
}
∪
{
q
-
j
}
j
=
0
∞
and x
k
=
[
k
]
q
/
[
n
]
q for k
=
0
,
…
,
n will be used.Forf
:
[
0,1
]
→
ℝ, m
∈
ℕ
0, the function
(11)
f
m
(
x
)
:
=
{
0
for
x
∈
[
0
,
q
-
(
m
+
1
)
)
,
f
(
x
)
for
x
∈
[
q
-
(
m
+
1
)
,
1
]
,
will be called the m-truncation of f. Clearly, f
(
x
)
=
f
m
(
x
) if and only if f
(
x
)
=
0 for x
∈
[
0
,
q
-
(
m
+
1
)
).The paper is organized as follows. The next section is devoted to the main results, which, finally, are illustrated in Section3 using numerical examples.


## 2. Results

In this section, the results are presented pertaining the convergence of the truncatedq-Bernstein polynomials. The following simple assertion reveals that the truncated q-Bernstein polynomials appear naturally when we consider those functions vanishing in some neighbourhood of 0.Theorem 3.
Ifn
≥
ln
(
[
m
+
1
]
q
)
/
ln
q, then B
n
,
m
,
q
(
f
;
x
)
=
B
n
,
q
(
f
m
;
x
), where f
m is given by (11).Proof.
Sincef
m
(
x
k
)
=
0, for x
k
<
q
-
(
m
+
1
), one has
(12)
B
n
,
q
(
f
m
;
x
)
=
∑
{
k
:
x
k
≥
q
-
(
m
+
1
)
}
‍
f
(
x
k
)
p
n
,
k
(
x
)
while
(13)
B
n
,
m
,
q
(
f
;
x
)
=
∑
k
≥
n
-
m
‍
f
(
x
k
)
p
n
,
k
(
x
)
.
The right sides of (12) and (13) are identical if and only if
(14)
q
-
(
m
+
1
)
≤
x
n
-
m
<
q
-
m
.
The inequality on the right holds for all q
>
1, while the one on the left is true if and only if n
≥
ln
⁡
(
[
m
+
1
]
q
)
/
ln
⁡
q.Remark 4.
Ifq
≥
2, then B
n
,
q
(
f
m
,
x
)
=
B
n
,
m
,
q
(
f
;
x
) for all n
≥
m.Corollary 5.
Iff
(
x
)
=
0 for x
∈
[
0
,
q
-
(
m
+
1
)
), then B
n
,
q
(
f
;
x
)
=
B
n
,
m
,
q
(
f
;
x
).Theorem 2.1 of [7] states that, for any f
∈
C
[
0,1
], j
∈
ℕ
0, and q
>
1, lim
⁡
n
→
∞
B
n
,
q
(
f
;
q
-
j
)
=
f
(
q
-
j
). That is, when q
>
1, the sequence of polynomials B
n
,
q
(
f
) converges to f on 𝕁
q. The following lemma, which can be inferred from Lemma 3.1 of [13], is needed to investigate the convergence of the truncated q-Bernstein polynomials.Lemma 6.
Letx
0
∈
[
0,1
]
∖
𝕁
q. Then
(15)
lim
⁡
n
→
∞
p
n
,
n
-
k
(
q
;
x
0
)
(
q
k
x
0
)
n
=
C
k
(
x
0
)
,
where C
k
(
x
0
)
=
(
-
1
)
k
q
-
k
(
k
-
1
)
/
2
(
x
0
;
q
)
k
/
[
(
q
;
q
)
k
x
0
k
]
≠
0.Note thatC
k
(
x
)
=
0 if and only if x
∈
𝕁
q
∖
{
0
}. Thus, the following holds.Lemma 7.
For anyf
∈
C
[
0,1
] and x
∈
[
0
,
q
-
m
), lim
⁡
n
→
∞
B
n
,
m
,
q
(
f
;
x
)
=
0. Moreover, the convergence is uniform on any compact subset of [
0
,
q
-
m
).Proof.
Sincef is continuous on [
0,1
], there exists M
>
0 such that |
f
(
x
)
|
≤
M for all x
∈
[
0,1
]. In addition, from the definition of p
n
,
k, one can obtain
(16)
|
p
n
,
n
-
k
(
x
)
|
≤
q
k
(
n
-
k
)
(
1
-
1
/
q
)
(
1
-
1
/
q
2
)
⋯
(
1
-
1
/
q
k
)
·
x
n
-
k
·
(
1
+
q
)
⋯
(
1
+
q
k
-
1
)
≤
(
-
1
/
q
;
1
/
q
)
∞
(
1
/
q
;
1
/
q
)
∞
(
q
k
x
)
n
-
k
≤
(
-
1
/
q
;
1
/
q
)
∞
(
1
/
q
;
1
/
q
)
∞
(
q
m
x
)
n
-
m
for n
≥
2
m. Hence, for any x
∈
[
0
,
q
-
m
),
(17)
|
B
n
,
m
,
q
(
f
;
x
)
|
=
|
∑
k
=
0
m
‍
f
(
x
k
)
p
n
,
n
-
k
(
x
)
|
≤
M
q
(
m
+
1
)
(
q
m
x
)
n
-
m
,
where M
q
=
M
(
-
1
/
q
;
1
/
q
)
∞
/
(
1
/
q
;
1
/
q
)
∞. This yields the desired result.Clearly, form
=
0, the truncated q-Bernstein polynomials have the form
(18)
B
n
,
0
,
q
(
f
;
x
)
=
f
(
1
)
x
n
,
whence
(19)
lim
⁡
n
→
∞
B
n
,
0
,
q
(
f
;
x
)
=
{
0
for
x
∈
[
0,1
)
,
f
(
1
)
for
x
=
1
.As the next theorem reveals, the casem
≠
0 is not straightforward.Theorem 8.
Letf
∈
C
[
0,1
], m
≥
1. If f
(
q
-
m
)
≠
0, then
(20)
lim
⁡
n
→
∞
B
n
,
m
,
q
(
f
;
x
)
=
{
0
f
o
r
x
∈
[
0
,
q
-
m
)
,
f
(
x
)
f
o
r
x
=
1
,
q
-
1
,
…
,
q
-
m
,
(21)
lim
⁡
n
→
∞
|
B
n
,
m
,
q
(
f
;
x
)
|
=
0
f
o
r
x
∈
[
q
-
m
,
1
]
∖
𝕁
q
.Proof.
The assertion (20) is obvious by Lemma 7 and the convergence on 𝕁
q. To see (21), let x
∈
[
q
-
m
,
1
]
∖
𝕁
q. Then, Lemma 6 implies that
(22)
p
n
,
n
-
k
(
q
;
x
)
~
C
k
(
x
)
(
q
k
x
)
n
as
n
⟶
∞
.
Moreover, it is easy to see that x
n
-
k
→
q
-
k as n
→
∞. Therefore,
(23)
B
n
,
m
,
q
(
f
;
x
)
=
∑
k
=
0
m
‍
f
(
x
n
-
k
)
p
n
,
n
-
k
(
q
;
x
)
~
∑
k
=
0
m
‍
f
(
q
-
k
)
C
k
(
x
)
(
q
k
x
)
n
~
f
(
q
-
m
)
C
m
(
x
)
(
q
m
x
)
n
as
n
⟶
∞
.
Since f
(
q
-
m
)
≠
0 and C
m
(
x
)
≠
0, the statement follows.In the case whenf
(
q
-
m
)
=
0, the truncated q-Bernstein polynomials behave differently as the following theorem indicates.Theorem 9.
Letf
∈
C
[
0,1
] with f
(
q
-
m
)
=
0, and suppose that, for each k
=
1
,
…
,
m, there exists α
k
>
0 such that
(24)
lim
⁡
n
→
∞
f
(
x
n
-
k
)
(
q
-
k
-
x
n
-
k
)
α
k
=
β
k
≠
0
.
Setting s
=
max
⁡
k
=
1
,
…
,
m
{
k
-
α
k
}, one has the following: (i)
ifs
>
0, then
(25)
lim
⁡
n
→
∞
B
n
,
m
,
q
(
f
;
x
)
=
0
w
h
e
n
x
∈
[
0
,
q
-
s
]
,
lim
⁡
n
→
∞
|
B
n
,
m
,
q
(
f
;
x
)
|
=
∞
w
h
e
n
x
∈
(
q
-
s
,
1
)
∖
𝕁
q
,
except possibly at most at m points, outside of 𝕁
q;
(ii)
ifs
≤
0, then lim
⁡
n
→
∞
B
n
,
m
,
q
(
f
;
x
)
=
0 for all x
∈
[
0,1
].Proof.
From (24), for each k
=
1
,
…
,
n, one has f
(
x
n
-
k
)
~
β
k
(
q
-
k
-
x
n
-
k
)
α
k as n
→
∞, which together with Lemma 6 and the fact that q
-
k
-
x
n
-
k
=
(
q
k
-
1
)
/
[
q
k
(
q
n
-
1
)
] yields that
(26)
B
n
,
m
,
q
(
f
;
x
)
-
f
(
1
)
x
n

=

∑
k
=
1
m
‍
f
(
x
n
-
k
)
p
n
,
n
-
k
(
q
;
x
)

~

∑
k
=
1
m
‍
β
k
(
q
-
k
-
x
n
-
k
)
α
k
C
k
(
x
)
(
q
k
x
)
n

~

∑
k
=
1
m
‍
β
~
k
C
k
(
x
)
(
q
k
-
α
k
x
)
n
as
n
⟶
∞
,
where β
~
k
=
β
k
(
1
-
q
-
k
)
α
k. Now, suppose that k
-
α
k takes on its maximum value s at k
1
,
k
2
,
…
,
k
r
∈
{
1
,
…
,
m
} with k
1
<
k
2
<
⋯
<
k
r. Then,
(27)
B
n
,
m
,
q
(
f
;
x
)
-
f
(
1
)
x
n
~
∑
k
=
1
m
‍
β
~
k
C
k
(
x
)
(
q
k
-
α
k
x
)
n
~
(
q
s
x
)
n
∑
j
=
1
r
‍
β
~
k
j
C
k
j
(
x
)
≔
(
q
s
x
)
n
φ
(
x
)
as
n
⟶
∞
.
Since x
k
r
φ
(
x
)
=
x
k
r
∑
j
=
1
r
‍
β
~
k
j
C
k
j
(
x
) is a polynomial of degree at most m, φ
(
x
) can vanish at most at m points. This completes the proof.


## 3. Numerical Examples

In this part, some numerical examples are given to demonstrate the theoretical results.Example 10.
Letq
=
2, m
=
2. Consider the function f
:
[
0,1
]
→
ℝ, defined by
(28)
f
(
x
)
=
{
0
,
x
<
1
8
,
(
x
-
1
8
)
2
,
1
8
≤
x
<
1
4
,
1
64
,
x
≥
1
4
.
Since f
(
x
)
=
0 for x
∈
[
0
,
2
-
3
) and f
(
2
-
2
)
≠
0, by Theorem 8,
(29)
lim
⁡
n
→
∞
B
n
,
2,2
(
f
;
x
)
=
{
0
,
if
x
∈
[
0
,
1
4
)
,
f
(
x
)
,
if
x
=
1
,
1
2
,
1
4
,
±
∞
,
otherwise
.
In Figure 1, the graphs of f and B
n
,
2,2
(
f
) on some different intervals are given.Graphs off and B
n
,
2,2
(
f
) on different intervals for some values of n.
(a)
(b)
(c)
(d)Example 11.
Letq
=
2, m
=
3, and consider a function g
∈
C
[
0,1
] satisfying
(30)
g
(
x
)
=
{
0
,
x
∈
[
0
,
1
16
)
,
72
(
1
/
8
-
x
)
2
7
,
x
∈
[
3
32
,
1
8
)
,
1
4
-
x
,
x
∈
[
3
16
,
1
4
)
,
3
(
1
2
-
x
)
,
x
∈
[
3
8
,
1
2
)
,
and on the rest of [
0,1
], g is piecewise linear. It is easily seen that the conditions of Theorem 9 are fulfilled by α
1
=
1, α
2
=
1, α
3
=
2, β
1
=
3, β
2
=
1, and β
3
=
72
/
7. Here, s
=
1 and φ
(
x
)
=
(
1
-
x
)
(
1
-
2
x
)
(
3
-
4
x
)
/
(
64
x
3
) vanishes at x
=
1, 1
/
2, and 3
/
4. Therefore,
(31)
lim
⁡
n
→
∞
B
n
,
3,2
(
g
;
x
)
=
{
0
,
if
x
∈
[
0
,
1
2
)
∪
{
3
4
}
,
g
(
x
)
,
if
x
=
1
,
1
2
,
±
∞
,
otherwise
.
In Figure 2, the graphs of g and B
g
,
3,2
(
g
) on some different intervals are provided.Graphs ofg and B
n
,
3,2
(
g
) on different intervals for some values of n.
(a)
(b)
(c)
(d)Example 12.
Letq
=
2, m
=
5, and consider the function h
:
[
0,1
]
→
ℝ with
(32)
h
(
x
)
=
{
0
,
x
∈
[
0
,
1
64
)
,
73400320
(
1
/
32
-
x
)
3
54777
,
x
∈
[
3
128
,
1
32
)
,
453376
(
1
/
16
-
x
)
2
7695
,
x
∈
[
3
64
,
1
16
)
,
1
8
-
x
,
x
∈
[
3
32
,
1
8
)
,
2
(
1
4
-
x
)
2
,
x
∈
[
3
16
,
1
4
)
,
1
2
-
x
,
x
∈
[
3
8
,
1
2
)
.
At any other point in [
0,1
], h is defined in such a way that it is continuous. Obviously, the conditions of Theorem 9 are met by α
1
=
1, α
2
=
1, α
3
=
1, α
4
=
2, α
5
=
3, β
1
=
1, β
2
=
2, β
3
=
1, β
4
=
453376
/
7695, and β
5
=
73400320
/
54777. Now, s
=
2 and φ
(
x
)
=
(
1
-
x
)
(
1
-
2
x
)
(
1
-
4
x
)
(
25
x
2
-
35
x
+
12
)
/
(
98496
x
5
). Therefore,
(33)
lim
⁡
n
→
∞
B
n
,
5,2
(
h
;
x
)
=
{
0
,
if
x
∈
[
0
,
1
4
)
∪
{
3
5
,
4
5
}
,
h
(
x
)
,
if
x
=
1
,
1
2
,
1
4
,
±
∞
,
otherwise
.
In Figure 3, the graphs of h and B
n
,
5,2
(
h
) on some different intervals are depicted.Graphs ofh and B
n
,
5,2
(
h
) on different intervals for some values of n.
(a)
(b)
(c)
(d)



---

*Source: 126319-2014-03-05.xml*