Convexity preserving and predicting by Bernstein polynomials (Q2266396)

It is known that the Bernstein polynomials of a function f defined on [0,1] preserve its convexity properties, i.e., if \(f^{(n)}\geq 0\) then for \(m\geq n\), \((B_ mf)^{(n)}\geq 0\). Moreover, if f is n-convex then \((B_ mf)^{(n)}\geq 0\). While the converse is not true, we show that if f is bounded on (a,b) and if for every subinterval \(| \alpha,\beta | \subset (a,b)\) the nth derivative of the mth Bernstein polynomial of f on \(| \alpha,\beta |\) is nonnegative then f is n-convex.