Mathematics > Classical Analysis and ODEs
[Submitted on 27 Nov 2014]
Title:Levin Steckin theorem and inequalities of the Hermite-Hadamard type
View PDFAbstract:Recently Ohlin lemma on convex stochastic ordering was used to obtain some inequalities of Hermite-Hadamard type. Continuing this idea, we use Levin-Stečkin result to determine all inequalities of the forms: $$\sum_{i=1}^3a_if(\alpha_ix+(1-\alpha_i)y)\leq \frac{1}{y-x}\int_{x}^yf(t),$$ $$a_1f(x)+\sum_{i=2}^3a_if(\alpha_ix+(1-\alpha_i)y)+a_4f(y)\geq \frac{1}{y-x}\int_{x}^yf(t)$$ and $$af(\alpha_1x+(1-\alpha_1)y)+(1-a)f(\alpha_2x+(1-\alpha_2)y)\leq b_1f(x)+b_2f(\beta x+(1-\beta)y)+b_3f(y)$$ which are satisfied by all convex functions $f:[x,y]\to{\mathbb R}.$ As it is easy to see, the same methods may be applied to deal with longer expressions of the forms considered. As particular cases of our results we obtain some known inequalities.
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.