A sharpening of a problem on Bernstein polynomials and convex function and related results

TL;DR

This paper provides a new proof of a conjecture involving Bernstein polynomials and convex functions, extends related inequalities, and introduces generalizations using stochastic convex ordering.

Contribution

It offers a simplified proof of Raa's conjecture and extends the associated inequalities with new generalizations and methods.

Findings

Short proof of Raa's conjecture using stochastic convex ordering

Extended versions of the original inequality

New generalizations of the binomial convex concentration inequality

Abstract

We present a short proof of a conjecture proposed by I. Ra\c{s}a (2017), which is an inequality involving basic Bernstein polynomials and convex functions. This proof was given in the letter to I. Ra\c{s}a (2017). The methods of our proof allow us to obtain some extended versions of this inequality as well as other inequalities given by I. Ra\c{s}a. As a tool we use stochastic convex ordering relations. We propose also some generalizations of the binomial convex concentration inequality. We use it to insert some additional expressions between left and right sides of the Ra\c{s}a inequalities.