Abstract
We give an integral version and a refinement of M. Niezgoda’s extension of the variant of Jensen’s inequality given by A. McD. Mercer.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction and Preliminaries
Let us start with Jensen’s inequality for convex functions, one of the most celebrated inequalities in mathematics and statistics (for detailed discussion and history, see [7] and [12]). Throughout the paper we assume that J and [a, b] are intervals in \(\mathbb {R}\).
Proposition 1
Let \(x_1,x_2,\ldots ,x_n\in [a,b]\), and let \(w_1,w_2,\ldots ,w_n\) be positive real numbers such that \(W_n=\sum _{i=1}^nw_i=1\). If \(\varphi : [a,b]\rightarrow \mathbb {R}\) is a convex function, then the inequality
holds.
In paper [8], A. McD. Mercer proved the following variant of Jensen’s inequality, which we will refer to as Mercer’s inequality.
Proposition 2
Let \(x_1,x_2,\ldots ,x_n\in [a,b]\), and let \(w_1,w_2,\ldots ,w_n\) be positive real numbers such that \(W_n=\sum _{i=1}^nw_i=1\). If \(\varphi : [a,b]\rightarrow \mathbb {R}\) is a convex function, then the inequality
holds, where
There are many versions, variants and generalizations of Proposition 1 and Proposition 2, see, e.g., [1], [3, 9] and [10]. Here we state few integral versions of Jensen’s inequality from [12, pp. 58–59] which will be needed in the main theorems of our paper.
Proposition 3
Let \(f:[a,b]\rightarrow J\) be a continuous function. If the function \(H:[a,b]\rightarrow \mathbb {R}\) is nondecreasing, bounded and \(H(a)\not =H(b)\), then for every continuous convex function \(\varphi :J\rightarrow \mathbb {R}\) the inequality
holds.
Inequality (2) can hold under different set of assumptions. For example, for a monotonic f, assumptions on H can be relaxed. The following proposition gives Jensen–Steffensen’s inequality.
Proposition 4
If \(f:[a,b] \rightarrow J\) is continuous and monotonic (either nonincreasing or nondecreasing) and \(H:[a,b]\rightarrow \mathbb {R}\) is either continuous or of bounded variation satisfying
then (2) holds.
If we replace the assumption of monotonicity of f over the whole interval [a, b] in Proposition 4 with monotonicity over subintervals, we obtain the following, Jensen–Boas inequality.
Proposition 5
If \(H:[a,b]\rightarrow \mathbb {R}\) is continuous or of bounded variation satisfying
for all \(x_i \in (y_{i-1}, y_i )\) (\(y_0 = a\), \(y_k = b\)), and \(H(b) > H (a)\), and if f is continuous and monotonic (either nonincreasing or nondecreasing) in each of the k intervals \((y_{i-1}, y_i)\), then inequality (2) holds.
In our construction for next proposition, we recall the definitions of majorization:
For fixed \( n\ge 2\),
denote two real n-tuples and
be their ordered components.
Definition 1
For \(\mathbf {x},\, \mathbf {y} \,\in \mathbb {R}^n\),
when \(\mathbf {x}\prec \mathbf {y}\), \(\mathbf {x}\) is said to be majorized by \(\mathbf {y}\) or \(\mathbf {y}\) majorizes \(\mathbf {x}\).
This notion and notation of majorization was introduced by Hardy et al. in [4]. The following extension of (1) is given by M. Niezgoda in [9] which we will refer to as Niezgoda’s inequality.
Proposition 6
Let \(\varphi : [a,b]\rightarrow \mathbb {R}\) be a continuous convex function. Suppose that \(\mathbf {\alpha }=(\alpha _1,\ldots ,\alpha _m)\) with \(\alpha _j\in J\), and \(\mathbf X =(x_{ij})\) is a real \(n\times m\) matrix such that \(x_{ij}\in J\) for all \( i\in \{1,\dots ,n\}, \,\,j\in \{1,\dots ,m\}\).
If \(\mathbf {\alpha }\) majorizes each row of \(\mathbf X \), i.e.,
then we have the inequality
where \(\sum _{i=1}^{n}w_i=1\) with \(w_{i}\ge 0\).
The paper is organized as follows: In Sect. 2 we will give an integral generalization of Niezgoda’s inequality. In the process we will use an integral majorization result of Pečarić [11] and prove a lemma which gives the Jensen–Boas inequality on disjoint set of subintervals. In Sect. 3 we will give a refinement of the inequality obtained in Sect. 2.
2 Generalized Mercer’s Inequalities
Here we state some results needed in the main theorems of this section. The following proposition is a consequence of Theorem 1 in [11] (see also [12, p. 328]) and represents an integral majorization result.
Proposition 7
Let \( f,\,g : [a,b]\rightarrow J\) be two nonincreasing continuous functions, and let \(H:[a,b]\rightarrow \mathbb {R}\) be a function of bounded variation. If
hold, then for every continuous convex function \(\varphi :J\rightarrow \mathbb {R}\) the following inequality holds
Remark 1
If \( f,\,g : [a,b]\rightarrow J\) are two nondecreasing continuous functions such that
then again inequality (4) holds. In this paper we will state our results for nonincreasing f and g satisfying the assumption of Proposition 7, but they are still valid for nondecreasing f and g satisfying the above condition, see, for example, [6, p. 584].
The following lemma shows that the subintervals in the Jensen–Boas inequality (see Proposition 5) can be disjoint for the inequality of type (2) to hold.
Lemma 1
Let \(H:[a,b] \rightarrow \mathbb {R}\) be continuous or a function of bounded variation, and let \(a \le a_1 \le b_1 \le a_2 \le \cdots \le a_k \le b_k \le b\) be a partition of the interval [a, b], \(I=\bigcup ^k_{i=1} [a_i,b_i]\) and \(L = \int _I dH(t)\). If
and \(L>0\), then for every function \(f:[a,b] \rightarrow J\) which is continuous and monotonic (either nonincreasing or nondecreasing) in each of the k intervals \((a_i, b_i)\) and every convex and continuous function \(\varphi :J \rightarrow \mathbb {R}\), the following inequality holds
Proof
Denote \(w_i = \int _{a_i}^{b_i} dH(t)\). Due to (5), if \(H(a_i) = H(b_i)\) then dH is a null-measure on \([a_i, b_i]\) and \(w_i=0\), while otherwise \(w_i >0\). Denote \(S =\{ i : w_i >0 \}\) and
Notice that
and, due to Proposition 4,
Therefore, taking into account the discrete Jensen’s inequality,
The following theorem is our main result of this section, and it gives a generalization of Proposition 6.
Theorem 1
Let \(a=b_0\le a_1< b_1< a_2< b_2<\cdots< a_k< b_k\le a_{k+1}=b\), \(I=\bigcup ^k_{i=1} (a_i,b_i)\), \(I^c= [a,b]\backslash I=\bigcup ^{k+1}_{i=1}[b_{i-1},a_i]\) and \(H:[a,b] \rightarrow \mathbb {R}\) be a function of bounded variation such that \(H(b_{i-1} ) \le H(t) \le H(a_i)\) for all \(t\in (b_{i-1}, a_i)\) and \(1\le i \le k+1\) and \(L = \int _{I^c} dH(t)>0\).
Furthermore, let \((X,\Sigma ,\mu )\) be a measure space with positive finite measure \(\mu \), let \(g:[a,b]\rightarrow J\) be a nonincreasing continuous function, and let \(f:X\times [a,b]\rightarrow J\) be a measurable function such that the mapping \(t\mapsto f(s,t)\) is nonincreasing and continuous for each \(s\in X\),
Then, for a continuous convex function \(\varphi : J\rightarrow \mathbb {R}\) the following inequality holds
Proof
Using Fubini’s theorem, equality (6) and the integral Jensen’s inequality (2) we get
Applying Lemma 1 and Proposition 7, respectively, we have
Finally, combining (8) and (9) we obtain inequality (7).
Corollary 1
Let \(\mathbf {\alpha }=(\alpha _1,\ldots ,\alpha _m)\) with \(\alpha _j\in J\) and \(\mathbf {X}=(x_{ij})\) be a real \(n\times m\) matrix such that \(x_{ij}\in J\) for all \(i \in \{1,\ldots , n\}, \,j \in \{1,\ldots ,m\}\), and let \(\mathbf {\alpha }\) majorize each row of \(\mathbf {X}\), that is
Moreover, let \(a_l,b_l \in \mathbb {N}\), \(l \in 1,\ldots ,k\), be such that \(1=b_0\le a_1< b_1< a_2< b_2<\cdots< a_k< b_k\le a_{k+1}=m+1\) and denote \(L=\sum ^{k+1}_{l=1}(a_l-b_{l-1})\). Then, for every continuous convex function \(\varphi : J\rightarrow \mathbb {R}\) the inequality
holds, where \(W_n=\sum _{i=1}^{n}w_i>0\) with \(w_{i}\ge 0\).
Proof
The proof of this corollary follows from Theorem 1 by taking step functions. More concretely, for \(a=b_0=1\), \(b=a_{k+1}=m+1\), \(f(s,t)=\sum ^n_{i=1}\sum ^m_{j=1}x_{ij}\,\chi _{[i,i+1)}(s)\chi _{[j,j+1)}(t)\), \(g(t)=\sum ^m_{j=1}\alpha _j\,\chi _{[j,j+1)}(t)\), \(X=[1,n+1)\), \(d\mu (s) = \sum _{i=1}^n w_i\chi _{[i,i+1)}(s) \mathrm{{d}}s\) and \(H(t)=t\).
Remark 2
If in Corollary 1 we take \(k=1\), \(a_1=1\) and \(b_1=m\) and assume \(W_n=\sum _{i=1}^{n}w_i=1\), then we get Niezgoda’s inequality (3).
Remark 3
For some similar results involving generalized convex functions, see [5].
3 Refinements
Throughout this section we assume that \(E\subset X\) with \(\mu (E),\mu (E^c)>0\) and we use the following notations
The following refinement of (7) is valid.
Theorem 2
Let \(a=b_0\le a_1< b_1< a_2< b_2<\cdots< a_k< b_k\le a_{k+1}=b\), \(I=\bigcup ^k_{i=1} (a_i,b_i)\), \(I^c= [a,b]\backslash I=\bigcup ^{k+1}_{i=1}[b_{i-1},a_i]\) and \(H:[a,b] \rightarrow \mathbb {R}\) be a function of bounded variation such that \(H(b_{i-1} ) \le H(t) \le H(a_i)\) for all \(t\in (b_{i-1}, a_i)\) and \(1\le i \le k+1\) and \(L = \int _{I^c} dH(t)>0\).
Furthermore, let \((X,\Sigma ,\mu )\) be a measure space with positive finite measure \(\mu \), let \(g:[a,b]\rightarrow J\) be a nonincreasing continuous function, and let \(f:X\times [a,b]\rightarrow J\) be a measurable function such that the mapping \(t\mapsto f(s,t)\) is nonincreasing and continuous for each \(s\in X\),
Then, for a continuous convex function \(\varphi : J\rightarrow \mathbb {R}\), the inequalities
hold, where
Proof
Following the proof of Theorem 3 of [2], by using convexity of the function \(\varphi \), we have
for any E, which proves the first inequality in (10).
By inequality (7) we also have
for any E, which proves the second inequality in (10).
Remark 4
Direct consequences of the previous theorem are the following two inequalities
and
References
Abramovich, A., Klaričić Bakula, M., Matić, M., Pečarić, J.: A variant of Jensen–Steffensen’s inequality and quasi-arithmetic means. J. Math. Anal. Appl. 307, 370–386 (2005)
Adil Khan, M., Khan, Asif R., Pečarić, J.: On the refinements of Jensen–Mercer’s Inequality. Rev. Anal. Numér. Théor. Approx 41, 62–81 (2012)
Cheung, W.S., Matković, A., Pečarić, J.: A variant of Jessen’s inequality and generalized means. J. Ineq. Pure Appl. Math. 7(1), 10 (2006)
Hardy, G.H., Littlewood, J.E., Pólya, G.: Inequalities. Cambridge University Press, Cambridge (1978)
Krulić, K., Pečarić, J., Smoljak, K.: \(a(x)\)-Convex functions and their inequalities. Bull. Malays. Math. Sci. Soc. (2) 35(3), 695–716 (2012)
Marshall, A.W., Olkin, I., Arnold, B.C.: Inequalities: Theory of majorization and its applications, 2nd edn. Springer, New York (2011)
Mitrinović, D.S., Pečarić, J., Fink, A.M.: Classical and New Inequalities in Analysis. Kluwer, The Netherlands (1993)
Mercer, AMcD: A variant of Jensen’s inequality. J. Ineq. Pure and Appl. Math. 4, 73 (2003)
Niezgoda, M.: A generalization of Mercer’s result on convex functions. Nonlinear Anal. 71, 2771–2779 (2009)
Pečarić, J.: A variant of Jensen’s inequality. J. Ineq. Pure Appl. Math. 4(4), 73 (2003)
Pečarić, J.: On some inequalities for functions with nondecreasing increments. J. Math. Anal. Appl. 98, 188–197 (1984)
Pečarić, J., Proschan, F., Tong, Y.L.: Convex Functions, Partial Orderings and Statistical Applications. Academic Press, New York (1992)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Lee See Keong.
Rights and permissions
About this article
Cite this article
Khan, A.R., Pečarić, J. & Praljak, M. A Note on Generalized Mercer’s Inequality. Bull. Malays. Math. Sci. Soc. 40, 881–889 (2017). https://doi.org/10.1007/s40840-017-0449-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40840-017-0449-0