Abstract
We show that certain inequalities involving differences of the Bernstein basis polynomials and values of a function \(f\in C[0,1]\), imply that the function is q-monotone. In view of previous results of the authors (see the list of references), the current results provide, among others, a characterization of q-monotone functions in C[0, 1].
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction and the Main Results
Given a function f defined on [0, 1], the classical Bernstein polynomials associated with it are defined by [8],
where
The following theorem was proved by J. Mrowiec, T. Rajba and S. Wąsowicz [9]. It has given an affirmative answer to a conjecture by the third author.
Theorem A
If \(f\in C[0,1]\) is convex, then for all \(n\in \mathbb {N}\),
The proof given by J. Mrowiec, T. Rajba and S. Wąsowicz [9] makes heavy use of probability theory. As a tool they applied stochastic convex orderings (which they proved for binomial distributions) as well as the so-called concentration inequality. This probabilistic approach has been applied in several other papers (see [7] and references therein) connecting (1.1) with the theory of stochastic ordering.
Recently [1], the first author gave an elementary, analytic, proof of Theorem A, and this approach has been followed by several authors (see [5, 6] and references therein). Here we continue the analytic line.
Since the Bernstein polynomials preserve convexity, if \(f\in C[0,1]\) is convex, then for all pairs \(x,y\in [0,1]\),
It follows from Vandermonde’s identity
that,
So, the first and third authors [3] asked whether one may actually prove a stronger inequality than (1.1), namely, for convex f, prove that
and indeed, they proved it in [3].
A function \(f\in C[0,1]\) is called q-monotone, \(q\in {\mathbb {N}}\), if \(\Delta ^q_h(f,x)\ge 0\), for all \(x\in [0,1]\) and \(h>0\), where \(\Delta ^q_h(f,x)\) is the qth forward difference with step \(h>0\). In particular, f is 1-monotone or 2-monotone, if it is nondecreasing, respectively, convex in [0, 1]. It is well known that \(f\in C[0,1]\) is q-monotone, \(q\ge 2\), if and only if \(f\in C^{q-2}(0,1)\), and \(f^{(q-2)}\) is convex in (0, 1).
Recently, Raşa’s conjecture has been extended to q-monotone functions, \(q>2\), by the first two authors who proved in [2] that,
Theorem B
Let \(q,n\in \mathbb {N}\). If \(f\in C\left[ 0,1\right] \) is a q-monotone function, then for all \(x,y\in \left[ 0,1\right] \),
It is well known (see, e.g., [8, 1.5(2)]) that for \(q\ge 1\),
Hence, the Bernstein polynomials preserve q-monotonicity of all orders \(q\ge 1\), so that if \(f\in C[0,1]\) is q-monotone, then for any pair \(x,y\in [0,1]\),
The identity analogous to (1.3) for a general q is easily proved, applying the Vandermonde’s identity
Namely,
Hence, one may ask whether, for \(q>2\), a stronger inequality (analogous to (1.4)) is valid. That is, is it true that for a q-monotone f,
In Sect. 2, we give an affirmative answer to this question. Namely, we prove
Theorem 1.1
If \(f\in C[0,1]\) is q-monotone, \(q\ge 3\), then (1.8) holds for all \(n\in {\mathbb {N}}\).
Since, for \(f\in C[0,1]\), \(\lim _{n\rightarrow \infty }(B_nf)(x)=f(x)\), uniformly in \(x\in [0,1]\), evidently, if (1.6) holds for any pair \(x,y\in [0,1]\), for some subsequence \(\{n_k\}_{k=1}^\infty \), then f is q-monotone in [0, 1]. Thus, one may ask whether this statement is true also for the weaker inequality (1.5). In Sect. 3, we answer this question affirmatively. Namely, in Sect. 3, we prove
Theorem 1.2
Let \(q\ge 1\) and \(f\in C[0,1]\). If for any pair \(x,y\in [0,1]\), inequality (1.5) holds for a subsequence \(\{n_k\}_{k=1}^\infty \), then f is q-monotone in [0, 1].
In view of the above, we propose the following open question. Prove or disprove that if \(f\in C[0,1]\) and (1.8) holds for all \(n\ge 1\), then f is q-monotone. We note that the answer is unknown even for \(q=2\).
Remark 1.3
The above notwithstanding, if (1.8) with \(q=2\), that is, (1.4) holds for \(f\in C[0,1]\), which is twice differentiable in (0, 1), then, we nevertheless, can prove that f is convex. In fact, it suffices that for each pair \(x,y\in [0,1]\), (1.4) holds for some subsequence \(\{n_k\}\).
Proof
To this end, we substitute \(x=0\), \(y=2t\), \(0<t\le \frac{1}{2}\), into (1.4), to obtain for \(n=n_k\),
Hence,
By Voronovskaja’s theorem for the classical Bernstein polynomials, passing to the limit on \(\{n_k\}\), yields
which in turn implies \(f''(t)\ge 0\), \(0<t\le \frac{1}{2}\).
Repeating the same with \(g(s):=f(1-s)\), yields that \(f''(t)\ge 0\), \(\frac{1}{2}\le ~t<1\).
Hence, we conclude that f is convex in [0, 1]. \(\square \)
Final comment, note that, in our proof, we only used (1.4) with \(x=0\) and \(x=1\).
2 Proof of Theorem 1.1
We begin with some preparatory lemmas.
Lemma 2.1
If
then it is a homogeneous polynomial of total degree \(q(n-1)\), in the variables u and v, with non-negative coefficients.
Proof
Denote \(s:=qn\) and rewrite
where the sum is over \(2^q\) possible \(w=\{w_1,\dots ,w_q\}\), with the variables \(w_1,\dots ,w_q\) taking the values u and v, and for each w, \(\sigma (w)\) is the number of \(w_i\)’s that take the value v.
Expanding the s power, applying the multinomial expansion, yields,
Since \(\frac{u^{m_i}-v^{m_i}}{u-v}\) is a homogeneous polynomial in u and v of total degree \(m_i-1\), the lemma follows. \(\square \)
Thus, we may write
where all \(a_i\ge 0\), \(0\le i\le q(n-1)\).
We will compare the coefficients of P to the coefficients of the homogeneous polynomial of total degree \(q(n-1)\), in the variables u and v,
We will prove that
To this end, we observe that, by (2.2), P(u, v) is a weighted average of the polynomials \(\prod _{i=1}^q\frac{u^{m_i}-v^{m_i}}{u-v}\). Hence, it suffices to prove that, coefficient-by-coefficient, they maximize when \(m_1=\cdots =m_q=n\).
Without loss of generality we may assume that \(v=1\) and \(u\ne 1\).
Lemma 2.2
Let \(1\le m<l-1\). Then the coefficients of the polynomial \(\frac{(u^m-1)(u^l-1)}{(u-1)^2}\) are no bigger than those of \(\frac{(u^{m+1}-1)(u^{l-1}-1)}{(u-1)^2}\).
Proof
For any \(1\le m\le l\),
If \(m<l-1\), then \(m+1\le l-1\), so we may replace in the above m by \(m+1\) and l by \(l-1\), and obtain
Comparing the two equations proves the lemma. \(\square \)
Lemma 2.3
Let \(s=qn\) and \(m_1+\cdots +m_q=s\). Then the biggest coefficients in the expansion of \(P(u):=\frac{(u^{m_1}-1)\cdots (u^{m_q}-1)}{(u-1)^q}\) are obtained for \(m_1=\cdots =m_q=n\).
Proof
Suppose that for some k, \(m_k\ne n\). Then, there exist two indices such that \(m_i<n<m_j\). By Lemma 2.2, all coefficients of the polynomial \(\frac{(u^{m_1}-1)\cdots (u^{m_i+1}-1)\cdots (u^{m_j-1}-1)\cdots (u^{m_q}-1)}{(u-1)^q}\) are no smaller than those of P(u). As long as there is an \(m_k\ne n\), we continue. This completes the proof. \(\square \)
Corollary 2.4
The difference
is divisible by \((u-v)^q\), and the resulting polynomial is a homogeneous polynomial of total degree \(q(n-1)\) in the variables u and v, with nonnegative coefficients.
Proof
Note that
Hence, D is divisible by \((u-v)^q\), and the assertion that the coefficients are nonnegative follows by (2.5). \(\square \)
Proof of Theorem 1.1
We are ready to prove (1.8).
Using the straightforward representation
by [3, Sect. 2], we have the following equations.
and
Thus,
Denoting \(1+xz:=u\) and \(1+yz:=v\), we conclude by Corollary 2.4 that,
where
is a polynomial in z of degree \(q(n-1)\), and \(c_j\ge 0\), \(0\le j\le q(n-1)\). Note that all derivatives of \(g_{x,y}(z)\), are nonnegative at \(z=-1\).
Indeed, the kth derivative (with respect to z), \(k\ge 0\), of the jth term in the above sum is,
Substituting \(z=-1\), we have
since \(c_j\ge 0\) and \(0\le x,y\le 1\).
Now,
Substituting into (2.6), we obtain for f which is q-monotone,
where \(\Delta \) is the forward difference, namely, for the sequence \(\{a_k\}\), \(\Delta ^1a_k:=\Delta a_k:=a_{k+1}-a_k\), and \(\Delta ^{m+1}a_k:=\Delta (\Delta ^m a_k)\).
Therefore, (1.8) is proved, and the proof of Theorem 1.1 is complete. \(\square \)
3 Proof of Theorem 1.2
We have,
Applying the generalized Vandermonde identity we obtain
Hence,
Define
Then,
and for \(1\le j\le q-1\),
Hence,
where, for a function g(x, y) of two variables, \((B_{\mu ,\kappa }g)(x,y)\) is the 2-dimensional tensor Bernstein polynomial.
It is well known, see, e.g., [4, p. 122], and actually goes back to Bernstein in Soc. Math. Charkow 13 (1912-13), that if g is continuous in \([0,1]\times [0,1]\), then
Since, by the assumptions of Theorem 1.2, inequality (1.5) is valid for a subsequence \(\{n_k\}_{k=1}^\infty \), i.e., \((x-y)^q I_{n_k}\ge 0\), \(k\ge 1\), we get
so that f is q-monotone on [0, 1]. This completes the proof of Theorem 1.2.
Data Availability Statement
Data sharing is not applicable to this article as no datasets were generated or analysed during the current study.
References
Abel, U.: An inequality involving Bernstein polynomials and convex functions. J. Approx. Theory 222, 1–7 (2017)
Abel, U., Leviatan, D.: An extension of Raşa’s conjecture to q-monotone functions. Results Math. 75(180), 1–13 (2020)
Abel, U., Raşa, I.: A sharpening of a problem on Bernstein polynomials and convex functions. Math. Inequ. Appl. 21, 773–777 (2018)
Davis, P.J.: Interpolation & Approximation. Dover publications Inc., New York (1975)
Gavrea, B., Gavrea, I.: An inequality involving Bernstein polynomials and boxconvex functions. Med. J. Math. 19(18), 1–15 (2022)
Gavrea, B., Gavrea, I.: An inequality involving some linear positive operators and box-convex functions. Results Math. 77(33), 1–10 (2022)
Komisarski, A., Rajba, T.: On the Raşa inequality for higher order convex functions II. Results Math. 77(88), 1–12 (2022)
Lorentz, G.G.: Bernstein polynomials, Mathematical Expositions, No. 8., University of Toronto Press, Toronto, (1953)
Mrowiec, J., Rajba, T., Wąsowicz, S.: A solution to the problem of Rasa connected with Bernstein polynomials. J. Math. Anal. Appl. 446, 864–878 (2017)
Funding
Open Access funding enabled and organized by Projekt DEAL. The authors declare that no funds, grants, or other support were received during the preparation of this manuscript.
Author information
Authors and Affiliations
Contributions
Ulrich Abel, Dany Leviatan and Ioan Raşa contributed equally to this work.
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Abel, U., Leviatan, D. & Raşa, I. Relations Between the Bernstein Polynomials and q-monotone Functions. Results Math 77, 239 (2022). https://doi.org/10.1007/s00025-022-01764-8
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00025-022-01764-8