The Hermite-Hadamard inequality on hypercuboid

preprint2016arXivOpen access

Abstract

Given any a:=(a1,a2,…,an){\bf{a}}: = \left( {a_1 ,a_2 , \ldots ,a_n } \right) and b:=(b1,b2,…,bn){\bf{b}}: = \left( {b_1 ,b_2 , \ldots ,b_n } \right) in Rn\mathbb{R}^n. The n\textbf{n}-fold convex function defined on [a,b]\left[ {\bf{a},{\bf{b}}} \right], a,b∈Rn{\bf{a}},{\bf{b}} \in \mathbb{R}^n with a<b{\bf{a}}<{\bf{b}} is a convex function in each variable separately. In this work we prove an inequality of Hermite-Hadamard type for n\textbf{n}-fold convex functions. Namely, we establish the inequality \begin{align*} f\left( {\frac{{\bf{a} + {\bf{b}}}}{2}} \right) \le \frac{1}{{\bf{b} - {\bf{a}}}}\int_{\bf{a}}^{\bf{b}} {f\left( {\bf{x}} \right)d{\bf{x}}} \le \frac{1}{2^n }\sum\limits_{\bf{c}} {f\left( {\bf{c}} \right)}, \end{align*} where ∑cf(c):=∑ci∈{ai,bi}1≤i≤nf(c1,c2,…,cn)\sum\limits_{\bf{c}} {f\left( {\bf{c}} \right)} : = \sum\limits_{\mathop {c_i \in \left\{ {a_i ,b_i } \right\}}\limits_{1 \le i \le n} } {f\left( {c_1, c_2, \ldots ,c_n } \right)}. Some other related result are given.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.