- Research Article
- Open Access

# On Some Improvements of the Jensen Inequality with Some Applications

- M. Adil Khan
^{1}Email author, - M. Anwar
^{1}, - J. Jakšetić
^{2}and - J. Pečarić
^{1, 3}

**2009**:323615

https://doi.org/10.1155/2009/323615

© M. Adil Khan et al. 2009

**Received:**23 April 2009**Accepted:**10 August 2009**Published:**27 August 2009

## Abstract

An improvement of the Jensen inequality for convex and monotone function is given as well as various applications for mean. Similar results for related inequalities of the Jensen type are also obtained. Also some applications of the Cauchy mean and the Jensen inequality are discussed.

## Keywords

- Convex Function
- Divergence Measure
- Hellinger Distance
- Renyi Entropy
- Jensen Inequality

## 1. Introduction

The well-known Jensen's inequality for convex function is given as follows.

Theorem 1.1.

is valid for any convex function . In the case when is strictly convex on one has equality in (1.1) if and only if is constant almost everywhere on .

Here and in the whole paper we suppose that all integrals exist. By considering the difference of (1.1) for functional in [1] Anwar and Pečarić proved an interesting result of log-convexity. We can define this result for integrals as follows.

Theorem 1.2.

The following improvement of (1.1) was obtained in [2].

Theorem 1.3.

If is concave, then left-hand side of (1.4) should be .

In this paper, we give another proof and extension of Theorem 1.2 as well as improvements of Theorem 1.3 for monotone convex function with some applications. Also we give applications of the Jensen inequality for divergence measures in information theory and related Cauchy means.

## 2. Another Proof and Extension of Theorem 1.2

In fact, Theorem 1.2 for and was first of all initiated by Simić in [3].

where and are real with .

In [1] we have given correct proof by using extension of (2.1), so that it is defined on .

Moreover, we can give another proof so that we use only (2.1) but without using convexity as in [3].

Proof of Theorem 1.2.

Consider the function defined, as in [3], by (2.1).

Since we have and , we also have that (2.4) is valid for . So is log-convex function in the Jensen sense on .

Let us note that it was used in [4] to get corresponding Cauchy's means. Moreover, we can extend the above result.

Theorem 2.1.

where define the determinant of order with elements and .

Proof.

for and and .

Therefore, ( denote the matrix with elements ) is nonnegative semi definite and (2.6) is valid for . Moreover, since we have continuity of for all , (2.6) is valid for all .

Remark 2.2.

In Theorem 2.1, if we set we get Theorem 1.2.

## 3. Improvements of the Jensen Inequality for Monotone Convex Function

In this section and in the following section, we denote and .

Theorem 3.1.

for monotone convex function . If is monotone concave, then the left-hand side of (3.1) should be .

Proof.

Now from (1.4), (3.3), and (3.4) we get (3.1).

The case when is nonincreasing can be treated in a similar way.

Of course a discrete inequality is a simple consequence of Theorem 3.1.

Theorem 3.2.

The following improvement of the Hermite-Hadamard inequality is valid [5].

Corollary 3.3.

Let be a differentiable convex. Then

holds. If is differentiable concave, then the left-hand side of (3.7) should be

holds. If is differentiable and monotone concave then the left-hand side of (3.8) should be .

- (i)
Setting in (1.4), we get (3.7).

- (ii)
Setting , and in (3.1), we get (3.8).

## 4. Improvements of the Levinson Inequality

Theorem 4.1.

- (i)
As for -convex function the function is convex on , so by setting in the discrete case of [2, Theorem 2], we get (4.1).

- (ii)
As is monotone convex, so by setting in (3.5), we get (5.16).

Ky Fan Inequality

with equality sign if and only if .

Inequality (4.5) has evoked the interest of several mathematicians and in numerous articles new proofs, extensions, refinements and various related results have been published [7].

The following improvement of Ky Fan inequality is valid [2].

Corollary 4.2.

- (i)
Setting , in (4.1), we get (4.6).

- (ii)

From (4.9) we get (4.7).

## 5. On Some Inequalities for Csiszár Divergence Measures

Let be a measure space satisfying and a -finite measure on with values in . Let be the set of all probability measures on the measurable space which are absolutely continuous with respect to . For , let and denote the Radon-Nikodym derivatives of and with respect to respectively.

Csiszár introduced the concept of -divergence for a convex function, that is continuous at 0 as follows (cf. [8], see also [9]).

Definition 5.1.

is called the -divergence of the probability distributions and .

- (i)

- (v)
The Dichotomy class: this class is generated by the family of functions ,

where and are positive integrable functions with

There are various other divergences in Information Theory and statistics such as Arimoto-type divergences, Matushita's divergence, Puri-Vincze divergences (cf. [12–14]) used in various problems in Information Theory and statistics. An application of Theorem 1.1 is the following result given by Csiszár and Körner (cf. [15]).

Theorem 5.2.

where .

Proof.

By substituting and in Theorem 1.1 we get (5.13).

Similar consequence of Theorems 1.2 and 2.1 in information theory for divergence measures discussed above is the following result.

Theorem 5.3.

and let be positive. Then

where define the determinant of order with elements and

(ii) is log-convex.

As we said in [4] we define new means of the Cauchy type, here we define an application of these means for divergence measures in the following definition.

Definition 5.4.

where and .

Theorem 5.5.

Proof.

Also for we consider limiting case and the result follows from continuity of .

An application of Theorem 1.3 in divergence measure is the following result given in [16].

Theorem 5.6.

Proof.

By substituting and in Theorem 1.3, we get (5.20).

Theorem 5.7.

and as in Theorem 5.7.

Proof.

By substituting and in Theorem 3.1(ii) we get (5.22).

Corollary 5.8.

and as in Theorem 5.7.

Proof.

The proof follows by setting in Theorem 5.7.

Corollary 5.9.

Let be as given in (5.11), then

and as in Theorem 5.7.

Proof.

The proof follows be setting to be as given in (5.11), in Theorem 3.1.

## Declarations

### Acknowledgments

This research work is funded by the Higher Education Commission Pakistan. The research of the fourth author is supported by the Croatian Ministry of Science, Education and Sports under the Research Grants 117-1170889-0888.

## Authors’ Affiliations

## References

- Anwar M, Pečarić J:
**On logarithmic convexity for differences of power means and related results.***Mathematical Inequalities & Applications*2009,**12**(1):81–90.MathSciNetView ArticleMATHGoogle Scholar - Hussain S, Pečarić J:
**An improvement of Jensen's inequality with some applications.***Asian-European Journal of Mathematics*2009,**2**(1):85–94. 10.1142/S179355710900008XMathSciNetView ArticleMATHGoogle Scholar - Simić S:
**On logarithmic convexity for differences of power means.***Journal of Inequalities and Applications*2007,**2007:**-8.Google Scholar - Anwar M, Pečarić J:
**New means of Cauchy's type.***Journal of Inequalities and Applications*2008,**2008:**10.MATHGoogle Scholar - Dragomir SS, McAndrew A: Refinements of the Hermite-Hadamard inequality for convex functions. Journal of Inequalities in Pure and Applied Mathematics 2005,6(2, article 140):-6.Google Scholar
- Alzer H:
**The inequality of Ky Fan and related results.***Acta Applicandae Mathematicae*1995,**38**(3):305–354. 10.1007/BF00996150MathSciNetView ArticleMATHGoogle Scholar - Beckenbach EF, Bellman R:
*Inequalities, Ergebnisse der Mathematik und ihrer Grenzgebiete, N. F.*.*Volume 30*. Springer, Berlin, Germany; 1961:xii+198.Google Scholar - Csiszár I:
**Information measures: a critical survey.**In*Transactions of the 7th Prague Conference on Information Theory, Statistical Decision Functions and the 8th European Meeting of Statisticians*. Academia, Prague, Czech Republic; 1978:73–86.Google Scholar - Pardo MC, Vajda I:
**On asymptotic properties of information-theoretic divergences.***IEEE Transactions on Information Theory*2003,**49**(7):1860–1868. 10.1109/TIT.2003.813509MathSciNetView ArticleMATHGoogle Scholar - Kullback S, Leibler RA:
**On information and sufficiency.***Annals of Mathematical Statistics*1951,**22:**79–86. 10.1214/aoms/1177729694MathSciNetView ArticleMATHGoogle Scholar - Cressie P, Read TRC:
**Multinomial goodness-of-fit tests.***Journal of the Royal Statistical Society. Series B*1984,**46**(3):440–464.MathSciNetMATHGoogle Scholar - Kafka P, Österreicher F, Vincze I:
**On powers of -divergences defining a distance.***Studia Scientiarum Mathematicarum Hungarica*1991,**26**(4):415–422.MathSciNetMATHGoogle Scholar - Liese F, Vajda I:
*Convex Statistical Distances, Teubner Texts in Mathematics*.*Volume 95*. BSB B. G. Teubner Verlagsgesellschaft, Leipzig, Germany; 1987:224.Google Scholar - Österreicher F, Vajda I:
**A new class of metric divergences on probability spaces and its applicability in statistics.***Annals of the Institute of Statistical Mathematics*2003,**55**(3):639–653. 10.1007/BF02517812MathSciNetView ArticleMATHGoogle Scholar - Csiszár I, Körner J:
*Information Theory: Coding Theorems for Discrete Memoryless System, Probability and Mathematical Statistics*. Academic Press, New York, NY, USA; 1981:xi+452.Google Scholar - Anwar M, Hussain S, Pečarić J:
**Some inequalities for Csiszár-divergence measures.***International Journal of Mathematical Analysis*2009,**3**(26):1295–1304.MathSciNetMATHGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.